Space-Efficient Data Structures, Streams, and Algorithms  Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday /  [electronic resource] : 
edited by Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola. 
 - Berlin, Heidelberg :  Springer Berlin Heidelberg,  2013. 
 - 1 online resource (XXVIII, 363 p. 58 ill.) 
 - Lecture Notes in Computer Science,  8066  0302-9743 ; .
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9783642402739 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer science.<br/>Computer communication systems.<br/>Data structures (Computer science).<br/>Algorithms.<br/>Numerical analysis.<br/>Computer science--Mathematics.<br/>Computer graphics.