Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Nicolas Broutin
@article{DBLP:journals/corr/abs-2306-11401,
author = {Nicolas Broutin and
Nina Kamcev and
G{\'{a}}bor Lugosi},
title = {Increasing paths in random temporal graphs},
journal = {CoRR},
volume = {abs/2306.11401},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.11401},
doi = {10.48550/ARXIV.2306.11401},
eprinttype = {arXiv},
eprint = {2306.11401},
timestamp = {Fri, 23 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-11401.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-10544,
author = {Nicolas Broutin and
Luc Devroye and
G{\'{a}}bor Lugosi and
Roberto Imbuzeiro Oliveira},
title = {Subtractive random forests},
journal = {CoRR},
volume = {abs/2210.10544},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.10544},
doi = {10.48550/ARXIV.2210.10544},
eprinttype = {arXiv},
eprint = {2210.10544},
timestamp = {Tue, 25 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-10544.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-14733,
author = {Romain Laroche and
Othmane Safsafi and
Rapha{\"{e}}l F{\'{e}}raud and
Nicolas Broutin},
title = {Batched Bandits with Crowd Externalities},
journal = {CoRR},
volume = {abs/2109.14733},
year = {2021},
url = {https://arxiv.org/abs/2109.14733},
eprinttype = {arXiv},
eprint = {2109.14733},
timestamp = {Mon, 04 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-14733.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroutinM20,
author = {Nicolas Broutin and
Jean{-}Fran{\c{c}}ois Marckert},
title = {The combinatorics of the colliding bullets},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {401--431},
year = {2020},
url = {https://doi.org/10.1002/rsa.20869},
doi = {10.1002/RSA.20869},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BroutinM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroutinDF20,
author = {Nicolas Broutin and
Luc Devroye and
Nicolas Fraiman},
title = {Recursive functions on conditional Galton-Watson trees},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {304--316},
year = {2020},
url = {https://doi.org/10.1002/rsa.20921},
doi = {10.1002/RSA.20921},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BroutinDF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-02769,
author = {Nicolas Broutin and
Thomas Duquesne and
Minmin Wang},
title = {Limits of multiplicative inhomogeneous random graphs and L{\'{e}}vy
trees: Limit theorems},
journal = {CoRR},
volume = {abs/2002.02769},
year = {2020},
url = {https://arxiv.org/abs/2002.02769},
eprinttype = {arXiv},
eprint = {2002.02769},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-02769.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroutinM18,
author = {Nicolas Broutin and
C{\'{e}}cile Mailler},
title = {And/or trees: {A} local limit point of view},
journal = {Random Struct. Algorithms},
volume = {53},
number = {1},
pages = {15--58},
year = {2018},
url = {https://doi.org/10.1002/rsa.20758},
doi = {10.1002/RSA.20758},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BroutinM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-11354,
author = {Nicolas Broutin and
Henning Sulzbach},
title = {A limit field for orthogonal range searches in two-dimensional random
point search trees},
journal = {CoRR},
volume = {abs/1711.11354},
year = {2017},
url = {http://arxiv.org/abs/1711.11354},
eprinttype = {arXiv},
eprint = {1711.11354},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-11354.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroutinDH16,
author = {Nicolas Broutin and
Olivier Devillers and
Ross Hemsley},
title = {Efficiently navigating a random Delaunay triangulation},
journal = {Random Struct. Algorithms},
volume = {49},
number = {1},
pages = {95--136},
year = {2016},
url = {https://doi.org/10.1002/rsa.20630},
doi = {10.1002/RSA.20630},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BroutinDH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroutinDFL14,
author = {Nicolas Broutin and
Luc Devroye and
Nicolas Fraiman and
G{\'{a}}bor Lugosi},
title = {Connectivity threshold of Bluetooth graphs},
journal = {Random Struct. Algorithms},
volume = {44},
number = {1},
pages = {45--66},
year = {2014},
url = {https://doi.org/10.1002/rsa.20459},
doi = {10.1002/RSA.20459},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BroutinDFL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroutinM14,
author = {Nicolas Broutin and
Jean{-}Fran{\c{c}}ois Marckert},
title = {Asymptotics of trees with a prescribed degree sequence and applications},
journal = {Random Struct. Algorithms},
volume = {44},
number = {3},
pages = {290--316},
year = {2014},
url = {https://doi.org/10.1002/rsa.20463},
doi = {10.1002/RSA.20463},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BroutinM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BroutinDL14,
author = {Nicolas Broutin and
Luc Devroye and
G{\'{a}}bor Lugosi},
title = {Connectivity of sparse Bluetooth networks},
journal = {CoRR},
volume = {abs/1402.3696},
year = {2014},
url = {http://arxiv.org/abs/1402.3696},
eprinttype = {arXiv},
eprint = {1402.3696},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BroutinDL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BroutinDH14,
author = {Nicolas Broutin and
Olivier Devillers and
Ross Hemsley},
title = {Efficiently navigating a random Delaunay triangulation},
journal = {CoRR},
volume = {abs/1402.6148},
year = {2014},
url = {http://arxiv.org/abs/1402.6148},
eprinttype = {arXiv},
eprint = {1402.6148},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BroutinDH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BroutinDL14a,
author = {Nicolas Broutin and
Luc Devroye and
G{\'{a}}bor Lugosi},
title = {Almost optimal sparsification of random geometric graphs},
journal = {CoRR},
volume = {abs/1403.1274},
year = {2014},
url = {http://arxiv.org/abs/1403.1274},
eprinttype = {arXiv},
eprint = {1403.1274},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BroutinDL14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BroutinW14,
author = {Nicolas Broutin and
Minmin Wang},
title = {Cutting down {\textdollar}{\textbackslash}mathbf p{\textdollar}-trees
and inhomogeneous continuum random trees},
journal = {CoRR},
volume = {abs/1408.0144},
year = {2014},
url = {http://arxiv.org/abs/1408.0144},
eprinttype = {arXiv},
eprint = {1408.0144},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BroutinW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BroutinM14,
author = {Nicolas Broutin and
Jean{-}Fran{\c{c}}ois Marckert},
title = {A new encoding of coalescent processes. Applications to the additive
and multiplicative cases},
journal = {CoRR},
volume = {abs/1409.4266},
year = {2014},
url = {http://arxiv.org/abs/1409.4266},
eprinttype = {arXiv},
eprint = {1409.4266},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BroutinM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BroutinF12,
author = {Nicolas Broutin and
Omar Fawzi},
title = {Longest Path Distance in Random Circuits},
journal = {Comb. Probab. Comput.},
volume = {21},
number = {6},
pages = {856--881},
year = {2012},
url = {https://doi.org/10.1017/S0963548312000260},
doi = {10.1017/S0963548312000260},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BroutinF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroutinF12,
author = {Nicolas Broutin and
Philippe Flajolet},
title = {The distribution of height and diameter in random non-plane binary
trees},
journal = {Random Struct. Algorithms},
volume = {41},
number = {2},
pages = {215--252},
year = {2012},
url = {https://doi.org/10.1002/rsa.20393},
doi = {10.1002/RSA.20393},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BroutinF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BroutinNS12,
author = {Nicolas Broutin and
Ralph Neininger and
Henning Sulzbach},
editor = {Yuval Rabani},
title = {Partial match queries in random quadtrees},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1056--1065},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.83},
doi = {10.1137/1.9781611973099.83},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/BroutinNS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-1342,
author = {Nicolas Broutin and
Ralph Neininger and
Henning Sulzbach},
title = {A limit process for partial match queries in random quadtrees},
journal = {CoRR},
volume = {abs/1202.1342},
year = {2012},
url = {http://arxiv.org/abs/1202.1342},
eprinttype = {arXiv},
eprint = {1202.1342},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-1342.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1343,
author = {Nicolas Broutin and
Henning Sulzbach},
title = {The dual tree of a recursive triangulation of the disk},
journal = {CoRR},
volume = {abs/1211.1343},
year = {2012},
url = {http://arxiv.org/abs/1211.1343},
eprinttype = {arXiv},
eprint = {1211.1343},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1343.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-2541,
author = {Nicolas Broutin and
Cecilia Holmgren},
title = {The total path length of split trees},
journal = {CoRR},
volume = {abs/1102.2541},
year = {2011},
url = {http://arxiv.org/abs/1102.2541},
eprinttype = {arXiv},
eprint = {1102.2541},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-2541.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-0351,
author = {Nicolas Broutin and
Luc Devroye and
Nicolas Fraiman and
G{\'{a}}bor Lugosi},
title = {Connectivity threshold for Bluetooth graphs},
journal = {CoRR},
volume = {abs/1103.0351},
year = {2011},
url = {http://arxiv.org/abs/1103.0351},
eprinttype = {arXiv},
eprint = {1103.0351},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-0351.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-2231,
author = {Nicolas Broutin and
Ralph Neininger and
Henning Sulzbach},
title = {Partial match queries in random quadtrees},
journal = {CoRR},
volume = {abs/1107.2231},
year = {2011},
url = {http://arxiv.org/abs/1107.2231},
eprinttype = {arXiv},
eprint = {1107.2231},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-2231.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BroutinDM10,
author = {Nicolas Broutin and
Luc Devroye and
Erin McLeish},
title = {Note on the Structure of Kruskal's Algorithm},
journal = {Algorithmica},
volume = {56},
number = {2},
pages = {141--159},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9164-4},
doi = {10.1007/S00453-008-9164-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BroutinDM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Addario-BerryBL10,
author = {Louigi Addario{-}Berry and
Nicolas Broutin and
G{\'{a}}bor Lugosi},
title = {The Longest Minimum-Weight Path in a Complete Graph},
journal = {Comb. Probab. Comput.},
volume = {19},
number = {1},
pages = {1--19},
year = {2010},
url = {https://doi.org/10.1017/S0963548309990204},
doi = {10.1017/S0963548309990204},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Addario-BerryBL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Addario-BerryBR09,
author = {Louigi Addario{-}Berry and
Nicolas Broutin and
Bruce A. Reed},
title = {Critical random graphs and the structure of a minimum spanning tree},
journal = {Random Struct. Algorithms},
volume = {35},
number = {3},
pages = {323--347},
year = {2009},
url = {https://doi.org/10.1002/rsa.20241},
doi = {10.1002/RSA.20241},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Addario-BerryBR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BroutinDM08,
author = {Nicolas Broutin and
Luc Devroye and
Erin McLeish},
title = {Weighted height of random trees},
journal = {Acta Informatica},
volume = {45},
number = {4},
pages = {237--277},
year = {2008},
url = {https://doi.org/10.1007/s00236-008-0069-0},
doi = {10.1007/S00236-008-0069-0},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/BroutinDM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BroutinD08,
author = {Nicolas Broutin and
Luc Devroye},
title = {An Analysis of the Height of Tries with Random Weights on the Edges},
journal = {Comb. Probab. Comput.},
volume = {17},
number = {2},
pages = {161--202},
year = {2008},
url = {https://doi.org/10.1017/S0963548307008796},
doi = {10.1017/S0963548307008796},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BroutinD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroutinDMS08,
author = {Nicolas Broutin and
Luc Devroye and
Erin McLeish and
M. de la Salle},
title = {The height of increasing trees},
journal = {Random Struct. Algorithms},
volume = {32},
number = {4},
pages = {494--518},
year = {2008},
url = {https://doi.org/10.1002/rsa.20202},
doi = {10.1002/RSA.20202},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BroutinDMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BroutinD06,
author = {Nicolas Broutin and
Luc Devroye},
title = {Large Deviations for the Weighted Height of an Extended Class of Trees},
journal = {Algorithmica},
volume = {46},
number = {3-4},
pages = {271--297},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-0112-x},
doi = {10.1007/S00453-006-0112-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BroutinD06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 18:15 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:
