default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID66. Birthday: J. Ian Munro 2013
- Andrej Brodnik
, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola:
Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. Lecture Notes in Computer Science 8066, Springer 2013, ISBN 978-3-642-40272-2 - Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of Finding a Hidden Permutation. 1-11 - Joan Boyar, Faith Ellen:
Bounds for Scheduling Jobs on Grid Processors. 12-26 - Timothy M. Chan:
Quake Heaps: A Simple Alternative to Fibonacci Heaps. 27-32 - Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara:
Variations on Instant Insanity. 33-47 - Stephane Durocher:
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query. 48-60 - David G. Kirkpatrick:
Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50. 61-76 - Qiang Ma, S. Muthukrishnan, Mark Sandler:
Frugal Streaming for Estimating Quantiles. 77-96 - Jérémy Barbay:
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures. 97-111 - Allan Borodin:
Computing (and Life) Is All about Tradeoffs - A Small Sample of Some Computational Tradeoffs. 112-132 - Prosenjit Bose, John Howat, Pat Morin:
A History of Distribution-Sensitive Data Structures. 133-149 - Gerth Stølting Brodal:
A Survey on Priority Queues. 150-163 - Jean Cardinal, Samuel Fiorini:
On Generalized Comparison-Based Sorting Problems. 164-175 - Rudolf Fleischer, Jiajin Yu:
A Survey of the Game "Lights Out!". 176-198 - Roberto Grossi:
Random Access to High-Order Entropy Compressed Text. 199-215 - Meng He:
Succinct and Implicit Data Structures for Computational Geometry. 216-235 - John Iacono:
In Pursuit of the Dynamic Optimality Conjecture. 236-250 - Shahin Kamali, Alejandro López-Ortiz:
A Survey of Algorithms and Models for List Update. 251-266 - Moshe Lewenstein:
Orthogonal Range Searching for Text Indexing. 267-302 - Patrick K. Nicholson, Venkatesh Raman, S. Srinivasa Rao:
A Survey of Data Structures in the Bitprobe Model. 303-318 - Rajeev Raman, S. Srinivasa Rao:
Succinct Representations of Ordinal Trees. 319-332 - Matthew Skala:
Array Range Queries. 333-350 - Wing-Kai Hon, Manish Patil, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
Indexes for Document Retrieval with Relevance. 351-362
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
