| Publication | Date of Publication | Type |
|---|
| Modern hashing made simple | 2024-05-29 | Paper |
| Tight bounds for monotone minimal perfect hashing | 2024-05-14 | 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 |
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 |
scientific article; zbMATH DE number 7650919 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650083 (Why is no real title available?) | 2023-02-03 | Paper |
Dynamic windows scheduling with reallocation
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
scientific article; zbMATH DE number 7561401 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Optimal hashing in external memory
(available as arXiv preprint) | 2021-07-28 | Paper |
Flushing Without Cascades
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | 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 |
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Cost-oblivious storage reallocation
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Parallel lookups in string indexes | 2018-10-17 | 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 |
Fault-tolerant aggregation: flow-updating meets mass-distribution
Distributed Computing | 2017-09-04 | Paper |
The I/O complexity of computing prime tables
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Tight Approximations of Degeneracy in Large Graphs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Exact sublinear binomial sampling
Algorithmica | 2016-02-19 | Paper |
On the complexity of computing prime tables
Algorithms and Computation | 2016-01-11 | Paper |
Finding articulation points of large graphs in linear time
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Reallocation problems in scheduling
Algorithmica | 2015-10-19 | Paper |
Initializing sensor networks of non-uniform density in the weak sensor model
Algorithmica | 2015-09-03 | Paper |
Bootstrapping a hop-optimal network in the weak sensor model
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics | 2014-10-13 | Paper |
The batched predecessor problem in external memory
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Computing the degeneracy of large graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Exact Sublinear Binomial Sampling
Algorithms and Computation | 2014-01-14 | Paper |
Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)
Theoretical Computer Science | 2013-03-04 | Paper |
Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
On the complexity of ordinal clustering
Journal of Classification | 2012-05-30 | Paper |
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Fast and compact regular expression matching
Theoretical Computer Science | 2009-01-08 | Paper |
Lower Bounds for Clear Transmissions in Radio Networks
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
A Linear Delay Algorithm for Building Concept Lattices
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Sensor Network Gossiping or How to Break the Broadcast Lower Bound
Algorithms and Computation | 2008-05-27 | Paper |
INSERTION SORT is \(O(n \log n)\)
Theory of Computing Systems | 2007-02-13 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | 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 |
| scientific article; zbMATH DE number 2119651 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2086252 (Why is no real title available?) | 2004-08-11 | Paper |
The level ancestor problem simplified
Theoretical Computer Science | 2004-08-10 | 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 |
Fast, fair and frugal bandwidth allocation in ATM networks
Algorithmica | 2002-06-17 | Paper |
| On the midpath tree conjecture: A counter-example | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1512678 (Why is no real title available?) | 2001-05-06 | Paper |
An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
SIAM Journal on Computing | 2001-03-19 | Paper |
On Local Register Allocation
Journal of Algorithms | 2000-11-05 | Paper |
| scientific article; zbMATH DE number 1305396 (Why is no real title available?) | 1999-06-17 | Paper |
Optimal parallel two dimensional text searching on a CREW PRAM
Information and Computation | 1999-03-25 | Paper |
