Volume 1,
Number 1,
February 2003
Combinatorial Algorithms
- Sergei Bespamyatnikh, Andrei Kelarev:
Algorithms for shortest paths and d-cycle problems.
1-9
Electronic Edition (link) BibTeX
- Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher:
A derandomization using min-wise independent permutations.
11-20
Electronic Edition (link) BibTeX
- Graeme L. Cohen, Ronald M. Sorli:
On the number of distinct prime factors of an odd perfect number.
21-35
Electronic Edition (link) BibTeX
- Maxime Crochemore, Christophe Hancart, Thierry Lecroq:
A unifying look at the Apostolico-Giancarlo string-matching algorithm.
37-52
Electronic Edition (link) BibTeX
- Michael J. Dinneen, Bakhadyr Khoussainov:
Update games and update networks.
53-65
Electronic Edition (link) BibTeX
- William Duckworth, Nicholas C. Wormald, Michele Zito:
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations.
67-76
Electronic Edition (link) BibTeX
- Jeffrey H. Kingston, Nicholas Paul Sheppard:
On reductions for the Steiner Problem in Graphs.
77-88
Electronic Edition (link) BibTeX
- Rolf Niedermeier, Peter Rossmanith:
An efficient fixed-parameter algorithm for 3-Hitting Set.
89-102
Electronic Edition (link) BibTeX
- Ramesh Hariharan, V. Vinay:
String matching in Õ(sqrt(n)+sqrt(m)) quantum time.
103-110
Electronic Edition (link) BibTeX
- Jeong Seop Sim, Kunsoo Park:
The consensus string problem for a metric is NP-complete.
111-117
Electronic Edition (link) BibTeX
Volume 1,
Number 2,
April 2003
SIROCCO 2000
- Paolo Boldi, Sebastiano Vigna:
Lower bounds for weak sense of direction.
119-128
Electronic Edition (link) BibTeX
- Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Alessandro Roncato, Nicola Santoro:
On time versus size for monotone dynamic monopolies in regular topologies.
129-150
Electronic Edition (link) BibTeX
- Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping:
Optimal broadcast on parallel locality models.
151-166
Electronic Edition (link) BibTeX
- Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
Exact communication costs for consensus and leader in a tree.
167-183
Electronic Edition (link) BibTeX
- Roberto Baldoni, Jean-Michel Hélary, Michel Raynal, Lénaick Tanguy:
Consensus in Byzantine asynchronous systems.
185-210
Electronic Edition (link) BibTeX
- Chryssis Georgiou, Alexander A. Shvartsman:
Cooperative computing with fragmentable and mergeable groups.
211-235
Electronic Edition (link) BibTeX
- Cyril Gavoille, Akka Zemmari:
The compactness of adaptive routing tables.
237-254
Electronic Edition (link) BibTeX
Volume 1,
Numbers 3-4,
June 2003
Volume 1,
Numbers 5-6,
October 2003
Copyright © Sun May 17 00:09:04 2009
by Michael Ley (ley@uni-trier.de)
