Skip to main content
  • Conference proceedings
  • © 2006

Experimental Algorithms

5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings

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

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

Conference series link(s): WEA: International Workshop on Experimental and Efficient Algorithms

Conference proceedings info: WEA 2006.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • 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

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

Table of contents (29 papers)

  1. Front Matter

  2. Session 2

    1. An Efficient Heuristic for the Ring Star Problem

      • Thayse Christine S. Dias, Gilberto F. de Sousa Filho, Elder M. Macambira, Lucidio dos Anjos F. Cabral, Marcia Helena C. Fampa
      Pages 24-35
    2. An Incremental Model for Combinatorial Maximization Problems

      • Jeff Hartline, Alexa Sharp
      Pages 36-48
    3. Workload Balancing in Multi-stage Production Processes

      • Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe
      Pages 49-60
  3. Session 3

    1. Fault Cryptanalysis and the Shrinking Generator

      • Marcin Gomułkiewicz, Mirosław Kutyłowski, Paweł Wlaź
      Pages 61-72
  4. Session 4

    1. Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces

      • Rodrigo Paredes, Edgar Chávez, Karina Figueroa, Gonzalo Navarro
      Pages 85-97
    2. Fast and Simple Approximation of the Diameter and Radius of a Graph

      • Krists Boitmanis, Kārlis Freivalds, Pēteris Lediņš, Rūdolfs Opmanis
      Pages 98-108
  5. Session 5

    1. Lists Revisited: Cache Conscious STL Lists

      • Leonor Frias, Jordi Petit, Salvador Roura
      Pages 121-133
    2. Engineering the LOUDS Succinct Tree Representation

      • O’Neil Delpratt, Naila Rahman, Rajeev Raman
      Pages 134-145
  6. Session 6

    1. Faster Adaptive Set Intersections for Text Searching

      • Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu
      Pages 146-157
    2. Compressed Dictionaries: Space Measures, Data Sets, and Experiments

      • Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
      Pages 158-169
    3. Efficient Bit-Parallel Algorithms for (δ,α)-Matching

      • Kimmo Fredriksson, Szymon Grabowski
      Pages 170-181
  7. Session 7

    1. Tiny Experiments for Algorithms and Life

      • Jon Bentley
      Pages 182-182
    2. Evaluation of Online Strategies for Reordering Buffers

      • Matthias Englert, Heiko Röglin, Matthias Westermann
      Pages 183-194
  8. Session 8

    1. Scheduling Unrelated Parallel Machines Computational Results

      • Burkhard Monien, Andreas Woclaw
      Pages 195-206
    2. Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem

      • Mihhail Aizatulin, Florian Diedrich, Klaus Jansen
      Pages 207-218

Editors and Affiliations

  • Software Department, Edifici Omega, Universitat Politècnica de Catalunya, Barcelona, Spain

    Carme Àlvarez

  • ALBCOM Research Group, Universitat Politècnica de Catalunya, Edifici Ω, Barcelona, Spain

    María Serna

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • 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