| Publication | Date of Publication | Type |
|---|
| Regular numeral systems for data structures | 2022-05-17 | Paper |
| Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls | 2022-02-16 | Paper |
| Optimal prefix codes with fewer distinct codeword lengths are faster to construct | 2019-09-17 | Paper |
| The Subset Partial Order: Computing and Combinatorics | 2019-09-16 | Paper |
| A new algorithm for the shortest‐path problem | 2019-08-01 | Paper |
| Red-black trees with constant update time | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633856 | 2019-05-06 | Paper |
| Toward Optimal Self-Adjusting Heaps | 2018-11-12 | Paper |
| Multipartite priority queues | 2018-11-05 | Paper |
| On the approximability of the maximum interval constrained coloring problem | 2018-08-17 | Paper |
| Bipartite binomial heaps | 2018-05-03 | Paper |
| Space-Efficient Plane-Sweep Algorithms. | 2018-04-19 | Paper |
| Optimizing binary heaps | 2017-10-20 | Paper |
| Space-efficient Basic Graph Algorithms | 2017-01-24 | Paper |
| Dynamic range majority data structures | 2016-09-01 | Paper |
| An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop | 2015-10-20 | Paper |
| Counting inversions adaptively | 2015-06-15 | Paper |
| ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS | 2014-11-14 | Paper |
| Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem | 2014-10-08 | Paper |
| Selection from read-only memory with limited workspace | 2014-10-06 | Paper |
| A Catalogue of Algorithms for Building Weak Heaps | 2014-08-19 | Paper |
| Weak heaps engineered | 2014-08-13 | Paper |
| Inversion-sensitive sorting algorithms in practice | 2014-04-01 | Paper |
| Weak Heaps and Friends: Recent Developments | 2014-01-17 | Paper |
| In-Place Binary Counters | 2013-09-20 | Paper |
| FAT HEAPS WITHOUT REGULAR COUNTERS | 2013-09-05 | Paper |
| On the hierarchy of distribution-sensitive properties for data structures | 2013-08-05 | Paper |
| Enumerating trichromatic triangles containing the origin in linear time | 2013-06-24 | Paper |
| Selection from Read-Only Memory with Limited Workspace | 2013-06-11 | Paper |
| Priority Queues and Sorting for Read-Only Data | 2013-05-28 | Paper |
| Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge | 2013-03-07 | Paper |
| The weak-heap data structure: variants and applications | 2013-01-18 | Paper |
| A priority queue with the time-finger property | 2013-01-18 | Paper |
| Two skew-binary numeral systems and one application | 2012-12-06 | Paper |
| In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses | 2012-09-25 | Paper |
| Worst-Case Optimal Priority Queues via Extended Regular Counters | 2012-09-10 | Paper |
| On the size of the subset partial order | 2012-07-25 | Paper |
| Fat Heaps without Regular Counters | 2012-06-08 | Paper |
| An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs | 2012-04-26 | Paper |
| FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS | 2012-04-19 | Paper |
| The longest almost-increasing subsequence | 2012-03-19 | Paper |
| Two Constant-Factor-Optimal Realizations of Adaptive Heapsort | 2012-01-13 | Paper |
| A Unifying Property for Distribution-Sensitive Priority Queues | 2012-01-13 | Paper |
| Dynamic Range Majority Data Structures | 2011-12-16 | Paper |
| Analysis of swaps in radix selection | 2011-07-22 | Paper |
| THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP | 2011-03-25 | Paper |
| Pairing heaps, scrambled pairing and square-root trees | 2011-01-20 | Paper |
| On the Approximability of the Maximum Interval Constrained Coloring Problem | 2010-12-09 | Paper |
| Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs | 2010-12-09 | Paper |
| Pairing Heaps with Costless Meld | 2010-09-06 | Paper |
| Computing the subset partial order for dense families of sets | 2010-08-20 | Paper |
| The Longest Almost-Increasing Subsequence | 2010-07-20 | Paper |
| The Violation Heap: A Relaxed Fibonacci-Like Heap | 2010-07-20 | Paper |
| Strictly-Regular Number System and Data Structures | 2010-06-22 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Two new methods for constructing double-ended priority queues from priority queues | 2009-09-09 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Verification of minimum-redundancy prefix codes | 2008-12-21 | Paper |
| Two-tier relaxed heaps | 2008-06-17 | Paper |
| Two-Tier Relaxed Heaps | 2008-04-24 | Paper |
| Adaptive sorting: an information theoretic perspective | 2008-04-03 | Paper |
| Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes | 2008-03-19 | Paper |
| Competitive advantage and the cost of equity in international shipping | 2007-12-04 | Paper |
| A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY | 2007-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485313 | 2006-08-29 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5705141 | 2005-11-08 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673415 | 2005-04-29 | Paper |
| Parameterized self-adjusting heaps | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737156 | 2004-08-11 | Paper |
| On the sequential access theorem and deque conjecture for splay trees | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453142 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453148 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418689 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414551 | 2003-07-25 | Paper |
| Reaching the bound in the \((2,n)\) merging problem | 2000-01-04 | Paper |
