2025
An asymptotically optimal algorithm for generating bin cardinalities.
Math. Comput. Simul., 2025
2024
An Algorithm to Recover Shredded Random Matrices.
SIAM J. Discret. Math., 2024
2023
On the peel number and the leaf-height of Galton-Watson trees.
Comb. Probab. Comput., January, 2023
A note on estimating the dimension from a random geometric graph.
CoRR, 2023
Broadcasting in random recursive dags.
CoRR, 2023
Two-Way Linear Probing Revisited.
Algorithms, 2023
2022
On the Consistency of the Kozachenko-Leonenko Entropy Estimate.
IEEE Trans. Inf. Theory, 2022
Root estimation in Galton-Watson trees.
Random Struct. Algorithms, 2022
Leaf multiplicity in a Bienaymé-Galton-Watson tree.
Discret. Math. Theor. Comput. Sci., 2022
Subtractive random forests.
CoRR, 2022
2021
Random variate generation for the truncated negative gamma distribution.
Math. Comput. Simul., 2021
2020
Recursive functions on conditional Galton-Watson trees.
Random Struct. Algorithms, 2020
On Mean Estimation for Heteroscedastic Random Variables.
CoRR, 2020
Probabilistic Analysis of RRT Trees.
CoRR, 2020
An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees.
Algorithmica, 2020
2019
Notes on growing a tree in a graph.
Random Struct. Algorithms, 2019
On the discovery of the seed in uniform attachment trees.
Internet Math., 2019
Remote Sampling with Applications to General Entanglement Simulation.
Entropy, 2019
A lower bound on the size of an absorbing set in an arc-coloured tournament.
Discret. Math., 2019
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019
2018
Discrete minimax estimation with trees.
CoRR, 2018
The Minimax Learning Rate of Normal and Ising Undirected Graphical Models.
CoRR, 2018
A note on interference in random networks.
Comput. Geom., 2018
OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture).
Proceedings of the 29th International Conference on Probabilistic, 2018
2017
The expected bit complexity of the von Neumann rejection algorithm.
Stat. Comput., 2017
The graph structure of a deterministic automaton chosen at random.
Random Struct. Algorithms, 2017
Finding Adam in random growing trees.
Random Struct. Algorithms, 2017
Nonparametric estimation of a function from noiseless observations at random points.
J. Multivar. Anal., 2017
On the measure of Voronoi cells.
J. Appl. Probab., 2017
Local optima of the Sherrington-Kirkpatrick Hamiltonian.
CoRR, 2017
The heavy path approach to Galton-Watson trees with an application to Apollonian networks.
CoRR, 2017
2016
Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution.
IEEE Trans. Inf. Theory, 2016
2015
Random-Walk Perturbations for Online Combinatorial Optimization.
IEEE Trans. Inf. Theory, 2015
Random hyperplane search trees in high dimensions.
J. Comput. Geom., 2015
Exceptional rotations of random graphs: a VC theory.
J. Mach. Learn. Res., 2015
On the Green's function of the partially diffusion-controlled reversible ABCD reaction for radiation chemistry codes.
J. Comput. Phys., 2015
The Analysis of Kademlia for Random IDs.
Internet Math., 2015
Sampling with arbitrary precision.
CoRR, 2015
The graph structure of a deterministic automaton chosen at random: full version.
CoRR, 2015
2014
Stat. Methods Appl., 2014
On simulation and properties of the stable law.
Stat. Methods Appl., 2014
Random variate generation for the generalized inverse Gaussian distribution.
Stat. Comput., 2014
Connectivity of inhomogeneous random graphs.
Random Struct. Algorithms, 2014
Connectivity threshold of Bluetooth graphs.
Random Struct. Algorithms, 2014
Calculations of distance distributions and probabilities of binding by ligands between parallel plane membranes comprising receptors.
Comput. Phys. Commun., 2014
The Random Connection Model on the Torus.
Comb. Probab. Comput., 2014
Almost optimal sparsification of random geometric graphs.
CoRR, 2014
Connectivity of sparse Bluetooth networks.
CoRR, 2014
Exact Classical Simulation of the GHZ Distribution.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014
Cellular Tree Classifiers.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014
2013
Estimation of a Density Using Real and Artificial Data.
IEEE Trans. Inf. Theory, 2013
Random sampling of the Green's Functions for reversible reactions with an intermediate state.
J. Comput. Phys., 2013
Connectivity for line-of-sight networks in higher dimensions.
Discret. Math. Theor. Comput. Sci., 2013
Exact simulation for the GHZ distribution
CoRR, 2013
A Probabilistic Analysis of Kademlia Networks.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Prediction by random-walk perturbation.
Proceedings of the COLT 2013, 2013
Strong Universal Consistent Estimate of the Minimum Mean Squared Error.
Proceedings of the Empirical Inference - Festschrift in Honor of Vladimir N. Vapnik, 2013
2012
Simulating Size-constrained Galton-Watson Trees.
SIAM J. Comput., 2012
Depth Properties of scaled attachment random recursive trees.
Random Struct. Algorithms, 2012
An affine invariant k-nearest neighbor regression estimate.
J. Multivar. Anal., 2012
A Note on Interference in Random Point Sets
CoRR, 2012
Memoryless routing in convex subdivisions: Random walks are optimal.
Comput. Geom., 2012
2011
ACM Trans. Model. Comput. Simul., 2011
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees.
Random Struct. Algorithms, 2011
Almost all Delaunay triangulations have stretch factor greater than pi/2.
Comput. Geom., 2011
2010
On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification.
J. Multivar. Anal., 2010
The dilation of the Delaunay triangulation is greater than π/2
CoRR, 2010
Point Location in Disconnected Planar Subdivisions
CoRR, 2010
Note on the Structure of Kruskal's Algorithm.
Algorithmica, 2010
Classification and Trees.
Proceedings of the Structural, 2010
Complexity Questions in Non-Uniform Random Variate Generation.
Proceedings of the 19th International Conference on Computational Statistics, 2010
2009
Random variate generation for exponentially and polynomially tilted stable distributions.
ACM Trans. Model. Comput. Simul., 2009
Random Hyperplane Search Trees.
SIAM J. Comput., 2009
Multiple choice tries and distributed hash tables.
Random Struct. Algorithms, 2009
On the k-orientability of random graphs.
Discret. Math., 2009
On the Expected Maximum Degree of Gabriel and Yao Graphs
CoRR, 2009
The spanning ratio of the Delaunay triangulation is greater than pi/2.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009
2008
On the Performance of Clustering in Hilbert Spaces.
IEEE Trans. Inf. Theory, 2008
The height of increasing trees.
Random Struct. Algorithms, 2008
Consistency of Random Forests and Other Averaging Classifiers.
J. Mach. Learn. Res., 2008
An Analysis of the Height of Tries with Random Weights on the Edges.
Comb. Probab. Comput., 2008
Weighted height of random trees.
Acta Informatica, 2008
2007
On the stabbing number of a random Delaunay triangulation.
Comput. Geom., 2007
2006
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons.
SIAM J. Discret. Math., 2006
Large Deviations for the Weighted Height of an Extended Class of Trees.
Algorithmica, 2006
Random Multivariate Search Trees.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006
Chapter 4 Nonuniform Random Variate Generation.
Proceedings of the Simulation, 2006
2005
Two-Way Chaining with Reassignment.
SIAM J. Comput., 2005
Probabilistic behavior of asymmetric level compressed tries.
Random Struct. Algorithms, 2005
Random Struct. Algorithms, 2005
Universal Asymptotics for Random Tries and PATRICIA Trees.
Algorithmica, 2005
2004
A note on density model size testing.
IEEE Trans. Inf. Theory, 2004
Distances and Finger Search in Random Binary Search Trees.
SIAM J. Comput., 2004
On Worst-Case Robin Hood Hashing.
SIAM J. Comput., 2004
Expected worst-case partial match in random quadtries.
Discret. Appl. Math., 2004
Expected time analysis for Delaunay point location.
Comput. Geom., 2004
2003
Random suffix search trees.
Random Struct. Algorithms, 2003
Cuckoo hashing: Further analysis.
Inf. Process. Lett., 2003
2002
A note on robust hypothesis testing.
IEEE Trans. Inf. Theory, 2002
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees.
SIAM J. Comput., 2002
Diamonds are Not a Minimum Weight Triangulation's Best Friend.
Int. J. Comput. Geom. Appl., 2002
Succinct Data Structures for Approximating Convex Functions with Applications.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Paul Erdös memorial lecture.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
2001
Analysis of random LC tries.
Random Struct. Algorithms, 2001
On the Probablistic Worst-Case Time of "Find".
Algorithmica, 2001
Analysis of range search for random k-d trees.
Acta Informatica, 2001
Combinatorial methods in density estimation.
Springer series in statistics, Springer, ISBN: 978-0-387-95117-1, 2001
2000
Squarish <i>k</i>-<i>d</i> Trees.
SIAM J. Comput., 2000
Estimating the number of vertices of a polyhedron.
Inf. Process. Lett., 2000
Perfect simulation from the Quicksort limit distribution
CoRR, 2000
1999
The Height and Size of Random Hash Trees and Random Pebbled Hash Trees.
SIAM J. Comput., 1999
On the complexity of branch-and-bound search for random trees.
Random Struct. Algorithms, 1999
Lower Bounds for Bayes Error Estimation.
IEEE Trans. Pattern Anal. Mach. Intell., 1999
Properties of Random Triangulations and Trees.
Discret. Comput. Geom., 1999
A Note on the Expected Time for Finding Maxima by List Algorithms.
Algorithmica, 1999
Fast delaunay point location with search structures.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999
1998
Universal Limit Laws for Depths in Random Trees.
SIAM J. Comput., 1998
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms.
SIAM J. Comput., 1998
A study of random Weyl trees.
Random Struct. Algorithms, 1998
On the Richness of the Collection of Subtrees in Random Binary Search Trees.
Inf. Process. Lett., 1998
Intersections with random geometric objects.
Comput. Geom., 1998
A Note on Point Location in Delaunay Triangulations of Random Points.
Algorithmica, 1998
1997
Random Variate Generation for Multivariate Unimodal Densities.
ACM Trans. Model. Comput. Simul., 1997
1996
On the Horton-Strahler Number for Random Tries.
RAIRO Theor. Informatics Appl., 1996
Random Variate Generation in One Line of Code.
Proceedings of the 28th conference on Winter simulation, 1996
A Probabilistic Theory of Pattern Recognition
Stochastic Modelling and Applied Probability 31, Springer, ISBN: 978-1-4612-0711-5, 1996
1995
On the Variance of the Height of Random Binary Search Trees.
SIAM J. Comput., 1995
On the Generation of Random Binary Search Trees.
SIAM J. Comput., 1995
The Strong Convergence of Maximal Degrees in Uniform Random Recursive Trees and Dags.
Random Struct. Algorithms, 1995
Lower bounds in pattern recognition and learning.
Pattern Recognit., 1995
A Note on the Horton-Strahler Number for Random Trees.
Inf. Process. Lett., 1995
The Botanical Beauty of Random Binary Trees.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995
1994
On Random Cartesian Trees.
Random Struct. Algorithms, 1994
Intersections of random line segments.
Int. J. Comput. Geom. Appl., 1994
1993
Convex Hulls for Random Lines.
J. Algorithms, 1993
On the Expected Height of Fringe-Balanced Trees.
Acta Informatica, 1993
1992
A Note on the Height of Suffix Trees.
SIAM J. Comput., 1992
A Note on the Probabilistic Analysis of Patricia Trees.
Random Struct. Algorithms, 1992
Generation of random objects.
Proceedings of the 24th Winter Simulation Conference, 1992
1991
Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence.
SIAM J. Sci. Comput., 1991
Limit Laws for Local Counters in Random Binary Search Tree.
Random Struct. Algorithms, 1991
Expected time analysis of a simple recursive Poisson random variate generator.
Computing, 1991
1990
An Analysis of Random d-Dimensional Quad Trees.
SIAM J. Comput., 1990
On the Height of Random m-ary Search Trees.
Random Struct. Algorithms, 1990
Coupled Samples in Simulation.
Oper. Res., 1990
1989
On Global Costs and Nyquist's Theorem in Random Variate Generation.
Math. Oper. Res., 1989
Probabilistic Analysis of Algorithms and Data Structures.
Proceedings of the Algorithms and Data Structures, 1989
1988
Automatic Pattern Recognition: A Study of the Probability of Error.
IEEE Trans. Pattern Anal. Mach. Intell., 1988
Applications of the Theory of Records in the Study of Random Trees.
Acta Informatica, 1988
Generating sums in constant average time.
Proceedings of the 20th conference on Winter simulation, 1988
1987
A simple generator for discrete log-concave distributions.
Computing, 1987
Branching Processes in the Analysis of the Heights of Trees.
Acta Informatica, 1987
1986
A note on the height of binary search trees.
J. ACM, 1986
Grid methods in simulation and random variate generation.
Computing, 1986
Sample-based non-uniform random variate generation.
Proceedings of the 18th conference on Winter simulation, 1986
Non-Uniform Random Variate Generation
Springer, ISBN: 978-1-4613-8643-8, 1986
1985
Data Structures in Kernel Density Estimation.
IEEE Trans. Pattern Anal. Mach. Intell., 1985
The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform.
J. Algorithms, 1985
A Note on the Expected Time Required to Construct the Outer Layer.
Inf. Process. Lett., 1985
1984
Exponential Bounds for the Running Time of a Selection Algorithm.
J. Comput. Syst. Sci., 1984
A simple algorithm for generating random variates with a log-concave density.
Computing, 1984
Random variate generation for unimodal and monotone densities.
Computing, 1984
A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort.
Acta Informatica, 1984
1983
Moment inequalities for random variables in computational geometry.
Computing, 1983
Linear Sorting with O(log n) Processors.
BIT, 1983
1982
Any Discrimination Rule Can Have an Arbitrarily Bad Probability of Error for Finite Sample Size.
IEEE Trans. Pattern Anal. Mach. Intell., 1982
A note on the average depth of tries.
Computing, 1982
8 Nearest neighbor methods in discrimination.
Proceedings of the Classification, Pattern Recognition and Reduction of Dimensionality, 1982
1981
On the Inequality of Cover and Hart in Nearest Neighbor Discrimination.
IEEE Trans. Pattern Anal. Mach. Intell., 1981
A note on linear expected time algorithms for finding convex hulls.
Computing, 1981
Average time behavior of distributive sorting algorithms.
Computing, 1981
The computer generation of poisson random variables.
Computing, 1981
Recent results in non-uniform random variate generation.
Proceedings of the 13th conference on Winter simulation, 1981
1980
A Note on Finding Convex Hulls Via Maximal Vectors.
Inf. Process. Lett., 1980
1979
Distribution-free performance bounds for potential function rules.
IEEE Trans. Inf. Theory, 1979
Distribution-free performance bounds with the resubstitution error estimate (Corresp.).
IEEE Trans. Inf. Theory, 1979
Distribution-free inequalities for the deleted and holdout error estimates.
IEEE Trans. Inf. Theory, 1979
Inequalities for the Completion Times of Stochastic PERT Networks.
Math. Oper. Res., 1979
1978
The uniform convergence of nearest neighbor regression function estimators and their application in optimization.
IEEE Trans. Inf. Theory, 1978
Progressive global random search of continuous functions.
Math. Program., 1978
1976
Probabilistic Search as a Strategy Selection Procedure.
IEEE Trans. Syst. Man Cybern., 1976
On the Convergence of Statistical Search.
IEEE Trans. Syst. Man Cybern., 1976
A distribution-free performance bound in error estimation (Corresp.).
IEEE Trans. Inf. Theory, 1976
