J. Ian Munro

Kaiyu Wu

Proceedings of the Data Compression Conference, 2024

Succinct Data Structures for Path Graphs and Chordal Graphs Revisited.

[BibT_eX]

[DOI]

Kaiyu Wu

Proceedings of the Data Compression Conference, 2024

Enumeration and Succinct Encoding of AVL Trees.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Probabilistic, 2024

2023

A Compact Representation for AVL Trees.

[BibT_eX]

[DOI]

CoRR, 2023

2022

A Simple Algorithm for Optimal Search Trees with Two-way Comparisons.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

On Huang and Wong's algorithm for generalized binary split trees.

[BibT_eX]

[DOI]

Acta Informatica, 2022

Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2022

Shortest Beer Path Queries in Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

On the cost of unsuccessful searches in search trees with two-way comparisons.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Hypersuccinct Trees - New universal tree source codes for optimal compressed tree data structures.

[BibT_eX]

[DOI]

Louisa Seelbach Benkner

CoRR, 2021

Range Majorities and Minorities in Arrays.

[BibT_eX]

[DOI]

Algorithmica, 2021

Dynamic Boolean Formula Evaluation.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima.

[BibT_eX]

[DOI]

Louisa Seelbach Benkner

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Ranked document selection.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Faster algorithms for some optimization problems on collinear points.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Fast Compressed Self-indexes with Deterministic Linear-Time Construction.

[BibT_eX]

[DOI]

Algorithmica, 2020

Space-Efficient Data Structures for Lattices.

[BibT_eX]

[DOI]

Bryce Sandlund

Corwin Sinnamon

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Space Efficient Construction of Lyndon Arrays in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Text Indexing and Searching in Sublinear Time.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Dynamic Optimality Refuted - For Tournament Heaps.

[BibT_eX]

[DOI]

CoRR, 2019

Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space.

[BibT_eX]

[DOI]

CoRR, 2019

On Approximate Range Mode and Range Selection.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Categorical Range Reporting with Frequencies.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Database Theory, 2019

Dynamic Planar Point Location in External Memory.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Selection and Sorting in the "Restore" Model.

[BibT_eX]

[DOI]

Timothy M. Chan

ACM Trans. Algorithms, 2018

Dynamic Path Queries in Linear Space.

[BibT_eX]

[DOI]

Algorithmica, 2018

Succinct Dynamic One-Dimensional Point Reporting.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Time and Space Efficient Representations of Distributive Lattices.

[BibT_eX]

[DOI]

Corwin Sinnamon

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Succinct Data Structures for Chordal Graphs.

[BibT_eX]

[DOI]

Kaiyu Wu

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Dynamic Trees with Almost-Optimal Access Cost.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Improved Time and Space Bounds for Dynamic Range Mode.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Finding modes with equality comparisons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Top-k Term-Proximity in Succinct Space.

[BibT_eX]

[DOI]

Jesper Sindahl Nielsen

Rahul Shah

Sharma V. Thankachan

Algorithmica, 2017

On the Succinct Representation of Equivalence Classes.

[BibT_eX]

[DOI]

Algorithmica, 2017

Succinct Indices for Path Minimum, with Applications.

[BibT_eX]

[DOI]

Algorithmica, 2017

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Succinct Color Searching in One Dimension.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Compressed Representations of Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Fast construction of wavelet trees.

[BibT_eX]

[DOI]

Jeffrey Scott Vitter

Theor. Comput. Sci., 2016

Document retrieval with one wildcard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Dynamic range majority data structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Permuted scaled matching.

[BibT_eX]

[DOI]

Ayelet Butman

Noa Lewenstein

Theor. Comput. Sci., 2016

Data Structures for Path Queries.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Succinct Posets.

[BibT_eX]

[DOI]

Algorithmica, 2016

Succinct Data Structures ... Potential for Symbolic Computation?

[BibT_eX]

[DOI]

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Raising Permutations to Powers in Place.

[BibT_eX]

[DOI]

Matthew Robertson

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

On hardness of several string indexing problems.

[BibT_eX]

[DOI]

Kasper Green Larsen

Jesper Sindahl Nielsen

Sharma V. Thankachan

Theor. Comput. Sci., 2015

Low space data structures for geometric range mode query.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Finding median in read-only memory on integer input.

[BibT_eX]

[DOI]

Timothy M. Chan

Theor. Comput. Sci., 2015

Optimal search trees with equality tests.

[BibT_eX]

[DOI]

CoRR, 2015

Sorting and Selection with Equality Comparisons.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Dynamic Data Structures for Document Collections and Graphs.

[BibT_eX]

[DOI]

Jeffrey Scott Vitter

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

On the Succinct Representation of Unlabeled Permutations.

[BibT_eX]

[DOI]

Siwei Yang

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Optimal Search Trees with 2-Way Comparisons.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Compressed Data Structures for Dynamic Sequences.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

Range Counting with Distinct Constraints.

[BibT_eX]

[DOI]

Sharma V. Thankachan

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Less space: Indexing for queries with wildcards.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

The Hausdorff Core Problem on Simple Polygons.

[BibT_eX]

[DOI]

Alejandro Salinger

Matthew Skala

J. Comput. Geom., 2014

Space efficient data structures for dynamic orthogonal range counting.

[BibT_eX]

[DOI]

Comput. Geom., 2014

A Framework for Succinct Labeled Ordinal Trees over Large Alphabets.

[BibT_eX]

[DOI]

Algorithmica, 2014

A Uniform Paradigm to Succinctly Encode Various Families of Trees.

[BibT_eX]

[DOI]

Algorithmica, 2014

In as Few Comparisons as Possible.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Dynamic Path Counting and Reporting in Linear Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Improved Explicit Data Structures in the Bitprobe Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

Succinct Indices for Path Minimum, with Applications to Path Reporting.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

Multi-Pivot Quicksort: Theory and Experiments.

[BibT_eX]

[DOI]

Shrinu Kushagra

Aurick Qiao

Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013

Succinct encoding of arbitrary graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A novel approach for leveraging co-occurrence to improve the false positive error in signature files.

[BibT_eX]

[DOI]

Pedram Ghodsnia

Kamran Tirdad

J. Discrete Algorithms, 2013

Range majority in constant time and linear space.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Sorting under partial information (without the ellipsoid algorithm).

[BibT_eX]

[DOI]

Comb., 2013

Document Listing on Versioned Documents.

[BibT_eX]

[DOI]

Francisco Claude

Proceedings of the String Processing and Information Retrieval, 2013

Adaptive Data Structures for Permutations and Binary Relations.

[BibT_eX]

[DOI]

Francisco Claude

Proceedings of the String Processing and Information Retrieval, 2013

Succinct Data Structures for Representing Equivalence Classes.

[BibT_eX]

[DOI]

Moshe Lewenstein

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

The Distance 4-Sector of Two Points Is Unique.

[BibT_eX]

[DOI]

Robert Fraser

Akitoshi Kawamura

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers.

[BibT_eX]

[DOI]

Timothy M. Chan

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Succinct representations of permutations and functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Succinct ordinal trees based on tree covering.

[BibT_eX]

[DOI]

Srinivasa Rao Satti

ACM Trans. Algorithms, 2012

Succinct Representation of Labeled Graphs.

[BibT_eX]

[DOI]

Jérémy Barbay

Luca Castelli Aleardi

Algorithmica, 2012

Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima.

[BibT_eX]

[DOI]

Rajeev Raman

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Succinct Data Structures for Path Queries.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

The Complexity of Partial Orders.

[BibT_eX]

[DOI]

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011

Succinct representation of dynamic trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Untangled monotonic chains and adaptive range search.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Succinct indexes for strings, binary relations and multilabeled trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Dynamic Range Majority Data Structures

[BibT_eX]

[DOI]

CoRR, 2011

COCA Filters: Co-occurrence Aware Bloom Filters.

[BibT_eX]

[DOI]

Kamran Tirdad

Pedram Ghodsnia

Proceedings of the String Processing and Information Retrieval, 2011

Finding Frequent Elements in Compressed 2D Arrays and Strings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2011

Path Queries in Weighted Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Dynamic Range Selection in Linear Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

An Efficient Algorithm for Partial Order Production.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Sorting with networks of data structures.

[BibT_eX]

[DOI]

Therese Biedl

Alexander Golynski

Angèle M. Hamel

Discret. Appl. Math., 2010

Range Reporting for Moving Points on a Grid

[BibT_eX]

[DOI]

Marek Karpinski

CoRR, 2010

Integer Representation and Counting in the Bit Probe Model.

[BibT_eX]

[DOI]

M. Ziaur Rahman

Algorithmica, 2010

Succinct Representations of Dynamic Strings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Range Queries over Untangled Chains.

[BibT_eX]

[DOI]

Francisco Claude

Proceedings of the String Processing and Information Retrieval, 2010

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

On the relative dominance of paging algorithms.

[BibT_eX]

[DOI]

Reza Dorrigiv

Theor. Comput. Sci., 2009

Preface.

[BibT_eX]

[DOI]

Dorothea Wagner

ACM J. Exp. Algorithmics, 2009

An Application of Self-organizing Data Structures to Compression.

[BibT_eX]

[DOI]

Reza Dorrigiv

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.

[BibT_eX]

[DOI]

Alejandro Salinger

Matthew Skala

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Dynamic Succinct Ordered Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Reflections on Optimal and Nearly Optimal Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

2008

Succinct Encoding of Permutations: Applications to Text Indexing.

[BibT_eX]

[DOI]

Jérémy Barbay

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A Uniform Approach Towards Succinct Representation of Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

Succinct Representations of Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

List Update Algorithms for Data Compression.

[BibT_eX]

[DOI]

Reza Dorrigiv

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Lower Bounds for Succinct Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Adaptive searching in succinctly encoded binary relations and tree-structured documents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms.

[BibT_eX]

[DOI]

Lars Arge

Michael A. Bender

Bryan Holland-Minkley

SIAM J. Comput., 2007

Succinct indexes for strings, binary relations and multi-labeled trees.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

The binomial transform and the analysis of skip lists.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Preface.

[BibT_eX]

[DOI]

Kyung-Yong Chwa

Theor. Comput. Sci., 2006

Foreword.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Structure, Scoring and Purpose of Computing Competitions.

[BibT_eX]

[DOI]

Informatics Educ., 2006

Rank/select operations on large alphabets: a tool for text indexing.

[BibT_eX]

[DOI]

Alexander Golynski

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Implicit dictionaries with O(1) modifications per update and fast search.

[BibT_eX]

[DOI]

Gianni Franceschini

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Succinct representation of finite abelian groups.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture.

[BibT_eX]

[DOI]

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005

Worst case constant time priority queue.

[BibT_eX]

[DOI]

J. Syst. Softw., 2005

Representing Trees of Higher Degree.

[BibT_eX]

[DOI]

Algorithmica, 2005

Fast allocation and deallocation with an improved buddy system.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Acta Informatica, 2005

A categorization theorem on suffix arrays with applications to space efficient text indexes.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Towards Optimal Multiple Selection.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Cache-Oblivious Comparison-Based Algorithms on Multisets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

Succinct Representation of Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Response to Richard Ormerod.

[BibT_eX]

[DOI]

Ian Munro

John Mingers

J. Oper. Res. Soc., 2004

Implicit B-trees: a new data structure for the dictionary problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Deterministic SkipNet.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

Inf. Process. Lett., 2004

Succinct Data Structures.

[BibT_eX]

[DOI]

Proceedings of Computing: The Australasian Theory Symposium, 2004

Fun-Sort--or the chaos of unordered binary search.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Succinct Representations of Functions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

On universally easy classes for NP-complete problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Efficient Generation of Uniform Samples from Phylogenetic Trees.

[BibT_eX]

[DOI]

Paul E. Kearney

Derek Phillips

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Brief announcement: deterministic skipnet.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Identifying frequent items in sliding windows over on-line packet streams.

[BibT_eX]

[DOI]

Lukasz Golab

David DeHaan

Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

Succinct Representations of Permutations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

The use of multimethodology in practice - results of a survey of practitioners.

[BibT_eX]

[DOI]

Ian Munro

John Mingers

J. Oper. Res. Soc., 2002

Online Routing in Convex Subdivisions.

[BibT_eX]

[DOI]

Pat Morin

Int. J. Comput. Geom. Appl., 2002

Efficient Tree Layout in a Multilevel Memory Hierarchy

[BibT_eX]

[DOI]

CoRR, 2002

Efficient visibility queries in simple polygons.

[BibT_eX]

[DOI]

Prosenjit Bose

Anna Lubiw

Comput. Geom., 2002

Robot Localization without Depth Perception.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

Cache-oblivious priority queue and graph algorithm applications.

[BibT_eX]

[DOI]

Lars Arge

Michael A. Bender

Bryan Holland-Minkley

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Implicit B-Trees: New Results for the Dictionary Problem.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Frequency Estimation of Internet Packet Streams with Limited Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

Succinct Representation of Balanced Parentheses and Static Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

Space Efficient Suffix Trees.

[BibT_eX]

[DOI]

J. Algorithms, 2001

The Complexity of Clickomania

[BibT_eX]

[DOI]

CoRR, 2001

Representing dynamic binary trees succinctly.

[BibT_eX]

[DOI]

Adam J. Storm

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Worst case constant time priority queue.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Experiments on Adaptive Set Intersections for Text Retrieval Systems.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Adaptive set intersections, unions, and differences.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On the Competitiveness of Linear Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

Membership in Constant Time and Almost-Minimum Space.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Resizable Arrays in Optimal Time and Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Representing Trees of Higer Degree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Fast Allocation and Deallocation with an Improved Buddy System.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1997

The Diagonal Poisson Transform and its application to the analysis of a hashing scheme.

[BibT_eX]

[DOI]

Alfredo Viola

Random Struct. Algorithms, 1997

Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds.

[BibT_eX]

[DOI]

Peter Bro Miltersen

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Selection from Read-Only Memory and Sorting with Minimum Data Movement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Fast Stable In-Place Sorting with O (n) Data Moves.

[BibT_eX]

[DOI]

Algorithmica, 1996

Neighbours on a Grid.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

Efficient Suffix Trees on Secondary Storage (extended Abstract).

[BibT_eX]

[DOI]

David R. Clark

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Tables.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995

Permuting in Place.

[BibT_eX]

[DOI]

Faith E. Fich

SIAM J. Comput., 1995

The Binomial Transform and its Application to the Analysis of Skip Lists.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract).

[BibT_eX]

[DOI]

Alfredo Viola

Proceedings of the Algorithms, 1994

Membership in Constant Time and Minimum Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Maintaining Discrete Probability Distributions Optimally.

[BibT_eX]

[DOI]

Torben Hagerup

Kurt Mehlhorn

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Selecting the Median and Two Quartiles in a Set of Numbers.

[BibT_eX]

[DOI]

Walter Cunto

Manuel Rey

Softw. Pract. Exp., 1992

Sorting with Minimum Data Movement.

[BibT_eX]

[DOI]

J. Algorithms, 1992

Average Search and Update Costs in Skip Lists.

[BibT_eX]

[DOI]

BIT, 1992

Deterministic Skip Lists.

[BibT_eX]

[DOI]

Robert Sedgewick

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Selection from Read-Only Memory and Sorting with Optimum Data Movement.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991

Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm

[BibT_eX]

[DOI]

Inf. Comput., June, 1991

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time.

[BibT_eX]

[DOI]

Amos Fiat

Moni Naor

Alejandro A. Schäffer

Jeanette P. Schmidt

Alan Siegel

J. Comput. Syst. Sci., 1991

Sorting Multisets and Vectors In-Place.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1991

A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).

[BibT_eX]

[DOI]

Walter Cunto

Proceedings of the Algorithms and Data Structures, 1991

Fast Sorting In-Place Sorting with O(n) Data.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990

Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies.

[BibT_eX]

[DOI]

B. John Oommen

E. R. Hansen

Theor. Comput. Sci., 1990

Stable in Situ Sorting and Minimum Data Movement.

[BibT_eX]

[DOI]

Jeffrey S. Salowe

BIT, 1990

Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees.

[BibT_eX]

[DOI]

Joseph C. Culberson

Algorithmica, 1990

Analysis of the Expected Search Cost in Skip Lists.

[BibT_eX]

[DOI]

Proceedings of the SWAT 90, 1990

Permuting

[BibT_eX]

[DOI]

Faith E. Fich

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Last-Come-First-Served Hashing.

[BibT_eX]

[DOI]

J. Algorithms, 1989

Average case selection.

[BibT_eX]

[DOI]

Walter Cunto

J. ACM, 1989

Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations.

[BibT_eX]

[DOI]

Joseph C. Culberson

Comput. J., 1989

Sorting with Minimum Data Movement (Preliminary Draft).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

1988

An Implicit Binomial Queue with Constant Insertion Time.

[BibT_eX]

[DOI]

Svante Carlsson

Proceedings of the SWAT 88, 1988

1987

Searchability in Merging and Implicit Data Structures.

[BibT_eX]

[DOI]

BIT, 1987

Searching a Two Key Table Under a Single Key

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Variations on Visibility.

[BibT_eX]

[DOI]

Mark H. Overmars

Derick Wood

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Heaps on Heaps.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

Developing Implicit Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Techniques for Collision Resolution in Hash Tables with Open Addressing.

[BibT_eX]

Pedro Celis

Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985

The Analysis of a Fringe Heuristic for Binary Search Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1985

Efficient Uses of the Past.

[BibT_eX]

[DOI]

J. Algorithms, 1985

Proximity of a Grid.

[BibT_eX]

[DOI]

Rolf G. Karlsson

Proceedings of the STACS 85, 1985

The Nearest Neighbor Problem on Bounded Domains.

[BibT_eX]

[DOI]

Rolf G. Karlsson

Edward L. Robertson

Proceedings of the Automata, 1985

Robin Hood Hashing (Preliminary Report)

[BibT_eX]

[DOI]

Pedro Celis

Per-Åke Larson

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform.

[BibT_eX]

[DOI]

J. Algorithms, 1984

Partial Match Retrieval in Implicit Data Structures.

[BibT_eX]

[DOI]

Helmut Alt

Kurt Mehlhorn

Inf. Process. Lett., 1984

Fault Tolerance and Storage Reduction in Binary Search Trees

[BibT_eX]

[DOI]

Inf. Control., 1984

An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Direct dynamic structures for some line segment problems.

[BibT_eX]

[DOI]

Derick Wood

Comput. Vis. Graph. Image Process., 1983

A Discipline for Robustness or Storage Reduction in Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

1982

Technical Note - Reducing Space Requirements for Shortest Path Problems.

[BibT_eX]

[DOI]

Raúl J. Ramírez

Oper. Res., 1982

Database Storage Structures Research at the University of Waterloo.

[BibT_eX]

[DOI]

IEEE Database Eng. Bull., 1982

Optimum Reorganization Points for Arbitrary Database Costs.

[BibT_eX]

[DOI]

Raúl J. Ramírez

Frank Wm. Tompa

Acta Informatica, 1982

1981

Continual Pattern Replication

[BibT_eX]

[DOI]

Edward L. Robertson

Inf. Control., March, 1981

Exegesis of Self-Organizing Linear Search.

[BibT_eX]

[DOI]

SIAM J. Comput., 1981

Optimal Time Minimal Space Selection Algorithms.

[BibT_eX]

[DOI]

J. ACM, 1981

A Linear Probing Sort and its Analysis (Preliminary Draft)

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980

Selection and Sorting with Limited Storage.

[BibT_eX]

[DOI]

Mike Paterson

Theor. Comput. Sci., 1980

Determining the Mode.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

Implicit Data Structures for Fast Search and Update.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

1979

Efficient Ordering of Hash Tables.

[BibT_eX]

[DOI]

SIAM J. Comput., 1979

Implicit Data Structures (Preliminary Draft)

[BibT_eX]

[DOI]

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Toward Self-Organizing Linear Search (Preliminary Draught)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

Self-Organizing Binary Search Trees.

[BibT_eX]

[DOI]

Brian Allen

J. ACM, 1978

Time and Space Bounds for Selection Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1978

1977

Designing Overlay Structures.

[BibT_eX]

[DOI]

W. Morven Gentleman

Softw. Pract. Exp., 1977

The Analysis of an Improved Hashing Technique

[BibT_eX]

[DOI]

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

The Parallel Complexity of Arithmetic Computation.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1976

Sorting and Searching in Multisets.

[BibT_eX]

[DOI]

Philip M. Spira

SIAM J. Comput., 1976

1975

The computational complexity of algebraic and numeric problems.

[BibT_eX]

[DOI]

Allan Borodin

Elsevier computer science library 1, Elsevier, ISBN: 0444001565, 1975

1974

A O(|V|*|E|) algorithm for maximum matching of graphs.

[BibT_eX]

[DOI]

Tiko Kameda

Computing, 1974

1973

Optimal Algorithms for Parallel Polynomial Evaluation.

[BibT_eX]

[DOI]

Mike Paterson

J. Comput. Syst. Sci., 1973

In search of the fastest algorithm.

[BibT_eX]

[DOI]

Proceedings of the American Federation of Information Processing Societies: 1973 National Computer Conference, 1973

1972

Efficient Evaluation of Polynomial Forms.

[BibT_eX]

[DOI]

Allan Borodin

J. Comput. Syst. Sci., 1972

1971

Efficient Determination of the Transitive Closure of a Directed Graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1971

Evaluating Polynomials at Many Points.

[BibT_eX]

[DOI]

Allan Borodin

Inf. Process. Lett., 1971

Some Results Concerning Efficient and Optimal Algorithms

[BibT_eX]

[DOI]