| On combinatorial testing problems L Addario-Berry, N Broutin, L Devroye, G Lugosi The Annals of Statistics 38 (5), 3063-3092, 2010 | 138 | 2010 |
| The continuum limit of critical random graphs L Addario-Berry, N Broutin, C Goldschmidt Probability Theory and Related Fields 152 (3-4), 367-406, 2012 | 123 | 2012 |
| The scaling limit of the minimum spanning tree of the complete graph L Addario-Berry, N Broutin, C Goldschmidt, G Miermont The Annals of Probability 45 (5), 3075-3144, 2017 | 75 | 2017 |
| Critical random graphs: limiting constructions and distributional properties L Addario-Berry, N Broutin, C Goldschmidt Electronic Journal of Probability 15, 741-775, 2010 | 53 | 2010 |
| Large deviations for the weighted height of an extended class of trees N Broutin, L Devroye Algorithmica 46 (3), 271-297, 2006 | 52 | 2006 |
| Cutting down trees with a Markov chainsaw L Addario-Berry, N Broutin, C Holmgren The Annals of Applied Probability 24 (6), 2297-2339, 2014 | 42 | 2014 |
| Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erd\H {o} sR\'enyi random graph S Bhamidi, N Broutin, S Sen, X Wang arXiv preprint arXiv:1411.3417, 2014 | 40 | 2014 |
| The height of increasing trees N Broutin, L Devroye, E McLeish, M de la Salle Random Structures & Algorithms 32 (4), 494-518, 2008 | 38 | 2008 |
| Asymptotics of trees with a prescribed degree sequence and applications N Broutin, JF Marckert Random Structures & Algorithms 44 (3), 290-316, 2014 | 35 | 2014 |
| Connectivity threshold of Bluetooth graphs N Broutin, L Devroye, N Fraiman, G Lugosi Random Structures & Algorithms 44 (1), 45-66, 2014 | 23 | 2014 |
| The distribution of height and diameter in random non‐plane binary trees N Broutin, P Flajolet Random Structures & Algorithms 41 (2), 215-252, 2012 | 21 | 2012 |
| Total progeny in killed branching random walk L Addario-Berry, N Broutin Probability theory and related fields 151 (1-2), 265-295, 2011 | 21 | 2011 |
| Critical random graphs and the structure of a minimum spanning tree L Addario‐Berry, N Broutin, B Reed Random Structures & Algorithms 35 (3), 323-347, 2009 | 21 | 2009 |
| A new encoding of coalescent processes: applications to the additive and multiplicative cases N Broutin, JF Marckert Probability Theory and Related Fields 166 (1), 515-552, 2016 | 19 | 2016 |
| The total path length of split trees N Broutin, C Holmgren The Annals of Applied Probability 22 (5), 1745-1777, 2012 | 18 | 2012 |
| The height of random binary unlabelled trees N Broutin, P Flajolet arXiv preprint arXiv:0807.2365, 2008 | 18 | 2008 |
| The diameter of the minimum spanning tree of a complete graph L Addario-Berry, N Broutin, B Reed Discrete Mathematics and Theoretical Computer Science, 237-248, 2006 | 16 | 2006 |
| Cutting down -trees and inhomogeneous continuum random trees N Broutin, M Wang Bernoulli 23 (4A), 2380-2433, 2017 | 14 | 2017 |
| The longest minimum-weight path in a complete graph L Addario-Berry, N Broutin, G Lugosi Combinatorics, Probability and Computing 19 (1), 1-19, 2010 | 14 | 2010 |
| Note on the Structure of Kruskal’s Algorithm N Broutin, L Devroye, E McLeish Algorithmica 56 (2), 141-159, 2010 | 13 | 2010 |
Luc DevroyeMcGill UniversityVerified email at cs.mcgill.ca
