Experimental Algorithms: 8th International Symposium SEA 2009, Dortmund, Germany, June 4-6, 2009, Proceedings | SpringerLink
Skip to main content
Springer Nature Link
Log in

Experimental Algorithms

8th International Symposium SEA 2009, Dortmund, Germany, June 4-6, 2009, Proceedings

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Jan Vahrenhold

    1. Fakultät für Informatik, Informatik XI, Technische Universität Dortmund, Dortmund, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5526)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SEA 2009.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (26 papers)

  1. Front Matter

    Download chapter PDF

  2. Parallelism in Current and Future Processors – Challenges and Support for Designing Optimal Algorithms

    • Heinz Bast
    Pages 1-1

  3. From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering

    • Michael A. Bender
    Pages 2-2

  4. Experimental Comparisons of Derivative Free Optimization Algorithms

    • A. Auger, N. Hansen, J. M. Perez Zerpa, R. Ros, M. Schoenauer
    Pages 3-15

  5. On Computational Models for Flash Memory Devices

    • Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz
    Pages 16-27

  6. Competitive Buffer Management with Stochastic Packet Arrivals

    • Kamal Al-Bawani, Alexander Souza
    Pages 28-39

  7. Fast and Accurate Bounds on Linear Programs

    • Ernst Althaus, Daniel Dumitriu
    Pages 40-50

  8. Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study

    • Reinhard Bauer, Dorothea Wagner
    Pages 51-62

  9. Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy

    • Mark de Berg, Peter Hachenberger
    Pages 63-75

  10. psort, Yet Another Fast Stable Sorting Software

    • Paolo Bertasi, Marco Bressan, Enoch Peserico
    Pages 76-88

  11. A Heuristic for Fair Correlation-Aware Resource Placement

    • Raouf Boutaba, Martin Karsten, Maxwell Young
    Pages 89-100

  12. Measuring the Similarity of Geometric Graphs

    • Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn
    Pages 101-112

  13. A Heuristic Strong Connectivity Algorithm for Large Graphs

    • Adan Cosgaya-Lozano, Norbert Zeh
    Pages 113-124

  14. Pareto Paths with SHARC

    • Daniel Delling, Dorothea Wagner
    Pages 125-136

  15. An Application of Self-organizing Data Structures to Compression

    • Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
    Pages 137-148

  16. Scheduling Additional Trains on Dense Corridors

    • Holger Flier, Thomas Graffagnino, Marc Nunkesser
    Pages 149-160

  17. Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays

    • Simon Gog
    Pages 161-172

  18. Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games

    • Matthias Kirschner, Philipp Schengbier, Tobias Tscheuschner
    Pages 173-184

  19. Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching

    • Lasse Kliemann, Anand Srivastav
    Pages 185-196

  20. Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow

    • Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia
    Pages 197-208
Back to top

Other volumes

  1. Experimental Algorithms

Editors and Affiliations

  • Fakultät für Informatik, Informatik XI, Technische Universität Dortmund, Dortmund, Germany

    Jan Vahrenhold

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation