default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 355
Volume 355, Number 1, 6 April 2006
- Ravi Kumar, Matthieu Latapy:
Preface. 1-5
- Luca Dall'Asta, J. Ignacio Alvarez-Hamelin
, Alain Barrat, Alexei Vázquez, Alessandro Vespignani:
Exploring networks with traceroute-like probes: Theory and simulations. 6-24 - Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic:
Broadcasting in unstructured peer-to-peer overlay networks. 25-36 - Michael Behrisch, Anusch Taraz:
Efficiently covering complex networks with cliques of similar vertices. 37-47 - Nima Sarshar, P. Oscar Boykin, Vwani P. Roychowdhury:
Scalable percolation search on complex networks. 48-64 - Pierre Fraigniaud, Philippe Gauron:
D2B: A de Bruijn based content-addressable network. 65-79 - Alexandre O. Stauffer, Valmir Carneiro Barbosa:
Local heuristics and the emergence of spanning subgraphs in complex networks. 80-95 - Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Could any graph be turned into a small-world? 96-103
Volume 355, Number 2, 11 April 2006
- Ruy J. G. B. de Queiroz, Dexter Kozen:
Logic, Language, Information and Computation. 105-107
- Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini:
Intersection types and lambda models. 108-126 - Eric Allender:
NL-printable sets and nondeterministic Kolmogorov complexity. 127-138 - Denis Béchet, Annie Foret:
k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures. 139-152 - Marcelo Finger, Renata Wassermann:
The universe of propositional approximations. 153-166 - Sven Hartmann, Sebastian Link, Klaus-Dieter Schewe:
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets. 167-196 - Lauri Hella, Jose Maria Turull Torres:
Computing queries with higher-order logics. 197-214 - Yngve Lamo, Michal Walicki:
Quantifier-free logic for nondeterministic theories. 215-227 - Hans Rott:
Revision by comparison as a unifying framework: Severe withdrawal, irrevocable revision and irrefutable revision. 228-242 - Marek Zaionc:
Probability distribution for simple tautologies. 243-260
Volume 355, Number 3, 14 April 2006
- Stavros G. Kolliopoulos, George Steiner:
Approximation algorithms for minimizing the total weighted tardiness on a single machine. 261-273 - António Malheiro:
Finite derivation type for Rees matrix semigroups. 274-290 - Ke Xu, Wei Li:
Many hard examples in exact phase transitions. 291-302 - Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang:
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. 303-314 - Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro:
Asynchronous deterministic rendezvous in graphs. 315-326 - José-Ramón Sánchez-Couso, María-Inés Fernández-Camacho:
Reductions in binary search trees. 327-353 - Zemin Jin, Xueliang Li:
On the k-path cover problem for cacti. 354-363
- Caterina De Simone, Célia Picinin de Mello:
Edge-colouring of join graphs. 364-370 - Philippe Flajolet, Markus E. Nebel, Helmut Prodinger:
The scientific works of Rainer Kemp (1949-2004). 371-381 - John M. Hitchcock:
Hausdorff dimension and oracle constructions. 382-388 - Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Degree-constrained decompositions of graphs: Bounded treewidth and planarity. 389-395
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
