Search the dblp DataBase

Publications of Author

1. Yakov Nekrich
   Space efficient dynamic orthogonal range reporting. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2005, pp:306-313 [Conf]
   
2. Yakov Nekrich
   A data structure for multi-dimensional range reporting. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2007, pp:344-353 [Conf]
   
3. Marek Karpinski, Yakov Nekrich
   Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes. [Citation Graph (0, 0)][DBLP]
   DCC, 2005, pp:464- [Conf]
   
4. Yakov Nekrich
   Decoding of Canonical Huffman Codes with Look-Up Tables. [Citation Graph (0, 0)][DBLP]
   Data Compression Conference, 2000, pp:566- [Conf]
   
5. Yakov Nekrich
   An Efficient Implementation of Adaptive Prefix Coding. [Citation Graph (0, 0)][DBLP]
   DCC, 2007, pp:396- [Conf]
   
6. Marek Karpinski, Yakov Nekrich
   Predecessor Queries in Constant Time?. [Citation Graph (0, 0)][DBLP]
   ESA, 2005, pp:238-248 [Conf]
   
7. Piotr Berman, Marek Karpinski, Yakov Nekrich
   Approximating Huffman Codes in Parallel. [Citation Graph (0, 0)][DBLP]
   ICALP, 2002, pp:845-855 [Conf]
   
8. Marek Karpinski, Yakov Nekrich
   Optimal trade-off for merkle tree traversal. [Citation Graph (0, 0)][DBLP]
   ICETE, 2005, pp:275-282 [Conf]
   
9. Piotr Berman, Marek Karpinski, Yakov Nekrich
   Approximating Huffman Codes in Parallel [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:018, pp:- [Journal]
   
10. Marek Karpinski, Yakov Nekrich
    Parallel Construction of Minimum Redundancy Length-Limited Codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:029, pp:- [Journal]
    
11. Piotr Berman, Marek Karpinski, Yakov Nekrich
    Optimal Trade-Off for Merkle Tree Traversal [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:049, pp:- [Journal]
    
12. Marek Karpinski, Yakov Nekrich
    A Note on Traversing Skew Merkle Trees [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:118, pp:- [Journal]
    
13. Marek Karpinski, Lawrence L. Larmore, Yakov Nekrich
    Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:1, pp:99-105 [Journal]
    
14. Marek Karpinski, Yakov Nekrich
    Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2006, v:16, n:1, pp:81-92 [Journal]
    
15. Piotr Berman, Marek Karpinski, Yakov Nekrich
    Optimal trade-off for Merkle tree traversal. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:372, n:1, pp:26-36 [Journal]
    
16. Yakov Nekrich
    A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
    
17. Yakov Nekrich
    Orthogonal Range Searching in Linear and Almost-Linear Space. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:15-26 [Conf]
    
18. 
    Searching for Frequent Colors in Rectangles. [Citation Graph (, )][DBLP]
    
    
19. 
    Approximating range-aggregate queries using coresets. [Citation Graph (, )][DBLP]
    
    
20. 
    Space Efficient Multi-dimensional Range Reporting. [Citation Graph (, )][DBLP]
    
    
21. 
    Low-Memory Adaptive Prefix Coding. [Citation Graph (, )][DBLP]
    
    
22. 
    Data Structures for Approximate Orthogonal Range Counting. [Citation Graph (, )][DBLP]
    
    
23. 
    External Memory Range Reporting on a Grid. [Citation Graph (, )][DBLP]
    
    
24. 
    I/O-Efficient Point Location in a Set of Rectangles. [Citation Graph (, )][DBLP]
    
    
25. 
    Fast and Compact Prefix Codes. [Citation Graph (, )][DBLP]
    
    
26. 
    Data Structures with Local Update Operations. [Citation Graph (, )][DBLP]
    
    
27. 
    Worst-Case Optimal Adaptive Prefix Coding. [Citation Graph (, )][DBLP]
    
    
28. 
    Space Efficient Dynamic Orthogonal Range Reporting. [Citation Graph (, )][DBLP]
    
    
29. 
    A Fast Algorithm for Adaptive Prefix Coding. [Citation Graph (, )][DBLP]
    
    
30. 
    Orthogonal range searching in linear and almost-linear space. [Citation Graph (, )][DBLP]
    
    
31. 
    Searching for Frequent Colors in Rectangles [Citation Graph (, )][DBLP]
    
    
32. 
    Space-Efficient Multi-Dimensional Range Reporting [Citation Graph (, )][DBLP]
    
    
33. 
    Low-Memory Adaptive Prefix Coding [Citation Graph (, )][DBLP]
    
    
34. 
    Worst-Case Optimal Adaptive Prefix Coding [Citation Graph (, )][DBLP]
    
    
35. 
    Fast and Compact Prefix Codes [Citation Graph (, )][DBLP]
    
    
36. 
    Data Structures for Approximate Range Counting [Citation Graph (, )][DBLP]
    
    
37. 
    Tight Bounds for Online Stable Sorting [Citation Graph (, )][DBLP]
    
    
38. 
    Alphabet Partitioning for Compressed Rank/Select with Applications [Citation Graph (, )][DBLP]
    
    
39. 
    Range Reporting for Moving Points on a Grid [Citation Graph (, )][DBLP]
    
    
40. 
    Dynamic Range Reporting in External Memory [Citation Graph (, )][DBLP]
    
    
41. 
    Top-K Color Queries for Document Retrieval [Citation Graph (, )][DBLP]
    
    
42. 
    A Fast Algorithm for Three-Dimensional Layers of Maxima Problem [Citation Graph (, )][DBLP]
    
    
43. 
    Searching in Dynamic Catalogs on a Tree [Citation Graph (, )][DBLP]