Luc's ecologically incorrect page
|
|
|
Luc's ecologically incorrect page |
|
|
|
|
|
|
|
L. Devroye, "A class of optimal performance-directed probabilistic automata," IEEE Transactions on Systems,Man and Cybernetics, vol. 6, pp. 777-784, 1976. |
|
|
|
L. Devroye, "On the convergence of statistical search," IEEE Transactions on Systems,Man and Cybernetics, vol. 6, pp. 46-56, 1976. |
|
|
|
L. Devroye and T.J. Wagner, "A distribution-free performance bound in error estimation," IEEE Transactions on Information Theory, vol. 22, pp. 586-587, 1976. |
|
|
|
L. Devroye, "Probabilistic search as a strategy selection procedure," IEEE Transactions on Systems, Man and Cybernetics, vol. 6, pp. 315-321, 1976. |
|
|
|
L. Devroye, "A uniform bound for the deviation of empirical distribution functions," Journal of Multivariate Analysis, vol. 7, pp. 594-597, 1977. |
|
|
|
L. Devroye and T.J. Wagner, "The strong uniform consistency of nearest neighbor density estimates," Annals of Statistics, vol. 5, pp. 536-540, 1977. |
|
|
|
L. Devroye, "An expanding automaton for use in stochastic optimization," Journal of Cybernetics and Information Science, vol. 1, pp. 82-94, 1977. |
|
|
|
L. Devroye, "Progressive global random search of continuous functions," Mathematical Programming, vol. 15, pp. 330-342, 1978. |
|
|
|
L. Devroye, "The uniform convergence of nearest neighbor regression function estimators and their application in optimization," IEEE Transactions on Information Theory, vol. 24, pp. 142-151, 1978. |
|
|
|
L. Devroye, "The uniform convergence of the Nadaraya-Watson regression function estimate," Canadian Journal of Statistics, vol. 6, pp. 179-191, 1978. |
|
|
|
L. Devroye, "On the pointwise and the integral convergence of recursive kernel estimates of probability densities," Utilitas Mathematica, vol. 15, pp. 113-128, 1979. |
|
|
|
L. Devroye and G.L. Wise, "On the recovery of discrete probability densities from imperfect measurements," Journal of the Franklin Institute, vol. 307, pp. 1-20, 1979. |
|
|
|
L. Devroye, "Recursive estimation of the mode of a multivariate density," Canadian Journal of Statistics, vol. 7, pp. 159-167, 1979. |
|
|
|
L. Devroye and T.J. Wagner, "Distribution-free probability inequalities for the deleted and holdout estimates," IEEE Transactions on Information Theory, vol. 25, pp. 202-207, 1979. |
|
|
|
L. Devroye and T.J. Wagner, "Distribution-free performance bounds with the resubstitution error estimate," IEEE Transactions on Information Theory, vol. 25, pp. 208-210, 1979. |
|
|
|
L. Devroye and T.J. Wagner, "Distribution-free performance bounds for potential function rules," IEEE Transactions on Information Theory, vol. 25, pp. 208-210, 1979. |
|
|
|
L. Devroye, "Inequalities for the completion times of stochastic PERT networks," Mathematics of Operations Research, vol. 4, pp. 441-447, 1979. |
|
|
|
L. Devroye and T.J. Wagner, "The L1 convergence of kernel density estimates," Annals of Statistics, vol. 7, pp. 1136-1139, 1979. |
|
|
|
L. Devroye, "Generating the maximum of independent identically distributed random variables," Computers and Mathematics with Applications, vol. 6, pp. 305-315, 1980. |
|
|
|
L. Devroye and T.J. Wagner, "On the L1 convergence of kernel estimators of regression functions with applications in discrimination," Zeitschrift f\"ur Wahrscheinlichleitstheorie und verwandte Gebiete, vol. 51, pp. 15-25, 1980. |
|
|
|
L. Devroye and G.L. Wise, "Detection of abnormal behavior via nonparametric estimation of the support," SIAM Journal on Applied Mathematics, vol. 38, pp. 480-488, 1980. |
|
|
|
L. Devroye and G.L. Wise, "Consistency of a recursive nearest neighbor regression function estimate," Journal of Multivariate Analysis, vol. 10, pp. 539-550, 1980. |
|
|
|
L. Devroye and T.J. Wagner, "Distribution-free consistency results in nonparametric discrimination and regression function estimation," Annals of Statistics, vol. 8, pp. 231-239, 1980. |
|
|
|
L. Devroye, "A note on finding convex hulls via maximal vectors," Information Processing Letters, vol. 11, pp. 53-56, 1980. |
|
|
|
L. Devroye and G.T. Toussaint, "A note on linear expected time algorithms for finding convex hulls," Computing, vol. 26, pp. 361-366, 1981. |
|
|
|
L. Devroye, "The computer generation of Poisson random variables," Computing, vol. 26, pp. 197-207, 1981. |
|
|
|
L. Devroye, "How to reduce the average complexity of convex hull finding algorithms," Computers and Mathematics with Applications, vol. 7, pp. 299-308, 1981. |
|
|
|
L. Devroye, "On the average complexity of some bucketing algorithms," Computers and Mathematics with Applications, vol. 7, pp. 407-412, 1981. |
|
|
|
L. Devroye, "The computer generation of random variables with a given characteristic function," Computers and Mathematics with Applications, vol. 7, pp. 547-552, 1981. |
|
|
|
L. Devroye, "The series method in random variate generation and its application to the Kolmogorov-Smirnov distribution," American Journal of Mathematical and Management Sciences, vol. 1, pp. 359-379, 1981. |
|
|
|
L. Devroye, "Laws of the iterated logarithm for order statistics of uniform spacings," Annals of Probability, vol. 9, pp. 860-867, 1981. |
|
|
|
L. Devroye, "On the inequality of Cover and Hart in nearest neighbor discrimination," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, pp. 75-78, 1981. |
|
|
|
L. Devroye, "On the asymptotic probability of error in nonparametric discrimination," Annals of Statistics, vol. 9, pp. 1320-1327, 1981. |
|
|
|
L. Devroye and T.Klincsek, "Average time behavior of distributive sorting algorithms," Computing, vol. 26, pp. 1-7, 1981. |
|
|
|
L. Devroye, "On the almost everywhere convergence of nonparametric regression function estimates," Annals of Statistics, vol. 9, pp. 1310-1319, 1981. |
|
|
|
L. Devroye, "A note on the average depth of tries," Computing, vol. 28, pp. 367-371, 1982. |
|
|
|
L. Devroye, "On the computer generation of random convex hulls," Computers and Mathematics with Applications, vol. 8, pp. 1-13, 1982. |
|
|
|
L. Devroye, "A note on approximations in random variate generation," Journal of Statistical Computation and Simulation, vol. 14, pp. 149-158, 1982. |
|
|
|
L. Devroye, "Bounds for the uniform deviation of empirical measures," Journal of Multivariate Analysis, vol. 12, pp. 72-79, 1982. |
|
|
|
L. Devroye, "A log log law for maximal uniform spacings," Annals of Probability, vol. 10, pp. 863-868, 1982. |
|
|
|
L. Devroye, "Upper and lower class sequences for minimal uniform spacings," Zeitschrift f\"ur Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 61, pp. 237-254, 1982. |
|
|
|
L. Devroye, "Any discrimination rule can have an arbitrarily bad probability of error for finite sample size," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 4, pp. 154-157, 1982. |
|
|
|
L. Devroye, "Necessary and sufficient conditions for the pointwise convergence of nearest neighbor regression function estimates," Zeitschrift f\"ur Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 61, pp. 467-481, 1982. |
|
|
|
L. Devroye, "Moment inequalities for random variables in computational geometry," Computing, vol. 30, pp. 111-119, 1983. |
|
|
|
J.A. Orenstein, T.H. Merrett, and L. Devroye, "Linear sorting with O(log n) processors," BIT, vol. 23, pp. 170-180, 1983. |
|
|
|
L. Devroye, "On arbitrarily slow rates of global convergence in density estimation," Zeitschrift f\"ur Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 62, pp. 475-483, 1983. |
|
|
|
L. Devroye, "The equivalence in L1 of weak, strong and complete convergence of kernel density estimates," Annals of Statistics, vol. 11, pp. 896-904, 1983. |
|
|
|
L. Devroye, "Random variate generation for unimodal and monotone densities," Computing, vol. 32, pp. 43-68, 1984. |
|
|
|
L. Devroye, "A simple algorithm for generating random variates with a log-concave density," Computing, vol. 33, pp. 247-257, 1984. |
|
|
|
L. Devroye, "A probabilistic analysis of the height of tries and of the complexity of triesort," Acta Informatica, vol. 21, pp. 229-237, 1984. |
|
|
|
L. Devroye, "Exponential bounds for the running time of a selection algorithm," Journal of Computers and System Sciences, vol. 29, pp. 1-7, 1984. |
|
|
|
L. Devroye, "On the use of probability inequalities in random variate generation," Journal of Statistical Computation and Simulation, vol. 20, pp. 91-100, 1984. |
|
|
|
P. Deheuvels and L. Devroye, "Strong laws for the maximal k-spacing when k is less than c log n," Zeitschrift f\"ur Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 66, pp. 315-334, 1984. |
|
|
|
L. Devroye, "The largest exponential spacing," Utilitas Mathematica, vol. 25, pp. 303-313, 1984. |
|
|
|
L. Devroye and C.S. Penrod, "Distribution-free lower bounds in density estimation," Annals of Statistics, vol. 12, pp. 1250-1262, 1984. |
|
|
|
L. Devroye and C.S. Penrod, "The consistency of automatic kernel density estimates," Annals of Statistics, vol. 12, pp. 1231-1249, 1984. |
|
|
|
L. Devroye, "Methods for generating random variates with Polya characteristic functions," Statistics and Probability Letters, vol. 2, pp. 257-261, 1984. |
|
|
|
L. Devroye, "The expected length of the longest probe sequence for bucket searching when the distribution is not uniform," Journal of Algorithms, vol. 6, pp. 1-9, 1985. |
|
|
|
L. Devroye, "On the expected time required to construct the outer layer," Information Processing Letters, vol. 20, pp. 255-257, 1985. |
|
|
|
L. Devroye and F. Machell, "Data structures in kernel density estimation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, pp. 360-366, 1985. |
|
|
|
D. Avis and L. Devroye, "The analysis of a decomposition heuristic for the assignment problem," Operations Research Letters, vol. 3, pp. 279-283, 1985. |
|
|
|
L. Devroye, "A note on the L1 consistency of variable kernel estimates," Annals of Statistics, vol. 13, pp. 1041-1049, 1985. |
|
|
|
L. Devroye and C.S. Penrod, "The strong uniform convergence of multivariate variable kernel estimates," Canadian Journal of Statistics, vol. 14, pp. 211-219, 1986. |
|
|
|
L. Devroye, "Grid methods in simulation and random variate generation," Computing, vol. 37, pp. 71-84, 1986. |
|
|
|
L. Devroye, "A note on the height of binary search trees," Journal of the ACM, vol. 33, pp. 489-498, 1986. |
|
|
|
L. Devroye, "An automatic method for generating random variables with a given characteristic function," SIAM Journal of Applied Mathematics, vol. 46, pp. 698-719, 1986. |
|
|
|
L. Devroye, G. Letac, and V. Seshadri, "The limit behavior of an interval splitting scheme," Statistics and Probability Letters, vol. 4, pp. 183-186, 1986. |
|
|
|
L. Devroye, "The analysis of some algorithms for generating random variates with a given hazard rate," Naval Research Logistics Quarterly, vol. 33, pp. 281-292, 1986. |
|
|
|
P. Deheuvels, L. Devroye, and J. Lynch, "Exact convergence rate in the limit theorems of Erd\"os-R\'enyi and Shepp," Annals of Probability, vol. 14, pp. 209-223, 1986. |
|
|
|
P. Deheuvels and L. Devroye, "Limit laws of Erd\"os-R\'enyi-Shepp type," Annals of Probability, vol. 15, pp. 1363-1386, 1987. |
|
|
|
L. Devroye, "An application of the Efron-Stein inequality in density estimation," Annals of Statistics, vol. 15, pp. 1317-1320, 1987. |
|
|
|
L. Devroye, "Branching processes in the analysis of the heights of trees," Acta Informatica, vol. 24, pp. 277-298, 1987. |
|
|
|
L. Devroye, "A simple generator for discrete log-concave distributions," Computing, vol. 39, pp. 87-91, 1987. |
|
|
|
L. Devroye, "Automatic pattern recognition: a study of the probability of error," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, pp. 530-543, 1988. |
|
|
|
L. Devroye, "On the expected size of some graphs in computational geometry," Computers and Mathematics with Applications, vol. 15, pp. 53-64, 1988. |
|
|
|
L. Devroye, "The kernel estimate is relatively stable," Probability Theory and Related Fields, vol. 77, pp. 521-536, 1988. |
|
|
|
L. Devroye, "Asymptotic performance bounds for the kernel estimate," Annals of Statistics, vol. 16, pp. 1162-1179, 1988. |
|
|
|
L. Devroye, "Applications of the theory of records in the study of random trees," Acta Informatica, vol. 26, pp. 123-130, 1988. |
|
|
|
L. Devroye, "Nyquist's theorem in random variate generation," Mathematics of Operations Research, vol. 14, pp. 224-236, 1989. |
|
|
|
L. Devroye, "Nonparametric density estimates with improved performance on given sets of densities," Statistics (Mathematische Operationsforschung und Statistik), vol. 20, pp. 357-376, 1989. |
|
|
|
L. Devroye, "On random variate generation when only moments or Fourier coefficients are known," Mathematics and Computers in Simulation, vol. 31, pp. 71-89, 1989. |
|
|
|
L. Devroye and A. Krzy\.zak, "An equivalence theorem for L1 convergence of the kernel regression estimate," Journal of Statistical Planning and Inference, vol. 23, pp. 71-82, 1989. |
|
|
|
M. Broniatowski, P. Deheuvels, and L. Devroye, "On the relationship between stability of extreme order statistics and convergence of the maximum likelihood kernel density estimate," Annals of Statistics, vol. 17, pp. 1070-1086, 1989. |
|
|
|
L. Devroye, "On the non-consistency of the L2 cross-validated kernel density estimate," Statistics and Probability Letters, vol. 8, pp. 425-433, 1989. |
|
|
|
L. Devroye, "A universal lower bound for the kernel estimate," Statistics and Probability Letters, vol. 8, pp. 419-423, 1989. |
|
|
|
L. Devroye, "The double kernel method in density estimation," Annales de l'Institut Henri Poincar\'e, vol. 25, pp. 533-580, 1989. |
|
|
|
L. Devroye, "Random variate generators for the Poisson-Poisson and related distributions," Computational Statistics and Data Analysis, vol. 8, pp. 247-278, 1989. |
|
|
|
L. Devroye, "Consistent deconvolution in density estimation," Canadian Journal of Statistics, vol. 17, pp. 235-239, 1989. |
|
|
|
A. Berlinet and L. Devroye, "Estimation d'une densit\'e: un point sur la m\'ethode du noyau," Statistique et Analyse des Donn\'ees, vol. 14, pp. 1-32, 1989. |
|
|
|
L. Devroye, "Coupled samples in simulation," Operations Research, vol. 38, pp. 115-126, 1990. |
|
|
|
L. Devroye, "A note on Linnik's distribution," Statistics and Probability Letters, vol. 9, pp. 305-306, 1990. |
|
|
|
L. Devroye and L. Gy\"orfi, "No empirical probability measure can converge in the total variation sense for all distributions," Annals of Statistics, vol. 18, pp. 1496-1499, 1990. |
|
|
|
L. Devroye and A. Sbihi, "Random walks on highly symmetric graphs," Journal of Theoretical Probability, vol. 3, pp. 497-514, 1990. |
|
|
|
L. Devroye, "On the height of random m-ary search trees," Random Structures and Algorithms, vol. 1, pp. 191-203, 1990. |
|
|
|
L. Devroye and L. Laforest, "An analysis of random d-dimensional quadtrees," SIAM Journal on Computing, vol. 19, pp. 821-832, 1990. |
|
|
|
L. Devroye, "Algorithms for generating discrete random variables with a given generating function or a given moment sequence," SIAM Journal on Scientific and Statistical Computing, vol. 12, pp. 107-126, 1991. |
|
|
|
L. Devroye, "Expected time analysis of a simple recursive Poisson random variate generator," Computing, vol. 46, pp. 165-173, 1991. |
|
|
|
L. Devroye, "On the oscillation of the expected number of points on a random convex hull," Statistics and Probability Letters, vol. 11, pp. 281-286, 1991. |
|
|
|
L. Devroye, "Limit laws for local counters in random binary search trees," Random Structures and Algorithms, vol. 2, pp. 303-316, 1991. |
|
|
|
L. Devroye, "A study of trie-like structures under the density model," Annals of Applied Probability, vol. 2, pp. 402-434, 1992. |
|
|
|
L. Devroye, W. Szpankowski, and B. Rais, "A note on the height of suffix trees," SIAM Journal on Computing, vol. 21, pp. 48-53, 1992. |
|
|
|
L. Devroye, "The branching process method in random variate generation," Communications in Statistics---Simulation, vol. 21, pp. 1-14, 1992. |
|
|
|
L. Devroye, "A limit theory for random skip lists," Annals of Applied Probability, vol. 2, pp. 597-609, 1992. |
|
|
|
L. Devroye, "A note on the probabilistic analysis of patricia trees," Random Structures and Algorithms, vol. 3, pp. 203-214, 1992. |
|
|
|
L. Devroye, "A note on the usefulness of superkernels in density estimation," Annals of Statistics, vol. 20, pp. 2037-2056, 1992. |
|
|
|
L. Devroye, "Random variate generation for the digamma and trigamma distributions," Journal of Statistical Computation and Simulation, vol. 43, pp. 197-216, 1992. |
|
|
|
L. Devroye, "A triptych of discrete distributions related to the stable law," Statistics and Probability Letters, vol. 18, pp. 349-351, 1993. |
|
|
|
L. Devroye, P. Epstein, and J.-R. Sack, "On generating random intervals and hyperrectangles," Journal of Computational and Graphical Statistics, vol. 2, pp. 291-307, 1993. |
|
|
|
L. Devroye, "On random variate generation for the generalized hyperbolic secant distributions," Statistics and Computing, vol. 3, pp. 125-134, 1993. |
|
|
|
L. Devroye and G.T. Toussaint, "On convex hulls for random lines," Journal of Algorithms, vol. 14, pp. 381-394, 1993. Correction. |
|
|
|
L. Devroye, "On records, the maximal layer, and uniform distributions on monotone sets," Computers and Mathematics with Applications, vol. 25, pp. 19-31, 1993. |
|
|
|
M.P. Wand and L. Devroye, "How easy is a given density to estimate?," Computational Statistics and Data Analysis, vol. 16, pp. 311-323, 1993. |
|
|
|
L. Devroye and M.P. Wand, "On the effect of density shape on the performance of its kernel estimate," Statistics, vol. 24, pp. 215-233, 1993. |
|
|
|
L. Devroye, "On the expected height of fringe-balanced trees," Acta Informatica, vol. 30, pp. 459-466, 1993. |
|
|
|
L. Devroye and B. Zhu, "Intersections of random line segments," International Journal of Computational Geometry and Applications, vol. 4, pp. 261-274, 1994. |
|
|
|
L. Devroye, "On the non-consistency of an estimate of Chiu," Statistics and Probability Letters, vol. 20, pp. 183-188, 1994. |
|
|
|
L. Devroye, "On good deterministic smoothing sequences for kernel density estimates," Annals of Statistics, vol. 22, pp. 886-889, 1994. |
|
|
|
L. Devroye, L. Gy\"orfi, A. Krzy\.zak, and G. Lugosi, "On the strong universal consistency of nearest neighbor regression function estimates," Annals of Statistics, vol. 22, pp. 1371-1385, 1994. |
|
|
|
A. Berlinet and L. Devroye, "A comparison of kernel density estimates," Publications de l'Institut de Statistique de l'Universit\'e de Paris, vol. 38(3), pp. 3-59, 1994. |
|
|
|
L. Devroye and P. Kruszewski, "A note on the Horton-Strahler number for random binary trees," Information Processing Letters, vol. 52, pp. 155-159, 1994. |
|
|
|
L. Devroye, "On random Cartesian trees," Random Structures and Algorithms, vol. 5, pp. 305-327, 1994. |
|
|
|
L. Devroye, "Another proof of a slow convergence result of Birg\'e," Statistics and Probability Letters, vol. 23, pp. 63-67, 1995. |
|
|
|
L. Devroye and B. Reed, "On the variance of the height of random binary search trees," SIAM Journal on Computing, vol. 24, pp. 1157-1162, 1995. |
|
|
|
A. Berlinet, L. Devroye, and L. Gy\"orfi, "Asymptotic normality of L1-error in density estimation," Statistics, vol. 26, pp. 329-343, 1995. |
|
|
|
L. Devroye and J. Lu, "The strong convergence of maximal degrees in uniform random recursive trees and dags," Random Structures and Algorithms, vol. 6, pp. 1-14, 1995. |
|
|
|
L. Devroye and G. Lugosi, "Lower bounds in pattern recognition and learning," Pattern Recognition, vol. 28, pp. 1011-1018, 1995. |
|
|
|
L. Devroye and J.M. Robson, "On the generation of random binary search trees," SIAM Journal on Computing, vol. 24, pp. 1141-1156, 1995. |
|
|
|
L. Devroye and M. McDougall, "Random fonts for the simulation of handwriting," Electronic Publishing, vol. 8, pp. 281-294, 1995. |
|
|
|
L. Devroye and P. Kruszewski, "A note on the Horton-Strahler number for random binary trees," Information Processing Letters, vol. 56, pp. 95-99, 1995. |
|
|
|
L. Devroye and G. Lugosi, "A universally acceptable smoothing factor for kernel density estimation," Annals of Statistics, vol. 24, pp. 2499--2512, 1996. |
|
|
|
R. Cao-Abad and L. Devroye, "The consistency of a smoothed minimum distance estimate," Scandinavian Journal of Statistics, vol. 23, pp. 405-418, 1996. |
|
|
|
L. Devroye and P. Kruszewski, "On the Horton-Strahler number for random tries," Theoretical Informatics and Applications, vol. 30(5), pp. 443-456, 1996. |
|
|
|
L. Devroye and G. Lugosi, "Nonasymptotic universal smoothing factors, kernel complexity and Yatracos classes," Annals of Statistics, vol. 25, pp. 2626-2637, 1997. |
|
|
|
L. Devroye, "Simulating theta random variates," Statistics and Probability Letters, vol. 31, pp. 2785-2791, 1997. |
|
|
|
L. Devroye, "Random variate generation for multivariate unimodal densities," ACM Transactions on Modeling and Computer Simulation, vol. 7, pp. 447-477, 1997. |
|
|
|
L. Devroye, "Universal smoothing factor selection in density estimation: theory and practice (with discussion)," Test, vol. 6, pp. 223-320, 1997. |
|
|
|
P. Bose and L. Devroye, "Intersections with random geometric objects," Computational Geometry: Theory and Applications, vol. 10, pp. 139-154, 1998. |
|
|
|
L. Devroye, L. Gy\"orfi, and A. Krzy\.zak, "The Hilbert kernel regression estimate," Journal of Multivariate Analysis, vol. 65, pp. 209-227, 1998. |
|
|
|
L. Devroye, "On the richness of the collection of subtrees in random binary search trees," Information Processing Letters, vol. 65, pp. 195-199, 1998. |
|
|
|
L. Devroye and A. Goudjil, "A study of random Weyl trees," Random Structures and Algorithms, vol. 9, pp. 271-295, 1998. |
|
|
|
L. Devroye, E. M\"ucke, and B. Zhu, "A note on point location in Delaunay triangulations of random points," Algorithmica, vol. 22, pp. 477-482, 1998. |
|
|
|
D. Avis, B. Beresford-Smith, L. Devroye, H. Elgindy, E. Gu\'evremont, F. Hurtado, and B. Zhu, "Unoriented Theta-maxima in the plane: complexity and algorithms," SIAM Journal on Computing, vol. 28, pp. 278-296, 1999. |
|
|
|
L. Devroye, P. Flajolet, F. Hurtado, M. Noy, and W. Steiger, "Properties of random triangulations and trees," Discrete and Computational Geometry, vol. 22, pp. 105-117, 1999. |
|
|
|
L. Devroye, "Universal limit laws for depths in random trees," SIAM Journal on Computing, vol. 28, pp. 409-432, 1999. |
|
|
|
L. Devroye, "A note on the expected time for finding maxima by list algorithms," Algorithmica, vol. 23, pp. 97-108, 1999. |
|
|
|
L. Devroye and C. Zamora-Cura, "On the complexity of branch-and-bound search for random trees," Random Structures and Algorithms, vol. 10, pp. 309-327, 1999. |
|
|
|
A. Antos, L. Devroye, and L. Gy\"orfi, "Lower bounds for Bayes error estimation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-21, pp. 643-645, 1999. |
|
|
|
J. Beirlant and L. Devroye, "A note on the impossibility of estimating densities of maxima," Statistics and Probability Letters, vol. 43, pp. 57-64, 1999. |
|
|
|
L. Devroye and A. Krzy\.zak, "On the Hilbert kernel density estimate," Statistics and Probability Letters, vol. 44, pp. 299-308, 1999. |
|
|
|
L. Devroye, "The height and size of random hash trees and random pebbled hash trees," SIAM Journal on Computing, vol. 28, pp. 1215-1224, 1999. |
|
|
|
D. Avis and L. Devroye, "Estimating the number of vertices of a polyhedron," Information Processing Letters, vol. 73, pp. 137-143, 2000. |
|
|
|
L. Devroye, J. Fill, and R. Neininger, "Perfect simulation from the quicksort limit distribution," Electronic Communications in Probability, vol. 5, pp. 95-99, 2000. |
|
|
|
L. Devroye, J. Jabbour, and C. Zamora-Cura, "Squarish k-d trees," SIAM Journal on Computing, vol. 30, pp. 1678-1700, 2001. |
|
|
|
P. Chanzy, L. Devroye, and C. Zamora-Cura, "Analysis of range search for random k-d trees," Acta Informatica, vol. 37, pp. 355-383, 2001. |
|
|
|
L. Devroye, "On the probabilistic worst-case time of "FIND"," Algorithmica, vol. 31, pp. 291-303, 2001. |
|
|
|
L. Devroye, "Simulating perpetuities," Methodologies and Computing in Applied Probability, vol. 3, pp. 97-115, 2001. |
|
|
|
J. Beirlant, L. Devroye, L. Gy\"orfi, and I. Vajda, "Large deviations of divergence measures on partitions," Journal of Statistical Planning and Inference, vol. 93, pp. 1-16, 2001. |
|
|
|
L. Devroye, "An analysis of random LC tries," Random Structures and Algorithms, vol. 15, pp. 359-375, 2001. |
|
|
|
L. Devroye, "Laws of large numbers and tail inequalities for random tries and Patricia trees," Journal of Computational and Applied Mathematics, vol. 142, pp. 27-37, 2002. |
|
|
|
L. Devroye and A. Krzy\. zak, "New multivariate product density estimators," Journal of Multivariate Analysis, vol. 82, pp. 88-110, 2002. |
|
|
|
L. Devroye, "Simulating Bessel random variables," Statistics and Probability Letters, vol. 57, pp. 249-257, 2002. |
|
|
|
L. Devroye, L. Gy\"orfi, and G. Lugosi, "A note on robust hypothesis testing," IEEE Transactions on Information Theory, vol. 48, pp. 2111-2114, 2002. |
|
|
|
L. Devroye and R. Neininger, "Density approximation and exact simulation of random variables that are solutions of fixed-point equations," Advances of Applied Probability, vol. 34, pp. 441-468, 2002. |
|
|
|
L. Devroye and G. Lugosi, "Almost sure classification of densities," Journal of Nonparametric Statistics, vol. 14, pp. 675-698, 2002. |
|
|
|
P. Bose, L. Devroye, and W. Evans, "Diamonds are not a minimum weight triangulation's best friend," International Journal on Computational Geometry and Applications, vol. 12, pp. 445-453, 2002. |
|
|
|
G. Biau and L. Devroye, "On the risk of estimates for block decreasing densities," Journal of Multivariate Analysis, vol. 86, pp. 143-165, 2003. |
|
|
|
L. Devroye, "Limit laws for sums of functions of subtrees of random binary search trees," SIAM Journal on Computing, vol. 32, pp. 152-171, 2003. |
|
|
|
L. Devroye and P. Morin, "Cuckoo hashing: further analysis," Information Processing Letters, vol. 86, pp. 215-219, 2003. |
|
|
|
L. Devroye, L. Gy\"orfi, D. Sch\"afer, and H. Walk, "The estimation problem of minimum mean squared error," Statistics and Decisions, vol. 21, pp. 15-28, 2003. |
|
|
|
L. Devroye and R. Neininger, "Random suffix search trees," Random Structures and Algorithms, vol. 23, pp. 357-396, 2003. |
|
|
|
L. Devroye, "Formatting font formats," TUGBoat, vol. 24, pp. 588-596, 2003. |
|
|
|
L. Devroye and G. Lugosi, "Bin width selection in multivariate histograms by the combinatorial method," Test, vol. 13, pp. 129-145, 2004. |
|
|
|
L. Devroye, P. Morin, and A. Viola, "On worst-case Robin Hood hashing," SIAM Journal on Computing, vol. 33, pp. 923-936, 2004. |
|
|
|
L. Devroye and C. Zamora-Cura, "Expected worst-case time for partial match in random quadtries," Discrete Applied Mathematics, vol. 141, pp. 103-117, 2004. |
|
|
|
L. Devroye and R. Neininger, "Distances and finger search in random binary search trees," SIAM Journal on Computing, vol. 33, pp. 647-658, 2004. |
|
|
|
G. Biau and L. Devroye, "A note on density model size testing," IEEE Transactions on Information Theory, vol. 50, pp. 576-581, 2004. |
|
|
|
L. Devroye, C. Lemaire, and J.-M. Moreau, "Expected time analysis for Delaunay point location," Computational Geometry: Theory and Applications, vol. 29, pp. 61-89, 2004. |
|
|
|
L. Devroye, "Universal asymptotics for random tries and Patricia trees," Algorithmica, vol. 42, pp. 11-29, 2005. |
|
|
|
Z.-D. Bai, L. Devroye, H.-K. Hwang, and T.-S. Tsai, "Maxima in hypercubes," Random Structures and Algorithms, vol. 27, pp. 290-309, 2005. |
|
|
|
G. Biau and L. Devroye, "Density estimation by the penalized combinatorial method," Journal of Multivariate Analysis, vol. 94, pp. 196-208, 2005. |
|
|
|
L. Devroye and W. Szpankowski, "Probabilistic behavior of asymmetric level compressed tries," Random Structures and Algorithms, vol. 27, pp. 185-200, 2005. |
|
|
|
T. Ali Khan, L. Devroye, and R. Neininger, "A limit law for the root value of minimax trees," Electronic Communications in Probability, vol. 10, pp. 273-281, 2005. |
|
|
|
P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, "On the spanning ratio of Gabriel graphs and $\beta$-skeletons," SIAM Journal on Discrete Mathematics, vol. 20, pp. 412-427, 2006. |
|
|
|
J. Cove, P. Blinder, E. Abi-Jaoude, M. Lafreni\`ere-Roula, L. Devroye, and D. Baranes, "Growth of neurites toward neurite-neurite contact increases synaptic clustering and secretion and is regulated by synaptic activity," Cerebral Cortex, vol. 16, pp. 83-92, 2006. |
|
|
|
K. Dalal, L. Devroye, E. Mal-Alla, and E. McLeish, "Two-way chaining with reassignment," SIAM Journal on Computing, vol. 35, pp. 327-340, 2006. |
|
|
|
N. Broutin and L. Devroye, "Large deviations for the weighted height of an extended class of trees," Algorithmica, vol. 46, pp. 271-297, 2006. |
|
|
|
L. Devroye and H.-K. Hwang, "Width and mode of the profile for random trees of logarithmic height," Annals of Applied Probability, vol. 16, pp. 886-918, 2006. |
|
|
|
P. Bose and L. Devroye, "On the stabbing number of a random Delaunay triangulation," Computational Geometry: Theory and Applications, vol. 36, pp. 89-105, 2007. |
|
|
|
N. Broutin and L. Devroye, "An analysis of the height of tries with random weights on the edges," Combinatorics, Probability and Computing, vol. 17, pp. 1-42, 2007. |
|
|
|
N. Broutin and L. Devroye, "The height of list-tries and TST," Discrete Mathematics and Theoretical Computer Science, vol. AH, pp. 271-282, 2007. |
|
|
|
G. Biau, B. Cadre, L. Devroye, and L. Gy\"orfi, "Strongly consistent model selection for densities," Test (on-line), vol. 17, pp. 531-545, 2008. |
|
|
|
L. Devroye and G. Lugosi, "Local tail bounds for functions of independent random variables," Annals of Probability, vol. 36, pp. 143-159, 2008. |
|
|
|
N. Broutin, L. Devroye, E. McLeish, and M. de la Salle, "The height of increasing trees," Random Structures and Algorithms, vol. 32, pp. 494-518, 2008. |
|
|
|
G. Biau, L. Devroye, and G. Lugosi, "On the performance of clustering in Hilbert spaces," IEEE Transactions on Information Theory, vol. 54, pp. 781-790, 2008. |
|
|
|
N. Broutin, L. Devroye, and E. McLeish, "Weighted height of random trees," Acta Informatica, vol. 45, pp. 237-277, 2008. |
|
|
|
G. Biau, L. Devroye, and G. Lugosi, "Consistency of random forests and other averaging classifiers," Journal of Machine Learning Research, vol. 9, pp. 2015-2033, 2008. |
|
|
|
L. Devroye, G. Lugosi, G. Park, and W. Szpankowski, "Multiple choice tries and distributed hash tables," Random Structures and Algorithms, vol. 34, pp. 337-367, 2009. |
|
|
|
L. Devroye, J. King, and C. McDiarmid, "Random hyperplane search trees," SIAM Journal on Computing, vol. 38, pp. 2411-2425, 2009. |
|
|
|
L. Devroye, "Random variate generation for exponentially and polynomially tilted stable distributions," ACM Transactions on Modeling and Computer Simulation, vol. 19 (article 18, DOI 10.1145/1596519.1596523), pp. , 2009. |
|
|
|
L. Devroye and E. Mal-Alla, "On the k-orientability of random graphs," SIAM Journal on Discrete Mathematics, vol. 309, pp. 1476-1490, 2009. |
|
|
|
L. Devroye, "On exact simulation algorithms for some distributions related to Jacobi theta functions," Statistics and Probability Letters, vol. 21, pp. 2251-2259, 2009. |
|
|
|
L. Devroye, J. Gudmundsson, and P. Morin, "On the expected maximal degree in random Gabriel and Yao graphs," Advances in Applied Probability, vol. 41, pp. 1123-1140, 2009. |
|
|
|
D. Avis, L. Devroye, and K. Iwama , "The locker problem with empty lockers ," International Journal of Computer and Information Engineering, vol. 3, pp. 2747-2750, 2009. |
|
|
|
N. Broutin, L. Devroye, and E. McLeish, "Note on the structure of Kruskal's algorithm," Algorithmica, vol. 56, pp. 141-159, 2010. |
|
|
|
L. Devroye and O. Fawzi, "Simulating the Dickman distribution," Statistics and Probability Letters, vol. 80, pp. 242-247, 2010. |
|
|
|
L. Addario-Berry, N. Broutin, L. Devroye, and G. Lugosi, "On combinatorial testing problems," Annals of Statistics, vol. 38, pp. 3063-3092, 2010. |
|
|
|
G. Biau and L. Devroye, "On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification," Journal of Multivariate Analysis, vol. 101, pp. 2499-2518, 2010. |
|
|
|
L. Devroye, O. Fawzi, and N. Fraiman, "The height of scaled attachment random recursive trees," Discrete Mathematics and Theoretical Computer Science, vol. 12(3), pp. 129-142, 2010. |
|
|
|
L. Devroye and S. Janson, "Long and short paths in uniform random recursive dags," Arkiv f\"ur Matematik, vol. 49, pp. 61-77, 2011. |
|
|
|
L. Devroye and S. Janson, "Distances between pairs of vertices and vertical profile in conditioned Galton--Watson trees," Random Structures and Algorithms, vol. 38, pp. 381-395, 2011. |
|
|
|
L. Devroye and L. James, "The double CFTP method," ACM Transactions on Modeling and Computer Simulation, vol. 21, pp. 1-20, 2011. |
|
|
|
P. Bose, L. Devroye, M. L\"offler, J. Snoeyink, and V. Verma, "Almost all Delaunay triangulations have stretch factor greater than pi over 2," Computational Geometry Theory and Applications, vol. 44, pp. 121-127, 2011. |
|
|
|
G. Biau, F. Chazal, D. Cohen-Steiner, L. Devroye, and C. Rodriguez, "A weighted k-nearest neighbor density estimate for geometric inference," Electronic Journal of Statistics, vol. 5, pp. 204-237, 2011. |
|
|
|
L. Devroye, A. Gy\"orgy, G. Lugosi, and F. Udina, "High-dimensional random geometric graphs and their clique number," Electronic Journal of Probability, vol. 16, pp. 2481-2508, 2011. |
|
|
|
L. Devroye, "On the probability of cutting a Galton-Watson tree," Electronic Journal of Probability, vol. 16, pp. 2001-2019, 2011. |
|
|
|
L. Devroye, "A note on generating random variables with log-concave densities," Statistics and Probability Letters, vol. 82, pp. 1035-1039, 2012. |
|
|
|
G. Biau, L. Devroye, V. Dujmovic, and A. Krzyzak, "An affine invariant k-nearest neighbor regression estimate," Journal of Multivariate Analysis, vol. 112, pp. 24-34, 2012. |
|
|
|
L. Devroye, T. Felber, and M. Kohler, "Estimation of a density using real and artificial data," IEEE Transactions on Information Theory, vol. 59(3), pp. 1927-1928, 2012. |
|
|
|
D. Chen, L. Devroye, V. Dujmovic, and P. Morin, "Memoryless routing in convex subdivisions: Random walks are optimal," Computational Geometry, vol. 45(4), pp. 178-185, 2012. |
|
|
|
L. Devroye, O. Fawzi, and N. Fraiman, "Depth Properties of scaled attachment random recursive trees," Random Structures and Algorithms, vol. 41(1), pp. 66-98, 2012. |
|
|
|
L. Devroye, "Simulating size-constrained Galton-Watson trees," SIAM Journal on Computing, vol. 41(1), pp. 1-11, 2012. |
|
|
|
V. Campos, V. Chvatal, L. Devroye, and P. Taslakian, "Transversals in trees," Journal of Graph Theory, vol. 73, pp. 32-43, 2013. |
|
|
|
L. Devroye, T. Felber, M. Kohler, and A. Krzyzak, "L1-consistent estimation of the density of residuals in random design regression models," Statistics and Probability Letters, vol. 82, pp. 173-179, 2013. |
|
|
|
L. Addario-Berry, L. Devroye, and S. Janson, "Sub-Gaussian tail bounds for the widths and height of conditioned Galton--Watson trees," Annals of Probability, vol. 41, pp. 1072-1087, 2013. |
|
|
|
I. Plante, L. Devroye, and F. Cucinotta, "Random sampling of the Green's Functions for reversible reactions with an intermediate state," Journal of Computational Physics, vol. 242, pp. 531-543, 2013. |
|
|
|
O. Amini, L. Devroye, S. Griffiths, and N. Olver, "On explosions in heavy-tailed branching random walks," Annals of Probability, vol. 41, pp. 1864-1899, 2013. |
|
|
|
L. Devroye and L. Farczadi, "Connectivity for line-of-sight networks in higher dimensions," Discrete Mathematics and Theoretical Computer Science, vol. 15, pp. 71-86, 2013. |
|
|
|
G. Biau and L. Devroye, "Cellular tree classifiers," Electronic Journal of Statistics, vol. 7, pp. 1875-1912, 2013. |
|
|
|
A.-K. Bott, L. Devroye, and M. Kohler, "Estimation of a distribution from data with small measurement errors," Electronic Journal of Statistics, vol. 7, pp. 2457-2476, 2013. |
|
|
|
L. Devroye, G. Lugosi, and G. Neu, "Prediction by random walk perturbation," Journal of Machine Learning Research, vol. WCP30, pp. 460-473, 2013. |
|
|
|
L. Devroye, "Random variate generation for the generalized inverse Gaussian distribution," Statistics and Computing, vol. 24, pp. 239-246, 2014. |
|
|
|
L. Devroye and N. Fraiman, "Connectivity threshold of inhomogeneous random graphs," Random Structures and Algorithms, vol. 45, pp. 408-420, 2014. |
|
|
|
L. Devroye and N. Fraiman, "The random connection model on the torus," Combinatorics, Probability and Computing, vol. 23, pp. 796-804, 2014. |
|
|
|
I. Plante, L. Devroye, and F. Cucinotta, "Calculations of distance distributions and probabilities of binding by ligands between parallel plane membranes comprising receptors," Computer Physics Communications, vol. 185, pp. 697-707, 2014. |
|
|
|
L. Devroye and S. Janson, "Protected nodes and fringe subtrees in some random trees," Electronic Communications in Probability, vol. 19, pp. 1-10, 2014. |
|
|
|
L. Devroye and L. James, "On simulation and properties of the stable law," Statistical Methods and Applications, vol. 23, pp. 307-343, 2014. |
|
|
|
N. Broutin, L. Devroye, N. Fraiman, and G. Lugosi, "Connectivity threshold of Bluetooth graphs," Random Structures and Algorithms, vol. 44, pp. 45-66, 2014. |
|
|
|
N. Broutin, L. Devroye, and G. Lugosi, "Connectivity of sparse bluetooth networks," Electronic Journal of Probability, vol. 20, pp. 48, 2015. |
|
|
|
L. Devroye, G. Lugosi, and G. Neu, "Random-walk perturbations for online combinatorial optimization," IEEE Transactions on Information Theory, vol. 61, pp. 4099-4106, 2015. |
|
|
|
I. Plante, L. Devroye, and H. Wu, "On the Green's function of the partially diffusion-controlled reversible ABCD reaction for radiation chemistry codes," Journal of Computational Physics, vol. 297, pp. 515-529, 2015. |
|
|
|
X. S. Cai and L. Devroye, "The analysis of Kademlia for random IDs," Internet Mathematics, vol. 11, pp. 572-587, 2015. |
|
|
|
L. Devroye and J. King, "Random hyperplane search trees in high dimensions," Journal of Computational Geometry, vol. 6, pp. 142-164, 2015. |
|
|
|
L. Addario-Berry, S. Bhamidi, S. Bubeck, L. Devroye, G. Lugosi, and R. Imbuzeiro Oliveira, "Exceptional rotations of random graphs: a VC theory," Journal of Machine Learning Research, vol. 16, pp. 1893-1922, 2015. |
|
|
|
G. Brassard, L. Devroye, and C. Gravel, "Exact classical simulation of the quantum-mechanical GHZ distribution," IEEE Transactions on Information Theory, vol. 62, pp. 876-890, 2016. |
|
|
|
N. Broutin, L. Devroye, and G. Lugosi, "Almost optimal sparsification of random geometric graphs," Annals of Applied Probability, vol. 26, pp. 3078-3109, 2016. |
|
|
|
L. Devroye, M. Lerasle, G. Lugosi, and R. I. Oliveira, "Sub-gaussian mean estimators," Annals of Statistics, vol. 44, pp. 2695-2725, 2016. |
|
|
|
Omid Amini, Luc Devroye, Simon Griffiths, and Neil Olver, "Explosion and linear transit times in infinite trees," Probability Theory and Related Fields, vol. 167, pp. 325-347, 2017. |
|
|
|
S. Bubeck, L. Devroye, and G. Lugosi, "Finding Adam in random growing trees," Random Structures and Algorithms, vol. 50, pp. 158-172, 2017. |
|
|
|
L. Devroye and C. Gravel, "The expected bit complexity of the von Neumann rejection algorithm," Statistics and Computing, vol. 27, pp. 699-710, 2017. |
|
|
|
X. S. Cai and L. Devroye, "The graph structure of a deterministic automaton chosen at random," Random Structures and Algorithms, vol. 51, pp. 428-458, 2017. |
|
|
|
L. Devroye, L. Gy\"orfi , G. Lugosi , and H. Walk, "On the measure of Voronoi cells," Journal of Applied Probability, vol. 54, pp. 394-408, 2017. |
|
|
|
L. Devroye and X. S. Cai, "A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees," ALEA Latin American Journal of Probability and Mathematical Statistics, vol. 14, pp. 579-611, 2017. |
|
|
|
I. Plante and L. Devroye, "Considerations for the independent reaction times and step-by-step methods for radiation chemistry simulations," Radiation Physics and Chemistry, vol. 139, pp. 157-172, 2017. |
|
|
|
B. Bauer, L. Devroye, M. Kohler, A. Krzyzak, and H. Walk, "Nonparametric estimation of a function from noiseless observations at random points," Journal of Multivariate Analysis, vol. 160, pp. 93-104, 2017. |
|
|
|
L. Devroye and P. Morin, "On interference in wireless networks," Computational Geometry Theory and Applications, vol. 67, pp. 2-10, 2018. |
|
|
|
L. Devroye, L. Gy\"orfi , G. Lugosi , and H. Walk, "A nearest neighbor estimate of the residual variance," Electronic Journal of Statistics, vol. 12, pp. 1752-1778, 2018. |
|
|
|
L. Beaudou, L. Devroye, and G. Hahn, "A lower bound on the size of an absorbing set in an arc-coloured tournament," Discrete Mathematics, vol. 342, pp. 143-144, 2019. |
|
|
|
L. Devroye, V. Dujmovic, A. Frieze, A. Mehrabian, P. Morin, and B. Reed, "Notes on growing a tree in a graph," Random Structures and Algorithms, vol. 55, pp. 290-312, 2019. |
|
|
|
L. Devroye, C. Holmgren, and H. Sulzbach, "Heavy subtrees of Galton-Watson trees with an application to Apollonian networks," Electronic Journal of Probability, vol. 24, pp. 1-44, 2019. |
|
|
|
G. Brassard, L. Devroye, and C. Gravel, "Remote sampling with applications to general entanglement simulation," Entropy, vol. 21 (92), pp. , 2019. |
|
|
|
L. Addario-Berry, L. Devroye, G. Lugosi, and R. Imbuzeiro Oliveira, "Local optima of the Sherrington-Kirkpatrick Hamiltonian," Journal of Mathematical Physics, vol. 60, pp. 043301, 2019. |
|
|
|
L. Devroye and T. Reddad, "On the discovery of the seed in uniform attachment trees," Internet Mathematics, vol. https://doi.org/10.24166/im.02.2019, pp. , 2019. |
|
|
|
L. Devroye and T. Reddad, "Discrete minimax estimation with trees," Electronic Journal of Statistics, vol. 13, pp. 2595-2623, 2019. |
|
|
|
X.S. Cai, L. Devroye, C. Holmgren, and F. Skerman, "K-cut on paths and some trees," Electronic Journal of Probability, vol. 24, pp. 1-22, 2019. |
|
|
|
D. Avis and L. Devroye, "An analysis of budgeted parallel search on conditional Galton-Watson trees," Algorithmica, vol. 82, pp. 1329-1345, 2020. |
|
|
|
N. Broutin, L. Devroye, and N. Fraiman, "Recursive functions on conditional Galton-Watson trees," Random Structures and Algorithms, vol. 57, pp. 304-316, 2020. |
|
|
|
L. Addario-Berry, H. Cairns, L. Devroye, C. Kerriou, and R. Mitchell, "Hipster random walks," Probability Theory and Related Fields, vol. 178, pp. 437-473, 2020. |
|
|
|
L. Devroye, A. Mehrabian, and T. Reddad, "The minimax learning rate of normal and Ising undirected graphical models," Electronic Journal of Statistics, vol. 14, pp. 2338-2361, 2020. |
|
|
|
Luc Devroye, "Random variate generation for the truncated negative gamma distribution," Mathematics and Computers in Simulation, vol. 181, pp. 51-56, 2021. |
|
|
|
A. M. Brandenberger, L. Devroye, and T. Reddad, "The Horton-Strahler number of conditioned Galton-Watson trees," Electronic Journal of Probability, vol. 26, pp. 1-29, 2021. |
|
|
|
L. Addario-Berry, L. Devroye, G. Lugosi, and V. Velona, "Broadcasting on random recursive trees," Annals of Applied Probability, vol. 32, pp. 497-528, 2022. |
|
|
|
A. M. Brandenberger, L. Devroye, and M. K. Goh, "Root estimation in Galton-Watson trees," Random Structures and Algorithms, vol. 61, pp. 52-542, 2022. |
|
|
|
L. Devroye and L. Györfi, "On the consistency of the Kozachenko-Leonenko entropy estimate," IEEE Transactions on Information Theory, vol. 68, pp. 1178-1185, 2022. |
|
|
|
A. M. Brandenberger, L. Devroye, M. K. Goh, and R. Y. Zhao, "Leaf multiplicity in a Bienaym\'e-Galton-Watson tree," Discrete Mathematics and Theoretical Computer Science, vol. 24, pp. dmtcs:7515 , 2022. |
|
|
|
Luc Devroye, Silvio Lattanzi, Gabor Lugosi, and Nikita Zhivotovskiy, "On mean estimation for heteroscedastic random variables," Annales de l'Institut Henri Poincaré, vol. 59, pp. 1-20, 2023. |
|
|
|
L. Devroye, M. K. Goh, and R. Y. Zhao, "On the peel number and the leaf-height of Galton-Watson trees," Combinatorics Probability Computing, vol. 32, pp. 68-90, 2023. |
|
|
|
K. Dalal, L. Devroye, and E. Mal-Alla, "Two-way linear probing revisited," Algorithms, vol. 16(11), pp. 500, 2023. |
|
|
|
Luc Devroye and John Nolan, "Random variate generation for the first hit of the symmetric stable process in $\RR^d$," Journal of Statistical Theory and Practice, vol. 18:11, pp. , 2024. |
|
|
|
N. Broutin, L. Devroye, G. Lugosi, and R. Oliveira, "Subtractive random forests," ALEA Latin American Journal of Probability and Mathematical Statistics, vol. 21, pp. 575-591, 2024. |
|
|
|
C. Atamanchuk, L. Devroye, and M. Vicenzo, "An algorithm to recover shredded random matrices," SIAM Journal on Discrete Mathematics, vol. 0, pp. 0-0, 2024. |
|
|
|
L. Devroye and D. Los, "An asymptotically optimal algorithm for generating bin cardinalities," Mathematics and Computers in Simulation, vol. 228, pp. 147-155, 2025. |
|
|
Luc Devroye |
PostScript file
PDF file