Yakov Nekrich

According to our database1, Yakov Nekrich authored at least 84 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Fast Compressed Self-indexes with Deterministic Linear-Time Construction.
Algorithmica, 2020

Better Data Structures for Colored Orthogonal Range Reporting.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On Approximate Range Mode and Range Selection.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Categorical Range Reporting with Frequencies.
Proceedings of the 22nd International Conference on Database Theory, 2019

Space-Efficient Computation of the Burrows-Wheeler Transform.
Proceedings of the Data Compression Conference, 2019

Dynamic Planar Point Location in External Memory.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Towards an Optimal Method for Dynamic Planar Point Location.
SIAM J. Comput., 2018

Succinct Dynamic One-Dimensional Point Reporting.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Orthogonal Point Location and Rectangle Stabbing Queries in 3-d.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Dynamic Trees with Almost-Optimal Access Cost.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Time-Optimal Top-k Document Retrieval.
SIAM J. Comput., 2017

Text Indexing and Searching in Sublinear Time.
CoRR, 2017

Full-Fledged Real-Time Indexing for Constant Size Alphabets.
Algorithmica, 2017

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Succinct Color Searching in One Dimension.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Orthogonal Range Searching on Discrete Grids.
Encyclopedia of Algorithms, 2016

Fast construction of wavelet trees.
Theor. Comput. Sci., 2016

Document retrieval with one wildcard.
Theor. Comput. Sci., 2016

Range Majorities and Minorities in Arrays.
CoRR, 2016

2015
Efficient and Compact Representations of Prefix Codes.
IEEE Trans. Information Theory, 2015

An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.
IEEE/ACM Trans. Comput. Biology Bioinform., 2015

Dynamic Data Structures for Document Collections and Graphs.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Compressed Data Structures for Dynamic Sequences.
Proceedings of the Algorithms - ESA 2015, 2015

Range Counting with Distinct Constraints.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

A Data-Aware FM-index.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Efficient range searching for categorical and plain data.
ACM Trans. Database Syst., 2014

Optimal Dynamic Sequence Representations.
SIAM J. Comput., 2014

Cross-document pattern matching.
J. Discrete Algorithms, 2014

Efficient Fully-Compressed Sequence Representations.
Algorithmica, 2014

Space-Efficient String Indexing for Wildcard Pattern Matching.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Categorical range maxima queries.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

LZ77-Based Self-indexing with Faster Pattern Matching.
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.
Proceedings of the Data Compression Conference, 2014

2013
Space-efficient data-analysis queries on grids.
Theor. Comput. Sci., 2013

External Memory orthogonal Range Reporting with Fast Updates.
Int. J. Comput. Geometry Appl., 2013

Optimal Top-k Document Retrieval.
CoRR, 2013

Minimal Discriminating Words Problem Revisited.
Proceedings of the String Processing and Information Retrieval, 2013

Optimal Color Range Reporting in One Dimension.
Proceedings of the Algorithms - ESA 2013, 2013

Heaviest Induced Ancestors and Longest Common Substrings.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

StemFinder: An efficient algorithm for searching motif stems over large alphabets.
Proceedings of the 2013 IEEE International Conference on Bioinformatics and Biomedicine, 2013

2012
Sorted Range Reporting.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Computing Discriminating and Generic Words.
Proceedings of the String Processing and Information Retrieval, 2012

Top-k document retrieval in optimal time and linear space.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Space-efficient range reporting for categorical data.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

A Faster Grammar-Based Self-index.
Proceedings of the Language and Automata Theory and Applications, 2012

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

2011
Tight bounds for online stable sorting.
J. Discrete Algorithms, 2011

A Compressed Self-Index for Genomic Databases
CoRR, 2011

A Fast Algorithm for Three-Dimensional Layers of Maxima Problem.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Top-K Color Queries for Document Retrieval.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Searching in Dynamic Catalogs on a Tree
CoRR, 2010

Range Reporting for Moving Points on a Grid
CoRR, 2010

Fast and Compact Prefix Codes.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Dynamic Range Reporting in External Memory.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Alphabet Partitioning for Compressed Rank/Select and Applications.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Approximating range-aggregate queries using coresets.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries.
Int. J. Comput. Geometry Appl., 2009

Alphabet Partitioning for Compressed Rank/Select with Applications
CoRR, 2009

Data Structures for Approximate Range Counting
CoRR, 2009

Orthogonal range searching in linear and almost-linear space.
Comput. Geom., 2009

A Fast Algorithm for Adaptive Prefix Coding.
Algorithmica, 2009

Worst-Case Optimal Adaptive Prefix Coding.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Data Structures for Approximate Orthogonal Range Counting.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Low-Memory Adaptive Prefix Coding.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

Space Efficient Multi-dimensional Range Reporting.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Data Structures with Local Update Operations.
Proceedings of the Algorithm Theory, 2008

I/O-Efficient Point Location in a Set of Rectangles.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Searching for Frequent Colors in Rectangles.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Optimal trade-off for Merkle tree traversal.
Theor. Comput. Sci., 2007

Space Efficient Dynamic Orthogonal Range Reporting.
Algorithmica, 2007

External Memory Range Reporting on a Grid.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

An Efficient Implementation of Adaptive Prefix Coding.
Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

A data structure for multi-dimensional range reporting.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes.
Parallel Processing Letters, 2006

2005
Optimal trade-off for merkle tree traversal.
Proceedings of the ICETE 2005, 2005

Predecessor Queries in Constant Time?.
Proceedings of the Algorithms, 2005

2004
Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes.
Parallel Processing Letters, 2004

A Note on Traversing Skew Merkle Trees
Electronic Colloquium on Computational Complexity (ECCC), 2004

2002
Parallel Construction of Minimum Redundancy Length-Limited Codes
Electronic Colloquium on Computational Complexity (ECCC), 2002

Approximating Huffman Codes in Parallel
Electronic Colloquium on Computational Complexity (ECCC), 2002

2000
Decoding of Canonical Huffman Codes with Look-Up Tables.
Proceedings of the Data Compression Conference, 2000


  Loading...