Volume 321,
Number 1,
June 2004
Editorial
Article
- Michael A. Bender, Martin Farach-Colton:
The Level Ancestor Problem simplified.
5-12
- Claudson F. Bornstein, Santosh Vempala:
Flow metrics.
13-24
- Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
Space-efficient planar convex hull algorithms.
25-40
- Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber:
Searching in random partially ordered sets.
41-57
- Theodoulos Garefalakis:
The generalized Weil pairing and the discrete logarithm problem on elliptic curves.
59-72
- Alejandro Hevia, Marcos A. Kiwi:
Electronic jury voting protocols.
73-94
- S. Muthukrishnan, Süleyman Cenk Sahinalp:
An efficient algorithm for sequence comparison with block reversals.
95-101
- Hadas Shachnai, Tami Tamir:
Tight bounds for online class-constrained packing.
103-123
- Brett Stevens, Eric Mendelsohn:
Packing arrays.
125-148
- Mario Szegedy, Xiaomin Chen:
Computing Boolean functions from multiple faulty copies of input bits.
149-170
Volume 321,
Number 2-3,
August 2004
Article
- Cláudia Linhares Sales, Frédéric Maffray:
On dart-free perfectly contractile graphs.
171-194
- Keqin Li:
Analysis of randomized load distribution for reproduction trees in linear arrays and rings.
195-214
- Jason J. Holdsworth:
Graph traversal and graph transformation.
215-231
- Matteo Cavaliere, Peter Leupold:
Evolution and observation--a non-standard way to generate formal languages.
233-248
- Rodney G. Downey, Evan J. Griffiths, Stephanie Reid:
On Kurtz randomness.
249-270
- Martin Klazar:
On the least exponential growth admitting uncountably many closed permutation classes.
271-281
- Gonzalo Navarro, Kimmo Fredriksson:
Average complexity of exact and approximate multiple string matching.
283-290
- Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
Updatable timed automata.
291-345
- Juan Luis Esteban, Nicola Galesi, Jochen Messner:
On the complexity of resolution with bounded conjunctions.
347-370
- Richard Nock, Frank Nielsen:
On domain-partitioning induction criteria: worst-case bounds for the worst-case based.
371-382
- Bala Ravikumar:
Peg-solitaire, string rewriting systems and finite automata.
383-394
Short Communication
Copyright © Fri Mar 12 17:33:12 2010
by Michael Ley (ley@uni-trier.de)
