Nicolas Broutin

According to our database1, Nicolas Broutin authored at least 14 papers between 2006 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
And/or trees: A local limit point of view.
Random Struct. Algorithms, 2018

2016
Efficiently navigating a random Delaunay triangulation.
Random Struct. Algorithms, 2016

2014
Asymptotics of trees with a prescribed degree sequence and applications.
Random Struct. Algorithms, 2014

Connectivity threshold of Bluetooth graphs.
Random Struct. Algorithms, 2014

2012
The distribution of height and diameter in random non-plane binary trees.
Random Struct. Algorithms, 2012

Longest Path Distance in Random Circuits.
Combinatorics, Probability & Computing, 2012

Partial match queries in random quadtrees.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010
The Longest Minimum-Weight Path in a Complete Graph.
Combinatorics, Probability & Computing, 2010

Note on the Structure of Kruskal's Algorithm.
Algorithmica, 2010

2009
Critical random graphs and the structure of a minimum spanning tree.
Random Struct. Algorithms, 2009

2008
The height of increasing trees.
Random Struct. Algorithms, 2008

An Analysis of the Height of Tries with Random Weights on the Edges.
Combinatorics, Probability & Computing, 2008

Weighted height of random trees.
Acta Inf., 2008

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


  Loading...