- Jörg Flum, Martin Grohe, Mark Weyer:
Bounded fixed-parameter tractability and log2n nondeterministic bits. J. Comput. Syst. Sci. 72(1): 34-71 (2006) - Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan:
An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci. 72(1): 16-33 (2006) - Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72(1): 180-203 (2006) - Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun:
Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci. 72(4): 617-647 (2006) - Sara Gradara, Antonella Santone, Maria Luisa Villani:
DELFIN+: An efficient deadlock detection tool for CCS processes. J. Comput. Syst. Sci. 72(8): 1397-1412 (2006) - Fan Chung Graham:
Foreword. J. Comput. Syst. Sci. 72(3): 419 (2006) - Fan Chung Graham:
A brief overview of network algorithms. J. Comput. Syst. Sci. 72(3): 420-424 (2006) - David Gross-Amblard, Michel de Rougemont:
Uniform generation in spatial constraint databases and applications. J. Comput. Syst. Sci. 72(4): 576-591 (2006) - Jon Grov, Ragnar Normann:
Technical note: Replication graphs revisited. J. Comput. Syst. Sci. 72(8): 1251-1261 (2006) - Lin Guan, Michael E. Woodward, Irfan-Ullah Awan:
Control of queueing delay in a buffer with time-varying arrival rate. J. Comput. Syst. Sci. 72(7): 1238-1248 (2006) - Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8): 1386-1396 (2006) - Yehuda Hassin, David Peleg:
Average probe complexity in quorum systems. J. Comput. Syst. Sci. 72(4): 592-616 (2006) - John M. Hitchcock, N. V. Vinodchandran:
Dimension, entropy rates, and compression. J. Comput. Syst. Sci. 72(4): 760-782 (2006) - Marcus Hutter:
Sequential predictions based on algorithmic complexity. J. Comput. Syst. Sci. 72(1): 95-117 (2006) - Makoto Ikeda, Leonard Barolli, Akio Koyama, Arjan Durresi, Giuseppe De Marco, Jiro Iwashige:
Performance evaluation of an intelligent CAC and routing framework for multimedia applications in broadband networks. J. Comput. Syst. Sci. 72(7): 1183-1200 (2006) - Russell Impagliazzo, Bruce M. Kapron:
Logics for reasoning about cryptographic constructions. J. Comput. Syst. Sci. 72(2): 286-320 (2006) - Satoshi Itaya, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa:
HAMS: Scalable peer-to-peer multimedia streaming model in heterogeneous networks. J. Comput. Syst. Sci. 72(7): 1211-1225 (2006) - Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán:
Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]. J. Comput. Syst. Sci. 72(4): 783 (2006) - Roni Khardon, Marta Arias:
The subsumption lattice and query learning. J. Comput. Syst. Sci. 72(1): 72-94 (2006) - Subhash Khot:
Hardness of approximating the Shortest Vector Problem in high lp norms. J. Comput. Syst. Sci. 72(2): 206-219 (2006) - Almudena Konrad, Ben Y. Zhao, Anthony D. Joseph:
Determining model accuracy of network traces. J. Comput. Syst. Sci. 72(7): 1156-1171 (2006) - I-En Liao, Cheng-Chi Lee, Min-Shiang Hwang:
A password authentication scheme over insecure networks. J. Comput. Syst. Sci. 72(4): 727-740 (2006) - László Lovász, Santosh S. Vempala:
Simulated annealing in convex bodies and an O*(n4) volume algorithm. J. Comput. Syst. Sci. 72(2): 392-417 (2006) - Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006) - Milena Mihail, Christos H. Papadimitriou, Amin Saberi:
On certain connectivity properties of the internet topology. J. Comput. Syst. Sci. 72(2): 239-251 (2006) - Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Tolerant property testing and distance approximation. J. Comput. Syst. Sci. 72(6): 1012-1042 (2006) - Ella Grishikashvili Pereira, Rubem Pereira, A. Taleb-Bendiab:
Performance evaluation for self-healing distributed services and fault detection mechanisms. J. Comput. Syst. Sci. 72(7): 1172-1182 (2006) - C. Greg Plaxton:
Approximation algorithms for hierarchical location problems. J. Comput. Syst. Sci. 72(3): 425-443 (2006) - Mario Di Raimondo, Rosario Gennaro:
Provably secure threshold password-authenticated key exchange. J. Comput. Syst. Sci. 72(6): 978-1001 (2006) - Tim Roughgarden:
On the severity of Braess's Paradox: Designing networks for selfish users is hard. J. Comput. Syst. Sci. 72(5): 922-953 (2006)