Authors:
AVIS D
BERESFORDSMITH B
DEVROYE L
ELGINDY H
GUEVREMONT E
HURTADO F
ZHU BH
Citation: D. Avis et al., UNORIENTED THETA-MAXIMA IN THE PLANE - COMPLEXITY AND ALGORITHMS, SIAM journal on computing (Print), 28(1), 1999, pp. 278-296
Citation: L. Devroye, ON THE RICHNESS OF THE COLLECTION OF SUBTREES IN RANDOM BINARY SEARCH-TREES, Information processing letters, 65(4), 1998, pp. 195-199
Citation: L. Devroye et P. Kruszewski, ON THE HORTON-STRAHLER NUMBER FOR RANDOM TRIES, Informatique theorique et applications, 30(5), 1996, pp. 443-456
Citation: L. Devroye et G. Lugosi, A UNIVERSALLY ACCEPTABLE SMOOTHING FACTOR FOR KERNEL DENSITY ESTIMATES, Annals of statistics, 24(6), 1996, pp. 2499-2512
Citation: L. Devroye et J. Lu, THE STRONG-CONVERGENCE OF MAXIMAL DEGREES IN UNIFORM RANDOM RECURSIVETREES AND DAGS, Random structures & algorithms, 7(1), 1995, pp. 1-14
Citation: L. Devroye et al., ON THE STRONG UNIVERSAL CONSISTENCY OF NEAREST-NEIGHBOR REGRESSION FUNCTION ESTIMATES, Annals of statistics, 22(3), 1994, pp. 1371-1385