Yakov Nekrich
Yakov Nekrich
University of Waterloo
Dirección de correo verificada de uwaterloo.ca - Página principal
TítuloCitado porAño
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
882012
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
742012
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
712010
Optimal dynamic sequence representations
G Navarro, Y Nekrich
SIAM Journal on Computing 43 (5), 1781-1806, 2014
612014
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
492014
Space-efficient data-analysis queries on grids
G Navarro, Y Nekrich, LMS Russo
Theoretical Computer Science 482, 60-72, 2013
482013
Efficient fully-compressed sequence representations
J Barbay, F Claude, T Gagie, G Navarro, Y Nekrich
Algorithmica 69 (1), 232-268, 2014
452014
Top-k color queries for document retrieval
M Karpinski, Y Nekrich
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
452011
Orthogonal range searching in linear and almost-linear space
Y Nekrich
Computational Geometry 42 (4), 342-351, 2009
422009
Sorted range reporting
Y Nekrich, G Navarro
Scandinavian Workshop on Algorithm Theory, 271-282, 2012
412012
Optimal trade-off for Merkle tree traversal
P Berman, M Karpinski, Y Nekrich
Theoretical Computer Science 372 (1), 26-36, 2007
402007
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
262017
Decoding of Canonical Hu man Codes with Look-Up Tables
Y Nekrich
Proc. Proceeding of the IEEE Data Compression Conference, 342, 2000
252000
Searching for frequent colors in rectangles
M Karpinski, Y Nekrich
arXiv preprint arXiv:0805.1348, 2008
202008
A data structure for multi-dimensional range reporting
Y Nekrich
Proceedings of the twenty-third annual symposium on Computational geometry …, 2007
202007
Fast construction of wavelet trees
JI Munro, Y Nekrich, JS Vitter
Theoretical Computer Science 638, 91-97, 2016
192016
Byte-oriented decoding of canonical Huffman codes
Y Nekritch
Information Theory, 2000. Proceedings. IEEE International Symposium on, 371, 2000
192000
A fast algorithm for adaptive prefix coding
M Karpinski, Y Nekrich
Algorithmica 55 (1), 29-41, 2009
172009
Space efficient dynamic orthogonal range reporting
Y Nekrich
Algorithmica 49 (2), 94-108, 2007
172007
Dynamic data structures for document collections and graphs
I Munro, Y Nekrich, JS Vitter
Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2015
132015
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20