The following pages link to Yakov Nekrich (Q287450):
Displaying 50 items.
- Document retrieval with one wildcard (Q287451) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Tight bounds for online stable sorting (Q553955) (← links)
- Optimal trade-off for Merkle tree traversal (Q870836) (← links)
- Orthogonal range searching in linear and almost-linear space (Q1005331) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- Orthogonal range reporting and rectangle stabbing for fat rectangles (Q2285096) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- A fast algorithm for adaptive prefix coding (Q2391182) (← links)
- Full-fledged real-time indexing for constant size alphabets (Q2408918) (← links)
- Space efficient dynamic orthogonal range reporting (Q2461544) (← links)
- Approximating Huffman codes in parallel (Q2466011) (← links)
- Optimal Color Range Reporting in One Dimension (Q2849362) (← links)
- Minimal Discriminating Words Problem Revisited (Q2856588) (← links)
- A Faster Grammar-Based Self-index (Q2890196) (← links)
- Cross-Document Pattern Matching (Q2904492) (← links)
- Sorted Range Reporting (Q2904563) (← links)
- Document Retrieval with One Wildcard (Q2922639) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Space-Efficient String Indexing for Wildcard Pattern Matching. (Q2965512) (← links)
- Efficient and Compact Representations of Prefix Codes (Q2977298) (← links)
- Dynamic Range Reporting in External Memory (Q3060758) (← links)
- Alphabet Partitioning for Compressed Rank/Select and Applications (Q3060784) (← links)
- A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time (Q3104611) (← links)
- External Memory Orthogonal Range Reporting with Fast Updates (Q3104634) (← links)
- Worst-Case Optimal Adaptive Prefix Coding (Q3183465) (← links)
- Fast and Compact Prefix Codes (Q3401107) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES (Q3459358) (← links)
- Data Structures with Local Update Operations (Q3512454) (← links)
- A data structure for multi-dimensional range reporting (Q3602892) (← links)
- Orthogonal Range Searching in Linear and Almost-Linear Space (Q3603510) (← links)
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES (Q3628098) (← links)
- Data Structures for Approximate Orthogonal Range Counting (Q3652204) (← links)
- Towards an Optimal Method for Dynamic Planar Point Location (Q4562277) (← links)
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time (Q4575763) (← links)
- (Q4737213) (← links)
- Computing Discriminating and Generic Words (Q4913726) (← links)
- (Q5002701) (← links)
- Dynamic Trees with Almost-Optimal Access Cost (Q5009598) (← links)
- Dynamic Planar Point Location in External Memory. (Q5088984) (← links)
- (Q5091119) (← links)
- (Q5116481) (← links)
- Succinct Color Searching in One Dimension (Q5136249) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
