TY  - BOOK
AU  - Vitter,Jeffrey S.
AU  - Zaroliagis,Christos D.
ED  - SpringerLink (Online service)
TI  - Algorithm Engineering: 3rd International Workshop, WAE’99 London, UK, July 19–21, 1999 Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540483182
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 1999///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer Communication Networks
KW  - Computer software
KW  - Electronic data processing
KW  - Computational complexity
KW  - Combinatorics
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Numeric Computing
KW  - Discrete Mathematics in Computer Science
N1  - Invited Lectures -- Selecting Problems for Algorithm Evaluation -- BSP Algorithms — “Write Once, Run Anywhere” -- Ten Years of LEDA: Some Thoughts -- Contributed Papers -- Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison -- Efficient Implementation of Lazy Suffix Trees -- Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism -- Finding Minimum Congestion Spanning Trees -- Evaluation of an Algorithm for the Transversal Hypergraph Problem -- Construction Heuristics and Domination Analysis for the Asymmetric TSP -- Counting in Mobile Networks: Theory and Experimentation -- Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport -- Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA -- On-Line Zone Construction in Arrangements of Lines in the Plane -- The Design and Implementation of Planar Maps in CGAL -- An Easy to Use Implementation of Linear Perturbations within Cupgal -- Analysing Cache Effects in Distribution Sorting -- Fast Regular Expression Search -- An Experimental Evaluation of Hybrid Data Structures for Searching -- LEDA-SM: Extending LEDA to Secondary Memory -- A Priority Queue Transform -- Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks -- Estimating Large Distances in Phylogenetic Reconstruction -- The Performance of Concurrent Red-Black Tree Algorithms -- Performance Engineering Case Study: Heap Construction -- A Fast and Simple Local Search for Graph Coloring -- BALL: Biochemical Algorithms Library -- An Experimental Study of Priority Queues in External Memory
UR  - http://dx.doi.org/10.1007/3-540-48318-7
ER  -