Space-Efficient Data Structures, Streams, and Algorithms

Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday

ISBN: 978-3-642-40272-2 (Print) 978-3-642-40273-9 (Online)
Download Book (5,695 KB) As a courtesy to our readers the eBook is provided DRM-free. However, please note that Springer uses effective methods and state-of-the art technology to detect, stop, and prosecute illegal sharing to safeguard our authors’ interests.

Table of contents (22 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Book Chapter

    Pages 1-11

    The Query Complexity of Finding a Hidden Permutation

  3. Book Chapter

    Pages 12-26

    Bounds for Scheduling Jobs on Grid Processors

  4. Book Chapter

    Pages 27-32

    Quake Heaps: A Simple Alternative to Fibonacci Heaps

  5. Book Chapter

    Pages 33-47

    Variations on Instant Insanity

  6. Book Chapter

    Pages 48-60

    A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query

  7. Book Chapter

    Pages 61-76

    Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50

  8. Book Chapter

    Pages 77-96

    Frugal Streaming for Estimating Quantiles

  9. Book Chapter

    Pages 97-111

    From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures

  10. Book Chapter

    Pages 112-132

    Computing (and Life) Is All about Tradeoffs

  11. Book Chapter

    Pages 133-149

    A History of Distribution-Sensitive Data Structures

  12. Book Chapter

    Pages 150-163

    A Survey on Priority Queues

  13. Book Chapter

    Pages 164-175

    On Generalized Comparison-Based Sorting Problems

  14. Book Chapter

    Pages 176-198

    A Survey of the Game “Lights Out!”

  15. Book Chapter

    Pages 199-215

    Random Access to High-Order Entropy Compressed Text

  16. Book Chapter

    Pages 216-235

    Succinct and Implicit Data Structures for Computational Geometry

  17. Book Chapter

    Pages 236-250

    In Pursuit of the Dynamic Optimality Conjecture

  18. Book Chapter

    Pages 251-266

    A Survey of Algorithms and Models for List Update

  19. Book Chapter

    Pages 267-302

    Orthogonal Range Searching for Text Indexing

  20. Book Chapter

    Pages 303-318

    A Survey of Data Structures in the Bitprobe Model

  21. Book Chapter

    Pages 319-332

    Succinct Representations of Ordinal Trees

previous Page of 2