Description |
1 online resource (xxxviii, 363 pages) : illustrations, portrait |
Series |
Lecture notes in computer science, 0302-9743 ; 8066 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 8066.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
Contents |
The Query Complexity of Finding a Hidden Permutation / Peyman Afshani, Manindra Agrawal -- Bounds for Scheduling Jobs on Grid Processors / Joan Boyar, Faith Ellen -- Quake Heaps: A Simple Alternative to Fibonacci Heaps / Timothy M. Chan -- Variations on Instant Insanity / Erik D. Demaine, Martin L. Demaine -- A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query / Stephane Durocher -- Closing a Long-Standing Complexity Gap for Selection: V₃(42) = 50 / David Kirkpatrick -- Frugal Streaming for Estimating Quantiles / Qiang Ma, S. Muthukrishnan, Mark Sandler -- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures / Jérémy Barbay -- Computing (and Life) Is All about Tradeoffs / Allan Borodin -- A History of Distribution-Sensitive Data Structures / Prosenjit Bose, John Howat, Pat Morin -- A Survey on Priority Queues / Gerth Stølting Brodal -- On Generalized Comparison-Based Sorting Problems / Jean Cardinal, Samuel Fiorini -- A Survey of the Game "Lights Out!" / Rudolf Fleischer, Jiajin Yu -- Random Access to High-Order Entropy Compressed Text / Roberto Grossi -- Succinct and Implicit Data Structures for Computational Geometry / Meng He -- In Pursuit of the Dynamic Optimality Conjecture / John Iacono -- A Survey of Algorithms and Models for List Update / Shahin Kamali, Alejandro López-Ortiz -- Orthogonal Range Searching for Text Indexing / Moshe Lewenstein -- A Survey of Data Structures in the Bitprobe Model / Patrick K. Nicholson, Venkatesh Raman -- Succinct Representations of Ordinal Trees / Rajeev Raman, S. Srinivasa Rao -- Array Range Queries / Matthew Skala -- Indexes for Document Retrieval with Relevance / Wing-Kai Hon, Manish Patil, Rahul Shah |
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 |
Analysis |
computerwetenschappen |
|
computer sciences |
|
numerieke methoden |
|
numerical methods |
|
computertechnieken |
|
computer techniques |
|
wiskunde |
|
mathematics |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
gegevensstructuren |
|
data structures |
|
computergrafie |
|
computer graphics |
|
computernetwerken |
|
computer networks |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
Bibliography |
Includes bibliographical references and author index |
Notes |
Online resource; title from PDF title page (SpringerLink, viewed August 20, 2013) |
Subject |
Data structures (Computer science) -- Congresses
|
|
Algorithms
|
|
algorithms.
|
|
Data structures (Computer science)
|
Genre/Form |
proceedings (reports)
|
|
Festschriften
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Festschriften.
|
|
Actes de congrès.
|
Form |
Electronic book
|
Author |
Munro, J. Ian, honouree
|
|
Brodnik, Andrej, editor
|
ISBN |
9783642402739 |
|
3642402739 |
|