Luc's chapters in edited books

PostScript file

PDF file


L. Devroye and T.J. Wagner, "The strong uniform consistency of kernel density estimates,"
in: Multivariate Analysis V, ed. P.R. Krishnaiah, pp. 59-77, North Holland, 1980.


L. Devroye, "The strong convergence of empirical nearest neighbor estimates of integrals,"
in: Statistics and Related Topics, ed. M. Cs\"org\"o, D.A. Dawson, J.N.K. Rao and A.K.Md.E. Saleh, pp. 243-252, North Holland, 1981.


L. Devroye and T.J. Wagner, "Nearest neighbor methods in discrimination,"
in: Handbook of Statistics, ed. P.R. Krishnaiah and L. Kanal, vol. 2, pp. 193-197, North Holland, 1982.

L. Devroye and L. Gy\"orfi, "Distribution free exponential bound for the L1 error of partitioning estimates of a regression function,"
in: Proceedings of the 4th Pannonian Symposium on Mathematical Statistics, ed. F. Konecny, J. Mogyorodi, W. Wertz, pp. 67-76, Akademiai Kiado, Budapest, Hungary, 1983.


L. Devroye, "The series method for random variate generation and its application to the Kolmogorov-Smirnov distribution,"
in: Modern Design and Analysis of Discrete-Event Computer Simulations, ed. E.J. Dudewicz and Z.A. Karian, pp. 62-77, IEEE Computer Science Press, Washington, D.C., 1985.


L. Devroye, "Expected time analysis of algorithms in computational geometry: a survey,"
in: Computational Geometry, ed. G.T. Toussaint, pp. 135-151, Elsevier, North Holland, 1985.


L. Devroye, "Automatic selection of a discrimination rule based upon minimization of the empirical risk,"
in: Pattern Recognition Theory and Applications, ed. P.Devijver and J.Kittler, NATO ASI Series, pp. 35-46, Springer-Verlag, Berlin, 1987.


L. Devroye, "A universal k-nearest neighbor procedure in discrimination,"
in: Nearest Neighbor Pattern Classification Techniques, ed. Belur V. Dasarathy, pp. 101-106, IEEE Computer Society Press, Los Alamitos, CA, 1991.


L. Devroye, "Exponential inequalities in nonparametric estimation,"
in: Nonparametric Functional Estimation and Related Topics, ed. G.Roussas, NATO ASI Series, pp. 31-44, Kluwer Academic Publishers, Dordrecht, 1991.


L. Devroye and A. Sbihi, "Inequalities for random walks on trees,"
in: Random Graphs Volume 2, ed. A. Frieze and T. Luczak, pp. 35-45, John Wiley, New York, 1992.


L. Devroye, "Random optimization methods,"
in: New Directions in Simulation for Manufacturing and Communications, ed. S. Morito, H. Sakasegawa, K. Yoneda, M. Fushimi and K. Nakano, pp. 20-31, Operations Research Society of Japan, Tokyo, Japan, 1994.


L. Devroye and P. Kruszewski, "The botanical beauty of random binary trees,"
in: Graph Drawing 95, ed. F. Brandenburg, pp. 166-177, Springer-Verlag, Berlin, 1995.


L. Devroye and O. Kamoun, "Random minimax game trees,"
in: Random Discrete Structures, ed. D. Aldous and R. Pemantle, pp. 55-80, John Wiley, New York, 1996.

L. Devroye, "Binary search trees based on Weyl and Lehmer sequences,"
in: Monte Carlo and Quasi-Monte Carlo Methods 1996, ed. H. Niederreiter, P. Hellekalek, G. Larcher and P. Zinterhof, Springer Lecture Notes in Statistics, vol. 127, pp. 40-65, Springer-Verlag, New York, 1998.


L. Devroye, "Branching processes and their applications in the analysis of tree structures and tree algorithms,"
in: Probabilistic Methods for Algorithmic Discrete Mathematics, ed. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed, Springer Seriues on Algorithms and Combinatorics, vol. 16, pp. 249-314, Springer-Verlag, Berlin, 1998.


L. Devroye, G. Lugosi, and F. Udina, "Inequalities for a new data-based method for selecting nonparametric density estimates,"
in: Asymptotics in Statistics and Probability: Papers in Honor of George Gregory Roussas, ed. Madan L. Puri, pp. 133-154, VSP International Science Publishers, Zeist, The Netherlands, 2000.


L. Devroye and G. Lugosi, "Variable kernel estimates: on the impossibility of tuning the parameters,"
in: High-Dimensional Probability II, ed. E. Gin\'e, D. Mason and J.A. Wellner, pp. 405-424, Springer-Verlag, New York, 2000.

A. Antos and L. Devroye, "Rawa trees,"
in: Algorithms, Trees, Combinatorics and Probabilities, ed. D. Gardy and A. Mokkadem, pp. 3-15, Birkh\"auser-Verlag, Basel, 2000.


L. Devroye and A. Krzy\.zak, "Random search under additive noise,"
in: Modeling Uncertainty, ed. M. Dror, P. L'Ecuyer and F. Szidarovsky, pp. 383-418, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002.


L. Devroye, C. McDiarmid, and B. Reed, "Giant components for two expanding graph processes,"
in: Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probability, ed. B. Chauvin, P. Flajolet, D. Gardy and A. Mokkadem, pp. 161-173, Birkh\"auser-Verlag, Basel, 2002.


L. Devroye and R. Neininger, "A note on random suffix search trees,"
in: Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probability, ed. B. Chauvin, P. Flajolet, D. Gardy and A. Mokkadem, pp. 267-278, Birkh\"auser-Verlag, Basel, 2002.

L. Devroye and L. Gy\"orfi, "Distribution and density estimation,"
in: Principles of Nonparametric Learning, ed. L. Gy\"orfi, CISM Courses and Lectures No.\ 434, pp. 211-270, Springer-Verlag, Vienna, 2002.

P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, "On the spanning ratio of Gabriel graphs and beta-skeletons,"
in: Proceedings of LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Springer Lecture Notes in Computer Science, vol. 2286, pp. 479-493, Springer, 2002.


P. Bose, L. Devroye, and P. Morin, "Succinct data structures for approximating convex functions with applications ,"
in: Discrete and Computational Geometry JCDCG 2002, ed. Jin Akiyama and Mikio Kano, Lecture Notes in Computer Science, vol. 2866, pp. 97-107, Springer-Verlag, Tokyo, 2003.


Z.D. Bai, L. Devroye, and T.H. Tsay, "Applications of Stein's method to maxima in hypercubes,"
in: Stein's Method and Applications, ed. Louis Chen and Andrew Barbour, Institute for Mathematical Sciences Lecture Notes Series, vol. 5, pp. 157-168, World Scientific Press, Singapore, 2005.


L. Devroye, "Applications of Stein's method in the analysis of random binary search trees,"
in: Stein's Method and Applications, ed. Louis Chen and Andrew Barbour, Institute for Mathematical Sciences Lecture Notes Series, vol. 5, pp. 247-297, World Scientific Press, Singapore, 2005.


L. Devroye, "Non-uniform random variate generation,"
in: Handbooks in Operations Research and Management Volume 13 Simulation, ed. Shane G. Henderson and Barry L. Nelson, pp. 83-121, North-Holland, Amsterdam, 2006.

L. Devroye, G. Lugosi, G. Park, and W. Szpankowski, "Multiple choice tries and distributed hash tables,"
in: Proceedings of the 18th SIAM-ACM Symposium on Discrete Algorithms (SODA 2007), pp. 891-899, SIAM, Philadelphia, 2007.


N. Broutin and L. Devroye, "The height of list-tries and TST,"
in: DMTCS Proceedings Series Volume XX, ed. Philippe Jacquet, International Conference on Analysis of Algorithms, pp. 245-256, DMTCS, Nancy, France, 2007.


L. Devroye, "On exact simulation algorithms for some distributions related to Brownian motion and Brownian meanders,"
in: Recent Developments in Applied Probability and Statistics, ed. Luc Devroye, B\"ulent Karas\"ozen, Michael Kohler, Ralf Korn, pp. 1-40, Springer, Berlin, 2010.


L. Devroye, O. Fawzi, and N. Fraiman, "The height of scaled attachment random recursive trees,"
in: Proceedings of the 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), ed. M. Drmota and B. Gittenberger, pp. 129-142, Vienna, Austria, 2010.


L. Devroye, "Complexity questions in non-uniform random variate generation,"
in: Proceedings in Computational Statistics 2010, ed. Yves Lechevallier and Gilbert Saporta, pp. 3-18, Physica-Verlag, Berlin, 2010.


L. Devroye, "Classification and trees,"
in: Structural, Syntactic and Statistical Pattern Recognition (S+SSPR 2010), Springer Lecture Notes in Computer Science, 2010, vol. 6218, pp. 40-44, Cesme, Turkey, 2010.


G. Biau, L. Devroye, V. Dujmovic, and A. Krzyzak, "An affine invariant k-nearest neighbor regression estimate,"
in: Proceeding is the 2012 IEEE International Symposium on Information Theory, 2012, pp. 1445-1447, IEEE, Boston, MA, 2012.


L. Devroye and P. Morin, "A note on interference in random networks,"
in: Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, 2012, pp. 193-198, Charlottetown, Prince Edward Island, Canada, 2012.


X. S. Cai and L. Devroye, "A probabilistic analysis of Kademlia networks,"
in: Algorithms and Computation: Proceedings of the 24th International Symposium ISAAC 2013, ed. L. Cai, S.-W. Chen and T.-W. Lam, 2013, vol. 8283, pp. 711-721, Springer Verlag, Berlin, 2013.


L. Devroye, G. Lugosi, and G. Neu, "Prediction by random walk perturbation,"
in: COLT 2013 - The 26th Annual Conference on Learning Theory, June 12-14, 2013, Princeton University, NJ, USA, ed. Shai Shalev-Shwartz, Ingo Steinwart, 2013, pp. 460-473, 2013.


L. Devroye, P.G. Ferrario, L. Gyorfi, and H. Walk, "Strong universal consistent estimate of the minimum mean squared error,"
in: Empirical Inference Festschrift in Honor of Vladimir N. Vapnik, ed. Bernhard Sch\"olkopf, Zhiyuan Luo and Vladimir Vovk, pp. 143-160, Springer-Verlag, Berlin-Heidelberg, 2014.


G. Biau and L. Devroye, "Cellular tree classifiers,"
in: Algorithmic Learning Theory: Proceedings of the 25th International Conference, ALT 2014, ed. Peter Auer, Alexander Clark, Thomas Zeugmann and Sandra Zilles, Lecture Notes in Computer Science, Volume 8776 2014, pp. 8-17, Springer-Verlag, Berlin-Heidelberg, 2014.


L. Devroye and G. Letac, "Copulas with prescribed correlation matrix,"
in: In Memoriam Marc Yor---S\'eminaire de Probabilit\'es XLVII, ed. Catherine Donati-Martin, Antoine Lejay, and Alain Rouault (eds), pp. 585-601, Springer-Verlag, Berlin-Heidelberg, 2015.


Luc Devroye
School of Computer Science
McGill University
Montreal, Canada H3A 2K6