default search action
Journal of Algorithms, Volume 29
Volume 29, Number 1, October 1998
- Al Borchers, Ding-Zhu Du, Biao Gao, Peng-Jun Wan:
The k-Steiner Ratio in the Rectilinear Plane. 1-17 - Dany Breslauer, Livio Colussi, Laura Toniolo:
On the Comparison Complexity of the String Prefix-Matching Problem. 18-67 - Sanguthevar Rajasekaran:
Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses. 68-81 - Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis:
All-Pairs Min-Cut in Sparse Networks. 82-110 - Paul E. Kearney, Derek G. Corneil:
Tree Powers. 111-131 - Hsueh-I Lu, R. Ravi:
Approximating Maximum Leaf Spanning Trees in Almost Linear Time. 132-141 - Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms. 142-164 - Timothy R. Walsh:
Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time. 165-173 - Dorit S. Hochbaum:
Approximating Clique and Biclique Problems. 174-200
Volume 29, Number 2, November 1998
- Kenneth L. Clarkson:
SODA '95 Papers. 203 - Baruch Schieber:
Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property. 204-222 - Sampath Kannan, Todd A. Proebsting:
Register Allocation in Structured Programs. 223-237 - L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl:
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. 238-255 - Arne Andersson, Ola Petersson:
Approximate Indexed Lists. 256-276 - George S. Lueker:
Average-Case Analysis of Off-Line and On-Line Knapsack Problems. 277-305 - Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts:
Fairness in Scheduling. 306-357 - William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan:
Design of Practical and Provably Good Random Number Generators. 358-389 - Nabil Kahalé, Frank Thomson Leighton:
Greedy Dynamic Routing on Arrays. 390-410
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.