| Publication | Date of Publication | Type |
|---|
Fragile complexity of adaptive algorithms
Lecture Notes in Computer Science | 2023-03-22 | Paper |
| On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? | 2023-02-03 | Paper |
Amortization results for chromatic search trees, with an application to priority queues
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Binary search trees: How low can you go?
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Fragile complexity of comparison-based algorithms
(available as arXiv preprint) | 2022-05-11 | Paper |
Fragile complexity of adaptive algorithms
Theoretical Computer Science | 2022-05-10 | Paper |
| Towards mechanistic prediction of mass spectra using graph transformation | 2021-09-02 | 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 |
| Competitive routing in the half-\(\theta_6\)-graph | 2019-05-10 | Paper |
On plane constrained bounded-degree spanners
Algorithmica | 2019-04-25 | Paper |
Handling preferences in student-project allocation
Annals of Operations Research | 2019-03-06 | Paper |
Competitive local routing with constraints
(available as arXiv preprint) | 2018-06-05 | Paper |
| scientific article; zbMATH DE number 6876091 (Why is no real title available?) | 2018-05-29 | Paper |
New and improved spanning ratios for Yao graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Continuous Yao graphs
Computational Geometry | 2018-02-12 | Paper |
Cache-oblivious planar orthogonal range searching and counting
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
On the adaptiveness of Quicksort
ACM Journal of Experimental Algorithmics | 2017-06-15 | Paper |
| New and improved spanning ratios for Yao graphs | 2017-03-30 | Paper |
Biased predecessor search
Algorithmica | 2016-12-21 | Paper |
Competitive local routing with constraints
Algorithms and Computation | 2016-01-11 | Paper |
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
SIAM Journal on Computing | 2015-11-18 | Paper |
On the complexity of reconstructing chemical reaction networks
Mathematics in Computer Science | 2015-02-04 | Paper |
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Biased predecessor search
Lecture Notes in Computer Science | 2014-03-31 | Paper |
De-amortizing binary search trees
Automata, Languages, and Programming | 2013-08-12 | Paper |
On plane constrained bounded-degree spanners
Lecture Notes in Computer Science | 2012-06-29 | Paper |
The cost of cache-oblivious searching
Algorithmica | 2011-09-20 | Paper |
Optimal sparse matrix dense vector multiplication in the I/O-model
Theory of Computing Systems | 2010-12-17 | 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 |
An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Online sorted range reporting
Algorithms and Computation | 2009-12-17 | Paper |
Optimal Resilient Dynamic Dictionaries
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Engineering a cache-oblivious sorting algorithm
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
Combinatorial Pattern Matching | 2008-06-17 | Paper |
External String Sorting: Faster and Cache-Oblivious
STACS 2006 | 2008-03-19 | 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 |
| scientific article; zbMATH DE number 2185626 (Why is no real title available?) | 2005-07-04 | 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 |
| 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 1830753 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1754590 (Why is no real title available?) | 2002-06-12 | Paper |
Amortization results for chromatic search trees, with an application to priority queues
Journal of Computer and System Sciences | 1998-08-04 | Paper |
A generalization of binomial queues
Information Processing Letters | 1997-02-28 | Paper |
EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
International Journal of Foundations of Computer Science | 1996-11-26 | Paper |
