Algorithm engineering : 5th International Workshop, WAE 2001, Århus, Denmark, August 28 31, 2001 : proceedings
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 t...
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | , , |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
2141 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithm engineering, 5th International Workshop, WAE 2001, Aarhus, Denmark, August 28-21, 2001, proceedings, Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela (eds.), 2001, New York, Springer, 1 vol. (X-197 p.), Lecture notes in computer science, 3-540-42500-4 • Algorithm Engineering, Texte imprimé, 9783662180655 |
Sisällysluettelo:
- 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.