| Publication | Date of Publication | Type |
|---|
| In-place calculation of minimum-redundancy codes | 2022-12-16 | Paper |
| Worst-case efficient external-memory priority queues | 2022-12-09 | Paper |
| Sorting multisets stably in minimum space | 2022-12-09 | Paper |
| In-place linear probing sort | 2022-08-18 | Paper |
| 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 |
| Convex-hull algorithms: implementation, testing, and experimentation | 2019-01-21 | Paper |
| Multipartite priority queues | 2018-11-05 | Paper |
| Bipartite binomial heaps | 2018-05-03 | Paper |
| A compact data structure for representing a dynamic multiset | 2017-11-03 | Paper |
| Optimizing binary heaps | 2017-10-20 | 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 |
| 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 |
| 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 |
| Selection from Read-Only Memory with Limited Workspace | 2013-06-11 | Paper |
| Priority Queues and Sorting for Read-Only Data | 2013-05-28 | Paper |
| The weak-heap data structure: variants and applications | 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 |
| Fat Heaps without Regular Counters | 2012-06-08 | Paper |
| The Open Graph Archive: A Community-Driven Effort | 2012-03-09 | Paper |
| Two Constant-Factor-Optimal Realizations of Adaptive Heapsort | 2012-01-13 | Paper |
| Strictly-Regular Number System and Data Structures | 2010-06-22 | Paper |
| Asymptotically efficient in-place merging | 2010-06-17 | Paper |
| Two new methods for constructing double-ended priority queues from priority queues | 2009-09-09 | Paper |
| Compressing spatio-temporal trajectories | 2009-08-14 | Paper |
| Two-tier relaxed heaps | 2008-06-17 | Paper |
| Compressing Spatio-temporal Trajectories | 2008-05-27 | Paper |
| Two-Tier Relaxed Heaps | 2008-04-24 | Paper |
| Performance engineering case study | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825541 | 2004-10-28 | Paper |
| Performance Tuning an Algorithm for Compressing Relational Tables | 2004-08-12 | Paper |
| A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044350 | 2004-08-11 | Paper |
| Space-efficient planar convex hull algorithms | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788553 | 2003-01-29 | Paper |
| In-place sorting with fewer moves | 2002-07-25 | Paper |
| Asymptotically efficient in-place merging | 2000-06-04 | Paper |
| Characterizing multiterminal flow networks and computing flows in networks of small treewidth | 1999-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953348 | 1998-01-01 | Paper |
| A Reliable Randomized Algorithm for the Closest-Pair Problem | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886100 | 1996-08-22 | Paper |
| Sorting multisets stably in minimum space | 1994-11-23 | Paper |
| An analysis of the longest match and the greedy heuristics in text encoding | 1994-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4289288 | 1994-05-24 | Paper |
| Space-efficient parallel merging | 1993-11-15 | Paper |
| Stable minimum space partitioning in linear time | 1993-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712662 | 1992-06-25 | Paper |
| A sublogarithmic convex hull algorithm | 1990-01-01 | Paper |
| TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484348 | 1989-01-01 | Paper |
| The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796755 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796756 | 1988-01-01 | Paper |
| Fast Simulation of Turing Machines by Random Access Machines | 1988-01-01 | Paper |
| A linear expected-time algorithm for computing planar relative neighbourhood graphs | 1987-01-01 | Paper |
| An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics | 1987-01-01 | Paper |
| Computing relative neighbourhood graphs in the plane | 1986-01-01 | Paper |
| NP-completeness of the Hamming salesman problem | 1985-01-01 | Paper |
| Notes on the complexity of sorting in abstract machines | 1985-01-01 | Paper |
| An alternative for the implementation of Kruskal's minimal spanning tree algorithm | 1983-01-01 | Paper |
| On the worst case of a minimal spanning tree algorithm for euclidean space | 1983-01-01 | Paper |
| Finding minimal spanning trees in a Euclidean coordinate space | 1981-01-01 | Paper |
