Volume 21,
Number 1,
May 1998
- Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Fast Generation of Random Permutations Via Networks Simulation.
2-20
- Alan M. Frieze, Wojciech Szpankowski:
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal.
21-36
- Alfredo Viola, Patricio V. Poblete:
The Analysis of Linear Probing Hashing with Buckets.
37-71
- Luca Trevisan:
Parallel Approximation Algorithms by Positive Linear Programming.
72-88
- Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber:
Matching Convex Shapes with Respect to the Symmetric Difference.
89-103
- Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger:
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
104-118
- Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristan, Steven Skiena, Tae-Heng Yang:
On Minimum-Area Hulls.
119-136
- Juha Kärkkäinen, Erkki Sutinen:
Lempel-Ziv Index for q-Grams.
137-154
Volume 21,
Number 2,
June 1998
Volume 21,
Number 3,
July 1998
Volume 21,
Number 4,
August 1998
Copyright © Tue Nov 10 00:28:23 2009
by Michael Ley (ley@uni-trier.de)
