Nicolas Broutin

According to our database, Nicolas Broutin authored at least 29 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Leaf Stripping on Uniform Attachment Trees.

Louigi Addario-Berry, Anna M. Brandenberger, Simon Briend, Nicolas Broutin, Gábor Lugosi

CoRR, 2024

2023

Increasing paths in random temporal graphs.

Nicolas Broutin, Nina Kamcev, Gábor Lugosi

CoRR, 2023

2022

Subtractive random forests.

Nicolas Broutin, Luc Devroye, Gábor Lugosi, Roberto Imbuzeiro Oliveira

CoRR, 2022

2021

Batched Bandits with Crowd Externalities.

Romain Laroche, Othmane Safsafi, Raphaël Féraud, Nicolas Broutin

CoRR, 2021

2020

The combinatorics of the colliding bullets.

Nicolas Broutin, Jean-François Marckert

Random Struct. Algorithms, 2020

Recursive functions on conditional Galton-Watson trees.

Nicolas Broutin, Luc Devroye, Nicolas Fraiman

Random Struct. Algorithms, 2020

Limits of multiplicative inhomogeneous random graphs and Lévy trees: Limit theorems.

Nicolas Broutin, Thomas Duquesne, Minmin Wang

CoRR, 2020

2018

And/or trees: A local limit point of view.

Nicolas Broutin, Cécile Mailler

Random Struct. Algorithms, 2018

2017

A limit field for orthogonal range searches in two-dimensional random point search trees.

Nicolas Broutin, Henning Sulzbach

CoRR, 2017

2016

Efficiently navigating a random Delaunay triangulation.

Nicolas Broutin, Olivier Devillers, Ross Hemsley

Random Struct. Algorithms, 2016

2014

Asymptotics of trees with a prescribed degree sequence and applications.

Nicolas Broutin, Jean-François Marckert

Random Struct. Algorithms, 2014

Connectivity threshold of Bluetooth graphs.

Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi

Random Struct. Algorithms, 2014

Cutting down $\mathbf p$-trees and inhomogeneous continuum random trees.

Nicolas Broutin, Minmin Wang

CoRR, 2014

A new encoding of coalescent processes. Applications to the additive and multiplicative cases.

Nicolas Broutin, Jean-François Marckert

CoRR, 2014

Almost optimal sparsification of random geometric graphs.

Nicolas Broutin, Luc Devroye, Gábor Lugosi

CoRR, 2014

Connectivity of sparse Bluetooth networks.

Nicolas Broutin, Luc Devroye, Gábor Lugosi

CoRR, 2014

2012

The distribution of height and diameter in random non-plane binary trees.

Nicolas Broutin, Philippe Flajolet

Random Struct. Algorithms, 2012

Longest Path Distance in Random Circuits.

Nicolas Broutin, Omar Fawzi

Comb. Probab. Comput., 2012

The dual tree of a recursive triangulation of the disk

Nicolas Broutin, Henning Sulzbach

CoRR, 2012

A limit process for partial match queries in random quadtrees

Nicolas Broutin, Ralph Neininger, Henning Sulzbach

CoRR, 2012

Partial match queries in random quadtrees.

Nicolas Broutin, Ralph Neininger, Henning Sulzbach

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

The total path length of split trees

Nicolas Broutin, Cecilia Holmgren

CoRR, 2011

2010

The Longest Minimum-Weight Path in a Complete Graph.

Louigi Addario-Berry, Nicolas Broutin, Gábor Lugosi

Comb. Probab. Comput., 2010

Note on the Structure of Kruskal's Algorithm.

Nicolas Broutin, Luc Devroye, Erin McLeish

Algorithmica, 2010

2009

Critical random graphs and the structure of a minimum spanning tree.

Louigi Addario-Berry, Nicolas Broutin, Bruce A. Reed

Random Struct. Algorithms, 2009

2008

The height of increasing trees.

Nicolas Broutin, Luc Devroye, Erin McLeish, M. de la Salle

Random Struct. Algorithms, 2008

An Analysis of the Height of Tries with Random Weights on the Edges.

Nicolas Broutin, Luc Devroye

Comb. Probab. Comput., 2008

Weighted height of random trees.

Nicolas Broutin, Luc Devroye, Erin McLeish

Acta Informatica, 2008

2006

Large Deviations for the Weighted Height of an Extended Class of Trees.

Nicolas Broutin, Luc Devroye

Algorithmica, 2006