Luc Devroye | Academic Influence

Luc Devroye's AcademicInfluence.com Rankings

Luc Devroye

Computer Science

#1937

World Rank

#2012

Historical Rank

Machine Learning

#168

World Rank

#169

Historical Rank

computer-science Degrees

Luc Devroye

Mathematics

#2906

World Rank

#4386

Historical Rank

Measure Theory

#232

World Rank

#363

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Luc Devroye's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics Université catholique de Louvain

Similar Degrees You Can Earn

Why Is Luc Devroye Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Luc P. Devroye is a Belgian computer scientist and mathematician and a James McGill Professor in the School of Computer Science of McGill University in Montreal, Quebec, Canada. Devroye wrote around 300 mathematical articles, mostly on probabilistic analysis of algorithms, on the asymptotic analysis of combinatorial structures , and on random number generation .

(See a Problem?)

Luc Devroye's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Non-Uniform Random Variate Generation (1986) (4131)
A Probabilistic Theory of Pattern Recognition (1996) (3744)
Combinatorial methods in density estimation (2001) (796)
Nonparametric density estimation : the L[1] view (1987) (657)
A Course in Density Estimation (1987) (543)
Consistency of Random Forests and Other Averaging Classifiers (2008) (526)
Nonparametric Density Estimation (1985) (469)
Nonparametric Density Estimation: The L 1 View. (1985) (464)
On the Strong Universal Consistency of Nearest Neighbor Regression Function Estimates (1994) (297)
A note on the height of binary search trees (1986) (251)
Distribution-Free Consistency Results in Nonparametric Discrimination and Regression Function Estimation (1980) (250)
On the Almost Everywhere Convergence of Nonparametric Regression Function Estimates (1981) (222)
Distribution-free performance bounds for potential function rules (1979) (210)
Sample-based non-uniform random variate generation (1986) (204)
Detection of Abnormal Behavior Via Nonparametric Estimation of the Support (1980) (188)
Lectures on the Nearest Neighbor Method (2015) (172)
The Equivalence of Weak, Strong and Complete Convergence in $L_1$ for Kernel Density Estimates (1983) (155)
Automatic Pattern Recognition: A Study of the Probability of Error (1988) (154)
On the Spanning Ratio of Gabriel Graphs and beta-skeletons (2002) (151)
Consistent deconvolution in density estimation (1989) (151)
On the Performance of Clustering in Hilbert Spaces (2008) (146)
The Strong Uniform Consistency of Nearest Neighbor Density Estimates. (1977) (145)
The total variation distance between high-dimensional Gaussians (2018) (141)
The uniform convergence of nearest neighbor regression function estimators and their application in optimization (1978) (135)
Sub-Gaussian mean estimators (2015) (134)
Distribution-free inequalities for the deleted and holdout error estimates (1979) (126)
Random variate generation for exponentially and polynomially tilted stable distributions (2009) (126)
Laws of the Iterated Logarithm for Order Statistics of Uniform Spacings (1981) (126)
Exponential Inequalities in Nonparametric Estimation (1991) (124)
A simple algorithm for generating random variates with a log-concave density (1984) (124)
Universal Limit Laws for Depths in Random Trees (1999) (116)
An equivalence theorem for L1 convergence of the kernel regression estimate (1989) (112)
Combinatorial Testing Problems (2009) (107)
On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification (2010) (107)
Branching processes in the analysis of the heights of trees (1987) (105)
Universal smoothing factor selection in density estimation: theory and practice (1997) (105)
On the Inequality of Cover and Hart in Nearest Neighbor Discrimination (1981) (102)
Necessary and sufficient conditions for the pointwise convergence of nearest neighbor regression function estimates (1982) (100)
A NOTE ON LINNIK'S DISTRIBUTION (1990) (99)
On the L1 convergence of kernel estimators of regression functions with applications in discrimination (1980) (97)
Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms (1998) (95)
A triptych of discrete distributions related to the stable law (1993) (93)
A Note on the Usefulness of Superkernels in Density Estimation (1992) (88)
A Note on Point Location in Delaunay Triangulations of Random Points (1998) (85)
The double kernel method in density estimation (1989) (81)
8 Nearest neighbor methods in discrimination (1982) (79)
A universally acceptable smoothing factor for kernel density estimates (1996) (78)
The uniform convergence of the nadaraya‐watson regression function estimate (1978) (76)
Bounds for the Uniform Deviation of Empirical Measures (1982) (76)
Random variate generation in one line of code (1996) (76)
Cuckoo hashing: Further analysis (2003) (76)
Applications of the theory of records in the study of random trees (1988) (75)
Any Discrimination Rule Can Have an Arbitrarily Bad Probability of Error for Finite Sample Size (1982) (74)
Limit Laws for Local Counters in Random Binary Search Tree (1991) (73)
Nonasymptotic universal smoothing factors, kernel complexity and yatracos classes (1997) (73)
Exact Convergence Rate in the Limit Theorems of Erdos-Renyi and Shepp (1986) (72)
Lower Bounds for Bayes Error Estimation (1999) (70)
Inequalities for the Completion Times of Stochastic PERT Networks (1979) (67)
Chapter 4 Nonuniform Random Variate Generation (2006) (67)
Lower bounds in pattern recognition and learning (1995) (67)
A Note on the Height of Suffix Trees (1992) (66)
A weighted k-nearest neighbor density estimate for geometric inference (2011) (64)
Lecture Notes on Bucket Algorithms (1986) (63)
Limit laws of Erdös-Rényi-Shepp type (1987) (63)
THE EXPECTED SIZE OF SOME GRAPHS IN COMPUTATIONAL GEOMETRY (1988) (61)
The $L_1$ Convergence of Kernel Density Estimates (1979) (57)
Expected time analysis for Delaunay point location (2004) (56)
Sub-Gaussian tail bounds for the width and height of conditioned Galton--Watson trees (2010) (56)
Finding Adam in random growing trees (2014) (56)
SIMULATING BESSEL RANDOM VARIABLES (2002) (55)
Progressive global random search of continuous functions (1978) (51)
High-dimensional random geometric graphs and their clique number (2011) (51)
A Study of Trie-Like Structures Under the Density Model (1992) (50)
A Note on Finding Convex Hulls Via Maximal Vectors (1980) (50)
Large Deviations for the Weighted Height of an Extended Class of Trees (2006) (49)
On the Asymptotic Probability of Error in Nonparametric Discrimination (1981) (49)
Maxima in hypercubes (2005) (48)
On the Variance of the Height of Random Binary Search Trees (1995) (48)
General Principles in Random Variate Generation (1986) (47)
The height of increasing trees (2008) (47)
ON THE SPANNING RATIO OF GABRIEL GRAPHS AND β-SKELETONS (2002) (46)
A Limit Theory for Random Skip Lists (1992) (46)
Random variate generation for the generalized inverse Gaussian distribution (2014) (44)
Large deviations of divergence measures on partitions (2001) (43)
An affine invariant k-nearest neighbor regression estimate (2012) (42)
On arbitrarily slow rates of global convergence in density estimation (1983) (41)
Random variate generation for multivariate unimodal densities (1997) (41)
Analysis of range search for random k-d trees (2001) (39)
On the computer generation of random variables with a given characteristic function (1981) (39)
An Analysis of Random d-Dimensional Quad Trees (1990) (39)
A Log Log Law for Maximal Uniform Spacings (1982) (38)
The Strong Convergence of Maximal Degrees in Uniform Random Recursive Trees and Dags (1995) (38)
Almost all Delaunay triangulations have stretch factor greater than pi/2 (2011) (37)
Squarish k-d Trees (2000) (37)
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees (2002) (36)
A probabilistic analysis of the height of tries and of the complexity of triesort (1984) (36)
The Series Method for Random Variate Generation and Its Application to the Kolmogorov-Smirnov Distribution (1981) (35)
Prediction by random-walk perturbation (2013) (35)
Random walks on highly symmetric graphs (1990) (35)
Laws of large numbers and tail inequalities for random tries and PATRICIA trees (2002) (35)
No Empirical Probability Measure can Converge in the Total Variation Sense for all Distributions (1990) (35)
Nonparametric Discrimination and Density Estimation. (1976) (34)
Protected nodes and fringe subtrees in some random trees (2013) (34)
The kernel estimate is relatively stable (1988) (34)
Generating the maximum of independent identically distributed random variables (1980) (33)
Properties of Random Triangulations and Trees (1999) (32)
Simulating Perpetuities (2001) (32)
On the Hilbert kernel density estimate (1999) (31)
On the Convergence of Statistical Search (1976) (31)
A note on linear expected time algorithms for finding convex hulls (1981) (30)
Distribution-free performance bounds with the resubstitution error estimate (Corresp.) (1979) (30)
Connectivity of inhomogeneous random graphs (2012) (30)
An analysis of a decomposition heuristic for the assignment problem (1985) (30)
A simple generator for discrete log-concave distributions (1987) (29)
Universal Asymptotics for Random Tries and PATRICIA Trees (2005) (29)
A note on the average depth of tries (1982) (29)
A Note on the Probabilistic Analysis of Patricia Trees (1992) (29)
Simulating Size-constrained Galton-Watson Trees (2012) (29)
On exact simulation algorithms for some distributions related to Jacobi theta functions (2009) (29)
A Note on the Horton-Strahler Number for Random Trees (1995) (29)
Discrete Univariate Distributions (1986) (29)
On simulation and properties of the stable law (2014) (28)
Variable Kernel Estimates: On the Impossibility of Tuning the Parameters (1998) (28)
Asymptotic Normality of L 1-Error in Density Estimation (1995) (28)
The Consistency of Automatic Kernel Density Estimates (1984) (27)
WIDTH AND MODE OF THE PROFILE FOR SOME RANDOM TREES OF LOGARITHMIC HEIGHT (2006) (27)
Distribution-Free Lower Bounds in Density Estimation (1984) (27)
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms (1999) (26)
On the Height of Random m-ary Search Trees (1990) (26)
Intersections with random geometric objects (1998) (26)
On the stabbing number of a random Delaunay triangulation (2007) (26)
Asymptotic Performance Bounds for the Kernel Estimate (1988) (26)
On random variate generation when only moments or Fourier coefficients are known (1989) (26)
Considerations for the independent reaction times and step-by-step methods for radiation chemistry simulations (2017) (26)
Perfect simulation from the Quicksort limit distribution (2000) (25)
Density approximation and exact simulation of random variables that are solutions of fixed-point equations (2002) (25)
Distances and Finger Search in Random Binary Search Trees (2004) (25)
On explosions in heavy-tailed branching random walks (2011) (25)
New Multivariate Product Density Estimators (2002) (24)
Bin width selection in multivariate histograms by the combinatorial method (2004) (24)
How to reduce the average complexity of convex hull finding algorithms (1981) (24)
The spanning ratio of the Delaunay triangulation is greater than pi/2 (2009) (24)
Exponential Bounds for the Running Time of a Selection Algorithm (1984) (23)
Recursive estimation of the mode of a multivariate density (1979) (23)
Simulating the Dickman distribution (2010) (23)
On the Probablistic Worst-Case Time of ``Find'' (2001) (23)
Growth of neurites toward neurite- neurite contact sites increases synaptic clustering and secretion and is regulated by synaptic activity. (2006) (22)
RECORDS, THE MAXIMAL LAYER, AND UNIFORM DISTRIBUTIONS IN MONOTONE SETS (1993) (22)
The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform (1985) (22)
The computer generation of poisson random variables (1981) (22)
The Hilbert Kernel Regression Estimate (1998) (22)
Almost sure classification of densities (2002) (21)
A Note on the $L_1$ Consistency of Variable Kernel Estimates (1985) (21)
The Minimax Learning Rate of Normal and Ising Undirected Graphical Models (2018) (21)
Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence (1991) (20)
Estimating the number of vertices of a polyhedron (2000) (20)
On the impossibility of estimating densities in the extreme tail (1999) (20)
A note on robust hypothesis testing (2002) (20)
A distribution-free performance bound in error estimation (Corresp.) (1976) (20)
Non-parametric Density Estimation (1985) (20)
Recent Developments in Applied Probability and Statistics (2010) (19)
Upper and lower class sequences for minimal uniform spacings (1982) (19)
On the Relationship Between Stability of Extreme Order Statistics and Convergence of the Maximum Likelihood Kernel Density Estimate (1989) (18)
Strong laws for the maximal k-spacing when k≦c log n (1984) (18)
Convex Hulls for Random Lines (1993) (18)
On Combinatorial Testing Problems 1 (2010) (18)
Estimation of a Density Using Real and Artificial Data (2013) (17)
Connectivity threshold of Bluetooth graphs (2011) (17)
On Exact Simulation Algorithms for Some Distributions Related to Brownian Motion and Brownian Meanders (2010) (17)
Nonparametric estimation of a function from noiseless observations at random points (2017) (17)
On the expected height of fringe-balanced trees (1993) (16)
Strong Universal Consistent Estimate of the Minimum Mean Squared Error (2013) (16)
Another proof of a slow convergence result of Birgé (1995) (16)
On Worst-Case Robin Hood Hashing (2004) (16)
On the measure of Voronoi cells (2015) (16)
A note on generating random variables with log-concave densities (2012) (16)
Diamonds are Not a Minimum Weight Triangulation's Best Friend (1996) (16)
A Uniform Bound for the Deviation of Empirical Distribution Functions (1977) (15)
Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees (2008) (15)
A Uniform Bound for the Deviation of Empirical Distribution Functions (1977) (15)
How easy is a given density to estimate (1993) (15)
Depth Properties of scaled attachment random recursive trees (2012) (15)
On the discovery of the seed in uniform attachment trees (2018) (15)
Distribution and Density Estimation (2002) (14)
The double CFTP method (2011) (14)
Random variate generation for unimodal and monotone densities (1984) (14)
Methods for generating random variates with Polya characteristic functions (1984) (14)
On the recovery of discrete probability densities from imperfect measurements (1979) (14)
The Botanical Beauty of Random Binary Trees (1995) (14)
A branching process method in Lagrance random variate generation (1992) (14)
Long and short paths in uniform random recursive dags (2009) (14)
Analysis of random LC tries (2001) (14)
Weighted height of random trees (2008) (13)
Transversals in Trees (2007) (13)
A universal lower bound for the kernel estimate (1989) (13)
On the risk of estimates for block decreasing densities (2003) (13)
Density estimation by the penalized combinatorial method (2005) (13)
Random fonts for the simulation of handwriting (1995) (13)
Data Structures in Kernel Density Estimation (1985) (13)
Random variate generation for the digamma and trigamma distributions (1992) (13)
On the computer generation of random convex hulls (1982) (13)
Note on the Structure of Kruskal’s Algorithm (2010) (12)
On the non-consistency of an estimate of Chiu☆ (1994) (12)
Two-Way Chaining with Reassignment (2005) (12)
Expected Time Analysis of Algorithms in Computational Geometry (1985) (12)
A Note on the Expected Time for Finding Maxima by List Algorithms (1999) (12)
A note on approximations in random variate generation (1982) (12)
THE EQUIVALENCE OF WEAK , STRONG AND COMPLETE CONVERGENCE IN Ll FOR KERNEL DENSITY ESTIMATES ' BY LUC DEVROYE McGill (1983) (12)
Moment inequalities for random variables in computational geometry (1983) (11)
Coupled Samples in Simulation (1990) (11)
Copulas with Prescribed Correlation Matrix (2015) (11)
On the use of probability inequalities in random variate generation (1984) (11)
Consistency of a recursive nearest neighbor regression function estimate (1980) (11)
On the Horton-Strahler Number for Random Tries (1996) (10)
Explosion and linear transit times in infinite trees (2014) (10)
Nonparametric density estimates with improved . performance on given sets of densities (1989) (10)
Copulas in three dimensions with prescribed correlations (2010) (10)
On the expected maximum degree of Gabriel and Yao graphs (2009) (10)
Cellular Tree Classifiers (2013) (10)
Fast delaunay point location with search structures (1999) (10)
On Random Cartesian Trees (1994) (10)
On the Richness of the Collection of Subtrees in Random Binary Search Trees (1998) (10)
Local tail bounds for functions of independent random variables (2007) (10)
The limit behavior of an interval splitting scheme (1986) (10)
Applications of Stein's method in the analysis of random binary search trees (2005) (10)
A nearest neighbor estimate of the residual variance (2018) (10)
On random variate generation for the generalized hyperbolic secant distributions (1993) (9)
Random sampling of the Green's Functions for reversible reactions with an intermediate state (2013) (9)
On the average complexity of some bucketing algorithms (1981) (9)
On the non-consistency of the L2-cross-validated kernel density estimate (1989) (9)
Memoryless routing in convex subdivisions: Random walks are optimal (2009) (9)
Sampling with arbitrary precision (2015) (9)
Complexity Questions in Non-Uniform Random Variate Generation (2010) (9)
On the Generation of Random Binary Search Trees (1995) (9)
A Probabilistic Analysis of Kademlia Networks (2013) (9)
The Height of List-tries and TST (2007) (8)
A Note on the Expected Time Required to Construct the Outer Layer (1985) (8)
$k$-cut on paths and some trees (2018) (8)
Connectivity for line-of-sight networks in higher dimensions (2013) (8)
Simulating theta random variates (1997) (8)
Random Search Under Additive Noise (2002) (8)
Generating sums in constant average time (1988) (8)
Average time behavior of distributive sorting algorithms (1981) (8)
The consistency of a smoothed minimum distance estimate (1996) (8)
On Good Deterministic Smoothing Sequences for Kernel Density Estimates (1994) (8)
Inequalities for a new data-based method for selecting nonparametric density estimates (1998) (8)
A note on the probability of cutting a Galton-Watson tree (2011) (7)
Random-Walk Perturbations for Online Combinatorial Optimization (2015) (7)
On the effect of density shape on the performance of its kernel estimate (1993) (7)
On the complexity of branch-and-bound search for random trees (1999) (7)
Estimation of a distribution from data with small measurement errors (2013) (7)
Probabilistic behavior of asymmetric level compressed tries (2005) (7)
A Limit Law for the Root Value of Minimax Trees (2005) (7)
The graph structure of a deterministic automaton chosen at random (2015) (6)
The analysis of some algorithms for generating random variates with a given hazard rate (1986) (6)
Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution (2016) (6)
Recent Results on the Average Time Behavior of Some Algorithms in Computational Geometry (1981) (6)
Giant Components for Two Expanding Graph Processes (2002) (6)
Computer-Assisted Information Searching on Internet (1997) (6)
Broadcasting on random recursive trees (2020) (6)
On Generating Random Intervals and Hyperrectangles (1993) (6)
L1-consistent estimation of the density of residuals in random design regression models (2012) (6)
A study of random Weyl trees (1998) (6)
An Application of the Efron-Stein Inequality in Density Estimation (1987) (6)
The expected bit complexity of the von Neumann rejection algorithm (2015) (6)
The Height and Size of Random Hash Trees and Random Pebbled Hash Trees (1999) (6)
An Analysis of the Height of Tries with Random Weights on the Edges (2008) (6)
Random variate generators for the Poisson-Poisson and related distributions (1989) (6)
The Random Connection Model on the Torus (2014) (5)
Random suffix search trees (2003) (5)
Odds-On Trees (2010) (5)
On the oscillation of the expected number of extreme points of a random set (1991) (5)
Recursive functions on conditional Galton‐Watson trees (2018) (5)
A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees (2016) (5)
Consistency of the k-Nearest Neighbor Rule (1996) (5)
Linear sorting withO(logn) processors (1983) (5)
The Kernel Density Estimate (2001) (4)
Almost optimal sparsification of random geometric graphs (2014) (4)
CONVERGENCE OF THE KERNEL REGRESSION ESTIMATE * (1989) (4)
On the complexity of branch-and bound search for random trees (1999) (4)
A note on density model size testing (2004) (4)
Random Hyperplane Search Trees (2009) (4)
Local optima of the Sherrington-Kirkpatrick Hamiltonian (2017) (4)
Probabilistic Search as a Strategy Selection Procedure (1976) (4)
Strongly consistent model selection for densities (2008) (4)
The Analysis of Kademlia for Random IDs (2014) (4)
Hipster random walks (2019) (4)
The height of scaled attachment random recursive trees (2010) (4)
Distribution and Density Estimation 5.1 Distribution Estimation (4)
An Analysis of Budgeted Parallel Search on Conditional Galton–Watson Trees (2017) (4)
Exact simulation for the GHZ distribution (2013) (3)
Uniform and Exponential Spacings (1986) (3)
On the k-orientability of random graphs (2009) (3)
Multiple choice tries and distributed hash tables (2007) (3)
Calculations of distance distributions and probabilities of binding by ligands between parallel plane membranes comprising receptors (2014) (3)
On the properties of convergence of statistical search (1974) (3)
Weighted k -nearest neighbor density estimates (2015) (3)
A Note on Interference in Random Point Sets (2012) (3)
Random Minimax Game Trees (1996) (3)
A mixed stochastic optimization algorithm and its applications in pattern recognition (1973) (2)
The k-nearest neighbor density estimate (2015) (2)
On Random Search with a Learning Memory (1976) (2)
Formatting Font Formats (2003) (2)
Cutting resilient networks (2018) (2)
Connectivity of sparse Bluetooth networks (2014) (2)
The Bayes Error (1996) (2)
Discrete minimax estimation with trees (2018) (2)
Root estimation in Galton–Watson trees (2020) (2)
Point Location in Disconnected Planar Subdivisions (2010) (2)
Continuous Univariate Densities (1986) (2)
Intersections of random line segments (1994) (2)
Expected worst-case partial match in random quadtries (2004) (2)
Error Exponents for Hypothesis Testing of the General Source (2005) (2)
Binary search trees based on Weyl and Lehmer sequences (1998) (2)
Grid methods in simulation and random variate generation (1986) (2)
The Poisson Process (1986) (2)
The nearest neighbor distance (2015) (2)
Remote Sampling with Applications to General Entanglement Simulation (2018) (2)
Nearest Neighbor Rules (1996) (2)
Notes on growing a tree in a graph (2017) (2)
A nearest neighbor estimate of a regression functional * (2017) (2)
Discrete Random Variates (1986) (2)
Exceptional rotations of random graphs: a VC theory (2015) (2)
A Note on Interference in Random Networks (2012) (2)
The Resubstitution Estimate (1996) (1)
Random variate generation using only finitely many unbiased, independently and identically distributed random bits. (2020) (1)
The Maximal Cardinality (1986) (1)
The Maximum Likelihood Principle (1996) (1)
The heavy path approach to Galton-Watson trees with an application to Apollonian networks (2017) (1)
Inequalities and Alternate Distance Measures (1996) (1)
The Locker Problem with Empty Lockers (2009) (1)
On Mean Estimation for Heteroscedastic Random Variables (2020) (1)
RANDOM SEARCH IN AUTOMATIC FONT GENERATION (1)
Deleted Estimates of the Error Probability (1996) (1)
Expected time analysis of a simple recursive Poisson random variate generator (1991) (1)
The 1-nearest neighbor regression function estimate (2015) (1)
Nonparametric Detection of Changes in System Characteristics. (1977) (1)
Weighted Heights of Random Trees (2007) (1)
The Horton–Strahler number of conditioned Galton–Watson trees (2020) (1)
Analysis of random trees (2000) (1)
Automatic selection of a discrimination rule based upon minimization of the empirical risk (1987) (1)
Probabilistic Analysis of Algorithms and Data Structures (1989) (1)
A lower bound on the size of an absorbing set in an arc-coloured tournament (2017) (1)
Choosing a Density Estimate (2001) (1)
Probability Theory on Trees and Analysis of Algorithms (2004) (1)
Uniform Laws of Large Numbers (1996) (1)
The independence number of a Bienaymé – Galton – Watson tree and related parameters (2021) (1)
MODE OF THE PROFILE FOR RANDOM TREES OF LOGARITHMIC HEIGHT 1 (2005) (1)
On the Green's function of the partially diffusion-controlled reversible ABCD reaction for radiation chemistry codes (2015) (1)
First-Passage Percolation Time on Hypercubes (2017) (1)
Splitting the Data (1996) (1)
Random Triangulations ( Extended Abstract ) (1996) (1)
On simulation and properties of the stable law (2014) (1)
The Random Bit Model (1986) (1)
k -cuts on a Path (2019) (1)
Recent Developments in Applied Probability and Statistics: Dedicated to the Memory of Jrgen Lehn (2010) (1)
An application of Stein’s method to maxima in hypercubes (2004) (1)
Condensed and Edited Nearest Neighbor Rules (1996) (1)
Leaf multiplicity in a Bienaymé-Galton-Watson tree (2021) (0)
Consistent Density Estimation Under Discrete Mixture Models (2021) (0)
ON RANDOM SEARCH WITH A LEARNING MEMORY i'il;'i,if ~'l.! (2005) (0)
Succinct Data Structures for Approximating Convex Functions with Applications (2002) (0)
My title (2009) (0)
Automatic Nearest Neighbor Rules (1996) (0)
Densities with Unbounded Support (1986) (0)
Subtractive random forests (2022) (0)
Automatic Kernel Rules (1996) (0)
Hypercubes and Discrete Spaces (1996) (0)
Epsilon Entropy and Totally Bounded Sets (1996) (0)
The dilation of the Delaunay triangulation is greater than π/2 (2010) (0)
Analysis of Bucket Sorting and Searching (1986) (0)
Random Combinatorial Objects (1986) (0)
Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications) - RIAO 1997, 5th International Conference, McGill University, Montreal, Canada, June 25-27, 1997. Proceedings (1997) (0)
Generation of random objects (1992) (0)
LINEAR SORTING WITH O ( Iog n ) PROCESSORS (2003) (0)
The Regular Histogram Rule (1996) (0)
Heavy subtrees of Galton-Watson trees with an application to Apollonian networks (2019) (0)
Table Methods for Continuous Random Variates (1986) (0)
Bandwidth Choice with Superkernels (2001) (0)
Multiparameter Kernel Estimates (2001) (0)
Bandwidth Selection for Kernel Estimates (2001) (0)
Random variate generation for the truncated negative gamma distribution (2021) (0)
Combinatorial Aspects of Vapnik-Chervonenkis Theory (1996) (0)
The Transformed Kernel Estimate (2001) (0)
The Minimum Distance Estimate: Examples (2001) (0)
Classification and Trees (2010) (0)
Exact Classical Simulation of the GHZ Distribution (2014) (0)
Recent results in non-uniform random variate generation (1981) (0)
Explosion and linear transit times in infinite trees (2015) (0)
On Global Costs and Nyquist's Theorem in Random Variate Generation (1989) (0)
Paul Erdös memorial lecture (2002) (0)
Almost sure testability of classes of densities (1999) (0)
Probability, Trees and Algorithms (2014) (0)
The expected bit complexity of the von Neumann rejection algorithm (2016) (0)
Electronic Communications in Probability Perfect Simulation from the Quicksort Limit Distribution (2000) (0)
Regression: the noiseless case (2015) (0)
Auxiliary Results from Probability Theory (1986) (0)
Random Multivariate Search Trees (2006) (0)
Other Error Estimates (1996) (0)
A Note on Robust Detection (2000) (0)
Rejoinder (2014) (0)
Subtractive random forests (cid:42) (2022) (0)
On Tractable Markov Random Field Models and MapReduce Algorithms: Towards a Practitioner's Toolbox (2013) (0)
k-cut on paths and some trees. Electronic of (2019) (0)
Slow Rates of Convergence (1996) (0)
L p -consistency and Stone’s theorem (2015) (0)
Probabilistic Shortcuts and Additional Topics (1986) (0)
Rates of convergence (2015) (0)
Asymptotic Properties of Clustering Algorithms (1977) (0)
Data-Dependent Partitioning (1996) (0)
On the Consistency of the Kozachenko-Leonenko Entropy Estimate (2021) (0)
Uniform Deviation Inequalities (2001) (0)
Hipster randomwalks (2020) (0)
EJP 318 k-cut on paths and some trees * (2019) (0)
A Proletarian Approach to Generating Eigenvalues of GUE Matrices (2023) (0)
On the Green’s function of the partially diffusion-controlled reversible ABCD reaction for radiation chemistry codes Authors’ names (2015) (0)
Advanced properties of uniform order statistics (2015) (0)
Lower Bounds for Empirical Classifier Selection (1996) (0)
Random hyperplane search trees in high dimensions (2011) (0)
Generalized Linear Discrimination (1996) (0)
The nearest neighbor rule: fixed k (2015) (0)
Choosing the Kernel Order (2001) (0)
Branching random walk and searching in trees: final report (2010) (0)
Large deviations of divergence measures onpartitionsJan (2000) (0)
Acknowledgement to Referees (2001) (0)
A Note on Random Suffix Search Trees (2002) (0)
OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture) (2018) (0)
Hipster random walks (2020) (0)
Random Tries (2002) (0)
Note: Addendum to "The Strong Uniform Consistency of Nearest Neighbor Density Estimates" (1978) (0)
Topics in global convergence of density estimates (1982) (0)
Basics of classification (2015) (0)
Order statistics and nearest neighbors (2015) (0)
A NOTE ON THE USEFULNESS OF SUIPERKERNELS IN DENSITY ESTIMATION (1992) (0)
Acknowledgement to referees (2004) (0)
The choice of a nearest neighbor estimate (2015) (0)
Random variate generation for the generalized inverse Gaussian distribution (2012) (0)
Geometric Learning Algorithms Geometric Learning Algorithms (1990) (0)
Probabilistic Analysis of RRT Trees (2020) (0)
Computer-Assisted Information Searching on Internet - Volume 2 (1997) (0)
An Analysis of Budgeted Parallel Search on Conditional Galton–Watson Trees (2019) (0)
On the peel number and the leaf-height of Galton-Watson trees (2021) (0)
The nearest neighbor rule: variable k (2015) (0)
Automatic Pattern Recognition: A Probability of Error (1988) (0)
Estimating monotone densities by cellular binary trees (2022) (0)
ON GROWING A TREE IN A GRAPH À (2017) (0)
A Note on the Height of Suffi x Trees (1989) (0)
Advances in Stochastic Inequalities and their Applications (2009) (0)
OntheConvergence ofStatistical Search (1976) (0)
Additive Estimates and Data Splitting (2001) (0)

This paper list is powered by the following services:

Other Resources About Luc Devroye

What Schools Are Affiliated With Luc Devroye?

Luc Devroye is affiliated with the following schools:

Image Attributions

Image Source for Luc Devroye