 | 2012 |
|---|
| 12 |       | Nicolas Broutin,
Ralph Neininger,
Henning Sulzbach:
Partial match queries in random quadtrees.
SODA 2012: 1056-1065 |
| 11 | | Nicolas Broutin,
Ralph Neininger,
Henning Sulzbach:
A limit process for partial match queries in random quadtrees
CoRR abs/1202.1342: (2012) |
| 2011 |
|---|
| 10 | | Nicolas Broutin,
Cecilia Holmgren:
The total path length of split trees
CoRR abs/1102.2541: (2011) |
| 9 | | Nicolas Broutin,
Luc Devroye,
Nicolas Fraiman,
Gábor Lugosi:
Connectivity threshold for Bluetooth graphs
CoRR abs/1103.0351: (2011) |
| 8 | | Nicolas Broutin,
Ralph Neininger,
Henning Sulzbach:
Partial match queries in random quadtrees
CoRR abs/1107.2231: (2011) |
| 2010 |
|---|
| 7 | | Nicolas Broutin,
Luc Devroye,
Erin McLeish:
Note on the Structure of Kruskal's Algorithm.
Algorithmica 56(2): 141-159 (2010) |
| 6 | | Louigi Addario-Berry,
Nicolas Broutin,
Gábor Lugosi:
The Longest Minimum-Weight Path in a Complete Graph.
Combinatorics, Probability & Computing 19(1): 1-19 (2010) |
| 2009 |
|---|
| 5 | | Louigi Addario-Berry,
Nicolas Broutin,
Bruce A. Reed:
Critical random graphs and the structure of a minimum spanning tree.
Random Struct. Algorithms 35(3): 323-347 (2009) |
| 2008 |
|---|
| 4 | | Nicolas Broutin,
Luc Devroye,
Erin McLeish:
Weighted height of random trees.
Acta Inf. 45(4): 237-277 (2008) |
| 3 | | Nicolas Broutin,
Luc Devroye:
An Analysis of the Height of Tries with Random Weights on the Edges.
Combinatorics, Probability & Computing 17(2): 161-202 (2008) |
| 2 | | Nicolas Broutin,
Luc Devroye,
Erin McLeish,
M. de la Salle:
The height of increasing trees.
Random Struct. Algorithms 32(4): 494-518 (2008) |
| 2006 |
|---|
| 1 | | Nicolas Broutin,
Luc Devroye:
Large Deviations for the Weighted Height of an Extended Class of Trees.
Algorithmica 46(3-4): 271-297 (2006) |
Data released under the ODC-BY 1.0 license — See also our legal information page