default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. WAE 1999: London, UK
- Jeffrey Scott Vitter, Christos D. Zaroliagis:
Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings. Lecture Notes in Computer Science 1668, Springer 1999, ISBN 3-540-66427-0
Invited Lectures
- Andrew V. Goldberg:
Selecting Problems for Algorithm Evaluation. 1-11 - Bill McColl:
BSP Algorithms - Write Once, Run Anywhere. 12-13 - Kurt Mehlhorn:
Ten Years of LEDA Some Thoughts (Abstract). 14
Contributed Papers
- Víctor M. Jiménez, Andrés Marzal:
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison. 15-29 - Robert Giegerich, Stefan Kurtz, Jens Stoye
:
Efficient Implementation of Lazy Suffix Trees. 30-42 - Shlomit Dascal, Uzi Vishkin:
Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. 43-59 - Renato Fonseca F. Werneck, João C. Setubal, Arlindo Flávio da Conceição:
Finding Minimum Congestion Spanning Trees. 60-71 - Dimitris J. Kavvadias, Elias C. Stavropoulos:
Evaluation of an Algorithm for the Transversal Hypergraph Problem. 72-84 - Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich:
Construction Heuristics and Domination Analysis for the Asymmetric TSP. 85-94 - Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Basil Tampakas:
Counting in Mobile Networks: Theory and Experimentation. 95-109 - Frank Schulz, Dorothea Wagner, Karsten Weihe:
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. 110-123 - Panagiota Fatourou, Paul G. Spirakis, Panagiotis Zarafidis, Anna Zoura:
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. 124-138 - Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart:
On-Line Zone Construction in Arrangements of Lines in the Plane. 139-153 - Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan:
The Design and Implementation of Planar Maps in CGAL. 154-168 - Jochen Comes, Mark Ziegelmann:
An Easy to Use Implementation of Linear Perturbations within CGAL. 169-182 - Naila Rahman, Rajeev Raman:
Analysing Cache Effects in Distribution Sorting. 183-197 - Gonzalo Navarro, Mathieu Raffinot:
Fast Regular Expression Search. 198-212 - Maureen Korda, Rajeev Raman:
An Experimental Evaluation of Hybrid Data Structures for Searching. 214-228 - Andreas Crauser, Kurt Mehlhorn:
LEDA-SM Extending LEDA to Secondary Memory. 229-243 - Michael L. Fredman:
A Priority Queue Transform. 244-258 - Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis:
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. 259-271 - Daniel H. Huson, Kelly Ann Smith, Tandy J. Warnow:
Estimating Large Distances in Phylogenetic Reconstruction. 272-286 - Sabine Hanke:
The Performance of Concurrent Red-Black Tree Algorithms. 287-301 - Jesper Bojesen, Jyrki Katajainen, Maz Spork:
Performance Engineering Case Study: Heap Construction. 302-316 - Massimiliano Caramia, Paolo Dell'Olmo:
A Fast and Simple Local Search for Graph Coloring. 317-330 - Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof:
BALL: Biochemical Algorithms Library. 331-345 - Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer:
An Experimental Study of Priority Queues in External Memory. 346-360
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 2024-12-31 21:54 CET 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:
