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


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. 356360,
IEEE,
1973.


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


L. Devroye, T.J. Wagner,
"A distributionfree performance bound in error estimation,"
in: Proceedings of the Third International Joint Conference on Pattern Recognition,
pp. 267272,
IEEE,
1976.


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


L. Devroye, T.J. Wagner,
"Distributionfree performance bounds with the resubstitution error estimate,"
in: Proceedings PRIP 77,
pp. 323326,
IEEE,
1977.


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


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


L. Devroye, 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. 211220,
1977.


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


L. Devroye, T.J. Wagner,
"The strong uniform convergence of kernel density estimates,"
in: Multivariate Analysis V,
ed. P.R. Krishnaiah,
pp. 5977,
NorthHolland,
1980.


L. Devroye,
"Distributionfree consistency results in discrimination,"
in: Proceedings AFOSR Workshop in Communication Theory and Applications,
pp. 3842,
IEEE,
1978.


L. Devroye,
"Some properties of the knearest neighbor rule,"
in: Proceedings of the Fifth International Conference on Pattern Recognition,
pp. 103105,
IEEE,
1980.


L. Devroye,
"The strong convergence of empirical nearest neighbor estimates of integrals,"
in: Statistics and Related Topics,
ed. M. Csorgo, D.A. Dawson, J.N.K. Rao, A.K.M.E. Saleh,
pp. 243252,
NorthHolland,
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. 7682,
SpringerVerlag,
1981.


L. Devroye,
"Recent results in nonuniform random variate generation,"
in: 1981 Winter Simulation Conference Proceedings,
ed. T.I. Oren, C.M. Delfosse, C.M. Shub,
pp. 517521,
IEEE,
1981.


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


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. 3546,
SpringerVerlag, Heidelberg,
1986.


L. Devroye,
"Samplebased nonuniform random variate generation,"
in: Proceedings of the 1986 Winter Simulation Conference,
ed. J. Wilson, J. Henriksen, S. Roberts,
pp. 260265,
IEEE,
1986.


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. 425431,
IEEE,
1988.


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


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. 270279,
ACM, Baltimore, MD,
1992.


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


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. 2031,
Operations Research Society of Japan,
1994.


L. Devroye, P. Kruszewski,
"The botanical beauty of random binary trees,"
in: Graph Drawing 95,
ed. F. Brandenburg,
pp. 166177,
SpringerVerlag,
1995.


L. Devroye,
"Sur l'estimation des densit\'es,"
in: Recueil des r\'esum\`es des communications des XXVIII\`emes Journ\'ees de statistique,
pp. 44,
Bureau de la statistique du Qu\'ebec,
1996.


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. 265272,
ACM,
1996.


L. Devroye,
"Branching processes (four invited talks),"
in: Probabilistic Methods for Algorithmic Discrete Mathematics,
ed. M. Habib, C. McDiarmid, J. RamirezAlfonsin and B. Reed,
pp. 249314,
SpringerVerlag, Berlin,
1998.


L. Devroye,
"Nonparametric density estimation (five lectures),"
in: Principles of Nonparametric Learning,
ed. L. Gy\"orfi,
pp. 211270,
SpringerVerlag, Wien,
2002.


L. Devroye, C. McDiarmid, 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. 161173,
Birkh\"auserVerlag, Basel,
2002.


L. Devroye, 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. 267278,
Birkh\"auserVerlag, Basel,
2002.


L. Devroye,
"Random tries,"
in: Algorithms and Computation: 13th International Symposium ISAAC 2002,
ed. P. Bose and P. Morin,
pp. 635,
SpringerVerlag, Berlin,
2002.


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


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


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, G. Lugosi, G. Park, W. Szpankowski,
"Multiple choice tries and distributed hash tables,"
in: Proceedings of ACMSIAM Symposium on Discrete Algorithms,
pp. 00,
2007.


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


L. Devroye, P. Bose, M. Loeffler, J. Snoeyink and V. Verma,
"The spanning ratio of the Delaunay triangulation is greater than pi over 2,"
in: Proceedings of CCCG 2009,
pp. 13,
2009.


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


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


L. Devroye, X.S. Cai,
"A probabilistic analysis of Kademlia networs,"
in: ISAAC 2013,
pp. 00,
2013.


L. Devroye,
"Prediction by random walk perturbation,"
in: COLT 2013  The 26th Annual Conference on Learning Theory,
ed. Shai ShalevShwartz, Ingo Steinwart,
pp. 460473,
2013.


L. Devroye,
"Cellular tree classifiers,"
in: Algorithmic Learning Theory,
ed. Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles,
pp. 817,
2014.


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. 11,
2018.
