| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147325 | 2024-01-15 | Paper |
| Dynamic planar point location in optimal time | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065424 | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059976 | 2023-11-02 | Paper |
| Four-dimensional dominance range reporting in linear space | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6104077 | 2023-06-05 | Paper |
| Finding a Maximum Clique in a Grounded 1-Bend String Graph | 2023-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874454 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874525 | 2023-02-07 | Paper |
| On Approximate Range Mode and Range Selection | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091119 | 2022-07-21 | Paper |
| Dynamic Planar Point Location in External Memory. | 2022-07-18 | Paper |
| Dynamic Trees with Almost-Optimal Access Cost | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002701 | 2021-07-28 | Paper |
| Range majorities and minorities in arrays | 2021-06-11 | Paper |
| Better Data Structures for Colored Orthogonal Range Reporting | 2021-02-02 | Paper |
| Succinct Color Searching in One Dimension | 2020-11-25 | Paper |
| Fast Compressed Self-Indexes with Deterministic Linear-Time Construction | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116481 | 2020-08-25 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2020-05-23 | Paper |
| Fast compressed self-indexes with deterministic linear-time construction | 2020-04-09 | Paper |
| Parallel computation of the Burrows Wheeler transform in compact space | 2020-02-20 | Paper |
| Orthogonal range reporting and rectangle stabbing for fat rectangles | 2020-01-16 | Paper |
| A Data-Aware FM-index | 2019-09-12 | Paper |
| Optimal Dynamic Sequence Representations | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743458 | 2019-05-10 | Paper |
| Towards an Optimal Method for Dynamic Planar Point Location | 2018-12-19 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2018-10-04 | Paper |
| Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time | 2018-07-16 | Paper |
| Space efficient dynamic orthogonal range reporting | 2017-10-20 | Paper |
| Full-fledged real-time indexing for constant size alphabets | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365051 | 2017-09-29 | Paper |
| Efficient and Compact Representations of Prefix Codes | 2017-04-28 | Paper |
| Space-Efficient String Indexing for Wildcard Pattern Matching. | 2017-03-03 | Paper |
| Time-Optimal Top-$k$ Document Retrieval | 2017-02-15 | Paper |
| Fast construction of wavelet trees | 2016-06-16 | Paper |
| Document retrieval with one wildcard | 2016-05-26 | Paper |
| EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES | 2015-12-22 | Paper |
| Compressed Data Structures for Dynamic Sequences | 2015-11-19 | Paper |
| Efficient range searching for categorical and plain data | 2015-09-03 | Paper |
| Optimal Dynamic Sequence Representations | 2015-02-09 | Paper |
| Efficient fully-compressed sequence representations | 2014-11-19 | Paper |
| Document Retrieval with One Wildcard | 2014-10-14 | Paper |
| Cross-document pattern matching | 2014-08-13 | Paper |
| LZ77-Based Self-indexing with Faster Pattern Matching | 2014-03-31 | Paper |
| Space-efficient data-analysis queries on grids | 2014-01-09 | Paper |
| Minimal Discriminating Words Problem Revisited | 2013-10-29 | Paper |
| Optimal Color Range Reporting in One Dimension | 2013-09-17 | Paper |
| Full-fledged real-time indexing for constant size alphabets | 2013-08-06 | Paper |
| Computing Discriminating and Generic Words | 2013-04-08 | Paper |
| Cross-Document Pattern Matching | 2012-08-14 | Paper |
| Sorted Range Reporting | 2012-08-14 | Paper |
| A Faster Grammar-Based Self-index | 2012-06-08 | Paper |
| A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time | 2011-12-16 | Paper |
| External Memory Orthogonal Range Reporting with Fast Updates | 2011-12-16 | Paper |
| A Fast Algorithm for Three-Dimensional Layers of Maxima Problem | 2011-08-12 | Paper |
| Tight bounds for online stable sorting | 2011-07-29 | Paper |
| Dynamic Range Reporting in External Memory | 2010-12-09 | Paper |
| Alphabet Partitioning for Compressed Rank/Select and Applications | 2010-12-09 | Paper |
| Fast and Compact Prefix Codes | 2010-01-28 | Paper |
| Data Structures for Approximate Orthogonal Range Counting | 2009-12-17 | Paper |
| Worst-Case Optimal Adaptive Prefix Coding | 2009-10-20 | Paper |
| A fast algorithm for adaptive prefix coding | 2009-07-24 | Paper |
| Space Efficient Multi-dimensional Range Reporting | 2009-07-23 | Paper |
| A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES | 2009-05-19 | Paper |
| Orthogonal range searching in linear and almost-linear space | 2009-03-09 | Paper |
| Orthogonal Range Searching in Linear and Almost-Linear Space | 2009-02-17 | Paper |
| A data structure for multi-dimensional range reporting | 2009-02-12 | Paper |
| Data Structures with Local Update Operations | 2008-07-15 | Paper |
| External Memory Range Reporting on a Grid | 2008-05-27 | Paper |
| I/O-Efficient Point Location in a Set of Rectangles | 2008-04-15 | Paper |
| Approximating Huffman codes in parallel | 2008-01-11 | Paper |
| Space efficient dynamic orthogonal range reporting | 2007-11-28 | Paper |
| Optimal trade-off for Merkle tree traversal | 2007-03-15 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737213 | 2004-08-11 | Paper |
