Experimental Algorithmics From Algorithm Design to Robust and Efficient Software
Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and tested on a variety of instances. Perhaps the most important lesson in this process is that designing an algorithm is but the first step in the...
| Other Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2002, 2002
|
| Edition: | 1st ed. 2002 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Algorithm Engineering for Parallel Computation
- Visualization in Algorithm Engineering: Tools and Techniques
- Parameterized Complexity: The Main Ideas and Connections to Practical Computing
- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation
- Using Finite Experiments to Study Asymptotic Performance
- WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms
- Algorithms and Heuristics in VLSI Design
- Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics
- Presenting Data from Experiments in Algorithmics
- Distributed Algorithm Engineering
- Implementations and Experimental Studies of Dynamic Graph Algorithms