| Publication | Date of Publication | Type |
|---|
| Deterministic cache-oblivious funnelselect | 2025-12-02 | Paper |
| Dynamic convex hulls for simple paths | 2025-11-24 | Paper |
Bottom-up rebalancing binary search trees by flipping a coin
Theoretical Computer Science | 2025-11-01 | Paper |
| 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
Theoretical Computer Science | 2024-05-02 | Paper |
Space-efficient functional offline-partially-persistent trees with applications to planar point location
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Fast meldable priority queues
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Priority queues on parallel machines
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
The randomized complexity of maintaining the minimum
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Worst-case efficient external-memory priority queues
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Comparator networks for binary heap construction
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Predecessor queries in dynamic integer sets
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Cache oblivious algorithms for computing the triplet distance between trees
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
| scientific article; zbMATH DE number 7509955 (Why is no real title available?) | 2022-04-19 | Paper |
Fully persistent B-trees
Theoretical Computer Science | 2020-09-17 | Paper |
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
(available as arXiv preprint) | 2020-05-27 | Paper |
A simple greedy algorithm for dynamic graph orientation
Algorithmica | 2020-04-09 | Paper |
On the Scalability of Computing Triplet and Quartet Distances
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Fully persistent B-trees | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 6876068 (Why is no real title available?) | 2018-05-29 | Paper |
| scientific article; zbMATH DE number 6876091 (Why is no real title available?) | 2018-05-29 | Paper |
External memory three-sided range reporting and top-\(k\) queries with sublogarithmic updates
(available as arXiv preprint) | 2018-01-24 | Paper |
Cache-oblivious planar orthogonal range searching and counting
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
| Ordered and unordered top-\(K\) range reporting in large data sets | 2017-09-29 | Paper |
On the adaptiveness of Quicksort
ACM Journal of Experimental Algorithmics | 2017-06-15 | Paper |
Improved bounds for dictionary look-up with one error
Information Processing Letters | 2016-06-16 | Paper |
Two dimensional range minimum queries and Fibonacci lattices
Theoretical Computer Science | 2016-06-16 | Paper |
Strictly implicit priority queues: on the number of moves and worst-case time
Lecture Notes in Computer Science | 2015-10-30 | Paper |
\(D^2\)-tree: a new overlay with deterministic bounds
Algorithmica | 2015-09-02 | Paper |
\textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
Theory of Computing Systems | 2015-05-12 | Paper |
Optimal planar orthogonal skyline counting queries
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Expected linear time sorting for word size \(\Omega (\log ^{2} n \log\log n)\)
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
| scientific article; zbMATH DE number 6297800 (Why is no real title available?) | 2014-05-22 | Paper |
Strict Fibonacci heaps
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Integer representations towards efficient counting in the bit probe model
Journal of Discrete Algorithms | 2014-04-28 | Paper |
Dynamic 3-sided planar range queries with expected doubly-logarithmic time
Theoretical Computer Science | 2014-03-13 | Paper |
The Encoding Complexity of Two Dimensional Range Minimum Data Structures
Lecture Notes in Computer Science | 2013-09-17 | Paper |
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters
Lecture Notes in Computer Science | 2013-09-17 | Paper |
A survey on priority queues
Lecture Notes in Computer Science | 2013-09-13 | Paper |
| Time-dependent networks as models to achieve fast exact time-table queries | 2013-09-09 | Paper |
Finger search in the implicit model
Algorithms and Computation | 2013-03-21 | Paper |
On space efficient two dimensional range minimum data structures
Algorithmica | 2012-12-06 | Paper |
Two Dimensional Range Minimum Queries and Fibonacci Lattices
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Cache-oblivious implicit predecessor dictionaries with the working-set property
(available as arXiv preprint) | 2012-08-23 | Paper |
OnlineMin: a fast strongly competitive randomized paging algorithm
Approximation and Online Algorithms | 2012-07-16 | Paper |
External memory planar point location with logarithmic updates
Algorithmica | 2012-04-26 | Paper |
Faster algorithms for computing longest common increasing subsequences
Journal of Discrete Algorithms | 2012-01-04 | Paper |
The cost of cache-oblivious searching
Algorithmica | 2011-09-20 | Paper |
Path minima queries in dynamic weighted trees
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Dynamic Planar Range Maxima Queries
Automata, Languages and Programming | 2011-07-06 | Paper |
Integer representations towards efficient counting in the bit probe model
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Towards optimal range medians
Theoretical Computer Science | 2011-06-07 | Paper |
Optimal sparse matrix dense vector multiplication in the I/O-model
Theory of Computing Systems | 2010-12-17 | Paper |
\(D^{2}\)-tree: a new overlay with deterministic bounds
Algorithms and Computation | 2010-12-09 | Paper |
A Cache-Oblivious Implicit Dictionary with the Working Set Property
Algorithms and Computation | 2010-12-09 | Paper |
On space efficient two dimensional range minimum data structures
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Cache-oblivious string dictionaries
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
On the limits of cache-obliviousness
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Optimal finger search trees in the pointer machine
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Online sorted range reporting
Algorithms and Computation | 2009-12-17 | Paper |
Data structures for range median queries
Algorithms and Computation | 2009-12-17 | Paper |
Counting in the presence of memory faults
Algorithms and Computation | 2009-12-17 | Paper |
Dynamic 3-sided planar range queries with expected doubly logarithmic time
Algorithms and Computation | 2009-12-17 | Paper |
Fault Tolerant External Memory Algorithms
Lecture Notes in Computer Science | 2009-10-20 | Paper |
The ComBack Method – Extending Hash Compaction with Backtracking
Petri Nets and Other Models of Concurrency – ICATPN 2007 | 2009-03-11 | Paper |
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Selecting Sums in Arrays
Algorithms and Computation | 2009-01-29 | Paper |
Optimal Resilient Dynamic Dictionaries
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Dynamic Matchings in Convex Bipartite Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
A Linear Time Algorithm for the k Maximal Sums Problem
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Engineering a cache-oblivious sorting algorithm
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
Operations Research Letters | 2008-05-29 | Paper |
Purely Functional Worst Case Constant Time Catenable Sorted Lists
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Skewed Binary Search Trees
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Faster Algorithms for Computing Longest Common Increasing Subsequences
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
| scientific article; zbMATH DE number 2185638 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2185626 (Why is no real title available?) | 2005-07-04 | Paper |
Fast allocation and deallocation with an improved buddy system
Acta Informatica | 2005-04-15 | Paper |
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms | 2005-02-16 | Paper |
Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
Algorithmica | 2004-12-02 | Paper |
| scientific article; zbMATH DE number 2119642 (Why is no real title available?) | 2004-11-29 | Paper |
Optimal finger search trees in the pointer machine
Journal of Computer and System Sciences | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2089205 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086666 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086641 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2081035 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079384 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 1979501 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1754590 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1617248 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1617278 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1615296 (Why is no real title available?) | 2001-07-08 | Paper |
Comparator networks for binary heap construction
Theoretical Computer Science | 2000-12-12 | Paper |
| scientific article; zbMATH DE number 1476490 (Why is no real title available?) | 2000-07-14 | Paper |
| scientific article; zbMATH DE number 1445383 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1303596 (Why is no real title available?) | 2000-02-09 | Paper |
| scientific article; zbMATH DE number 1305387 (Why is no real title available?) | 1999-06-17 | Paper |
A parallel priority queue with constant time operations
Journal of Parallel and Distributed Computing | 1998-11-05 | Paper |
Optimal purely functional priority queues
Journal of Functional Programming | 1997-06-04 | Paper |
| scientific article; zbMATH DE number 1002203 (Why is no real title available?) | 1997-04-22 | Paper |
| scientific article; zbMATH DE number 871899 (Why is no real title available?) | 1996-06-16 | Paper |
