Vai al contenuto principale della pagina

Space-Efficient Data Structures, Streams, and Algorithms : Papers in Honor of J. Ian Munro, on the Occasion of His 66th Birthday / / edited by Andrej Brodnik, Alejandro Lopez-Ortiz, Venkatesh Raman, Alfredo Viola



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Space-Efficient Data Structures, Streams, and Algorithms : Papers in Honor of J. Ian Munro, on the Occasion of His 66th Birthday / / edited by Andrej Brodnik, Alejandro Lopez-Ortiz, Venkatesh Raman, Alfredo Viola Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Edizione: 1st ed. 2013.
Descrizione fisica: 1 online resource (XXVIII, 363 p. 58 illus.)
Disciplina: 005.1
Soggetto topico: Algorithms
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Computer graphics
Numerical analysis
Computer networks
Data Science
Discrete Mathematics in Computer Science
Computer Graphics
Numerical Analysis
Computer Communication Networks
Persona (resp. second.): BrodnikAndrej
Lopez-OrtizAlejandro
RamanV <1962-> (Venkatesh)
ViolaAlfredo
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di contenuto: 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.
Sommario/riassunto: 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.
Titolo autorizzato: Space-Efficient Data Structures, Streams, and Algorithms  Visualizza cluster
ISBN: 3-642-40273-9
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910484908003321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 8066