| 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 | 95 | 2012 |
| 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 | 82 | 2012 |
| 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 |
| 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 | 62 | 2014 |
| Space-efficient data-analysis queries on grids G Navarro, Y Nekrich, LMS Russo Theoretical Computer Science 482, 60-72, 2013 | 52 | 2013 |
| Top-K Color Queries for Document Retrieval M Karpinski, Y Nekrich Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 51 | 2011 |
| Sorted range reporting Y Nekrich, G Navarro Scandinavian Workshop on Algorithm Theory, 271-282, 2012 | 50 | 2012 |
| Optimal trade-off for Merkle tree traversal P Berman, M Karpinski, Y Nekrich Theoretical Computer Science 372 (1), 26-36, 2007 | 50 | 2007 |
| Efficient fully-compressed sequence representations J Barbay, F Claude, T Gagie, G Navarro, Y Nekrich Algorithmica 69 (1), 232-268, 2014 | 49 | 2014 |
| Orthogonal range searching in linear and almost-linear space Y Nekrich Computational Geometry 42 (4), 342-351, 2009 | 45 | 2009 |
| 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 | 44 | 2017 |
| Optimal dynamic sequence representations G Navarro, Y Nekrich SIAM Journal on Computing 43 (5), 1781-1806, 2014 | 36 | 2014 |
| Optimal dynamic sequence representations G Navarro, Y Nekrich Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 35 | 2013 |
| Fast construction of wavelet trees JI Munro, Y Nekrich, JS Vitter Theoretical Computer Science 638, 91-97, 2016 | 31 | 2016 |
| A data structure for multi-dimensional range reporting Y Nekrich Proceedings of the twenty-third annual symposium on Computational geometry …, 2007 | 29 | 2007 |
| Decoding of Canonical Hu man Codes with Look-Up Tables Y Nekrich Proc. Proceeding of the IEEE Data Compression Conference, 342, 2000 | 25 | 2000 |
| Searching for frequent colors in rectangles M Karpinski, Y Nekrich arXiv preprint arXiv:0805.1348, 2008 | 23 | 2008 |
| Byte-oriented decoding of canonical Huffman codes Y Nekritch 2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060 …, 2000 | 22 | 2000 |
| Space efficient dynamic orthogonal range reporting Y Nekrich Algorithmica 49 (2), 94-108, 2007 | 20 | 2007 |
| A fast algorithm for adaptive prefix coding M Karpinski, Y Nekrich Algorithmica 55 (1), 29-41, 2009 | 17 | 2009 |
Gonzalo NavarroUniversity of ChileVerified email at dcc.uchile.cl
