default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Broutin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j15]Nicolas Broutin, Jean-François Marckert:
The combinatorics of the colliding bullets. Random Struct. Algorithms 56(2): 401-431 (2020)- [j14]Nicolas Broutin, Luc Devroye, Nicolas Fraiman
:
Recursive functions on conditional Galton-Watson trees. Random Struct. Algorithms 57(2): 304-316 (2020) - 2018
- [j13]Nicolas Broutin, Cécile Mailler:
And/or trees: A local limit point of view. Random Struct. Algorithms 53(1): 15-58 (2018) - 2016
- [j12]Nicolas Broutin, Olivier Devillers, Ross Hemsley:
Efficiently navigating a random Delaunay triangulation. Random Struct. Algorithms 49(1): 95-136 (2016) - 2014
- [j11]Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi:
Connectivity threshold of Bluetooth graphs. Random Struct. Algorithms 44(1): 45-66 (2014) - [j10]Nicolas Broutin, Jean-François Marckert:
Asymptotics of trees with a prescribed degree sequence and applications. Random Struct. Algorithms 44(3): 290-316 (2014) - 2012
- [j9]Nicolas Broutin, Omar Fawzi:
Longest Path Distance in Random Circuits. Comb. Probab. Comput. 21(6): 856-881 (2012) - [j8]Nicolas Broutin, Philippe Flajolet:
The distribution of height and diameter in random non-plane binary trees. Random Struct. Algorithms 41(2): 215-252 (2012) - 2010
- [j7]Nicolas Broutin, Luc Devroye, Erin McLeish:
Note on the Structure of Kruskal's Algorithm. Algorithmica 56(2): 141-159 (2010) - [j6]Louigi Addario-Berry, Nicolas Broutin, Gábor Lugosi:
The Longest Minimum-Weight Path in a Complete Graph. Comb. Probab. Comput. 19(1): 1-19 (2010) - 2009
- [j5]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
- [j4]Nicolas Broutin, Luc Devroye, Erin McLeish:
Weighted height of random trees. Acta Informatica 45(4): 237-277 (2008) - [j3]Nicolas Broutin, Luc Devroye:
An Analysis of the Height of Tries with Random Weights on the Edges. Comb. Probab. Comput. 17(2): 161-202 (2008) - [j2]Nicolas Broutin, Luc Devroye, Erin McLeish, M. de la Salle:
The height of increasing trees. Random Struct. Algorithms 32(4): 494-518 (2008) - 2006
- [j1]Nicolas Broutin, Luc Devroye:
Large Deviations for the Weighted Height of an Extended Class of Trees. Algorithmica 46(3-4): 271-297 (2006)
Conference and Workshop Papers
- 2012
- [c1]Nicolas Broutin, Ralph Neininger, Henning Sulzbach:
Partial match queries in random quadtrees. SODA 2012: 1056-1065
Informal and Other Publications
- 2023
- [i15]Nicolas Broutin, Nina Kamcev, Gábor Lugosi:
Increasing paths in random temporal graphs. CoRR abs/2306.11401 (2023) - 2022
- [i14]Nicolas Broutin, Luc Devroye, Gábor Lugosi, Roberto Imbuzeiro Oliveira:
Subtractive random forests. CoRR abs/2210.10544 (2022) - 2021
- [i13]Romain Laroche, Othmane Safsafi, Raphaël Féraud, Nicolas Broutin:
Batched Bandits with Crowd Externalities. CoRR abs/2109.14733 (2021) - 2020
- [i12]Nicolas Broutin, Thomas Duquesne, Minmin Wang:
Limits of multiplicative inhomogeneous random graphs and Lévy trees: Limit theorems. CoRR abs/2002.02769 (2020) - 2017
- [i11]Nicolas Broutin, Henning Sulzbach:
A limit field for orthogonal range searches in two-dimensional random point search trees. CoRR abs/1711.11354 (2017) - 2014
- [i10]Nicolas Broutin, Luc Devroye, Gábor Lugosi:
Connectivity of sparse Bluetooth networks. CoRR abs/1402.3696 (2014) - [i9]Nicolas Broutin, Olivier Devillers, Ross Hemsley:
Efficiently navigating a random Delaunay triangulation. CoRR abs/1402.6148 (2014) - [i8]Nicolas Broutin, Luc Devroye, Gábor Lugosi:
Almost optimal sparsification of random geometric graphs. CoRR abs/1403.1274 (2014) - [i7]Nicolas Broutin, Minmin Wang:
Cutting down $\mathbf p$-trees and inhomogeneous continuum random trees. CoRR abs/1408.0144 (2014) - [i6]Nicolas Broutin, Jean-François Marckert:
A new encoding of coalescent processes. Applications to the additive and multiplicative cases. CoRR abs/1409.4266 (2014) - 2012
- [i5]Nicolas Broutin, Ralph Neininger, Henning Sulzbach:
A limit process for partial match queries in random quadtrees. CoRR abs/1202.1342 (2012) - [i4]Nicolas Broutin, Henning Sulzbach:
The dual tree of a recursive triangulation of the disk. CoRR abs/1211.1343 (2012) - 2011
- [i3]Nicolas Broutin, Cecilia Holmgren:
The total path length of split trees. CoRR abs/1102.2541 (2011) - [i2]Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi:
Connectivity threshold for Bluetooth graphs. CoRR abs/1103.0351 (2011) - [i1]Nicolas Broutin, Ralph Neininger, Henning Sulzbach:
Partial match queries in random quadtrees. CoRR abs/1107.2231 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
