A faster grammar-based self-index T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi International Conference on Language and Automata Theory and Applications …, 2012 | 115 | 2012 |
Top-k Document Retrieval in Optimal Time and Linear Space G Navarro, Y Nekrich Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 104 | 2012 |
LZ77-based self-indexing with faster pattern matching T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi Latin American Symposium on Theoretical Informatics, 731-742, 2014 | 91 | 2014 |
Optimal dynamic sequence representations G Navarro, Y Nekrich SIAM Journal on Computing 43 (5), 1781-1806, 2014 | 89 | 2014 |
Alphabet partitioning for compressed rank/select and applications J Barbay, T Gagie, G Navarro, Y Nekrich International Symposium on Algorithms and Computation, 315-326, 2010 | 74 | 2010 |
Space-efficient construction of compressed indexes in deterministic linear time JI Munro, G Navarro, Y Nekrich Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 64 | 2017 |
Sorted range reporting Y Nekrich, G Navarro Algorithm Theory–SWAT 2012: 13th Scandinavian Symposium and Workshops …, 2012 | 62 | 2012 |
Efficient fully-compressed sequence representations J Barbay, F Claude, T Gagie, G Navarro, Y Nekrich Algorithmica 69 (1), 232-268, 2014 | 60 | 2014 |
Optimal trade-off for Merkle tree traversal P Berman, M Karpinski, Y Nekrich Theoretical Computer Science 372 (1), 26-36, 2007 | 60 | 2007 |
Space-efficient data-analysis queries on grids G Navarro, Y Nekrich, LMS Russo Theoretical Computer Science 482, 60-72, 2013 | 55 | 2013 |
Top-K Color Queries for Document Retrieval M Karpinski, Y Nekrich Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 54 | 2011 |
Orthogonal range searching in linear and almost-linear space Y Nekrich Computational Geometry 42 (4), 342-351, 2009 | 54 | 2009 |
Fast construction of wavelet trees JI Munro, Y Nekrich, JS Vitter Theoretical Computer Science 638, 91-97, 2016 | 50 | 2016 |
Efficient range searching for categorical and plain data Y Nekrich ACM Transactions on Database Systems (TODS) 39 (1), 1-21, 2014 | 33 | 2014 |
A data structure for multi-dimensional range reporting Y Nekrich Proceedings of the twenty-third annual symposium on Computational geometry …, 2007 | 32 | 2007 |
Compressed data structures for dynamic sequences JI Munro, Y Nekrich Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 31 | 2015 |
Time-Optimal Top- Document Retrieval G Navarro, Y Nekrich SIAM Journal on Computing 46 (1), 80-113, 2017 | 26 | 2017 |
Byte-oriented decoding of canonical Huffman codes Y Nekritch 2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060 …, 2000 | 26 | 2000 |
Categorical range maxima queries M Patil, SV Thankachan, R Shah, Y Nekrich, JS Vitter Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014 | 25 | 2014 |
Decoding of Canonical Hu man Codes with Look-Up Tables Y Nekrich Proc. Proceeding of the IEEE Data Compression Conference, 342, 2000 | 25 | 2000 |