Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro, on the Occasion of His 66th Birthday

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

Brodnik, Andrej
Lopez-Ortiz, Alejandro
Raman, Venkatesh

Paperback

General ComputersProgramming

ISBN10: 3642402720
ISBN13: 9783642402722
Publisher: Springer
Published: Aug 7 2013
Pages: 363
Weight: 1.21
Height: 0.81 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

Programming

View All