| Publication | Date of Publication | Type |
|---|
| Uniform random generations and rejection method(I) with binomial majorant | 2023-03-16 | Paper |
Uniform random generations and rejection method(I) with binomial majorant
(available as arXiv preprint) | 2023-01-01 | Paper |
Determining plurality
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Average-case lower bounds for the plurality problem
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Average-case analysis of some plurality algorithms
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Uniform generation of a Schröder tree
Information Processing Letters | 2016-06-09 | Paper |
Analysis of Boyer and Moore's \texttt{MJRTY} algorithm
Information Processing Letters | 2014-04-11 | Paper |
Improved bounds for cops-and-robber pursuit
Computational Geometry | 2011-08-02 | Paper |
Bounds for cops and robber pursuit
Computational Geometry | 2010-09-02 | Paper |
The worst-case chip problem
Information Processing Letters | 2009-07-09 | Paper |
| Average-case analysis of the chip problem | 2006-06-06 | Paper |
Behavior of the Laplacian of Gaussian extrema
Journal of Mathematical Imaging and Vision | 2005-11-07 | Paper |
Quicksort with Unreliable Comparisons: A Probabilistic Analysis
Combinatorics, Probability and Computing | 2005-04-18 | Paper |
On the tree inclusion problem
Acta Informatica | 2001-08-26 | Paper |
| scientific article; zbMATH DE number 1333595 (Why is no real title available?) | 1999-09-19 | Paper |
The three dimensional polyominoes of minimal area
The Electronic Journal of Combinatorics | 1998-02-22 | Paper |
The three dimensional polyominoes of minimal area
The Electronic Journal of Combinatorics | 1998-02-22 | Paper |
The Average-Case Complexity of Determining the Majority
SIAM Journal on Computing | 1997-08-03 | Paper |
A linear-time algorithm for the generation of trees
Algorithmica | 1997-03-06 | Paper |
A parallel algorithm for the generation of a permutation and applications
Theoretical Computer Science | 1997-02-27 | Paper |
| The average complexity of a coin-weighing problem | 1996-10-07 | Paper |
Uniform generation of a Motzkin word
Theoretical Computer Science | 1995-10-29 | Paper |
Multidimensional Divide-and-Conquer Maximin Recurrences
SIAM Journal on Discrete Mathematics | 1995-09-20 | Paper |
Determining the majority
Information Processing Letters | 1994-01-31 | Paper |
“Lion and Man”: Upper and Lower Bounds
ORSA Journal on Computing | 1993-02-25 | Paper |
