default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDALENEX 2003: Baltimore, MD, USA
- Richard E. Ladner:
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA, January 11, 2003. SIAM 2003, ISBN 0-89871-542-3 - Lars Arge:
Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). ALENEX 2003 - Erik D. Demaine:
Open Problems from ALENEX 2003. ALENEX 2003 - David L. Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor:
The Cutting-Stock Approach to Bin Packing: Theory and Experiments. ALENEX 2003: 1-15 - Christos Gkantsidis, Milena Mihail, Ellen W. Zegura:
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs. ALENEX 2003: 16-25 - John Hershberger, Matthew Maxel, Subhash Suri:
Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. ALENEX 2003: 26-36 - Olivier Devillers, Sylvain Pion:
Efficient Exact Geometric Predicates for Delauny Triangulations. ALENEX 2003: 37-44 - Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim:
Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. ALENEX 2003: 45-55 - F. Betül Atalay, David M. Mount:
Interpolation over Light Fields with Applications in Computer Graphics. ALENEX 2003: 56-68 - Gonzalo Navarro, Rodrigo Paredes:
Practical Constraction of Metric t-Spanners. ALENEX 2003: 69-81 - Lars Arge, Andrew Danner, Sha-Mayn Teh:
I/O-efficient Point Location Using Persistent B-Trees. ALENEX 2003: 82-92 - Ranjan Sinha, Justin Zobel:
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries. ALENEX 2003: 93-105 - Luzi Anderegg, Stephan J. Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer:
Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. ALENEX 2003: 106-118 - Mauricio G. C. Resende, Renato Fonseca F. Werneck:
On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem. ALENEX 2003: 119-127 - Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang:
Fast Prefix Matching of Bounded Strings. ALENEX 2003: 128-140
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.
last updated on 2025-05-24 01:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
