Space-Efficient Data Structures, Streams, and Algorithms

CHF 66.35
Auf Lager
SKU
LSEH1TQBDRN
Stock 1 Verfügbar
Geliefert zwischen Mi., 04.02.2026 und Do., 05.02.2026

Details

_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.


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.

Future prospects in algorithm research Growth of and advances in space efficient data structures Sorting and searching in data structures

Inhalt

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.

Weitere Informationen

  • Allgemeine Informationen
    • GTIN 09783642402722
    • Editor Andrej Brodnik, Alfredo Viola, Venkatesh Raman, Alejandro Lopez-Ortiz
    • Sprache Englisch
    • Auflage 2013
    • Größe H235mm x B155mm x T22mm
    • Jahr 2013
    • EAN 9783642402722
    • Format Kartonierter Einband
    • ISBN 3642402720
    • Veröffentlichung 07.08.2013
    • Titel Space-Efficient Data Structures, Streams, and Algorithms
    • Untertitel Papers in Honor of J. Ian Munro, on the Occasion of His 66th Birthday
    • Gewicht 593g
    • Herausgeber Springer Berlin Heidelberg
    • Anzahl Seiten 392
    • Lesemotiv Verstehen
    • Genre Mathematik

Bewertungen

Schreiben Sie eine Bewertung
Nur registrierte Benutzer können Bewertungen schreiben. Bitte loggen Sie sich ein oder erstellen Sie ein Konto.
Made with ♥ in Switzerland | ©2025 Avento by Gametime AG
Gametime AG | Hohlstrasse 216 | 8004 Zürich | Schweiz | UID: CHE-112.967.470
Kundenservice: customerservice@avento.shop | Tel: +41 44 248 38 38