| Publication | Date of Publication | Type |
|---|
| Partial match queries in quad-\(K\)-d trees | 2024-05-14 | Paper |
| Affirmative sampling: theory and applications | 2024-05-14 | Paper |
| On the expected cost of partial match queries in random quad-\(K\)-d trees | 2024-04-02 | Paper |
| \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams | 2023-08-10 | Paper |
| A probabilistic model revealing shortcomings in Lua's hybrid tables | 2023-08-10 | Paper |
| Median and hybrid median \(K\)-dimensional trees | 2023-07-26 | Paper |
| Fixed Partial Match Queries in Quadtrees | 2021-06-15 | Paper |
| On Deletions in Open Addressing Hashing | 2019-09-18 | Paper |
| Sesquickselect: One and a half pivots for cache-efficient selection | 2019-09-18 | Paper |
| Analysis of Branch Misses in Quicksort | 2019-09-17 | Paper |
| The Swedish Leader Election Protocol: Analysis and Variations | 2019-09-16 | Paper |
| Generating Random Derangements | 2019-09-16 | Paper |
| On the average cost of insertions on random relaxed K-d trees | 2019-09-16 | Paper |
| On the Variance of Quickselect | 2019-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743397 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3176556 | 2018-07-23 | Paper |
| Randomization of search trees by subtree size | 2017-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959928 | 2017-02-10 | Paper |
| Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme | 2016-09-06 | Paper |
| On the cost of fixed partial match queries in \(K\)-d trees | 2016-09-06 | Paper |
| Random Partial Match in Quad-K-d Trees | 2016-05-03 | Paper |
| On the average performance of fixed partial match queries in random relaxed \(K\)-d trees | 2016-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501291 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5262056 | 2015-07-09 | Paper |
| Analysis of the strategy ``hiring above the \(m\)-th best candidate | 2015-01-19 | Paper |
| Adaptive sampling strategies for quickselects | 2014-11-18 | Paper |
| Updating relaxed K -d trees | 2014-11-18 | Paper |
| Updating relaxed \(K\)-d trees | 2014-11-18 | Paper |
| Data streams as random permutations: the distinct element problem | 2014-09-29 | Paper |
| Selection by rank in K-dimensional binary search trees | 2014-08-25 | Paper |
| Psi-series method for equality of random trees and quadratic convolution recurrences | 2014-01-28 | Paper |
| Hiring above the m-th Best Candidate: A Generalization of Records in Permutations | 2012-06-29 | Paper |
| The analysis of range quickselect and related problems | 2011-12-07 | Paper |
| Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms | 2010-12-03 | Paper |
| Interval Sorting | 2010-09-07 | Paper |
| Rank Selection in Multidimensional Data | 2010-04-27 | Paper |
| Psi-series method in random trees and moments of high orders | 2010-02-20 | Paper |
| Moves and displacements of particular elements in quicksort | 2009-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3625879 | 2009-05-22 | Paper |
| Improving the performance of multidimensional search using fingers | 2008-06-20 | Paper |
| Algorithms to Locate Errors Using Covering Arrays | 2008-04-15 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Efficient iteration in admissible combinatorial classes | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154677 | 2005-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737184 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428917 | 2003-09-22 | Paper |
| On the average performance of orthogonal range search in multidimensional data structures | 2003-03-23 | Paper |
| Optimal sampling strategies in Quicksort and Quickselect | 2002-04-23 | Paper |
| A generic approach for the unranking of labeled combinatorial classes | 2002-02-19 | Paper |
| Partial match queries in relaxed multidimensional search trees | 2001-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502543 | 2000-09-12 | Paper |
| On the competitiveness of the move-to-front rule | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4361713 | 1998-09-08 | Paper |
| Randomized binary search trees | 1998-08-20 | Paper |
| On the number of descendants and ascendants in random search trees | 1998-04-16 | Paper |
| Analysis of Hoare's FIND algorithm with Median-of-three partition | 1997-03-05 | Paper |
| Analysis of an optimized search algorithm for skip lists | 1997-02-28 | Paper |
| A design of a parallel dictionary using skip lists | 1997-02-27 | Paper |
