| Publication | Date of Publication | Type |
|---|
| The cost of cache-oblivious searching | 2026-05-29 | Paper |
| Cache-oblivious B-trees | 2026-05-08 | Paper |
Contention resolution with message deadlines
Distributed Computing | 2026-01-20 | Paper |
Paging and the address-translation problem
ACM Transactions on Algorithms | 2025-11-03 | Paper |
Tiny pointers
ACM Transactions on Algorithms | 2025-11-03 | Paper |
Online list labeling: breaking the ^2n barrier
SIAM Journal on Computing | 2025-10-24 | Paper |
Jamming-resistant backoff with polylogarithmic sending and listening cost
SIAM Journal on Computing | 2025-10-21 | Paper |
| Online list labeling: breaking the ^2 n barrier | 2025-08-15 | Paper |
| Linear probing revisited: tombstones mark the demise of primary clustering | 2025-08-13 | Paper |
| Bloom filters, adaptivity, and the dictionary problem | 2025-08-12 | Paper |
| When are cache-oblivious algorithms cache adaptive? A case study of matrix multiplication and sorting | 2025-06-19 | Paper |
| Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution | 2025-06-13 | Paper |
| History-independent concurrent objects | 2025-06-13 | Paper |
| How to allocate tasks asynchronously | 2025-05-05 | Paper |
Iceberg hashing: optimizing many hash-table criteria at once
Journal of the ACM | 2025-02-05 | Paper |
| Modern hashing made simple | 2024-05-29 | Paper |
| Tiny pointers | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7829250 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7788461 (Why is no real title available?) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788518 (Why is no real title available?) | 2024-01-15 | Paper |
On the optimal time/space tradeoff for hash tables
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
On the optimal time/space tradeoff for hash tables
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Incremental Edge Orientation in Forests
(available as arXiv preprint) | 2023-09-20 | Paper |
Batched predecessor and sorting with size-priced information in external memory
(available as arXiv preprint) | 2022-10-13 | Paper |
B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys
ACM Transactions on Database Systems | 2021-11-25 | Paper |
| Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering | 2021-07-02 | Paper |
Flushing Without Cascades
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Contention resolution without collision detection
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Achieving optimal backlog in multi-processor cup games
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Optimal ball recycling
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Dynamic Task Allocation in Asynchronous Shared Memory
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Cache-adaptive algorithms
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| A new approach to incremental topological ordering | 2019-05-06 | Paper |
Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness
Journal of the ACM | 2019-02-25 | Paper |
Cost-oblivious storage reallocation
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A new approach to incremental cycle detection and related problems
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Contention resolution with constant throughput and log-logstar channel accesses
SIAM Journal on Computing | 2018-10-11 | Paper |
The range 1 query (R1Q) problem
Theoretical Computer Science | 2018-08-23 | Paper |
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
File maintenance: when in doubt, change the layout!
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Cross-referenced dictionaries and the limits of write optimization
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Contention resolution with log-logstar channel accesses
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Resource optimization for program committee members: a subreview article | 2017-07-17 | Paper |
Performance guarantees for the TSP with a parameterized triangle inequality
Information Processing Letters | 2016-06-16 | Paper |
The I/O complexity of computing prime tables
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Run generation revisited: what goes up may or may not come down
Algorithms and Computation | 2016-01-11 | Paper |
The minimum backlog problem
Theoretical Computer Science | 2015-10-30 | Paper |
Reallocation problems in scheduling
Algorithmica | 2015-10-19 | Paper |
| Improved bounds on sorting with length-weighted reversals | 2015-08-03 | Paper |
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
Theory of Computing Systems | 2015-01-21 | Paper |
The batched predecessor problem in external memory
Algorithms - ESA 2014 | 2014-10-08 | Paper |
The Range 1 Query (R1Q) Problem
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Mutual Exclusion with O(log^2 Log n) Amortized Work
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
Distributed Computing | 2013-06-07 | Paper |
The cost of cache-oblivious searching
Algorithmica | 2011-09-20 | Paper |
The snowblower problem
Computational Geometry | 2011-08-02 | Paper |
Optimal cache-oblivious mesh layouts
Theory of Computing Systems | 2011-03-30 | Paper |
Optimal sparse matrix dense vector multiplication in the I/O-model
Theory of Computing Systems | 2010-12-17 | Paper |
Cache-oblivious priority queue and graph algorithm applications
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
The snowblower problem
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
Maintaining Arrays of Contiguous Objects
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Scheduling algorithms for procrastinators
Journal of Scheduling | 2009-08-28 | Paper |
The worst page-replacement policy
Theory of Computing Systems | 2009-08-06 | Paper |
Optimal shape of a blob
Journal of Mathematical Physics | 2008-10-14 | Paper |
Improved bounds on sorting by length-weighted reversals
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Sum-of-squares heuristics for bin packing and memory allocation
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Communication-aware processor allocation for supercomputers: Finding point sets of small average distance
Algorithmica | 2008-04-03 | Paper |
Contention Resolution with Heterogeneous Job Sizes
Lecture Notes in Computer Science | 2008-03-11 | Paper |
An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
SIAM Journal on Computing | 2008-01-03 | Paper |
The Worst Page-Replacement Policy
Lecture Notes in Computer Science | 2007-11-15 | Paper |
INSERTION SORT is O(n n)
Theory of Computing Systems | 2007-02-13 | Paper |
The freeze-tag problem: How to wake up a swarm of robots
Algorithmica | 2006-11-06 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Optimal Covering Tours with Turn Costs
SIAM Journal on Computing | 2006-06-01 | Paper |
Cache-Oblivious B-Trees
SIAM Journal on Computing | 2006-06-01 | Paper |
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms | 2005-12-08 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
| scientific article; zbMATH DE number 2185604 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2185608 (Why is no real title available?) | 2005-07-04 | Paper |
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms | 2005-02-16 | Paper |
| scientific article; zbMATH DE number 2119641 (Why is no real title available?) | 2004-11-29 | Paper |
| The freeze-tag problem: how to wake up a swarm of robots | 2004-11-29 | Paper |
When can you fold a map?
Computational Geometry | 2004-10-13 | Paper |
| scientific article; zbMATH DE number 2102783 (Why is no real title available?) | 2004-09-24 | Paper |
Data structures for maintaining set partitions
Random Structures & Algorithms | 2004-08-16 | Paper |
Analysis of Heuristics for the Freeze-Tag Problem
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086252 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086622 (Why is no real title available?) | 2004-08-11 | Paper |
The level ancestor problem simplified
Theoretical Computer Science | 2004-08-10 | Paper |
What is the optimal shape of a city?
Journal of Physics A: Mathematical and General | 2004-06-15 | Paper |
The lazy bureaucrat scheduling problem
Information and Computation | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1947390 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947389 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947388 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1830752 (Why is no real title available?) | 2002-11-18 | Paper |
New algorithms for disk scheduling
Algorithmica | 2002-08-14 | Paper |
Testing properties of directed graphs: acyclicity and connectivity*
Random Structures & Algorithms | 2002-08-08 | Paper |
An efficient approximation algorithm for minimizing makespan on uniformly related machines.
Journal of Algorithms | 2002-07-08 | Paper |
| Finding least common ancestors in directed acyclic graphs | 2002-05-02 | Paper |
| Optimal covering tours with turn costs | 2002-03-24 | Paper |
| scientific article; zbMATH DE number 1670872 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1617250 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1512678 (Why is no real title available?) | 2001-05-06 | Paper |
| scientific article; zbMATH DE number 1187166 (Why is no real title available?) | 1998-08-10 | Paper |
Efficient execution of nondeterministic parallel programs on asynchronous systems
Information and Computation | 1998-07-27 | Paper |
Parallel interval order recognition and construction of interval representations
Theoretical Computer Science | 1997-02-28 | Paper |
