| Publication | Date of Publication | Type |
|---|
| Deterministic cache-oblivious funnelselect | 2025-12-02 | Paper |
Randomized communication and implicit graph representations
TheoretiCS | 2025-10-22 | Paper |
| Lazy search trees | 2025-08-12 | Paper |
| Funnelselect: Cache-oblivious multiple selection | 2025-01-06 | Paper |
| Towards the 5/6-density conjecture of pinwheel scheduling | 2024-05-24 | Paper |
| Multiway powersort | 2024-05-24 | Paper |
A simple and fast linear-time algorithm for divisor methods of apportionment
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Randomized communication and implicit graph representations
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7765383 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-14 | Paper |
| Finding the saddlepoint faster than sorting | 2023-10-25 | Paper |
scientific article; zbMATH DE number 7740925 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Succinct permutation graphs
Algorithmica | 2023-02-16 | Paper |
scientific article; zbMATH DE number 7378733 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
scientific article; zbMATH DE number 7359768 (Why is no real title available?)
(available as arXiv preprint) | 2021-06-15 | Paper |
QuickXsort: a fast sorting scheme in theory and practice
Algorithmica | 2020-02-06 | Paper |
Efficient second-order shape-constrained function fitting
(available as arXiv preprint) | 2020-01-16 | Paper |
Quicksort is optimal for many equal keys
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Sesquickselect: one and a half pivots for cache-efficient selection
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Median-of-\(k\) jumplists and dangling-min BSTs
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Analysis of Branch Misses in Quicksort
2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks
Algorithmica | 2019-01-11 | Paper |
Average case and distributional analysis of dual-pivot quicksort
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
Algorithmica | 2016-09-06 | Paper |
Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
Algorithmica | 2016-03-23 | Paper |
| Pivot sampling in dual-pivot quicksort: exploiting asymmetries in Yaroslavskiy's partitioning scheme | 2016-03-01 | Paper |
| Pivot Sampling in Dual-Pivot Quicksort | 2014-03-26 | Paper |
Average case analysis of Java 7's dual pivot quicksort
Algorithms – ESA 2012 | 2012-09-25 | Paper |
An Optimal Randomized Algorithm for Finding the Saddlepoint
(available as arXiv preprint) | N/A | Paper |
