Skip to main content
SpringerLink
Log in

Space-Efficient Data Structures, Streams, and Algorithms

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

  • Book
  • © 2013

Overview

Editors:
  1. Andrej Brodnik

    1. Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Alejandro López-Ortiz

    1. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Venkatesh Raman

    1. The Institute of Mathematical Sciences, Chennai, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Alfredo Viola

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 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)

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (22 chapters)

  1. Front Matter

    Download chapter PDF

  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. Quake Heaps: A Simple Alternative to Fibonacci Heaps

    • Timothy M. Chan
    Pages 27-32

  5. Variations on Instant Insanity

    • Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara
    Pages 33-47

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

    • Stephane Durocher
    Pages 48-60

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

    • David Kirkpatrick
    Pages 61-76

  8. Frugal Streaming for Estimating Quantiles

    • Qiang Ma, S. Muthukrishnan, Mark Sandler
    Pages 77-96

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

    • Jérémy Barbay
    Pages 97-111

  10. Computing (and Life) Is All about Tradeoffs

    • Allan Borodin
    Pages 112-132

  11. A History of Distribution-Sensitive Data Structures

    • Prosenjit Bose, John Howat, Pat Morin
    Pages 133-149

  12. A Survey on Priority Queues

    • Gerth Stølting Brodal
    Pages 150-163

  13. On Generalized Comparison-Based Sorting Problems

    • Jean Cardinal, Samuel Fiorini
    Pages 164-175

  14. A Survey of the Game “Lights Out!”

    • Rudolf Fleischer, Jiajin Yu
    Pages 176-198

  15. Random Access to High-Order Entropy Compressed Text

    • Roberto Grossi
    Pages 199-215

  16. Succinct and Implicit Data Structures for Computational Geometry

    • Meng He
    Pages 216-235

  17. In Pursuit of the Dynamic Optimality Conjecture

    • John Iacono
    Pages 236-250

  18. A Survey of Algorithms and Models for List Update

    • Shahin Kamali, Alejandro López-Ortiz
    Pages 251-266

  19. Orthogonal Range Searching for Text Indexing

    • Moshe Lewenstein
    Pages 267-302

  20. A Survey of Data Structures in the Bitprobe Model

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

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation