1. Fast Generation of Random Permutations Via Networks Simulation

   • A. Czumaj
   • P. Kanarek
   • K. Lorys

   Pages: 2 - 20

2. Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal

   • A. Frieze
   • W. Szpankowski

   Pages: 21 - 36

3. The Analysis of Linear Probing Hashing with Buckets

   • A. Viola
   • P. V. Poblete

   Pages: 37 - 71

4. Parallel Approximation Algorithms by Positive Linear Programming

   • L. Trevisan

   Pages: 72 - 88

5. Matching Convex Shapes with Respect to the Symmetric Difference

   • H. Alt
   • U. Fuchs
   • G. Weber

   Pages: 89 - 103

6. On-Line and Off-Line Approximation Algorithms for Vector Covering Problems

   • N. Alon
   • Y. Azar
   • G. J. Woeginger

   Pages: 104 - 118

7. On Minimum-Area Hulls

   • E. M. Arkin
   • Y. -J. Chiang
   • T. -C. Yang

   Pages: 119 - 136

8. Lempel—Ziv Index for q -Grams

   • J. Kärkkäinen
   • E. Sutinen

   Pages: 137 - 154