| 2009 |
|---|
| 29 | EE | Yakov Nekrich:
Orthogonal range searching in linear and almost-linear space.
Comput. Geom. 42(4): 342-351 (2009) |
| 28 | EE | Yakov Nekrich:
A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries.
Int. J. Comput. Geometry Appl. 19(1): 1-15 (2009) |
| 2008 |
|---|
| 27 | | Marek Karpinski,
Yakov Nekrich:
Searching for Frequent Colors in Rectangles.
CCCG 2008 |
| 26 | EE | Yakov Nekrich:
I/O-Efficient Point Location in a Set of Rectangles.
LATIN 2008: 687-698 |
| 25 | EE | Yakov Nekrich:
Data Structures with Local Update Operations.
SWAT 2008: 138-147 |
| 24 | EE | Marek Karpinski,
Yakov Nekrich:
Searching for Frequent Colors in Rectangles
CoRR abs/0805.1348: (2008) |
| 23 | EE | Marek Karpinski,
Yakov Nekrich:
Space-Efficient Multi-Dimensional Range Reporting
CoRR abs/0806.4361: (2008) |
| 22 | EE | Travis Gagie,
Marek Karpinski,
Yakov Nekrich:
Low-Memory Adaptive Prefix Coding
CoRR abs/0811.3602: (2008) |
| 21 | EE | Travis Gagie,
Yakov Nekrich:
Worst-Case Optimal Adaptive Prefix Coding
CoRR abs/0812.3306: (2008) |
| 2007 |
|---|
| 20 | EE | Yakov Nekrich:
An Efficient Implementation of Adaptive Prefix Coding.
DCC 2007: 396 |
| 19 | EE | Yakov Nekrich:
External Memory Range Reporting on a Grid.
ISAAC 2007: 525-535 |
| 18 | EE | Yakov Nekrich:
A data structure for multi-dimensional range reporting.
Symposium on Computational Geometry 2007: 344-353 |
| 17 | EE | Yakov Nekrich:
Orthogonal Range Searching in Linear and Almost-Linear Space.
WADS 2007: 15-26 |
| 16 | EE | Yakov Nekrich:
Space Efficient Dynamic Orthogonal Range Reporting.
Algorithmica 49(2): 94-108 (2007) |
| 15 | EE | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Approximating Huffman codes in parallel.
J. Discrete Algorithms 5(3): 479-490 (2007) |
| 14 | EE | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Optimal trade-off for Merkle tree traversal.
Theor. Comput. Sci. 372(1): 26-36 (2007) |
| 2006 |
|---|
| 13 | EE | Yakov Nekrich:
A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries.
CCCG 2006 |
| 12 | EE | Marek Karpinski,
Yakov Nekrich:
Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes.
Parallel Processing Letters 16(1): 81-92 (2006) |
| 2005 |
|---|
| 11 | EE | Marek Karpinski,
Yakov Nekrich:
Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes.
DCC 2005: 464 |
| 10 | EE | Marek Karpinski,
Yakov Nekrich:
Predecessor Queries in Constant Time?.
ESA 2005: 238-248 |
| 9 | | Marek Karpinski,
Yakov Nekrich:
Optimal trade-off for merkle tree traversal.
ICETE 2005: 275-282 |
| 8 | EE | Yakov Nekrich:
Space efficient dynamic orthogonal range reporting.
Symposium on Computational Geometry 2005: 306-313 |
| 2004 |
|---|
| 7 | EE | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Optimal Trade-Off for Merkle Tree Traversal
Electronic Colloquium on Computational Complexity (ECCC)(049): (2004) |
| 6 | EE | Marek Karpinski,
Yakov Nekrich:
A Note on Traversing Skew Merkle Trees
Electronic Colloquium on Computational Complexity (ECCC)(118): (2004) |
| 5 | EE | 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) |
| 2002 |
|---|
| 4 | EE | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Approximating Huffman Codes in Parallel.
ICALP 2002: 845-855 |
| 3 | EE | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Approximating Huffman Codes in Parallel
Electronic Colloquium on Computational Complexity (ECCC)(018): (2002) |
| 2 | EE | Marek Karpinski,
Yakov Nekrich:
Parallel Construction of Minimum Redundancy Length-Limited Codes
Electronic Colloquium on Computational Complexity (ECCC)(029): (2002) |
| 2000 |
|---|
| 1 | EE | Yakov Nekrich:
Decoding of Canonical Huffman Codes with Look-Up Tables.
Data Compression Conference 2000: 566 |
