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

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.

• Format: Paperback
• Language: English
• ISBN: 3642402720
• ISBN13: 9783642402722
• Release Date: August 2013
• Publisher: Springer
• Length: 363 Pages
• Weight: 1.21 lbs.
• Dimensions: 0.8" x 6.1" x 9.2"