Yakov Nekrich

1.3k total citations
43 papers, 233 citations indexed

About

Yakov Nekrich is a scholar working on Artificial Intelligence, Molecular Biology and Computer Vision and Pattern Recognition. According to data from OpenAlex, Yakov Nekrich has authored 43 papers receiving a total of 233 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Artificial Intelligence, 18 papers in Molecular Biology and 12 papers in Computer Vision and Pattern Recognition. Recurrent topics in Yakov Nekrich's work include Algorithms and Data Compression (33 papers), DNA and Biological Computing (15 papers) and Network Packet Processing and Optimization (11 papers). Yakov Nekrich is often cited by papers focused on Algorithms and Data Compression (33 papers), DNA and Biological Computing (15 papers) and Network Packet Processing and Optimization (11 papers). Yakov Nekrich collaborates with scholars based in United States, Canada and Germany. Yakov Nekrich's co-authors include Gonzalo Navarro, Marek Karpiński, Jeffrey Scott Vitter, J. Ian Munro, Luís M. S.​Russo, Hongwei Huo, Piotr Berman, Travis Gagie, Francisco Claude and Jérémy Barbay and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and ACM Transactions on Database Systems.

In The Last Decade

Yakov Nekrich

36 papers receiving 225 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Yakov Nekrich United States 10 169 73 71 70 49 43 233
Jyh-Jong Tsay Taiwan 8 82 0.5× 29 0.4× 105 1.5× 54 0.8× 67 1.4× 37 267
Daniel K. Blandford United States 7 127 0.8× 23 0.3× 57 0.8× 66 0.9× 90 1.8× 10 211
Kimmo Fredriksson Finland 11 235 1.4× 88 1.2× 71 1.0× 33 0.5× 18 0.4× 33 295
Alexander Golynski Canada 9 187 1.1× 55 0.8× 40 0.6× 41 0.6× 89 1.8× 14 233
Diego Arroyuelo Chile 8 113 0.7× 28 0.4× 56 0.8× 43 0.6× 58 1.2× 28 149
Tsvi Kopelowitz United States 10 119 0.7× 41 0.6× 16 0.2× 13 0.2× 117 2.4× 38 229
Dzung T. Hoang United States 8 106 0.6× 76 1.0× 100 1.4× 88 1.3× 42 0.9× 18 260
S. W. Song Brazil 7 82 0.5× 22 0.3× 37 0.5× 9 0.1× 100 2.0× 25 201
Matthias Petri Australia 11 219 1.3× 44 0.6× 82 1.2× 57 0.8× 106 2.2× 35 296
Ola Petersson Sweden 8 110 0.7× 29 0.4× 14 0.2× 15 0.2× 52 1.1× 20 157

Countries citing papers authored by Yakov Nekrich

Since Specialization
Citations

This map shows the geographic impact of Yakov Nekrich's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Yakov Nekrich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yakov Nekrich more than expected).

Fields of papers citing papers by Yakov Nekrich

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yakov Nekrich. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Yakov Nekrich. The network helps show where Yakov Nekrich may publish in the future.

Co-authorship network of co-authors of Yakov Nekrich

This figure shows the co-authorship network connecting the top 25 collaborators of Yakov Nekrich. A scholar is included among the top collaborators of Yakov Nekrich based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Yakov Nekrich. Yakov Nekrich is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ganguly, Arnab, Wing-Kai Hon, Yakov Nekrich, et al.. (2020). A linear-space data structure for range-LCP queries in poly-logarithmic time. Theoretical Computer Science. 822. 15–22. 4 indexed citations
2.
Navarro, Gonzalo, et al.. (2019). Parallel computation of the Burrows Wheeler Transform in compact space. Theoretical Computer Science. 812. 123–136. 1 indexed citations
3.
Munro, J. Ian & Yakov Nekrich. (2019). Dynamic Planar Point Location in External Memory. arXiv (Cornell University). 15. 3 indexed citations
4.
Chan, Timothy M., et al.. (2018). Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 2 indexed citations
5.
Chan, Timothy M. & Yakov Nekrich. (2018). Towards an Optimal Method for Dynamic Planar Point Location. SIAM Journal on Computing. 47(6). 2337–2361. 4 indexed citations
6.
Navarro, Gonzalo & Yakov Nekrich. (2017). Time-Optimal Top-$k$ Document Retrieval. SIAM Journal on Computing. 46(1). 80–113. 9 indexed citations
7.
Lewenstein, Moshe, J. Ian Munro, Yakov Nekrich, & Sharma V. Thankachan. (2016). Document retrieval with one wildcard. Theoretical Computer Science. 635. 94–101. 1 indexed citations
8.
Kucherov, Grégory & Yakov Nekrich. (2016). Full-Fledged Real-Time Indexing for Constant Size Alphabets. Algorithmica. 79(2). 387–400.
9.
Munro, J. Ian, Yakov Nekrich, & Jeffrey Scott Vitter. (2015). Fast construction of wavelet trees. Theoretical Computer Science. 638. 91–97. 16 indexed citations
10.
Navarro, Gonzalo & Yakov Nekrich. (2014). Optimal Dynamic Sequence Representations. SIAM Journal on Computing. 43(5). 1781–1806. 13 indexed citations
11.
Kopelowitz, Tsvi, et al.. (2013). Cross-document pattern matching. Journal of Discrete Algorithms. 24. 40–47. 5 indexed citations
12.
Huo, Hongwei, et al.. (2013). StemFinder: An efficient algorithm for searching motif stems over large alphabets. 473–476. 2 indexed citations
13.
Nekrich, Yakov. (2012). Space-efficient range reporting for categorical data. 113–120. 5 indexed citations
14.
Karpiński, Marek & Yakov Nekrich. (2011). Top-K color queries for document retrieval. arXiv (Cornell University). 401–411. 20 indexed citations
15.
Gagie, Travis & Yakov Nekrich. (2011). Tight bounds for online stable sorting. Journal of Discrete Algorithms. 9(2). 176–181.
16.
Nekrich, Yakov, et al.. (2010). Approximating Range-Aggregate Queries using Coresets. Canadian Conference on Computational Geometry. 253–256. 1 indexed citations
17.
Nekrich, Yakov. (2008). Orthogonal range searching in linear and almost-linear space. Computational Geometry. 42(4). 342–351. 15 indexed citations
18.
Nekrich, Yakov. (2007). A data structure for multi-dimensional range reporting. 344–344. 7 indexed citations
19.
Berman, Piotr, Marek Karpiński, & Yakov Nekrich. (2006). Optimal trade-off for Merkle tree traversal. Theoretical Computer Science. 372(1). 26–36. 13 indexed citations
20.
Karpiński, Marek & Yakov Nekrich. (2004). A Note on Traversing Skew Merkle Trees. Electronic colloquium on computational complexity. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026