Ebook: Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday

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.

---

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.

---

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.
Content:
Front Matter....Pages -
The Query Complexity of Finding a Hidden Permutation....Pages 1-11
Bounds for Scheduling Jobs on Grid Processors....Pages 12-26
Quake Heaps: A Simple Alternative to Fibonacci Heaps....Pages 27-32
Variations on Instant Insanity....Pages 33-47
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query....Pages 48-60
Frugal Streaming for Estimating Quantiles....Pages 61-76
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures....Pages 77-96
Computing (and Life) Is All about Tradeoffs....Pages 97-111
A History of Distribution-Sensitive Data Structures....Pages 112-132
A Survey on Priority Queues....Pages 133-149
On Generalized Comparison-Based Sorting Problems....Pages 150-163
A Survey of the Game “Lights Out!”....Pages 164-175
Random Access to High-Order Entropy Compressed Text....Pages 176-198
Succinct and Implicit Data Structures for Computational Geometry....Pages 199-215
In Pursuit of the Dynamic Optimality Conjecture....Pages 216-235
A Survey of Algorithms and Models for List Update....Pages 236-250
Orthogonal Range Searching for Text Indexing....Pages 251-266
A Survey of Data Structures in the Bitprobe Model....Pages 267-302
Succinct Representations of Ordinal Trees....Pages 303-318
Array Range Queries....Pages 319-332
Indexes for Document Retrieval with Relevance....Pages 333-350
Back Matter....Pages 351-362
....Pages -