Screen LibrarySpace-efficient data structures, streams, and algorithms : papers in honor of J. Ian Munro on the occasion of his 66th birthday /
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 Water...
Saved in:
| Corporate Authors: | |
|---|---|
| Group Author: | ; |
| Published: |
Springer,
|
| Publisher Address: | Heidelberg : |
| Publication Dates: | 2013. |
| Literature type: | eBook |
| Language: | English |
| Series: |
Lecture notes in computer science,
8066 LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Subjects: | |
| Online Access: |
http://dx.doi.org/10.1007/978-3-642-40273-9 |
| Summary: |
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. |
| Carrier Form: | 1 online resource (xxxviii, 363 pages) : illustrations, portrait. |
| Bibliography: | Includes bibliographical references and author index. |
| ISBN: |
9783642402739 (electronic bk.) 3642402739 (electronic bk.) |
| Index Number: | QA76 |
| CLC: | TP311.12-532 |
| Contents: |
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 Minimum Query / Closing a Long-Standing Complexity Gap for Selection: V₃(42) = 50 / Frugal Streaming for Estimating Quantiles / From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures / Computing (and Life) Is All about 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 / |