1. Recherche
27 résultats  enregistrer la recherche
...
inria-00510232v1  Documents associés à des manifestations scientifiques -- Hal-inria+
Nicolas Broutin. Les distances dans les arbres couvrants minimaux
Journées MAS et Journée en l'honneur de Jacques Neveu, Aug 2010, Talence, France
hal-00773365v1  Communication dans un congrès
Nicolas Broutin, Ralph Neininger, Henning Sulzbach. Partial match queries in random quadtrees
Symposium on Discrete Algorithms (SoDA), Jan 2012, Kyoto, Japan. pp.1056--1065, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. <10.1137/1.9781611973099.83>
hal-01056124v1  Pré-publication, Document de travail
Nicolas Broutin, Minmin Wang. Reversing the cut tree of the Brownian continuum random tree
24 pages, 5 figures. 2014
hal-01056127v1  Article dans une revue
Nicolas Broutin, Luc Devroye, Gabor Lugosi. Almost optimal sparsification of random geometric graphs
The Annals of Applied Probability : an official journal of the institute of mathematical statistics, The Institute of Mathematical Statistics, 2016, 26, pp.3078-3109. <10.1214/15-AAP1170>
hal-01056126v1  Pré-publication, Document de travail
Nicolas Broutin, Ross J. Kang. Bounded monochromatic components for random graphs
20 pages, 1 figure. 2014
hal-00773363v1  Article dans une revue
Nicolas Broutin, Ralph Neininger, Henning Sulzbach. A limit process for partial match queries in random quadtrees and 2-d trees
Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2013, 23, pp.2560-2603. <10.1214/12-AAP912>
hal-00773367v1  Article dans une revue
Nicolas Broutin, Cecilia Holmgren. The total path length of split trees
Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2012, 22 (5), pp.1745-1777. <10.1214/11-AAP812>
...
tel-00842019v1  HDR
Nicolas Broutin. Random trees, graphs and recursive partitions
Probability [math.PR]. Université Pierre et Marie Curie - Paris VI, 2013
hal-01220798v1  Article dans une revue
L. Addario-Berry, Nicolas Broutin. Total progeny in killed branching random walk
Probability Theory and Related Fields, Springer Verlag, 2011, 151, pp.265-295. <10.1007/s00440-010-0299-2>
hal-00919175v1  Article dans une revue
Nicolas Broutin, Jean-François Marckert. Asymptotic of trees with a prescribed degree sequence and applications
Random Structures and Algorithms, Wiley, 2014, Random Structures and Algorithms, 44 (3), pp.290-316
...
hal-01194678v1  Communication dans un congrès
Nicolas Broutin, Philippe Flajolet. The height of random binary unlabelled trees
Roesler, Uwe. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, pp.121-134, 2008, DMTCS Proceedings
...
hal-01184718v1  Communication dans un congrès
Louigi Addario-Berry, Nicolas Broutin, Bruce Reed. The Diameter of the Minimum Spanning Tree of a Complete Graph
Chassaing, Philippe and others. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, pp.237-248, 2006, DMTCS Proceedings
hal-01056128v1  Article dans une revue
Nicolas Broutin, Luc Devroye, Gábor Lugosi. Connectivity of sparse Bluetooth networks
Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2015, 20 (48), pp.1-10
hal-01056125v1  Article dans une revue
Nicolas Broutin, Minmin Wang. Cutting down $\mathbf p$-trees and inhomogeneous continuum random trees
Bernoulli, Bernoulli Society for Mathematical Statistics and Probability, 2016
hal-00773368v1  Article dans une revue
Nicolas Broutin, Omar Fawzi. Longest path distance in random circuits
Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2012, 21 (6), pp.856-881. <10.1017/S0963548312000260>
hal-00773364v1  Article dans une revue
Louigi Addario-Berry, Nicolas Broutin, Cecilia Holmgren. Cutting down trees with a Markov chainsaw
Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2014, 24 (6), pp.2297-2339. <10.1214/13-AAP978>
hal-00773370v1  Article dans une revue
Louigi Addario-Berry, Nicolas Broutin, Christina Goldschmidt. The continuum limit of critical random graphs
Probability Theory and Related Fields, Springer Verlag, 2012, 152, pp.367-406. <10.1007/s00440-010-0325-4>
hal-00773362v1  Article dans une revue
Nicolas Broutin, Henning Sulzbach. The dual tree of a recursive triangulation of the disk
Annals of Probability, Institute of Mathematical Statistics, 2015, 43, pp.738-781. <10.1214/13-AOP894>
hal-00773360v1  Article dans une revue
Louigi Addario-Berry, Nicolas Broutin, Christina Goldschmidt, Grégory Miermont. The scaling limit of the minimum spanning tree of the complete graph
Annals of Probability, Institute of Mathematical Statistics, 2016
hal-00773369v1  Article dans une revue
Nicolas Broutin, Philippe Flajolet. The distribution of height and diameter in random non-plane binary trees
Random Structures and Algorithms, Wiley, 2011, 41 (2), pp.215-252. <10.1002/rsa.20393>
hal-00773366v1  Article dans une revue
Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi. Connectivity threshold for Bluetooth graphs
Random Structures and Algorithms, Wiley, 2014, 44, pp.45-66. <10.1002/rsa.20459>
hal-01220797v1  Article dans une revue
Nicolas Broutin, Jean-François Marckert. Asymptotics of trees with a prescribed degree sequence
Random Structures and Algorithms, Wiley, 2014, 44, pp.290-316. <10.1002/rsa.20463>
...
hal-00940743v3  Article dans une revue
Nicolas Broutin, Olivier Devillers, Ross Hemsley. Efficiently navigating a random Delaunay triangulation
Random Structures and Algorithms, Wiley, 2016, 49 (1), pp.95--136. <10.1002/rsa.20630>

Contact


archive-ouverte@inria.fr