| Publication | Date of Publication | Type |
|---|
| Funnelselect: Cache-oblivious multiple selection | 2025-01-06 | Paper |
| Priority queues with decreasing keys | 2024-05-16 | Paper |
| Soft sequence heaps | 2024-05-14 | Paper |
| External memory fully persistent search trees | 2024-05-08 | Paper |
| Priority queues with decreasing keys | 2024-05-02 | Paper |
| Space-efficient functional offline-partially-persistent trees with applications to planar point location | 2024-01-16 | Paper |
| Fast meldable priority queues | 2022-12-16 | Paper |
| The randomized complexity of maintaining the minimum | 2022-12-09 | Paper |
| Priority queues on parallel machines | 2022-12-09 | Paper |
| Worst-case efficient external-memory priority queues | 2022-12-09 | Paper |
| Comparator networks for binary heap construction | 2022-12-09 | Paper |
| Predecessor queries in dynamic integer sets | 2022-11-09 | Paper |
| Cache Oblivious Algorithms for Computing the Triplet Distance between Trees | 2022-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5071021 | 2022-04-19 | Paper |
| Fully persistent B-trees | 2020-09-17 | Paper |
| Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees | 2020-05-27 | Paper |
| A simple greedy algorithm for dynamic graph orientation | 2020-04-09 | Paper |
| On the Scalability of Computing Triplet and Quartet Distances | 2019-09-12 | Paper |
| Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743424 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643837 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643861 | 2018-05-29 | Paper |
| External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. | 2018-01-24 | Paper |
| Cache-oblivious planar orthogonal range searching and counting | 2017-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365050 | 2017-09-29 | Paper |
| On the adaptiveness of Quicksort | 2017-06-15 | Paper |
| Two dimensional range minimum queries and Fibonacci lattices | 2016-06-16 | Paper |
| Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time | 2015-10-30 | Paper |
| \(D^2\)-tree: a new overlay with deterministic bounds | 2015-09-02 | Paper |
| \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm | 2015-05-12 | Paper |
| Expected Linear Time Sorting for Word Size Ω(log2 n loglogn) | 2014-09-02 | Paper |
| Optimal Planar Orthogonal Skyline Counting Queries | 2014-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417721 | 2014-05-22 | Paper |
| Strict fibonacci heaps | 2014-05-13 | Paper |
| Integer representations towards efficient counting in the bit probe model | 2014-04-28 | Paper |
| Dynamic 3-sided planar range queries with expected doubly-logarithmic time | 2014-03-13 | Paper |
| An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters | 2013-09-17 | Paper |
| The Encoding Complexity of Two Dimensional Range Minimum Data Structures | 2013-09-17 | Paper |
| A Survey on Priority Queues | 2013-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2847380 | 2013-09-09 | Paper |
| Finger Search in the Implicit Model | 2013-03-21 | 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 |
| https://portal.mardi4nfdi.de/entity/Q2904754 | 2012-08-23 | Paper |
| OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm | 2012-07-16 | Paper |
| External memory planar point location with logarithmic updates | 2012-04-26 | Paper |
| Faster algorithms for computing longest common increasing subsequences | 2012-01-04 | Paper |
| The cost of cache-oblivious searching | 2011-09-20 | Paper |
| Path Minima Queries in Dynamic Weighted Trees | 2011-08-12 | Paper |
| Dynamic Planar Range Maxima Queries | 2011-07-06 | Paper |
| Integer Representations towards Efficient Counting in the Bit Probe Model | 2011-07-01 | Paper |
| Towards optimal range medians | 2011-06-07 | Paper |
| Optimal sparse matrix dense vector multiplication in the I/O-model | 2010-12-17 | Paper |
| D2-Tree: A New Overlay with Deterministic Bounds | 2010-12-09 | Paper |
| A Cache-Oblivious Implicit Dictionary with the Working Set Property | 2010-12-09 | Paper |
| On Space Efficient Two Dimensional Range Minimum Data Structures | 2010-09-06 | Paper |
| On the limits of cache-obliviousness | 2010-08-16 | Paper |
| Cache-oblivious string dictionaries | 2010-08-16 | Paper |
| Optimal finger search trees in the pointer machine | 2010-08-05 | Paper |
| Online Sorted Range Reporting | 2009-12-17 | Paper |
| Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time | 2009-12-17 | Paper |
| Data Structures for Range Median Queries | 2009-12-17 | Paper |
| Counting in the Presence of Memory Faults | 2009-12-17 | Paper |
| Fault Tolerant External Memory Algorithms | 2009-10-20 | Paper |
| The ComBack Method – Extending Hash Compaction with Backtracking | 2009-03-11 | Paper |
| External memory planar point location with logarithmic updates | 2009-02-12 | Paper |
| Selecting Sums in Arrays | 2009-01-29 | Paper |
| Optimal Resilient Dynamic Dictionaries | 2008-09-25 | Paper |
| Dynamic Matchings in Convex Bipartite Graphs | 2008-09-17 | Paper |
| A Linear Time Algorithm for the k Maximal Sums Problem | 2008-09-17 | Paper |
| Engineering a cache-oblivious sorting algorithm | 2008-06-20 | Paper |
| An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree | 2008-05-29 | Paper |
| Purely Functional Worst Case Constant Time Catenable Sorted Lists | 2008-03-11 | Paper |
| Skewed Binary Search Trees | 2008-03-11 | Paper |
| Faster Algorithms for Computing Longest Common Increasing Subsequences | 2007-09-14 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024792 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024804 | 2005-07-04 | Paper |
| Fast allocation and deallocation with an improved buddy system | 2005-04-15 | Paper |
| On external-memory MST, SSSP and multi-way planar graph separation | 2005-02-16 | 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 |
| Optimal finger search trees in the pointer machine | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046473 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737177 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737203 | 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/Q4535015 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721968 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722001 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723969 | 2001-07-08 | Paper |
| Comparator networks for binary heap construction | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4490355 | 2000-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952706 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250222 | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252266 | 1999-06-17 | Paper |
| A parallel priority queue with constant time operations | 1998-11-05 | Paper |
| Optimal purely functional priority queues | 1997-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129921 | 1997-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875168 | 1996-06-16 | Paper |
