X.S. Cai, L. Devroye, C. Holmgren, F. Skerman, and L. Devroye, "k-cuts on a path,"
in: Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27--29, 2019, Proceedings, Lecture Notes in Computer Science 11485, ed. Pinar Heggernes, pp. 112-123, Springer Nature, Cham, Switzerland, 2019.

L. Devroye, "OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture),"
in: Proceedings of the 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, ed. James Allen Fill, Mark Daniel Ward, pp. 1-1, 2018.

G. Biau and L. Devroye, "Cellular tree classifiers,"
in: Algorithmic Learning Theory, ed. Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles, pp. 8-17, 2014.

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

X.S. Cai and L. Devroye, "A probabilistic analysis of Kademlia networs,"
in: Algorithms and Computation---24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings, ed. Leizhen Cai, Siu{-}Wing Cheng and Tak Wah Lam, pp. 711-721, Springer, 2013.

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

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

L. Devroye, "The spanning ratio of the Delaunay triangulation is greater than pi over 2,"
in: Proceedings of CCCG 2009, pp. 1-3, 2009.

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

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

L. Devroye, "Random multivariate search trees,"
in: Learning Theory: Proceedings of COLT 2006, the 19th Annual Conference on Learning Theory, ed. Gabor Lugosi and Hans Ulrich Simon, pp. 1, Springer, 2006.

L. Devroye, "Formatting font formats,"
in: Proceedings of the Fourteenth EuroTEX Conference: Back to Typography, ed. Y. Haralambous, pp. 588-596, ENST, Bretagne, 2003.

L. Devroye, P. Bose, and P. Morin, "Minimalist approximations for convex functions,"
in: JCDCG 2002: The Japan Conference on Discrete and Computational Geometry, Springer-Verlag, Tokyo, 2003.

L. Devroye, "Random tries,"
in: Algorithms and Computation: 13th International Symposium ISAAC 2002, ed. P. Bose and P. Morin, pp. 635, Springer-Verlag, Berlin, 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äuser-Verlag, Basel, 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äuser-Verlag, Basel, 2002.

L. Devroye and L. Györfi, "Distribution and density estimation,"
in: Principles of Nonparametric Learning, ed. L. Györfi, pp. 211-270, Springer-Verlag, Wien, 2002.

L. Devroye, "Branching processes (four invited talks),"
in: Probabilistic Methods for Algorithmic Discrete Mathematics, ed. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed, pp. 249-314, Springer-Verlag, Berlin, 1998.

L. Devroye, "Random variate generation in one line of code,"
in: 1996 Winter Simulation Conference Proceedings, ed. J.M. Charnes, D.J. Morrice, D.T. Brunner and J.J. Swain, pp. 265-272, ACM, 1996.

L. Devroye, "Sur l'estimation des densités,"
in: Recueil des résumés des communications des XXVIIIèmes Journées de statistique, pp. 44, Bureau de la statistique du Québec, 1996.

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

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, 1994.

L. Devroye and Olivier Kamoun, "Probabilistic min-max trees,"
in: Proceedings of the 4th International Workshop on AI and Statistics, ed. P. Cheeseman, pp. 0-0, 0, 1993.

L. Devroye, "Generation of random objects,"
in: 1992 Winter Simulation Conference Proceedings, ed. J.J. Swain, D. Goldsman, R.C. Crain and J.R. Wilson, pp. 270-279, ACM, Baltimore, MD, 1992.

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

L. Devroye, "Generating sums in constant average time,"
in: Proceedings of the 1988 Winter Simulation Conference, ed. M. A. Abrams, P. L. Haigh and J. C. Comfort, pp. 425-431, IEEE, 1988.

L. Devroye, "Sample-based non-uniform random variate generation,"
in: Proceedings of the 1986 Winter Simulation Conference, ed. J. Wilson, J. Henriksen, S. Roberts, pp. 260-265, IEEE, 1986.

L. Devroye, "Automatic selection of a discrimination rule based upon minimization of the empirical risk,"
in: Proceedings of the NASI Workshop on Pattern Recognition, NATO ASI Series, Vol. F30, ed. P. Devijver and J. Kittler, pp. 35-46, Springer-Verlag, Heidelberg, 1986.

L. Devroye, "Topics in global convergence of density estimates,"
in: Proceedings of the NASA Workshop on Density Estimation, ed. L.F. Guseman, pp. 9-19, Department of Mathematics, Texas A&M University, 1982.

L. Devroye, "Recent results in non-uniform random variate generation,"
in: 1981 Winter Simulation Conference Proceedings, ed. T.I. Oren, C.M. Delfosse, C.M. Shub, pp. 517-521, IEEE, 1981.

L. Devroye, "Recent results on the average time behavior of some algorithms in computational geometry,"
in: Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface, ed. W.F. Eddy, pp. 76-82, Springer-Verlag, 1981.

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

L. Devroye, "Some properties of the k-nearest neighbor rule,"
in: Proceedings of the Fifth International Conference on Pattern Recognition, pp. 103-105, IEEE, 1980.

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

L. Devroye, "Distribution-free consistency results in discrimination,"
in: Proceedings AFOSR Workshop in Communication Theory and Applications, pp. 38-42, IEEE, 1978.

L. Devroye, "A universal k-nearest neighbor procedure in clustering and discrimination,"
in: Proceedings of the 1978 Computer Society Conference on Pattern Recognition and Image Processing, pp. 142-147, IEEE, 1978.

L. Devroye and G.L. Wise, "Nonparametric detection of changes in system characteristics,"
in: Proceedings of the 20th Midwest Symposium on Circuits and Systems, 1977.

L. Devroye and T.J. Wagner, "Asymptotic properties of clustering algorithms,"
in: Proceedings PRIP 77, pp. 321-322, IEEE, 1977.

L. Devroye and T.J. Wagner, "Distribution-free performance bounds with the resubstitution error estimate,"
in: Proceedings PRIP 77, pp. 323-326, IEEE, 1977.

L. Devroye and G.L. Wise, "On the estimation of discrete probability densities from noisy measurements,"
in: Proceedings of the 15th Annual Allerton Conference on Communication, Control and Computing, pp. 211-220, 1977.

L. Devroye, "On random search with a learning memory,"
in: Proceedings of the IEEE Conference on Cybernetics and Society, pp. 704-711, IEEE, 1976.

L. Devroye and H T.J. Wagner, "A distribution-free performance bound in error estimation,"
in: Proceedings of the Third International Joint Conference on Pattern Recognition, pp. 267-272, IEEE, 1976.

L. Devroye, "On the properties of convergence of statistical search,"
in: Proceedings of the IEEE Conference on Decision and Control, pp. 250-255, IEEE, 1974.

L. Devroye, "A mixed stochastic optimization algorithm and its applications in pattern recognition,"
in: Proceedings of the 1973 IEEE Conference on Decision and Control, pp. 356-360, IEEE, 1973.

L. Devroye, "The compound random search algorithm,"
in: Proceedings of the International Symposium on Systems Engineering, pp. 105-110, 1972.

Luc Devroye
School of Computer Science
McGill University
Montreal, Canada H3A 2K6
lucdevroye@gmail.ca
https://luc.devroye.org