1 option
Algorithm Engineering : 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings / edited by Jeffrey S. Vitter, Christos D. Zaroliagis.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1668.
- Lecture Notes in Computer Science, 0302-9743 ; 1668
- Language:
- English
- Subjects (All):
- Computer programming.
- Computers.
- Algorithms.
- Numerical analysis.
- Computer networks.
- Combinatorial analysis.
- Programming Techniques.
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Numeric Computing.
- Computer Communication Networks.
- Combinatorics.
- Local Subjects:
- Programming Techniques.
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Numeric Computing.
- Computer Communication Networks.
- Combinatorics.
- Physical Description:
- 1 online resource (VIII, 368 pages).
- Edition:
- First edition 1999.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-48318-2
- 9783540483182
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.