| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q4643864 | 2018-05-29 | Paper |
| A compact data structure for representing a dynamic multiset | 2017-11-03 | Paper |
| Periodic boundary value problem for the graph differential equation and the matrix differential equation | 2017-09-26 | Paper |
| Encoding range minima and range top-2 queries | 2017-01-13 | Paper |
| Quasilinearization for periodic boundary value problem of graph differential equations and its associated matrix differential equations | 2016-08-17 | Paper |
| A simplified NP-complete MAXSAT problem | 2016-06-09 | Paper |
| Encoding 2D range maximum queries | 2015-12-08 | Paper |
| Succinct indexes for strings, binary relations and multi-labeled trees | 2014-12-18 | Paper |
| Optimal indexes for sparse bit vectors | 2014-11-19 | Paper |
| An optimal bloom filter replacement | 2014-10-13 | Paper |
| A categorization theorem on suffix arrays with applications to space efficient text indexes | 2014-10-13 | Paper |
| Encodings for range selection and top-\(k\) queries | 2013-09-17 | Paper |
| Theory and implementation of online multiselection algorithms | 2013-09-17 | Paper |
| A Survey of Data Structures in the Bitprobe Model | 2013-09-13 | Paper |
| Succinct representations of ordinal trees | 2013-09-13 | Paper |
| Dynamic Compressed Strings with Random Access | 2013-08-06 | Paper |
| On space efficient two dimensional range minimum data structures | 2012-12-06 | Paper |
| Two Dimensional Range Minimum Queries and Fibonacci Lattices | 2012-09-25 | Paper |
| Succinct representations of permutations and functions | 2012-08-08 | Paper |
| External memory planar point location with logarithmic updates | 2012-04-26 | 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 |
| Path minima queries in dynamic weighted trees | 2011-08-12 | Paper |
| Succinct dynamic cardinal trees with constant time operations for small alphabet | 2011-07-01 | Paper |
| Integer representations towards efficient counting in the bit probe model | 2011-07-01 | Paper |
| On space efficient two dimensional range minimum data structures | 2010-09-06 | Paper |
| Rank/select operations on large alphabets | 2010-08-16 | Paper |
| Universal Succinct Representations of Trees? | 2009-07-14 | Paper |
| External memory planar point location with logarithmic updates | 2009-02-12 | Paper |
| On the Size of Succinct Indices | 2008-09-25 | Paper |
| On the Redundancy of Succinct Data Structures | 2008-07-15 | Paper |
| Adaptive searching in succinctly encoded binary relations and tree-structured documents | 2007-12-19 | Paper |
| Succinct Ordinal Trees Based on Tree Covering | 2007-11-28 | Paper |
| Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents | 2007-09-14 | Paper |
| Representing trees of higher degree | 2006-03-21 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets | 2004-11-29 | Paper |
| Longest increasing subsequences in sliding windows | 2004-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449188 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449187 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428995 | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420327 | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796182 | 2003-03-02 | Paper |
| Time-space trade-offs for compressed suffix arrays. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778577 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511215 | 2001-02-27 | Paper |
| Space efficient suffix trees | 2001-01-01 | Paper |
