| 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
La Matematica | 2024-04-02 | Paper |
\textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams
Lecture Notes in Computer Science | 2023-08-10 | Paper |
A probabilistic model revealing shortcomings in Lua's hybrid tables
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Median and hybrid median \(K\)-dimensional trees
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
| Fixed partial match queries in quadtrees | 2021-06-15 | Paper |
On deletions in open addressing hashing
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Sesquickselect: one and a half pivots for cache-efficient selection
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Analysis of Branch Misses in Quicksort
2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
The Swedish leader election protocol: analysis and variations
2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Generating random derangements
2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
On the average cost of insertions on random relaxed \(K\)-d trees
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
On the variance of quickselect
2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
| The MAX-CUT of sparse random graphs | 2019-05-10 | Paper |
| The hiring problem and permutations | 2018-07-23 | Paper |
Randomization of search trees by subtree size
Algorithms — ESA '96 | 2017-12-05 | Paper |
| Partial Quicksort and Quickpartitionsort | 2017-02-10 | Paper |
Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
Algorithmica | 2016-09-06 | Paper |
On the cost of fixed partial match queries in \(K\)-d trees
Algorithmica | 2016-09-06 | Paper |
Random partial match in quad-\(K\)-d trees
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
| On the average performance of fixed partial match queries in random relaxed \(K\)-d trees | 2016-03-01 | Paper |
| scientific article; zbMATH DE number 6469176 (Why is no real title available?) | 2015-08-03 | Paper |
| The \(r^{\mathrm{th}}\) smallest part size of a random integer partition | 2015-07-09 | Paper |
Analysis of the strategy ``hiring above the \(m\)-th best candidate
Algorithmica | 2015-01-19 | Paper |
Adaptive sampling strategies for quickselects
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Updating relaxed \(K\)-d trees
ACM Transactions on Algorithms | 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
Random Structures & Algorithms | 2014-08-25 | Paper |
Psi-series method for equality of random trees and quadratic convolution recurrences
Random Structures & Algorithms | 2014-01-28 | Paper |
Hiring above the \(m\)-th best candidate: a generalization of records in permutations
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
The analysis of range quickselect and related problems
Theoretical Computer Science | 2011-12-07 | Paper |
Locating errors using ELAs, covering arrays, and adaptive testing algorithms
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Interval Sorting
Automata, Languages and Programming | 2010-09-07 | Paper |
Rank selection in multidimensional data
LATIN 2010: Theoretical Informatics | 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
Theoretical Computer Science | 2009-05-28 | Paper |
| scientific article; zbMATH DE number 5556016 (Why is no real title available?) | 2009-05-22 | Paper |
Improving the performance of multidimensional search using fingers
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Algorithms to Locate Errors Using Covering Arrays
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Efficient iteration in admissible combinatorial classes
Theoretical Computer Science | 2006-01-10 | Paper |
| scientific article; zbMATH DE number 2127730 (Why is no real title available?) | 2005-01-14 | Paper |
| scientific article; zbMATH DE number 2086648 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1984552 (Why is no real title available?) | 2003-09-22 | Paper |
On the average performance of orthogonal range search in multidimensional data structures
Journal of Algorithms | 2003-03-23 | Paper |
Optimal sampling strategies in Quicksort and Quickselect
SIAM Journal on Computing | 2002-04-23 | Paper |
A generic approach for the unranking of labeled combinatorial classes
Random Structures & Algorithms | 2002-02-19 | Paper |
Partial match queries in relaxed multidimensional search trees
Algorithmica | 2001-09-03 | Paper |
| scientific article; zbMATH DE number 1504592 (Why is no real title available?) | 2000-09-12 | Paper |
On the competitiveness of the move-to-front rule
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1080355 (Why is no real title available?) | 1998-09-08 | Paper |
Randomized binary search trees
Journal of the ACM | 1998-08-20 | Paper |
On the number of descendants and ascendants in random search trees
The Electronic Journal of Combinatorics | 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
Theoretical Computer Science | 1997-02-28 | Paper |
A design of a parallel dictionary using skip lists
Theoretical Computer Science | 1997-02-27 | Paper |
