Algorithm Engineering
5th International Workshop, WAE 2001 Århus, Denmark, August 28–31, 2001 Proceedings
Brodal, Gerth Stølting.
editor.
Frigioni, Daniele.
editor.
Marchetti-Spaccamela, Alberto.
editor.
SpringerLink (Online service)
text
gw
2001
monographic
eng
access
X, 202 p. online resource.
This book constitutes the refereed proceedings of the 5th Workshop on Algorithm Engineering, WAE 2001, held in Aarhus, Denmark, in August 2001. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. Among the topics addressed are implementation, experimental testing, and fine-tuning of discrete algorithms; novel use of discrete algorithms in other disciplines; empirical research on algorithms and data structures; and methodological issues regarding the process of converting user requirements into efficient algorithmic solutions and implemenations.
Compact DFA Representation for Fast Regular Expression Search -- The Max-Shift Algorithm for Approximate String Matching -- Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance -- Experiences with the Design and Implementation of Space-Efficient Deques -- Designing and Implementing a General Purpose Halfedge Data Structure -- Optimised Predecessor Data Structures for Internal Memory -- An Adaptable and Extensible Geometry Kernel -- Efficient Resource Allocation with Noisy Functions -- Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem -- Exploiting Partial Knowledge of Satisfying Assignments -- Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture -- An Experimental Study of Data Migration Algorithms -- An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks -- Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry -- Pareto Shortest Paths is Often Feasible in Practice.
edited by Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela.
Computer science
Computer programming
Data structures (Computer science)
Computers
Algorithms
Computer science
Mathematics
Computer Science
Theory of Computation
Programming Techniques
Data Structures, Cryptology and Information Theory
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Data Structures
QA75.5-76.95
004.0151
Springer eBooks
Lecture Notes in Computer Science, 2141
9783540446880
http://dx.doi.org/10.1007/3-540-44688-5
http://dx.doi.org/10.1007/3-540-44688-5
121227
20170515111527.0
978-3-540-44688-0