Yakov Nekrich

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

2024

Size-Constrained Weighted Ancestors with Applications.

[BibT_eX]

[DOI]

Philip Bille

Solon P. Pissis

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023

4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time.

[BibT_eX]

[DOI]

Saladi Rahul

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Sum-of-Local-Effects Data Structures for Separable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Orthogonal point location and rectangle stabbing queries in 3-d.

[BibT_eX]

[DOI]

Saladi Rahul

Konstantinos Tsakalidis

J. Comput. Geom., 2022

Finding a Maximum Clique in a Grounded 1-Bend String Graph.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

External-Memory Dictionaries with Worst-Case Update Cost.

[BibT_eX]

[DOI]

Rathish Das

John Iacono

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

2021

Range Majorities and Minorities in Arrays.

[BibT_eX]

[DOI]

Algorithmica, 2021

Dynamic planar point location in optimal time.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

New Data Structures for Orthogonal Range Reporting and Range Minima Queries.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Parallel computation of the Burrows Wheeler Transform in compact space.

[BibT_eX]

[DOI]

José Fuentes-Sepúlveda

Theor. Comput. Sci., 2020

A linear-space data structure for range-LCP queries in poly-logarithmic time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Better Data Structures for Colored Orthogonal Range Reporting.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 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

Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing.

[BibT_eX]

[DOI]

Younan Gao

Meng He

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Text Indexing and Searching in Sublinear Time.

[BibT_eX]

[DOI]

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

Four-Dimensional Dominance Range Reporting in Linear Space.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Further Results on Colored Range Searching.

[BibT_eX]

[DOI]

Qizheng He

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles.

[BibT_eX]

[DOI]

Michiel H. M. Smid

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 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

Space-Efficient Computation of the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

José Fuentes-Sepúlveda

Proceedings of the Data Compression Conference, 2019

Dynamic Planar Point Location in External Memory.

[BibT_eX]

[DOI]

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

2018

Towards an Optimal Method for Dynamic Planar Point Location.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Succinct Dynamic One-Dimensional Point Reporting.

[BibT_eX]

[DOI]

Hicham El-Zein

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

Dynamic Trees with Almost-Optimal Access Cost.

[BibT_eX]

[DOI]

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

A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time.

[BibT_eX]

[DOI]

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

2017

Time-Optimal Top-k Document Retrieval.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Full-Fledged Real-Time Indexing for Constant Size Alphabets.

[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]

Hicham El-Zein

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

2016

Orthogonal Range Searching on Discrete Grids.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Fast construction of wavelet trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Document retrieval with one wildcard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

Efficient and Compact Representations of Prefix Codes.

[BibT_eX]

[DOI]

Alberto Ordóñez Pereira

IEEE Trans. Inf. Theory, 2015

An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Dynamic Data Structures for Document Collections and Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 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

A Data-Aware FM-index.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Efficient range searching for categorical and plain data.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2014

Optimal Dynamic Sequence Representations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Cross-document pattern matching.

[BibT_eX]

[DOI]

Tsvi Kopelowitz

J. Discrete Algorithms, 2014

Efficient Fully-Compressed Sequence Representations.

[BibT_eX]

[DOI]

Algorithmica, 2014

Space-Efficient String Indexing for Wildcard Pattern Matching.

[BibT_eX]

[DOI]

Moshe Lewenstein

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Categorical range maxima queries.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

LZ77-Based Self-indexing with Faster Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

2013

Space-efficient data-analysis queries on grids.

[BibT_eX]

[DOI]

Luís M. S. Russo

Theor. Comput. Sci., 2013

External Memory orthogonal Range Reporting with Fast Updates.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2013

Optimal Top-k Document Retrieval.

[BibT_eX]

[DOI]

CoRR, 2013

Minimal Discriminating Words Problem Revisited.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Proceedings of the String Processing and Information Retrieval, 2013

Optimal Color Range Reporting in One Dimension.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Heaviest Induced Ancestors and Longest Common Substrings.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

StemFinder: An efficient algorithm for searching motif stems over large alphabets.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Conference on Bioinformatics and Biomedicine, 2013

2012

Sorted Range Reporting.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Computing Discriminating and Generic Words.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

Top-<i>k</i> document retrieval in optimal time and linear space.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Space-efficient range reporting for categorical data.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

A Faster Grammar-Based Self-index.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

Cross-Document Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Tight bounds for online stable sorting.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

A Compressed Self-Index for Genomic Databases

[BibT_eX]

[DOI]

CoRR, 2011

A Fast Algorithm for Three-Dimensional Layers of Maxima Problem.

[BibT_eX]

[DOI]

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

Top-K Color Queries for Document Retrieval.

[BibT_eX]

[DOI]

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

A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.

[BibT_eX]

[DOI]

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

2010

Searching in Dynamic Catalogs on a Tree

[BibT_eX]

[DOI]

CoRR, 2010

Range Reporting for Moving Points on a Grid

[BibT_eX]

[DOI]

CoRR, 2010

Fast and Compact Prefix Codes.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Dynamic Range Reporting in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Alphabet Partitioning for Compressed Rank/Select and Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Approximating range-aggregate queries using coresets.

[BibT_eX]

[DOI]

Michiel H. M. Smid

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

Alphabet Partitioning for Compressed Rank/Select with Applications

[BibT_eX]

[DOI]

CoRR, 2009

Data Structures for Approximate Range Counting

[BibT_eX]

[DOI]

CoRR, 2009

Orthogonal range searching in linear and almost-linear space.

[BibT_eX]

[DOI]

Comput. Geom., 2009

A Fast Algorithm for Adaptive Prefix Coding.

[BibT_eX]

[DOI]

Algorithmica, 2009

Worst-Case Optimal Adaptive Prefix Coding.

[BibT_eX]

[DOI]

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

Data Structures for Approximate Orthogonal Range Counting.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Low-Memory Adaptive Prefix Coding.

[BibT_eX]

[DOI]

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

Space Efficient Multi-dimensional Range Reporting.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Data Structures with Local Update Operations.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

I/O-Efficient Point Location in a Set of Rectangles.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Searching for Frequent Colors in Rectangles.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Optimal trade-off for Merkle tree traversal.

[BibT_eX]

[DOI]

Piotr Berman

Theor. Comput. Sci., 2007

Space Efficient Dynamic Orthogonal Range Reporting.

[BibT_eX]

[DOI]

Algorithmica, 2007

External Memory Range Reporting on a Grid.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

An Efficient Implementation of Adaptive Prefix Coding.

[BibT_eX]

[DOI]

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

A data structure for multi-dimensional range reporting.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2006

2005

Optimal trade-off for merkle tree traversal.

[BibT_eX]

Proceedings of the ICETE 2005, 2005

Predecessor Queries in Constant Time?.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes.

[BibT_eX]

[DOI]

Lawrence L. Larmore

Parallel Process. Lett., 2004

A Note on Traversing Skew Merkle Trees

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

2002

Parallel Construction of Minimum Redundancy Length-Limited Codes

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2002

Approximating Huffman Codes in Parallel

[BibT_eX]

[DOI]

Piotr Berman

Electron. Colloquium Comput. Complex., 2002

2001

Huffman coding and its applications.

[BibT_eX]

[DOI]

PhD thesis, 2001

2000

Decoding of Canonical Huffman Codes with Look-Up Tables.

[BibT_eX]

[DOI]