Algorithm Engineering (eBook, PDF)

3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings
Redaktion: Vitter, Jeffrey S.; Zaroliagis, Christos D.

• Format: PDF

Produktbeschreibung

This book constitutes the refereed proceedings of the Third International Workshop on Algorithm Engineering, WAE'99, held in London, UK in July 1999.The 24 revised full papers presented were carefully reviewed and selected from a total of 46 submissions. The papers present original research results in all aspects of algorithm engineering including implementation, experimental testing, fine-tuning of discrete algorithms, development of repositories of software, methodological issues such as standards for empirical research on algorithms and data structures, and issues in the process of converting user requirements into efficient algorithmic solutions and implementations.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 368
• Erscheinungstermin: 15. Mai 2003
• Englisch
• ISBN-13: 9783540483182
• Artikelnr.: 53383970

Autorenporträt

Jeffrey Scott Vitter is the Gilbert, Louis, and Edward Lehrman Professor of Computer Science at Duke University. With a PhD from Stanford University, he is a National Science Foundation Presidential Young Investigator, a Fulbright Scholar, a Guggenheim Fellow, an IBM Faculty Development Awardee, and a Fellow of both the ACM and IEEE. He also holds several patents in the fields of external sorting, prediction, and approximate data structures.

Inhaltsangabe

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.