| Publication | Date of Publication | Type |
|---|
| Adaptive computation of the discrete Fréchet distance | 2023-07-28 | Paper |
| Indexed dynamic programming to boost edit distance and LCSS computation | 2023-07-28 | Paper |
| The computational complexity of Evil Hangman | 2023-02-07 | Paper |
| From Adaptive Analysis to Instance Optimality | 2022-02-04 | Paper |
| Computing the depth distribution of a set of boxes | 2021-08-27 | Paper |
| Synergistic solutions on multisets | 2020-05-25 | Paper |
| Computing coverage kernels under restricted settings | 2020-04-06 | Paper |
| Adaptive computation of the swap-insert correction distance | 2019-03-28 | Paper |
| Alternation and redundancy analysis of the intersection problem | 2018-11-05 | Paper |
| Synergistic solutions for merging and computing planar convex hulls | 2018-10-04 | Paper |
| Computing coverage kernels under restricted settings | 2018-10-04 | Paper |
| Instance-optimal geometric algorithms | 2018-08-02 | Paper |
| Depth distribution in high dimensions | 2017-10-23 | Paper |
| Optimal prefix free codes with partial sorting | 2017-10-17 | Paper |
| Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time | 2017-07-17 | Paper |
| Near-optimal online multiselection in internal and external memory | 2016-02-18 | Paper |
| Adaptive computation of the swap-insert correction distance | 2015-10-02 | Paper |
| Dynamic online multiselection in internal and external memory | 2015-02-27 | Paper |
| Succinct indexes for strings, binary relations and multi-labeled trees | 2014-12-18 | Paper |
| Efficient fully-compressed sequence representations | 2014-11-19 | Paper |
| Succinct indexes for strings, binary relations and multilabeled trees | 2014-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5171169 | 2014-07-25 | Paper |
| Maximum-weight planar boxes in \(O(n^2)\) time (and better) | 2014-04-30 | Paper |
| An experimental investigation of set intersection algorithms for text searching | 2014-04-01 | Paper |
| On compressing permutations and adaptive sorting | 2014-01-13 | Paper |
| Compact binary relation representations with rich functionality | 2013-12-13 | Paper |
| Theory and implementation of online multiselection algorithms | 2013-09-17 | Paper |
| From time to space: fast algorithms that yield small and fast data structures | 2013-09-13 | Paper |
| LRM-trees: compressed indices, adaptive sorting, and compressed permutations | 2012-11-08 | Paper |
| Succinct representation of labeled graphs | 2012-04-26 | Paper |
| Compressed representations of permutations, and applications | 2012-04-24 | Paper |
| LRM-trees: compressed indices, adaptive sorting, and compressed permutations | 2011-06-29 | Paper |
| Randomized complexity | 2011-03-09 | Paper |
| Alphabet partitioning for compressed rank/select and applications | 2010-12-09 | Paper |
| Compact rich-functional binary relation representations | 2010-04-27 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Stochastic Algorithms: Foundations and Applications | 2009-05-26 | Paper |
| Succinct Representation of Labeled Graphs | 2008-05-27 | Paper |
| Adaptive searching in succinctly encoded binary relations and tree-structured documents | 2007-12-19 | Paper |
| Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents | 2007-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828958 | 2004-11-29 | Paper |
| On the discrete Bak-Sneppen model of self-organized criticality | 2003-04-02 | Paper |
