Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/rsa/rsa50.bht:"
download as .bib file
@article{DBLP:journals/rsa/AntunovicDMP17,
author = {Tonci Antunovic and
Yael Dekel and
Elchanan Mossel and
Yuval Peres},
title = {Competing first passage percolation on random regular graphs},
journal = {Random Struct. Algorithms},
volume = {50},
number = {4},
pages = {534--583},
year = {2017},
url = {https://doi.org/10.1002/rsa.20699},
doi = {10.1002/RSA.20699},
timestamp = {Thu, 22 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AntunovicDMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaranyHRS17,
author = {Imre B{\'{a}}r{\'{a}}ny and
Daniel Hug and
Matthias Reitzner and
Rolf Schneider},
title = {Random points in halfspheres},
journal = {Random Struct. Algorithms},
volume = {50},
number = {1},
pages = {3--22},
year = {2017},
url = {https://doi.org/10.1002/rsa.20644},
doi = {10.1002/RSA.20644},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaranyHRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasR17,
author = {B{\'{e}}la Bollob{\'{a}}s and
Oliver Riordan},
title = {Exploring hypergraphs with martingales},
journal = {Random Struct. Algorithms},
volume = {50},
number = {3},
pages = {325--352},
year = {2017},
url = {https://doi.org/10.1002/rsa.20678},
doi = {10.1002/RSA.20678},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BubeckDL17,
author = {S{\'{e}}bastien Bubeck and
Luc Devroye and
G{\'{a}}bor Lugosi},
title = {Finding Adam in random growing trees},
journal = {Random Struct. Algorithms},
volume = {50},
number = {2},
pages = {158--172},
year = {2017},
url = {https://doi.org/10.1002/rsa.20649},
doi = {10.1002/RSA.20649},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BubeckDL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CaiPRW17,
author = {Xing Shi Cai and
Guillem Perarnau and
Bruce A. Reed and
Adam Bene Watts},
title = {Acyclic edge colourings of graphs with large girth},
journal = {Random Struct. Algorithms},
volume = {50},
number = {4},
pages = {511--533},
year = {2017},
url = {https://doi.org/10.1002/rsa.20695},
doi = {10.1002/RSA.20695},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CaiPRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChernFHN17,
author = {Hua{-}Huai Chern and
Michael Fuchs and
Hsien{-}Kuei Hwang and
Ralph Neininger},
title = {Dependence and phase changes in random \emph{m}-ary search trees},
journal = {Random Struct. Algorithms},
volume = {50},
number = {3},
pages = {353--379},
year = {2017},
url = {https://doi.org/10.1002/rsa.20659},
doi = {10.1002/RSA.20659},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ChernFHN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ConlonFNS17,
author = {David Conlon and
Asaf Ferber and
Rajko Nenadov and
Nemanja Skoric},
title = {Almost-spanning universality in random graphs},
journal = {Random Struct. Algorithms},
volume = {50},
number = {3},
pages = {380--393},
year = {2017},
url = {https://doi.org/10.1002/rsa.20661},
doi = {10.1002/RSA.20661},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ConlonFNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Cook17,
author = {Nicholas A. Cook},
title = {Discrepancy properties for random regular digraphs},
journal = {Random Struct. Algorithms},
volume = {50},
number = {1},
pages = {23--58},
year = {2017},
url = {https://doi.org/10.1002/rsa.20643},
doi = {10.1002/RSA.20643},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Cook17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EldanRS17,
author = {Ronen Eldan and
Mikl{\'{o}}s Z. R{\'{a}}cz and
Tselil Schramm},
title = {Braess's paradox for the spectral gap in random graphs and delocalization
of eigenvectors},
journal = {Random Struct. Algorithms},
volume = {50},
number = {4},
pages = {584--611},
year = {2017},
url = {https://doi.org/10.1002/rsa.20696},
doi = {10.1002/RSA.20696},
timestamp = {Thu, 22 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EldanRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FanH17,
author = {Genghua Fan and
Jianfeng Hou},
title = {Bounds for pairs in judicious partitioning of graphs},
journal = {Random Struct. Algorithms},
volume = {50},
number = {1},
pages = {59--70},
year = {2017},
url = {https://doi.org/10.1002/rsa.20642},
doi = {10.1002/RSA.20642},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FanH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberKSV17,
author = {Asaf Ferber and
Michael Krivelevich and
Benny Sudakov and
Pedro Vieira},
title = {Finding paths in sparse random graphs requires many queries},
journal = {Random Struct. Algorithms},
volume = {50},
number = {1},
pages = {71--85},
year = {2017},
url = {https://doi.org/10.1002/rsa.20680},
doi = {10.1002/RSA.20680},
timestamp = {Wed, 21 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberKSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeJ17,
author = {Alan M. Frieze and
Tony Johansson},
title = {On random \emph{k}-out subgraphs of large graphs},
journal = {Random Struct. Algorithms},
volume = {50},
number = {2},
pages = {143--157},
year = {2017},
url = {https://doi.org/10.1002/rsa.20650},
doi = {10.1002/RSA.20650},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriezeJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GajarskyHKKKOOT17,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Tom{\'{a}}s Kaiser and
Daniel Kr{\'{a}}l' and
Martin Kupec and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
Vojtech Tuma},
title = {First order limits of sparse graphs: Plane trees and path-width},
journal = {Random Struct. Algorithms},
volume = {50},
number = {4},
pages = {612--635},
year = {2017},
url = {https://doi.org/10.1002/rsa.20676},
doi = {10.1002/RSA.20676},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GajarskyHKKKOOT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Graf17,
author = {Robert Graf},
title = {Self-destructive percolation as a limit of forest-fire models on regular
rooted trees},
journal = {Random Struct. Algorithms},
volume = {50},
number = {1},
pages = {86--113},
year = {2017},
url = {https://doi.org/10.1002/rsa.20646},
doi = {10.1002/RSA.20646},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Graf17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HoffmanRS17,
author = {Christopher Hoffman and
Douglas Rizzolo and
Erik Slivken},
title = {Pattern-avoiding permutations and Brownian excursion part {I:} Shapes
and fluctuations},
journal = {Random Struct. Algorithms},
volume = {50},
number = {3},
pages = {394--419},
year = {2017},
url = {https://doi.org/10.1002/rsa.20677},
doi = {10.1002/RSA.20677},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HoffmanRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Huber17,
author = {Mark Huber},
title = {A Bernoulli mean estimate with known relative error distribution},
journal = {Random Struct. Algorithms},
volume = {50},
number = {2},
pages = {173--182},
year = {2017},
url = {https://doi.org/10.1002/rsa.20654},
doi = {10.1002/RSA.20654},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Huber17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KulskeR17,
author = {Christof K{\"{u}}lske and
Utkir A. Rozikov},
title = {Fuzzy transformations and extremality of Gibbs measures for the potts
model on a Cayley tree},
journal = {Random Struct. Algorithms},
volume = {50},
number = {4},
pages = {636--678},
year = {2017},
url = {https://doi.org/10.1002/rsa.20671},
doi = {10.1002/RSA.20671},
timestamp = {Thu, 22 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KulskeR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LeviMRRS17,
author = {Reut Levi and
Guy Moshkovitz and
Dana Ron and
Ronitt Rubinfeld and
Asaf Shapira},
title = {Constructing near spanning trees with few local inspections},
journal = {Random Struct. Algorithms},
volume = {50},
number = {2},
pages = {183--200},
year = {2017},
url = {https://doi.org/10.1002/rsa.20652},
doi = {10.1002/RSA.20652},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LeviMRRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LubetzkyZ17,
author = {Eyal Lubetzky and
Yufei Zhao},
title = {On the variational problem for upper tails in sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {50},
number = {3},
pages = {420--436},
year = {2017},
url = {https://doi.org/10.1002/rsa.20658},
doi = {10.1002/RSA.20658},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LubetzkyZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmidSW17,
author = {Colin McDiarmid and
Alex Scott and
Paul Withers},
title = {Uniform multicommodity flows in the hypercube with random edge-capacities},
journal = {Random Struct. Algorithms},
volume = {50},
number = {3},
pages = {437--463},
year = {2017},
url = {https://doi.org/10.1002/rsa.20672},
doi = {10.1002/RSA.20672},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmidSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Mehrabian17,
author = {Abbas Mehrabian},
title = {Justifying the small-world phenomenon via random recursive trees},
journal = {Random Struct. Algorithms},
volume = {50},
number = {2},
pages = {201--224},
year = {2017},
url = {https://doi.org/10.1002/rsa.20648},
doi = {10.1002/RSA.20648},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Mehrabian17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Muller17,
author = {Tobias M{\"{u}}ller},
title = {The critical probability for confetti percolation equals 1/2},
journal = {Random Struct. Algorithms},
volume = {50},
number = {4},
pages = {679--697},
year = {2017},
url = {https://doi.org/10.1002/rsa.20675},
doi = {10.1002/RSA.20675},
timestamp = {Thu, 17 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Muller17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Noever17,
author = {Andreas Noever},
title = {Online Ramsey games for more than two colors},
journal = {Random Struct. Algorithms},
volume = {50},
number = {3},
pages = {464--492},
year = {2017},
url = {https://doi.org/10.1002/rsa.20698},
doi = {10.1002/RSA.20698},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Noever17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ParzanchevskiR17,
author = {Ori Parzanchevski and
Ron Rosenthal},
title = {Simplicial complexes: Spectrum, homology and random walks},
journal = {Random Struct. Algorithms},
volume = {50},
number = {2},
pages = {225--261},
year = {2017},
url = {https://doi.org/10.1002/rsa.20657},
doi = {10.1002/RSA.20657},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ParzanchevskiR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SchulteT17,
author = {Matthias Schulte and
Christoph Th{\"{a}}le},
title = {Central limit theorems for the radial spanning tree},
journal = {Random Struct. Algorithms},
volume = {50},
number = {2},
pages = {262--286},
year = {2017},
url = {https://doi.org/10.1002/rsa.20651},
doi = {10.1002/RSA.20651},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SchulteT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Smith17,
author = {Aaron Smith},
title = {The cutoff phenomenon for random birth and death chains},
journal = {Random Struct. Algorithms},
volume = {50},
number = {2},
pages = {287--321},
year = {2017},
url = {https://doi.org/10.1002/rsa.20693},
doi = {10.1002/RSA.20693},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Smith17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Sulzbach17,
author = {Henning Sulzbach},
title = {On martingale tail sums for the path length in random trees},
journal = {Random Struct. Algorithms},
volume = {50},
number = {3},
pages = {493--508},
year = {2017},
url = {https://doi.org/10.1002/rsa.20674},
doi = {10.1002/RSA.20674},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Sulzbach17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Towsner17,
author = {Henry Towsner},
title = {\emph{{\(\sigma\)}}-algebras for quasirandom hypergraphs},
journal = {Random Struct. Algorithms},
volume = {50},
number = {1},
pages = {114--139},
year = {2017},
url = {https://doi.org/10.1002/rsa.20641},
doi = {10.1002/RSA.20641},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Towsner17.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.
retrieved on 2024-05-28 22:05 CEST from data curated 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:
