Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Yakov Nekrich
2010 – today
- 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)
[c33]
[i24]Gregory Kucherov, Yakov Nekrich: Full-fledged Real-Time Indexing for Constant Size Alphabets. CoRR abs/1302.4016 (2013)
[i23]Travis Gagie, Pawel Gawrychowski, Yakov Nekrich: Heaviest Induced Ancestors and Longest Common Substrings. CoRR abs/1305.3164 (2013)- 2012
[c32]Gregory Kucherov, Yakov Nekrich, Tatiana A. Starikovskaya: Cross-Document Pattern Matching. CPM 2012: 196-207
[c31]Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi: A Faster Grammar-Based Self-index. LATA 2012: 240-251
[c30]
[c29]Gonzalo Navarro, Yakov Nekrich: Top-k document retrieval in optimal time and linear space. SODA 2012: 1066-1077
[c28]Gregory Kucherov, Yakov Nekrich, Tatiana A. Starikovskaya: Computing Discriminating and Generic Words. SPIRE 2012: 307-317
[c27]
[i22]Gregory Kucherov, Yakov Nekrich, Tatiana A. Starikovskaya: Cross-Document Pattern Matching. CoRR abs/1202.4076 (2012)
[i21]- 2011
[j9]Travis Gagie, Yakov Nekrich: Tight bounds for online stable sorting. J. Discrete Algorithms 9(2): 176-181 (2011)
[c26]Yakov Nekrich: A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. ISAAC 2011: 170-179
[c25]
[c24]
[c23]
[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
[c22]Yakov Nekrich, Michiel H. M. Smid: Approximating range-aggregate queries using coresets. CCCG 2010: 253-256
[c21]
[c20]Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich: Alphabet Partitioning for Compressed Rank/Select and Applications. ISAAC (2) 2010: 315-326
[c19]
[i17]Marek Karpinski, J. Ian Munro, Yakov Nekrich: Range Reporting for Moving Points on a Grid. CoRR abs/1002.3511 (2010)
[i16]
[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]
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. Geometry Appl. 19(1): 1-15 (2009)
[c18]Marek Karpinski, Yakov Nekrich: Space Efficient Multi-dimensional Range Reporting. COCOON 2009: 215-224
[c17]
[c16]
[c15]
[i12]Travis Gagie, Gonzalo Navarro, Yakov Nekrich: Fast and Compact Prefix Codes. CoRR abs/0905.3107 (2009)
[i11]
[i10]
[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
[c14]
[c13]
[c12]
[i8]Marek Karpinski, Yakov Nekrich: Searching for Frequent Colors in Rectangles. CoRR abs/0805.1348 (2008)
[i7]Marek Karpinski, Yakov Nekrich: Space-Efficient Multi-Dimensional Range Reporting. CoRR abs/0806.4361 (2008)
[i6]Travis Gagie, Marek Karpinski, Yakov Nekrich: Low-Memory Adaptive Prefix Coding. CoRR abs/0811.3602 (2008)
[i5]- 2007
[j5]Yakov Nekrich: Space Efficient Dynamic Orthogonal Range Reporting. Algorithmica 49(2): 94-108 (2007)
[j4]Piotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman codes in parallel. J. Discrete Algorithms 5(3): 479-490 (2007)
[j3]Piotr Berman, Marek Karpinski, Yakov Nekrich: Optimal trade-off for Merkle tree traversal. Theor. Comput. Sci. 372(1): 26-36 (2007)
[c11]Yakov Nekrich: A data structure for multi-dimensional range reporting. Symposium on Computational Geometry 2007: 344-353
[c10]
[c9]
[c8]- 2006
[j2]Marek Karpinski, Yakov Nekrich: Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. Parallel Processing Letters 16(1): 81-92 (2006)
[c7]Yakov Nekrich: A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. CCCG 2006- 2005
[c6]Yakov Nekrich: Space efficient dynamic orthogonal range reporting. Symposium on Computational Geometry 2005: 306-313
[c5]Marek Karpinski, Yakov Nekrich: Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes. DCC 2005: 464
[c4]
[c3]- 2004
[j1]Marek Karpinski, Lawrence L. Larmore, Yakov Nekrich: Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. Parallel Processing Letters 14(1): 99-105 (2004)
[i4]Piotr Berman, Marek Karpinski, Yakov Nekrich: Optimal Trade-Off for Merkle Tree Traversal. Electronic Colloquium on Computational Complexity (ECCC)(049) (2004)
[i3]Marek Karpinski, Yakov Nekrich: A Note on Traversing Skew Merkle Trees. Electronic Colloquium on Computational Complexity (ECCC)(118) (2004)- 2002
[c2]Piotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman Codes in Parallel. ICALP 2002: 845-855
[i2]Piotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman Codes in Parallel. Electronic Colloquium on Computational Complexity (ECCC)(018) (2002)
[i1]Marek Karpinski, Yakov Nekrich: Parallel Construction of Minimum Redundancy Length-Limited Codes. Electronic Colloquium on Computational Complexity (ECCC)(029) (2002)- 2000
[c1]Yakov Nekrich: Decoding of Canonical Huffman Codes with Look-Up Tables. Data Compression Conference 2000: 566
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 00:22 CEST by the dblp team



