Skip to main content
  • Book
  • © 2013

Space-Efficient Data Structures, Streams, and Algorithms

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

  • Future prospects in algorithm research
  • Growth of and advances in space efficient data structures
  • Sorting and searching in data structures

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

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

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 (22 chapters)

  1. Front Matter

  2. The Query Complexity of Finding a Hidden Permutation

    • Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
    Pages 1-11
  3. Bounds for Scheduling Jobs on Grid Processors

    • Joan Boyar, Faith Ellen
    Pages 12-26
  4. Variations on Instant Insanity

    • Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara
    Pages 33-47
  5. Frugal Streaming for Estimating Quantiles

    • Qiang Ma, S. Muthukrishnan, Mark Sandler
    Pages 77-96
  6. Computing (and Life) Is All about Tradeoffs

    • Allan Borodin
    Pages 112-132
  7. A History of Distribution-Sensitive Data Structures

    • Prosenjit Bose, John Howat, Pat Morin
    Pages 133-149
  8. A Survey on Priority Queues

    • Gerth Stølting Brodal
    Pages 150-163
  9. On Generalized Comparison-Based Sorting Problems

    • Jean Cardinal, Samuel Fiorini
    Pages 164-175
  10. A Survey of the Game “Lights Out!”

    • Rudolf Fleischer, Jiajin Yu
    Pages 176-198
  11. A Survey of Algorithms and Models for List Update

    • Shahin Kamali, Alejandro López-Ortiz
    Pages 251-266
  12. Orthogonal Range Searching for Text Indexing

    • Moshe Lewenstein
    Pages 267-302
  13. A Survey of Data Structures in the Bitprobe Model

    • Patrick K. Nicholson, Venkatesh Raman, S. Srinivasa Rao
    Pages 303-318

About this book

This Festschrift volume, published in honour of J. Ian Munro, contains contributions written by some of his colleagues, former students, and friends. In celebration of his 66th birthday the colloquium "Conference on Space Efficient Data Structures, Streams and Algorithms" was held in Waterloo, ON, Canada, during August 15-16, 2013. The articles presented herein cover some of the main topics of Ian's research interests. Together they give a good overall perspective of the last 40 years of research in algorithms and data structures.

Editors and Affiliations

  • Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia

    Andrej Brodnik

  • Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada

    Alejandro López-Ortiz

  • The Institute of Mathematical Sciences, Chennai, India

    Venkatesh Raman

  • Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay

    Alfredo Viola

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