Volume 10,
Number 1-2,
January 1997
- Philippe Flajolet, Wojciech Szpankowski:
Analysis of algorithms.
1-3
- Alan M. Frieze, Colin McDiarmid:
Algorithmic theory of random graphs.
5-42
- Stéphane Boucheron, Danièle Gardy:
An urn model from learning theory.
43-67
- Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber:
Bin packing with discrete item sizes, part II: Tight bounds on First Fit.
69-101
- Michael Drmota:
Systems of functional equations.
103-124
- Svante Janson, Donald E. Knuth:
Shellsort with three increments.
125-142
- Peter Kirschenhofer, Helmut Prodinger, Conrado Martinez:
Analysis of Hoare's FIND algorithm with Median-of-three partition.
143-156
- Guy Louchard:
Probabilistic analysis of adaptative sampling.
157-168
- Hosam M. Mahmoud, Robert T. Smythe, Mireille Régnier:
Analysis of Boyer-Moore-Horspool string-matching heuristic.
169-186
- Colin McDiarmid, Theodore Johnson, Harold S. Stone:
On finding a minimum spanning tree in a network with random weights.
187-204
- Kurt Mehlhorn, Volker Priebe:
On the all-pairs shortest-path algorithm of Moffat and Takaoka.
205-220
- Patricio V. Poblete, Alfredo Viola, J. Ian Munro:
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme.
221-255
- Ulrich Schmid:
Static priority scheduling of aperiodic real-time tasks.
257-303
Volume 10,
Number 3,
May 1997
Volume 10,
Number 4,
July 1997
Copyright © Sat Nov 28 22:33:24 2009
by Michael Ley (ley@uni-trier.de)
