Book Volume 2547 2002

Experimental Algorithmics

From Algorithm Design to Robust and Efficient Software

Editors:

ISBN: 978-3-540-00346-5 (Print) 978-3-540-36383-5 (Online)

Table of contents (11 chapters)

  1. Front Matter

    Pages I-XIII

  2. No Access

    Chapter

    Pages 1-23

    Algorithm Engineering for Parallel Computation

  3. No Access

    Chapter

    Pages 24-50

    Visualization in Algorithm Engineering: Tools and Techniques

  4. No Access

    Chapter

    Pages 51-77

    Parameterized Complexity: The Main Ideas and Connections to Practical Computing

  5. No Access

    Chapter

    Pages 78-92

    A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation

  6. No Access

    Chapter

    Pages 93-126

    Using Finite Experiments to Study Asymptotic Performance

  7. No Access

    Chapter

    Pages 127-138

    WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms

  8. No Access

    Chapter

    Pages 139-162

    Algorithms and Heuristics in VLSI Design

  9. No Access

    Chapter

    Pages 163-180

    Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics

  10. No Access

    Chapter

    Pages 181-196

    Presenting Data from Experiments in Algorithmics

  11. No Access

    Chapter

    Pages 197-228

    Distributed Algorithm Engineering

  12. No Access

    Chapter

    Pages 229-278

    Implementations and Experimental Studies of Dynamic Graph Algorithms

  13. Back Matter

    Pages 279-279