Nicolas Broutin

32 papers A* 1Journal 31
YearRankTypeTitle / Venue / Authors
2024 J jnl
Leaf Stripping on Uniform Attachment Trees.
CoRR
Louigi Addario-Berry, Anna M. Brandenberger, Simon Briend, Nicolas Broutin, Gábor Lugosi
2023 J jnl
Increasing paths in random temporal graphs.
CoRR
Nicolas Broutin, Nina Kamcev, Gábor Lugosi
2022 J jnl
Subtractive random forests.
CoRR
Nicolas Broutin, Luc Devroye, Gábor Lugosi, Roberto Imbuzeiro Oliveira
2021 J jnl
Batched Bandits with Crowd Externalities.
CoRR
Romain Laroche, Othmane Safsafi, Raphaël Féraud, Nicolas Broutin
2020 J jnl
Limits of multiplicative inhomogeneous random graphs and Lévy trees: Limit theorems.
CoRR
Nicolas Broutin, Thomas Duquesne, Minmin Wang
2020 J jnl
Recursive functions on conditional Galton-Watson trees.
Random Struct. Algorithms
Nicolas Broutin, Luc Devroye, Nicolas Fraiman
2020 J jnl
The combinatorics of the colliding bullets.
Random Struct. Algorithms
Nicolas Broutin, Jean-François Marckert
2018 J jnl
And/or trees: A local limit point of view.
Random Struct. Algorithms
Nicolas Broutin, Cécile Mailler
2017 J jnl
A limit field for orthogonal range searches in two-dimensional random point search trees.
CoRR
Nicolas Broutin, Henning Sulzbach
2016 J jnl
Efficiently navigating a random Delaunay triangulation.
Random Struct. Algorithms
Nicolas Broutin, Olivier Devillers, Ross Hemsley
2014 J jnl
A new encoding of coalescent processes. Applications to the additive and multiplicative cases.
CoRR
Nicolas Broutin, Jean-François Marckert
2014 J jnl
Almost optimal sparsification of random geometric graphs.
CoRR
Nicolas Broutin, Luc Devroye, Gábor Lugosi
2014 J jnl
Asymptotics of trees with a prescribed degree sequence and applications.
Random Struct. Algorithms
Nicolas Broutin, Jean-François Marckert
2014 J jnl
Connectivity of sparse Bluetooth networks.
CoRR
Nicolas Broutin, Luc Devroye, Gábor Lugosi
2014 J jnl
Connectivity threshold of Bluetooth graphs.
Random Struct. Algorithms
Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi
2014 J jnl
Cutting down $\mathbf p$-trees and inhomogeneous continuum random trees.
CoRR
Nicolas Broutin, Minmin Wang
2014 J jnl
Efficiently navigating a random Delaunay triangulation.
CoRR
Nicolas Broutin, Olivier Devillers, Ross Hemsley
2012 J jnl
A limit process for partial match queries in random quadtrees
CoRR
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
2012 J jnl
Longest Path Distance in Random Circuits.
Comb. Probab. Comput.
Nicolas Broutin, Omar Fawzi
2012 A* conf
Partial match queries in random quadtrees.
SODA
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
2012 J jnl
The distribution of height and diameter in random non-plane binary trees.
Random Struct. Algorithms
Nicolas Broutin, Philippe Flajolet
2012 J jnl
The dual tree of a recursive triangulation of the disk
CoRR
Nicolas Broutin, Henning Sulzbach
2011 J jnl
Connectivity threshold for Bluetooth graphs
CoRR
Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi
2011 J jnl
Partial match queries in random quadtrees
CoRR
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
2011 J jnl
The total path length of split trees
CoRR
Nicolas Broutin, Cecilia Holmgren
2010 J jnl
Note on the Structure of Kruskal's Algorithm.
Algorithmica
Nicolas Broutin, Luc Devroye, Erin McLeish
2010 J jnl
The Longest Minimum-Weight Path in a Complete Graph.
Comb. Probab. Comput.
Louigi Addario-Berry, Nicolas Broutin, Gábor Lugosi
2009 J jnl
Critical random graphs and the structure of a minimum spanning tree.
Random Struct. Algorithms
Louigi Addario-Berry, Nicolas Broutin, Bruce A. Reed
2008 J jnl
An Analysis of the Height of Tries with Random Weights on the Edges.
Comb. Probab. Comput.
Nicolas Broutin, Luc Devroye
2008 J jnl
The height of increasing trees.
Random Struct. Algorithms
Nicolas Broutin, Luc Devroye, Erin McLeish, M. de la Salle
2008 J jnl
Weighted height of random trees.
Acta Informatica
Nicolas Broutin, Luc Devroye, Erin McLeish
2006 J jnl
Large Deviations for the Weighted Height of an Extended Class of Trees.
Algorithmica
Nicolas Broutin, Luc Devroye