Volume 25,
Number 1,
October 1997
- Bonnie Berger, Peter W. Shor:
Tight Bounds for the Maximum Acyclic Subgraph Problem.
1-18
- Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen:
A Reliable Randomized Algorithm for the Closest-Pair Problem.
19-51
- Michel Habib, Lhouari Nourine, George Steiner:
Gray Codes for the Ideals of Interval Orders.
52-66
- Mohammad Hossain Heydari, Ivan Hal Sudborough:
On the Diameter of the Pancake Network.
67-94
- Yehuda Afek, Gideon Stupp:
Optimal Time-Space Tradeoff for Shared Memory Leader Election.
95-117
- Michael Krivelevich:
Approximate Set Covering in Uniform Hypergraphs.
118-143
- Michel Barbeau, Froduald Kabanza, Richard St.-Denis:
An Efficient Algorithm for Controller Synthesis under Full Observation.
144-161
- Noga Alon, Dmitry N. Kozlov:
Coins with Arbitrary Weights.
162-176
- Binay K. Bhattacharya, Sandeep Sen:
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm.
177-193
- Andrew Chi-Chih Yao, Frances F. Yao:
Dictionary Look-Up with One Error.
194-202
Volume 25,
Number 2,
November 1997
Copyright © Mon Nov 2 21:43:00 2009
by Michael Ley (ley@uni-trier.de)
