| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6098778 | 2023-06-14 | Paper |
| Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) | 2023-01-18 | Paper |
| Engineering Practical Lempel-Ziv Tries | 2022-09-06 | Paper |
| Fast and simple compact hashing via bucketing | 2022-08-18 | Paper |
| Adaptive succinctness | 2022-03-22 | Paper |
| LZ78 Compression in Low Main Memory Space | 2021-02-16 | Paper |
| Generating a Gray code for prefix normal words in amortized polylogarithmic time per word | 2020-10-12 | Paper |
| Compact Dynamic Rewritable (CDRW) Arrays | 2019-09-12 | Paper |
| m-Bonsai: A Practical Compact Dynamic Trie | 2019-06-24 | Paper |
| Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries | 2018-11-05 | Paper |
| Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643860 | 2018-05-29 | Paper |
| Priority queues: Small, monotone and trans-dichotomous | 2017-12-05 | Paper |
| Converting to and from Dilated Integers | 2017-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365049 | 2017-09-29 | Paper |
| On succinct representations of binary trees | 2017-07-17 | Paper |
| Asymptotically Optimal Encodings for Range Selection | 2017-04-25 | Paper |
| Encoding range minima and range top-2 queries | 2017-01-13 | Paper |
| Two dimensional range minimum queries and Fibonacci lattices | 2016-06-16 | Paper |
| Space efficient data structures for nearest larger neighbor | 2016-02-18 | Paper |
| Encoding 2D range maximum queries | 2015-12-08 | Paper |
| SEPIA: Search for Proofs Using Inferred Automata | 2015-12-02 | Paper |
| Succinct ordinal trees with level-ancestor queries | 2015-09-02 | Paper |
| Encoding Nearest Larger Values | 2015-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501236 | 2015-08-03 | Paper |
| Random Access to Grammar-Compressed Strings and Trees | 2015-06-11 | Paper |
| Encoding Data Structures | 2015-02-27 | Paper |
| Compact Encodings and Indexes for the Nearest Larger Neighbor Problem | 2015-02-27 | Paper |
| Optimal indexes for sparse bit vectors | 2014-11-19 | Paper |
| Range Extremum Queries | 2014-08-19 | Paper |
| Mining State-Based Models from Proof Corpora | 2014-08-07 | Paper |
| Encodings for Range Selection and Top-k Queries | 2013-09-17 | Paper |
| Succinct Representations of Ordinal Trees | 2013-09-13 | Paper |
| Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima | 2013-08-12 | Paper |
| Dynamic Compressed Strings with Random Access | 2013-08-06 | Paper |
| Two Dimensional Range Minimum Queries and Fibonacci Lattices | 2012-09-25 | Paper |
| Succinct Representations of Binary Trees for Range Minimum Queries | 2012-09-25 | Paper |
| Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism | 2012-09-13 | Paper |
| Succinct representations of permutations and functions | 2012-08-08 | Paper |
| More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries | 2012-04-24 | Paper |
| Encoding 2D range maximum queries | 2011-12-16 | Paper |
| Optimal Trade-Offs for Succinct String Indexes | 2010-09-07 | Paper |
| Universal Succinct Representations of Trees? | 2009-07-14 | Paper |
| On the Size of Succinct Indices | 2008-09-25 | Paper |
| On the Redundancy of Succinct Data Structures | 2008-07-15 | Paper |
| Compressed Prefix Sums | 2008-03-07 | Paper |
| Engineering the LOUDS Succinct Tree Representation | 2007-09-14 | Paper |
| A simple optimal representation for balanced parentheses | 2007-01-22 | Paper |
| Representing trees of higher degree | 2006-03-21 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Analysing cache effects in distribution sorting | 2005-08-04 | Paper |
| Adapting Radix Sort to the Memory Hierarchy | 2005-08-04 | Paper |
| Compact routing schemes for dynamic ring networks | 2005-01-25 | Paper |
| Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046471 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737157 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449187 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449188 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785572 | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778577 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228437 | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753954 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942229 | 2000-03-21 | Paper |
| Small-Rank Selection in Parallel, with Applications to Heap Construction | 1999-02-02 | Paper |
| Randomized Data Structures for the Dynamic Closest-Pair Problem | 1998-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128924 | 1997-08-04 | Paper |
| Fast deterministic selection on mesh-connected processor arrays | 1996-04-28 | Paper |
| A constant update time finger search tree | 1996-02-26 | Paper |
| Lower bounds for set intersection queries | 1995-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140433 | 1994-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140421 | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138942 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016520 | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3361878 | 1990-01-01 | Paper |
