default search action
Journal of Algorithms, Volume 31
Volume 31, Number 1, April 1999
- Julien Basch, Leonidas J. Guibas, John Hershberger:
Data Structures for Mobile Data. 1-28 - Gary L. Miller, Dafna Talmor, Shang-Hua Teng:
Optimal Coarsening of Unstructured Meshes. 29-65 - Anthony LaMarca, Richard E. Ladner:
The Influence of Caches on the Performance of Sorting. 66-104 - Friedhelm Meyer auf der Heide, Berthold Vöcking:
Shortest-Path Routing in Arbitrary Networks. 105-131 - William M. Kantor, Eugene M. Luks, Peter D. Mark:
Sylow Subgroups in Parallel. 132-195 - Ulrich Faigle, Walter Kern, Willem M. Nawijn:
A Greedy On-Line Algorithm for thek-Track Assignment Problem. 196-210 - Toshihiro Fujito:
Approximating Node-Deletion Problems for Matroidal Properties. 211-227 - Sudipto Guha, Samir Khuller:
Greedy Strikes Back: Improved Facility Location Algorithms. 228-248 - Cristina Bazgan, Miklos Santha, Zsolt Tuza:
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. 249-268
Volume 31, Number 2, May 1999
- Edward A. Bender, E. Rodney Canfield:
An Approximate Probabilistic Model for Structured Gaussian Elimination. 271-290 - Paolo Ferragina, Roberto Grossi:
Improved Dynamic Text Indexing. 291-319 - Michael E. Saks, Fotios Zaharoglou:
Optimal Space Distributed Order-Preserving Lists. 320-334 - Meena Mahajan, Venkatesh Raman:
Parameterizing above Guaranteed Values: MaxSat and MaxCut. 335-354
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.