Yakov Nekrich

From MaRDI portal
Person:287450

Available identifiers

zbMath Open nekrich.yakovDBLPn/YakovNekrichWikidataQ58153724 ScholiaQ58153724MaRDI QIDQ287450

List of research outcomes





PublicationDate of PublicationType
External-memory dictionaries with worst-case update cost2024-09-11Paper
Sum-of-local-effects data structures for separable graphs2024-08-22Paper
4D range reporting in the pointer machine model in almost-optimal time2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61473252024-01-15Paper
Dynamic planar point location in optimal time2023-11-14Paper
https://portal.mardi4nfdi.de/entity/Q60654242023-11-14Paper
https://portal.mardi4nfdi.de/entity/Q60599762023-11-02Paper
Four-dimensional dominance range reporting in linear space2023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q61040772023-06-05Paper
Finding a Maximum Clique in a Grounded 1-Bend String Graph2023-03-30Paper
https://portal.mardi4nfdi.de/entity/Q58744542023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58745252023-02-07Paper
On Approximate Range Mode and Range Selection2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50911192022-07-21Paper
Dynamic Planar Point Location in External Memory.2022-07-18Paper
Dynamic Trees with Almost-Optimal Access Cost2021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50027012021-07-28Paper
Range majorities and minorities in arrays2021-06-11Paper
Better Data Structures for Colored Orthogonal Range Reporting2021-02-02Paper
Succinct Color Searching in One Dimension2020-11-25Paper
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction2020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q51164812020-08-25Paper
A linear-space data structure for range-LCP queries in poly-logarithmic time2020-05-23Paper
Fast compressed self-indexes with deterministic linear-time construction2020-04-09Paper
Parallel computation of the Burrows Wheeler transform in compact space2020-02-20Paper
Orthogonal range reporting and rectangle stabbing for fat rectangles2020-01-16Paper
A Data-Aware FM-index2019-09-12Paper
Optimal Dynamic Sequence Representations2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q57434582019-05-10Paper
Towards an Optimal Method for Dynamic Planar Point Location2018-12-19Paper
A linear-space data structure for range-LCP queries in poly-logarithmic time2018-10-04Paper
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time2018-07-16Paper
Space efficient dynamic orthogonal range reporting2017-10-20Paper
Full-fledged real-time indexing for constant size alphabets2017-10-10Paper
https://portal.mardi4nfdi.de/entity/Q53650512017-09-29Paper
Efficient and Compact Representations of Prefix Codes2017-04-28Paper
Space-Efficient String Indexing for Wildcard Pattern Matching.2017-03-03Paper
Time-Optimal Top-$k$ Document Retrieval2017-02-15Paper
Fast construction of wavelet trees2016-06-16Paper
Document retrieval with one wildcard2016-05-26Paper
EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES2015-12-22Paper
Compressed Data Structures for Dynamic Sequences2015-11-19Paper
Efficient range searching for categorical and plain data2015-09-03Paper
Optimal Dynamic Sequence Representations2015-02-09Paper
Efficient fully-compressed sequence representations2014-11-19Paper
Document Retrieval with One Wildcard2014-10-14Paper
Cross-document pattern matching2014-08-13Paper
LZ77-Based Self-indexing with Faster Pattern Matching2014-03-31Paper
Space-efficient data-analysis queries on grids2014-01-09Paper
Minimal Discriminating Words Problem Revisited2013-10-29Paper
Optimal Color Range Reporting in One Dimension2013-09-17Paper
Full-fledged real-time indexing for constant size alphabets2013-08-06Paper
Computing Discriminating and Generic Words2013-04-08Paper
Sorted Range Reporting2012-08-14Paper
Cross-Document Pattern Matching2012-08-14Paper
A Faster Grammar-Based Self-index2012-06-08Paper
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time2011-12-16Paper
External Memory Orthogonal Range Reporting with Fast Updates2011-12-16Paper
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem2011-08-12Paper
Tight bounds for online stable sorting2011-07-29Paper
Alphabet Partitioning for Compressed Rank/Select and Applications2010-12-09Paper
Dynamic Range Reporting in External Memory2010-12-09Paper
Fast and Compact Prefix Codes2010-01-28Paper
Data Structures for Approximate Orthogonal Range Counting2009-12-17Paper
Worst-Case Optimal Adaptive Prefix Coding2009-10-20Paper
A fast algorithm for adaptive prefix coding2009-07-24Paper
Space Efficient Multi-dimensional Range Reporting2009-07-23Paper
A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES2009-05-19Paper
Orthogonal range searching in linear and almost-linear space2009-03-09Paper
Orthogonal Range Searching in Linear and Almost-Linear Space2009-02-17Paper
A data structure for multi-dimensional range reporting2009-02-12Paper
Data Structures with Local Update Operations2008-07-15Paper
External Memory Range Reporting on a Grid2008-05-27Paper
I/O-Efficient Point Location in a Set of Rectangles2008-04-15Paper
Approximating Huffman codes in parallel2008-01-11Paper
Space efficient dynamic orthogonal range reporting2007-11-28Paper
Optimal trade-off for Merkle tree traversal2007-03-15Paper
Algorithms – ESA 20052006-06-27Paper
https://portal.mardi4nfdi.de/entity/Q47372132004-08-11Paper

Research outcomes over time

This page was built for person: Yakov Nekrich