Journal: Algorithmica

Volume 21, Issue 1

2 -- 20Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys. Fast Generation of Random Permutations Via Networks Simulation
21 -- 36Alan M. Frieze, Wojciech Szpankowski. Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal
37 -- 71Alfredo Viola, Patricio V. Poblete. The Analysis of Linear Probing Hashing with Buckets
72 -- 88Luca Trevisan. Parallel Approximation Algorithms by Positive Linear Programming
89 -- 103Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber. Matching Convex Shapes with Respect to the Symmetric Difference
104 -- 118Noga 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
119 -- 136Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristan, Steven Skiena, Tae-Heng Yang. On Minimum-Area Hulls
137 -- 154Juha Kärkkäinen, Erkki Sutinen. Lempel-Ziv Index for ::::q::::-Grams