S. Srinivasa Rao

Dagstuhl Reports, 2018

Encoding Two-Dimensional Range Top-k Queries Revisited.

[BibT_eX]

[DOI]

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

A Framework for In-place Graph Algorithms.

[BibT_eX]

[DOI]

Anish Mukherjee

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

Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds.

[BibT_eX]

[DOI]

Niranka Banerjee

Proceedings of the Computer Science - Theory and Applications, 2018

Minimum Transactions Problem.

[BibT_eX]

[DOI]

Niranka Banerjee

Varunkumar Jayapaul

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Finding modes with equality comparisons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-<i>k</i> Queries.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

On Succinct Representations of Binary Trees.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2017

Biconnectivity, st-numbering and other applications of DFS using O(n) bits.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems.

[BibT_eX]

[DOI]

CoRR, 2017

Compressed Bit vectors Based on Variable-to-Fixed Encodings.

[BibT_eX]

[DOI]

Comput. J., 2017

The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Synergistic Solutions on MultiSets.

[BibT_eX]

[DOI]

Jérémy Barbay

Carlos Ochoa

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Compressing and Indexing Structured Text.

[BibT_eX]

[DOI]

Paolo Ferragina

Encyclopedia of Algorithms, 2016

Simultaneous encodings for range and next/previous larger/smaller value queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Encoding 2D range maximum queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Two dimensional range minimum queries and Fibonacci lattices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Space efficient data structures for nearest larger neighbor.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Near-optimal online multiselection in internal and external memory.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

SBH: Super byte-aligned hybrid bitmap compression.

[BibT_eX]

[DOI]

Inf. Syst., 2016

Synergistic Sorting and Deferred Data Structures on MultiSets.

[BibT_eX]

[DOI]

Jérémy Barbay

Carlos Ochoa

CoRR, 2016

Succinct Dynamic Cardinal Trees.

[BibT_eX]

[DOI]

Diego Arroyuelo

Algorithmica, 2016

Finding Mode Using Equality Comparisons.

[BibT_eX]

[DOI]

Varunkumar Jayapaul

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits.

[BibT_eX]

[DOI]

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

SJSON: A succinct representation for JavaScript object notation documents.

[BibT_eX]

[DOI]

Edman Anjos

Junhee Lee

Proceedings of the Eleventh International Conference on Digital Information Management, 2016

2015

Random Access to Grammar-Compressed Strings and Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Compact Encodings and Indexes for the Nearest Larger Neighbor Problem.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Dynamic Online Multiselection in Internal and External Memory.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Sorting and Selection with Equality Comparisons.

[BibT_eX]

[DOI]

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

Set and array based hybrid data structure solution for Frequent Pattern Mining.

[BibT_eX]

[DOI]

Neha Dwivedi

Proceedings of the Tenth International Conference on Digital Information Management, 2015

2014

Selection from read-only memory with limited workspace.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Integer representations towards efficient counting in the bit probe model.

[BibT_eX]

[DOI]

Mark Greve

Vineet Pandey

J. Discrete Algorithms, 2014

Optimal Indexes for Sparse Bit Vectors.

[BibT_eX]

[DOI]

Algorithmica, 2014

Space Efficient Data Structures for Nearest Larger Neighbor.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Asymptotically Optimal Encodings for Range Selection.

[BibT_eX]

[DOI]

Gonzalo Navarro

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Encoding Range Minimum Queries.

[BibT_eX]

[DOI]

CoRR, 2013

Dynamic Compressed Strings with Random Access.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Encodings for Range Selection and Top-k Queries.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Theory and Implementation of Online Multiselection Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Succinct Representations of Ordinal Trees.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

A Survey of Data Structures in the Bitprobe Model.

[BibT_eX]

[DOI]

Patrick K. Nicholson

Proceedings of the Space-Efficient Data Structures, 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]

Meng He

ACM Trans. Algorithms, 2012

Competitive Online Selection in Main and External Memory

[BibT_eX]

[DOI]

CoRR, 2012

On Space Efficient Two Dimensional Range Minimum Data Structures.

[BibT_eX]

[DOI]

Algorithmica, 2012

External Memory Planar Point Location with Logarithmic Updates.

[BibT_eX]

[DOI]

Lars Arge

Algorithmica, 2012

Succinct Representations of Binary Trees for Range Minimum Queries.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Succinct indexes for strings, binary relations and multilabeled trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Encoding 2-D Range Maximum Queries

[BibT_eX]

[DOI]

CoRR, 2011

Path Minima Queries in Dynamic Weighted Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

Random Access to grammar-Compressed Strings.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Encoding 2D Range Maximum Queries.

[BibT_eX]

[DOI]

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

2010

A compact data structure for representing a dynamic multiset.

[BibT_eX]

[DOI]

Jyrki Katajainen

Inf. Process. Lett., 2010

2009

More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Secondary indexing in one dimension: beyond b-trees and bitmap indexes.

[BibT_eX]

[DOI]

Rasmus Pagh

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Universal Succinct Representations of Trees?

[BibT_eX]

[DOI]

Arash Farzan

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

2008

Tree Compression and Indexing.

[BibT_eX]

[DOI]

Paolo Ferragina

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the Redundancy of Succinct Data Structures.

[BibT_eX]

[DOI]

Alexander Golynski

Proceedings of the Algorithm Theory, 2008

Compressing Binary Decision Diagrams.

[BibT_eX]

[DOI]

Esben Rune Hansen

Peter Tiedemann

Proceedings of the ECAI 2008, 2008

2007

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Succinct indexable dictionaries with applications to encoding <i>k</i>-ary trees, prefix sums and multisets.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets

[BibT_eX]

[DOI]

CoRR, 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

On the Size of Succinct Indices.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

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

2005

Representing Trees of Higher Degree.

[BibT_eX]

[DOI]

Algorithmica, 2005

An optimal Bloom filter replacement.

[BibT_eX]

[DOI]

Anna Pagh

Rasmus Pagh

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

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

[BibT_eX]

[DOI]

Meng He

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

2004

Succinct Representation of Data Structures.

[BibT_eX]

[DOI]

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

Longest increasing subsequences in sliding windows.

[BibT_eX]

[DOI]

Michael H. Albert

Alexander Golynski

Angèle M. Hamel

Alejandro López-Ortiz

Mohammad Ali Safari

Theor. Comput. Sci., 2004

Succinct Representations of Functions.

[BibT_eX]

[DOI]

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

2003

Computing Refined Buneman Trees in Cubic Time.

[BibT_eX]

[DOI]

Rolf Fagerberg

Anna Östlin

Christian N. S. Pedersen

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

Succinct Dynamic Dictionaries and Trees.

[BibT_eX]

[DOI]

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

Succinct Representations of Permutations.

[BibT_eX]

[DOI]

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

2002

Time-space trade-offs for compressed suffix arrays.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Full-Text Indexes in External Memory.

[BibT_eX]

[DOI]

Juha Kärkkäinen

Proceedings of the Algorithms for Memory Hierarchies, 2002

2001

Space Efficient Suffix Trees.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Succinct Dynamic Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Explicit Deterministic Constructions for Membership in the Bitprobe Model.

[BibT_eX]

[DOI]

Jaikumar Radhakrishnan

Proceedings of the Algorithms, 2001

1999

Static Dictionaries Supporting Rank.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

A Simplified NP-Complete MAXSAT Problem.

[BibT_eX]

[DOI]

Bala Ravikumar