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

ISBN-13: 9783642402722 / Angielski / Miękka / 2013 / 363 str.

Andrej Brodnik; Alejandro Lopez-Ortiz; Venkatesh Raman

Opis

This Festschrift volume, published in honor of J. Ian Munro, presents a good overall perspective of the last 40 years of research in algorithms and data structures. It also explores the future prospects in algorithm research.

Spis treści

The Query Complexity of Finding a Hidden Permutation.- Bounds for Scheduling Jobs on Grid Processors.- Quake Heaps: A Simple Alternative to Fibonacci Heaps.- Variations on Instant Insanity.- A Simple Linear-Space Data Structure for Constant-Time Range.- Closing a Long-Standing Complexity Gap for Selection: V3(42) = 50.- Frugal Streaming for Estimating Quantiles.- From Time to Space: Fast Algorithms That Yield Small and Fast Data.- Computing (and life) Is all About Tradeoffs: A Small Sample of Some Computational Tradeoffs.- A History of Distribution-Sensitive Data Structures.- A Survey on Priority Queues.- On Generalized Comparison-Based Sorting Problems.- A Survey of the Game “Lights Out!”.- Random Access to High-Order Entropy Compressed Text.- Succinct and Implicit Data Structures for Computational Geometry.- In Pursuit of the Dynamic Optimality Conjecture.- A Survey of Algorithms and Models for List Update.- Orthogonal Range Searching for Text Indexing.- A Survey of Data Structures in the Bitprobe Model.- Succinct Representations of Ordinal Trees.- Array Range Queries.- Indexes for Document Retrieval with Relevance.

Blurb

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.