| Publication | Date of Publication | Type |
|---|
| Fragile complexity of adaptive algorithms | 2023-03-22 | Paper |
| On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? | 2023-02-03 | Paper |
| Amortization results for chromatic search trees, with an application to priority queues | 2022-12-16 | Paper |
| Binary search trees: How low can you go? | 2022-12-09 | Paper |
| Fragile complexity of comparison-based algorithms | 2022-05-11 | Paper |
| Fragile complexity of adaptive algorithms | 2022-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4956545 | 2021-09-02 | Paper |
| Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743479 | 2019-05-10 | Paper |
| On plane constrained bounded-degree spanners | 2019-04-25 | Paper |
| Handling preferences in student-project allocation | 2019-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5745388 | 2018-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643861 | 2018-05-29 | Paper |
| New and Improved Spanning Ratios for Yao Graphs | 2018-04-23 | Paper |
| Continuous Yao graphs | 2018-02-12 | Paper |
| Cache-oblivious planar orthogonal range searching and counting | 2017-10-20 | Paper |
| On the adaptiveness of Quicksort | 2017-06-15 | Paper |
| New and improved spanning ratios for Yao graphs | 2017-03-30 | Paper |
| Biased predecessor search | 2016-12-21 | Paper |
| Competitive Local Routing with Constraints | 2016-01-11 | Paper |
| Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles | 2015-11-18 | Paper |
| On the complexity of reconstructing chemical reaction networks | 2015-02-04 | Paper |
| Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts | 2014-11-18 | Paper |
| Biased predecessor search | 2014-03-31 | Paper |
| De-amortizing Binary Search Trees | 2013-08-12 | Paper |
| On plane constrained bounded-degree spanners | 2012-06-29 | Paper |
| The cost of cache-oblivious searching | 2011-09-20 | Paper |
| Optimal sparse matrix dense vector multiplication in the I/O-model | 2010-12-17 | Paper |
| On the limits of cache-obliviousness | 2010-08-16 | Paper |
| Cache-oblivious string dictionaries | 2010-08-16 | Paper |
| An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times | 2010-06-22 | Paper |
| Online Sorted Range Reporting | 2009-12-17 | Paper |
| Optimal Resilient Dynamic Dictionaries | 2008-09-25 | Paper |
| Engineering a cache-oblivious sorting algorithm | 2008-06-20 | Paper |
| Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts | 2008-06-17 | Paper |
| External String Sorting: Faster and Cache-Oblivious | 2008-03-19 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024792 | 2005-07-04 | Paper |
| Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\) | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828913 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737177 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474139 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471343 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425956 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778576 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535015 | 2002-06-12 | Paper |
| Amortization results for chromatic search trees, with an application to priority queues | 1998-08-04 | Paper |
| A generalization of binomial queues | 1997-02-28 | Paper |
| EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE | 1996-11-26 | Paper |
