default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYakov Nekrich
Person information
- affiliation: Michigan Technological University, MI, USA
- affiliation (former): University of Bonn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c75]Philip Bille
, Yakov Nekrich, Solon P. Pissis:
Size-Constrained Weighted Ancestors with Applications. SWAT 2024: 14:1-14:12- 2023
- [c74]Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh:
Sum-of-Local-Effects Data Structures for Separable Graphs. COCOON (1) 2023: 195-206 - [c73]Yakov Nekrich, Saladi Rahul:
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. SODA 2023: 1862-1876 - [i50]Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh:
Sum-of-Local-Effects Data Structures for Separable Graphs. CoRR abs/2305.03240 (2023) - [i49]Philip Bille, Yakov Nekrich, Solon P. Pissis:
Size-constrained Weighted Ancestors with Applications. CoRR abs/2311.15777 (2023) - 2022
- [j28]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich:
Finding a Maximum Clique in a Grounded 1-Bend String Graph. J. Graph Algorithms Appl. 26(1): 553-575 (2022) - [j27]Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal point location and rectangle stabbing queries in 3-d. J. Comput. Geom. 13(1) (2022) - [c72]Rathish Das, John Iacono, Yakov Nekrich:
External-Memory Dictionaries with Worst-Case Update Cost. ISAAC 2022: 21:1-21:13 - [i48]Yakov Nekrich, Saladi Rahul:
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. CoRR abs/2211.03161 (2022) - [i47]Rathish Das, John Iacono, Yakov Nekrich:
External-memory dictionaries with worst-case update cost. CoRR abs/2211.06044 (2022) - 2021
- [j26]Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Range Majorities and Minorities in Arrays. Algorithmica 83(6): 1707-1733 (2021) - [c71]Yakov Nekrich:
New Data Structures for Orthogonal Range Reporting and Range Minima Queries. SODA 2021: 1191-1205 - [c70]Yakov Nekrich:
Dynamic planar point location in optimal time. STOC 2021: 1003-1014 - [i46]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich:
Finding a Maximum Clique in a Grounded 1-Bend String Graph. CoRR abs/2107.05198 (2021) - 2020
- [j25]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Fast Compressed Self-indexes with Deterministic Linear-Time Construction. Algorithmica 82(2): 316-337 (2020) - [j24]José Fuentes-Sepúlveda, Gonzalo Navarro, Yakov Nekrich:
Parallel computation of the Burrows Wheeler Transform in compact space. Theor. Comput. Sci. 812: 123-136 (2020) - [j23]Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A linear-space data structure for range-LCP queries in poly-logarithmic time. Theor. Comput. Sci. 822: 15-22 (2020) - [c69]Timothy M. Chan, Qizheng He, Yakov Nekrich:
Further Results on Colored Range Searching. SoCG 2020: 28:1-28:15 - [c68]Yakov Nekrich:
Four-Dimensional Dominance Range Reporting in Linear Space. SoCG 2020: 59:1-59:14 - [c67]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Text Indexing and Searching in Sublinear Time. CPM 2020: 24:1-24:15 - [c66]Younan Gao, Meng He, Yakov Nekrich:
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. ESA 2020: 54:1-54:18 - [c65]Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu:
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC 2020: 25:1-25:18 - [c64]Timothy M. Chan, Yakov Nekrich:
Better Data Structures for Colored Orthogonal Range Reporting. SODA 2020: 627-636 - [i45]Yakov Nekrich:
Four-Dimensional Dominance Range Reporting in Linear Space. CoRR abs/2003.06742 (2020) - [i44]Timothy M. Chan, Qizheng He, Yakov Nekrich:
Further Results on Colored Range Searching. CoRR abs/2003.11604 (2020) - [i43]Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu:
Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs. CoRR abs/2005.07644 (2020) - [i42]Younan Gao, Meng He, Yakov Nekrich:
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. CoRR abs/2006.11978 (2020) - [i41]Yakov Nekrich:
New Data Structures for Orthogonal Range Reporting and Range Minima Queries. CoRR abs/2007.11094 (2020)
2010 – 2019
- 2019
- [c63]J. Ian Munro, Yakov Nekrich:
Dynamic Planar Point Location in External Memory. SoCG 2019: 52:1-52:15 - [c62]José Fuentes-Sepúlveda, Gonzalo Navarro, Yakov Nekrich:
Space-Efficient Computation of the Burrows-Wheeler Transform. DCC 2019: 132-141 - [c61]Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan:
Categorical Range Reporting with Frequencies. ICDT 2019: 9:1-9:19 - [c60]Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund:
On Approximate Range Mode and Range Selection. ISAAC 2019: 57:1-57:14 - [c59]Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid:
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. WADS 2019: 283-295 - [i40]J. Ian Munro, Yakov Nekrich:
Dynamic Planar Point Location in External Memory. CoRR abs/1903.06601 (2019) - [i39]Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid:
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. CoRR abs/1905.02322 (2019) - [i38]Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund:
On Approximate Range Mode and Range Selection. CoRR abs/1907.08579 (2019) - 2018
- [j22]Timothy M. Chan, Yakov Nekrich:
Towards an Optimal Method for Dynamic Planar Point Location. SIAM J. Comput. 47(6): 2337-2361 (2018) - [c58]Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. COCOON 2018: 615-625 - [c57]Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. ESA 2018: 38:1-38:14 - [c56]Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. ICALP 2018: 31:1-31:14 - [c55]Hicham El-Zein, J. Ian Munro, Yakov Nekrich:
Succinct Dynamic One-Dimensional Point Reporting. SWAT 2018: 17:1-17:11 - [i37]Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. CoRR abs/1805.08602 (2018) - [i36]Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. CoRR abs/1806.10498 (2018) - 2017
- [j21]Gregory Kucherov, Yakov Nekrich:
Full-Fledged Real-Time Indexing for Constant Size Alphabets. Algorithmica 79(2): 387-400 (2017) - [j20]Gonzalo Navarro, Yakov Nekrich:
Time-Optimal Top-k Document Retrieval. SIAM J. Comput. 46(1): 80-113 (2017) - [c54]Hicham El-Zein, J. Ian Munro, Yakov Nekrich:
Succinct Color Searching in One Dimension. ISAAC 2017: 30:1-30:11 - [c53]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. ISAAC 2017: 57:1-57:12 - [c52]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. SODA 2017: 408-424 - [i35]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. CoRR abs/1707.01743 (2017) - [i34]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Text Indexing and Searching in Sublinear Time. CoRR abs/1712.07431 (2017) - 2016
- [j19]Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Document retrieval with one wildcard. Theor. Comput. Sci. 635: 94-101 (2016) - [j18]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Fast construction of wavelet trees. Theor. Comput. Sci. 638: 91-97 (2016) - [r1]Yakov Nekrich:
Orthogonal Range Searching on Discrete Grids. Encyclopedia of Algorithms 2016: 1484-1489 - [i33]Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Range Majorities and Minorities in Arrays. CoRR abs/1606.04495 (2016) - [i32]J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. CoRR abs/1607.04346 (2016) - 2015
- [j17]Qiang Yu, Hongwei Huo, Jeffrey Scott Vitter, Jun Huan, Yakov Nekrich:
An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. IEEE ACM Trans. Comput. Biol. Bioinform. 12(2): 384-397 (2015) - [j16]Travis Gagie, Gonzalo Navarro, Yakov Nekrich, Alberto Ordóñez Pereira:
Efficient and Compact Representations of Prefix Codes. IEEE Trans. Inf. Theory 61(9): 4999-5011 (2015) - [c51]Hongwei Huo, Longgang Chen, Heng Zhao, Jeffrey Scott Vitter, Yakov Nekrich, Qiang Yu:
A Data-Aware FM-index. ALENEX 2015: 10-23 - [c50]J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Range Counting with Distinct Constraints. CCCG 2015 - [c49]J. Ian Munro, Yakov Nekrich:
Compressed Data Structures for Dynamic Sequences. ESA 2015: 891-902 - [c48]Timothy M. Chan, Yakov Nekrich:
Towards an Optimal Method for Dynamic Planar Point Location. FOCS 2015: 390-409 - [c47]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Dynamic Data Structures for Document Collections and Graphs. PODS 2015: 277-289 - [i31]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Dynamic Data Structures for Document Collections and Graphs. CoRR abs/1503.05977 (2015) - [i30]J. Ian Munro, Yakov Nekrich:
Compressed Data Structures for Dynamic Sequences. CoRR abs/1507.06866 (2015) - 2014
- [j15]Jérémy Barbay, Francisco Claude, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Efficient Fully-Compressed Sequence Representations. Algorithmica 69(1): 232-268 (2014) - [j14]Tsvi Kopelowitz, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Cross-document pattern matching. J. Discrete Algorithms 24: 40-47 (2014) - [j13]Gonzalo Navarro, Yakov Nekrich:
Optimal Dynamic Sequence Representations. SIAM J. Comput. 43(5): 1781-1806 (2014) - [j12]Yakov Nekrich:
Efficient range searching for categorical and plain data. ACM Trans. Database Syst. 39(1): 9:1-9:21 (2014) - [c46]Hongwei Huo, Longgang Chen, Jeffrey Scott Vitter, Yakov Nekrich:
A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing. DCC 2014: 292-301 - [c45]Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi:
LZ77-Based Self-indexing with Faster Pattern Matching. LATIN 2014: 731-742 - [c44]Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Document Retrieval with One Wildcard. MFCS (2) 2014: 529-540 - [c43]Manish Patil, Sharma V. Thankachan, Rahul Shah, Yakov Nekrich, Jeffrey Scott Vitter:
Categorical range maxima queries. PODS 2014: 266-277 - [c42]J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter:
Fast Construction of Wavelet Trees. SPIRE 2014: 101-110 - [c41]Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter:
Space-Efficient String Indexing for Wildcard Pattern Matching. STACS 2014: 506-517 - [i29]Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter:
Space-Efficient String Indexing for Wildcard Pattern Matching. CoRR abs/1401.0625 (2014) - [i28]Travis Gagie, Gonzalo Navarro, Yakov Nekrich, Alberto Ordóñez Pereira:
Efficient and Compact Representations of Prefix Codes. CoRR abs/1410.3438 (2014) - 2013
- [j11]Yakov Nekrich:
External Memory orthogonal Range Reporting with Fast Updates. Int. J. Comput. Geom. Appl. 23(2): 141- (2013) - [j10]Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo:
Space-efficient data-analysis queries on grids. Theor. Comput. Sci. 482: 60-72 (2013) - [c40]Qiang Yu, Hongwei Huo, Jeffrey Scott Vitter, Jun Huan, Yakov Nekrich:
StemFinder: An efficient algorithm for searching motif stems over large alphabets. BIBM 2013: 473-476 - [c39]Travis Gagie, Pawel Gawrychowski, Yakov Nekrich:
Heaviest Induced Ancestors and Longest Common Substrings. CCCG 2013 - [c38]Yakov Nekrich, Jeffrey Scott Vitter:
Optimal Color Range Reporting in One Dimension. ESA 2013: 743-754 - [c37]Gregory Kucherov, Yakov Nekrich:
Full-Fledged Real-Time Indexing for Constant Size Alphabets. ICALP (1) 2013: 650-660 - [c36]Gonzalo Navarro, Yakov Nekrich:
Optimal Dynamic Sequence Representations. SODA 2013: 865-876 - [c35]Pawel Gawrychowski, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Minimal Discriminating Words Problem Revisited. SPIRE 2013: 129-140 - [i27]Gregory Kucherov, Yakov Nekrich:
Full-fledged Real-Time Indexing for Constant Size Alphabets. CoRR abs/1302.4016 (2013) - [i26]Travis Gagie, Pawel Gawrychowski, Yakov Nekrich:
Heaviest Induced Ancestors and Longest Common Substrings. CoRR abs/1305.3164 (2013) - [i25]Yakov Nekrich, Jeffrey Scott Vitter:
Optimal Color Range Reporting in One Dimension. CoRR abs/1306.5029 (2013) - [i24]Gonzalo Navarro, Yakov Nekrich:
Optimal Top-k Document Retrieval. CoRR abs/1307.6789 (2013) - 2012
- [c34]Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Cross-Document Pattern Matching. CPM 2012: 196-207 - [c33]Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi:
A Faster Grammar-Based Self-index. LATA 2012: 240-251 - [c32]Yakov Nekrich:
Space-efficient range reporting for categorical data. PODS 2012: 113-120 - [c31]Gonzalo Navarro, Yakov Nekrich:
Top-k document retrieval in optimal time and linear space. SODA 2012: 1066-1077 - [c30]Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Computing Discriminating and Generic Words. SPIRE 2012: 307-317 - [c29]Yakov Nekrich, Gonzalo Navarro:
Sorted Range Reporting. SWAT 2012: 271-282 - [i23]Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Cross-Document Pattern Matching. CoRR abs/1202.4076 (2012) - [i22]Yakov Nekrich, Gonzalo Navarro:
Sorted Range Reporting. CoRR abs/1204.4509 (2012) - [i21]Gonzalo Navarro, Yakov Nekrich:
Optimal Dynamic Sequence Representations. CoRR abs/1206.6982 (2012) - 2011
- [j9]Travis Gagie, Yakov Nekrich:
Tight bounds for online stable sorting. J. Discrete Algorithms 9(2): 176-181 (2011) - [c28]Yakov Nekrich:
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. ISAAC 2011: 170-179 - [c27]Yakov Nekrich:
External Memory Orthogonal Range Reporting with Fast Updates. ISAAC 2011: 395-404 - [c26]Marek Karpinski, Yakov Nekrich:
Top-K Color Queries for Document Retrieval. SODA 2011: 401-411 - [c25]Yakov Nekrich:
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. WADS 2011: 607-618 - [i20]Yakov Nekrich:
External Memory Orthogonal Range Reporting with Fast Updates. CoRR abs/1106.6261 (2011) - [i19]Yakov Nekrich:
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. CoRR abs/1109.3890 (2011) - [i18]Travis Gagie, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi:
A Compressed Self-Index for Genomic Databases. CoRR abs/1111.1355 (2011) - 2010
- [c24]Yakov Nekrich, Michiel H. M. Smid:
Approximating range-aggregate queries using coresets. CCCG 2010: 253-256 - [c23]Yakov Nekrich:
Dynamic Range Reporting in External Memory. ISAAC (2) 2010: 25-36 - [c22]Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Alphabet Partitioning for Compressed Rank/Select and Applications. ISAAC (2) 2010: 315-326 - [c21]Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Fast and Compact Prefix Codes. SOFSEM 2010: 419-427 - [i17]Marek Karpinski, J. Ian Munro, Yakov Nekrich:
Range Reporting for Moving Points on a Grid. CoRR abs/1002.3511 (2010) - [i16]Yakov Nekrich:
Dynamic Range Reporting in External Memory. CoRR abs/1006.4093 (2010) - [i15]Marek Karpinski, Yakov Nekrich:
Top-K Color Queries for Document Retrieval. CoRR abs/1007.1361 (2010) - [i14]Yakov Nekrich:
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. CoRR abs/1007.1593 (2010) - [i13]Yakov Nekrich:
Searching in Dynamic Catalogs on a Tree. CoRR abs/1007.3415 (2010)
2000 – 2009
- 2009
- [j8]Marek Karpinski, Yakov Nekrich:
A Fast Algorithm for Adaptive Prefix Coding. Algorithmica 55(1): 29-41 (2009) - [j7]Yakov Nekrich:
Orthogonal range searching in linear and almost-linear space. Comput. Geom. 42(4): 342-351 (2009) - [j6]Yakov Nekrich:
A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. Int. J. Comput. Geom. Appl. 19(1): 1-15 (2009) - [c20]Marek Karpinski, Yakov Nekrich:
Space Efficient Multi-dimensional Range Reporting. COCOON 2009: 215-224 - [c19]Travis Gagie, Marek Karpinski, Yakov Nekrich:
Low-Memory Adaptive Prefix Coding. DCC 2009: 13-22 - [c18]Yakov Nekrich:
Data Structures for Approximate Orthogonal Range Counting. ISAAC 2009: 183-192 - [c17]Travis Gagie, Yakov Nekrich:
Worst-Case Optimal Adaptive Prefix Coding. WADS 2009: 315-326 - [i12]Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Fast and Compact Prefix Codes. CoRR abs/0905.3107 (2009) - [i11]Yakov Nekrich:
Data Structures for Approximate Range Counting. CoRR abs/0906.2738 (2009) - [i10]Travis Gagie, Yakov Nekrich:
Tight Bounds for Online Stable Sorting. CoRR abs/0907.0741 (2009) - [i9]Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich:
Alphabet Partitioning for Compressed Rank/Select with Applications. CoRR abs/0911.4981 (2009) - 2008
- [c16]Marek Karpinski, Yakov Nekrich:
Searching for Frequent Colors in Rectangles. CCCG 2008 - [c15]Yakov Nekrich:
I/O-Efficient Point Location in a Set of Rectangles. LATIN 2008: 687-698 - [c14]Yakov Nekrich:
Data Structures with Local Update Operations. SWAT 2008: 138-147 - [i8]Marek Karpinski, Yakov Nekrich:
Searching for Frequent Colors in Rectangles. CoRR abs/0805.1348 (2008) - [i7]