L. Alonso

Available identifiers

Publication	Date of Publication	Type
Uniform random generations and rejection method(I) with binomial majorant	2023-03-16	Paper
Determining plurality	2018-11-05	Paper
Average-case analysis of some plurality algorithms	2018-11-05	Paper
Average-case lower bounds for the plurality problem	2018-11-05	Paper
Uniform generation of a Schröder tree	2016-06-09	Paper
Analysis of Boyer and Moore's \texttt{MJRTY} algorithm	2014-04-11	Paper
Improved bounds for cops-and-robber pursuit	2011-08-02	Paper
Bounds for cops and robber pursuit	2010-09-02	Paper
The worst-case chip problem	2009-07-09	Paper
https://portal.mardi4nfdi.de/entity/Q5471353	2006-06-06	Paper
Behavior of the Laplacian of Gaussian extrema	2005-11-07	Paper
Quicksort with Unreliable Comparisons: A Probabilistic Analysis	2005-04-18	Paper
On the tree inclusion problem	2001-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q4260368	1999-09-19	Paper
The three dimensional polyominoes of minimal area	1998-02-22	Paper
The Average-Case Complexity of Determining the Majority	1997-08-03	Paper
A linear-time algorithm for the generation of trees	1997-03-06	Paper
A parallel algorithm for the generation of a permutation and applications	1997-02-27	Paper
The average complexity of a coin-weighing problem	1996-10-07	Paper
Uniform generation of a Motzkin word	1995-10-29	Paper
Multidimensional Divide-and-Conquer Maximin Recurrences	1995-09-20	Paper
Determining the majority	1994-01-31	Paper
“Lion and Man”: Upper and Lower Bounds	1993-02-25	Paper

This page was built for person: L. Alonso