| Publication | Date of Publication | Type |
|---|
| Modern hashing made simple | 2024-05-29 | Paper |
| Tiny pointers | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126243 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147379 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147438 | 2024-01-15 | Paper |
| On the optimal time/space tradeoff for hash tables | 2023-12-08 | Paper |
| Incremental Edge Orientation in Forests | 2023-09-20 | Paper |
| Batched predecessor and sorting with size-priced information in external memory | 2022-10-13 | Paper |
| B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys | 2021-11-25 | Paper |
| Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering | 2021-07-02 | Paper |
| Flushing Without Cascades | 2021-02-02 | Paper |
| Contention resolution without collision detection | 2021-01-19 | Paper |
| Achieving optimal backlog in multi-processor cup games | 2020-01-30 | Paper |
| Optimal Ball Recycling | 2019-10-15 | Paper |
| Dynamic Task Allocation in Asynchronous Shared Memory | 2019-06-20 | Paper |
| Cache-Adaptive Algorithms | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633925 | 2019-05-06 | Paper |
| Scaling Exponential Backoff | 2019-02-25 | Paper |
| Cost-Oblivious Storage Reallocation | 2018-11-05 | Paper |
| A New Approach to Incremental Cycle Detection and Related Problems | 2018-10-30 | Paper |
| Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses | 2018-10-11 | Paper |
| The range 1 query (R1Q) problem | 2018-08-23 | Paper |
| How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness | 2018-07-16 | Paper |
| File Maintenance: When in Doubt, Change the Layout! | 2018-07-16 | Paper |
| Cross-Referenced Dictionaries and the Limits of Write Optimization | 2018-07-16 | Paper |
| Contention resolution with log-logstar channel accesses | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282805 | 2017-07-17 | Paper |
| Performance guarantees for the TSP with a parameterized triangle inequality | 2016-06-16 | Paper |
| The I/O Complexity of Computing Prime Tables | 2016-05-03 | Paper |
| Run Generation Revisited: What Goes Up May or May Not Come Down | 2016-01-11 | Paper |
| The minimum backlog problem | 2015-10-30 | Paper |
| Reallocation problems in scheduling | 2015-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501354 | 2015-08-03 | Paper |
| The kissing problem: how to end a gathering when everyone kisses everyone else goodbye | 2015-01-21 | Paper |
| The Batched Predecessor Problem in External Memory | 2014-10-08 | Paper |
| The Range 1 Query (R1Q) Problem | 2014-09-26 | Paper |
| Mutual Exclusion with O(log^2 Log n) Amortized Work | 2014-07-30 | Paper |
| Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler | 2013-06-07 | Paper |
| The cost of cache-oblivious searching | 2011-09-20 | Paper |
| The snowblower problem | 2011-08-02 | Paper |
| Optimal cache-oblivious mesh layouts | 2011-03-30 | Paper |
| Optimal sparse matrix dense vector multiplication in the I/O-model | 2010-12-17 | Paper |
| Cache-oblivious priority queue and graph algorithm applications | 2010-08-05 | Paper |
| The Snowblower Problem | 2010-06-02 | Paper |
| Maintaining Arrays of Contiguous Objects | 2009-10-20 | Paper |
| Scheduling algorithms for procrastinators | 2009-08-28 | Paper |
| The worst page-replacement policy | 2009-08-06 | Paper |
| Optimal shape of a blob | 2008-10-14 | Paper |
| Improved bounds on sorting by length-weighted reversals | 2008-06-26 | Paper |
| Sum-of-squares heuristics for bin packing and memory allocation | 2008-06-20 | Paper |
| Communication-aware processor allocation for supercomputers: Finding point sets of small average distance | 2008-04-03 | Paper |
| Contention Resolution with Heterogeneous Job Sizes | 2008-03-11 | Paper |
| An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms | 2008-01-03 | Paper |
| The Worst Page-Replacement Policy | 2007-11-15 | Paper |
| INSERTION SORT is \(O(n \log n)\) | 2007-02-13 | Paper |
| The freeze-tag problem: How to wake up a swarm of robots | 2006-11-06 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Cache-Oblivious B-Trees | 2006-06-01 | Paper |
| Optimal Covering Tours with Turn Costs | 2006-06-01 | Paper |
| Lowest common ancestors in trees and directed acyclic graphs | 2005-12-08 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024765 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024770 | 2005-07-04 | Paper |
| A locality-preserving cache-oblivious dynamic dictionary | 2005-02-16 | Paper |
| The freeze-tag problem: How to wake up a swarm of robots | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828912 | 2004-11-29 | Paper |
| When can you fold a map? | 2004-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818871 | 2004-09-24 | Paper |
| Data structures for maintaining set partitions | 2004-08-16 | Paper |
| Analysis of Heuristics for the Freeze-Tag Problem | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044351 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737157 | 2004-08-11 | Paper |
| The level ancestor problem simplified | 2004-08-10 | Paper |
| What is the optimal shape of a city? | 2004-06-15 | Paper |
| The lazy bureaucrat scheduling problem | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411353 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411355 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411356 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778574 | 2002-11-18 | Paper |
| New algorithms for disk scheduling | 2002-08-14 | Paper |
| Testing properties of directed graphs: acyclicity and connectivity* | 2002-08-08 | Paper |
| An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines | 2002-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768390 | 2002-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768284 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754198 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721970 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508365 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840373 | 1998-08-10 | Paper |
| Efficient execution of nondeterministic parallel programs on asynchronous systems | 1998-07-27 | Paper |
| Parallel interval order recognition and construction of interval representations | 1997-02-28 | Paper |
