default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:journals/rsa:"
more than 1000 matches, exporting first 1000 hits only!
download as .bib file
@article{DBLP:journals/rsa/Antonir24,
author = {Asaf Cohen Antonir},
title = {The upper tail problem for induced 4-cycles in sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {401--459},
year = {2024},
url = {https://doi.org/10.1002/rsa.21187},
doi = {10.1002/RSA.21187},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Antonir24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AragaoNMMM24,
author = {Lucas Arag{\~{a}}o and
Maur{\'{\i}}cio Collares Neto and
Jo{\~{a}}o Pedro Marciano and
Ta{\'{\i}}sa Martins and
Robert Morris},
title = {A lower bound for set-coloring Ramsey numbers},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {157--169},
year = {2024},
url = {https://doi.org/10.1002/rsa.21173},
doi = {10.1002/RSA.21173},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AragaoNMMM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AraujoHHS24,
author = {Pedro Ara{\'{u}}jo and
Jan Hladk{\'{y}} and
Eng Keat Hng and
Matas Sileikis},
title = {Prominent examples of flip processes},
journal = {Random Struct. Algorithms},
volume = {64},
number = {3},
pages = {692--740},
year = {2024},
url = {https://doi.org/10.1002/rsa.21192},
doi = {10.1002/RSA.21192},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AraujoHHS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalisterBMS24,
author = {Paul Balister and
B{\'{e}}la Bollob{\'{a}}s and
Robert Morris and
Paul Smith},
title = {Subcritical monotone cellular automata},
journal = {Random Struct. Algorithms},
volume = {64},
number = {1},
pages = {38--61},
year = {2024},
url = {https://doi.org/10.1002/rsa.21174},
doi = {10.1002/RSA.21174},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BalisterBMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BorstHNS24,
author = {Sem C. Borst and
Frank Den Hollander and
Francesca R. Nardi and
Matteo Sfragara},
title = {Wireless random-access networks with bipartite interference graphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {4},
pages = {814--855},
year = {2024},
url = {https://doi.org/10.1002/rsa.21198},
doi = {10.1002/RSA.21198},
timestamp = {Wed, 12 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BorstHNS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BrennanBH24,
author = {Matthew S. Brennan and
Guy Bresler and
Brice Huang},
title = {Threshold for detecting high dimensional geometry in anisotropic random
geometric graphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {1},
pages = {125--137},
year = {2024},
url = {https://doi.org/10.1002/rsa.21178},
doi = {10.1002/RSA.21178},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BrennanBH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CambieBDK24,
author = {Stijn Cambie and
Wouter Cames van Batenburg and
Ewan Davies and
Ross J. Kang},
title = {Packing list-colorings},
journal = {Random Struct. Algorithms},
volume = {64},
number = {1},
pages = {62--93},
year = {2024},
url = {https://doi.org/10.1002/rsa.21181},
doi = {10.1002/RSA.21181},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CambieBDK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CamposNM24,
author = {Marcelo Campos and
Maur{\'{\i}}cio Collares Neto and
Guilherme Oliveira Mota},
title = {Counting orientations of random graphs with no directed \emph{k}-cycles},
journal = {Random Struct. Algorithms},
volume = {64},
number = {3},
pages = {676--691},
year = {2024},
url = {https://doi.org/10.1002/rsa.21196},
doi = {10.1002/RSA.21196},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CamposNM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChakrabortiKLLS24,
author = {Debsoumya Chakraborti and
Jaehoon Kim and
Hyunwoo Lee and
Hong Liu and
Jaehyeon Seo},
title = {On a rainbow extremal problem for color-critical graphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {460--489},
year = {2024},
url = {https://doi.org/10.1002/rsa.21189},
doi = {10.1002/RSA.21189},
timestamp = {Fri, 10 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChakrabortiKLLS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChenL24,
author = {Wei{-}Kuo Chen and
Wai{-}Kit Lam},
title = {Universality of superconcentration in the Sherrington-Kirkpatrick
model},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {267--286},
year = {2024},
url = {https://doi.org/10.1002/rsa.21183},
doi = {10.1002/RSA.21183},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChenL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DovgalPRRW24,
author = {Sergey Dovgal and
{\'{E}}lie de Panafieu and
Dimbinaina Ralaivaosaona and
Vonjy Rasendrahasina and
Stephan G. Wagner},
title = {The birth of the strong components},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {170--266},
year = {2024},
url = {https://doi.org/10.1002/rsa.21176},
doi = {10.1002/RSA.21176},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DovgalPRRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Eberhard24,
author = {Sean Eberhard},
title = {Dixon's asymptotic without the classification of finite simple groups},
journal = {Random Struct. Algorithms},
volume = {64},
number = {4},
pages = {1016--1019},
year = {2024},
url = {https://doi.org/10.1002/rsa.21205},
doi = {10.1002/RSA.21205},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Eberhard24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FoxHM24,
author = {Jacob Fox and
Zoe M. Himwich and
Nitya Mani},
title = {Extremal results on feedback arc sets in digraphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {287--308},
year = {2024},
url = {https://doi.org/10.1002/rsa.21179},
doi = {10.1002/RSA.21179},
timestamp = {Sat, 06 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FoxHM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FoxLP24,
author = {Jacob Fox and
Sammy Luo and
Huy Tuan Pham},
title = {On random irregular subgraphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {4},
pages = {899--917},
year = {2024},
url = {https://doi.org/10.1002/rsa.21204},
doi = {10.1002/RSA.21204},
timestamp = {Wed, 12 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FoxLP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeP24,
author = {Alan M. Frieze and
Xavier P{\'{e}}rez{-}Gim{\'{e}}nez},
title = {Rainbow Hamilton cycles in random geometric graphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {4},
pages = {878--898},
year = {2024},
url = {https://doi.org/10.1002/rsa.21201},
doi = {10.1002/RSA.21201},
timestamp = {Wed, 12 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriezeP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FuchsLY24,
author = {Michael Fuchs and
Hexuan Liu and
Tsan{-}Cheng Yu},
title = {Limit theorems for patterns in ranked tree-child networks},
journal = {Random Struct. Algorithms},
volume = {64},
number = {1},
pages = {15--37},
year = {2024},
url = {https://doi.org/10.1002/rsa.21177},
doi = {10.1002/RSA.21177},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FuchsLY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GheissariS24,
author = {Reza Gheissari and
Alistair Sinclair},
title = {Spatial mixing and the random-cluster dynamics on lattices},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {490--534},
year = {2024},
url = {https://doi.org/10.1002/rsa.21191},
doi = {10.1002/RSA.21191},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GheissariS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GiraoISW24,
author = {Ant{\'{o}}nio Gir{\~{a}}o and
Freddie Illingworth and
Alex D. Scott and
David R. Wood},
title = {Defective coloring of hypergraphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {3},
pages = {663--675},
year = {2024},
url = {https://doi.org/10.1002/rsa.21190},
doi = {10.1002/RSA.21190},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GiraoISW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GranetJ24,
author = {Bertille Granet and
Felix Joos},
title = {Random perfect matchings in regular graphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {1},
pages = {3--14},
year = {2024},
url = {https://doi.org/10.1002/rsa.21172},
doi = {10.1002/RSA.21172},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GranetJ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HanMWY24,
author = {Jie Han and
Patrick Morris and
Guanghui Wang and
Donglei Yang},
title = {A Ramsey-Tur{\'{a}}n theory for tilings in graphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {1},
pages = {94--124},
year = {2024},
url = {https://doi.org/10.1002/rsa.21182},
doi = {10.1002/RSA.21182},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HanMWY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson24,
author = {Svante Janson},
title = {The number of descendants in a random directed acyclic graph},
journal = {Random Struct. Algorithms},
volume = {64},
number = {3},
pages = {768--803},
year = {2024},
url = {https://doi.org/10.1002/rsa.21195},
doi = {10.1002/RSA.21195},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JiangLMY24,
author = {Tao Jiang and
Shoham Letzter and
Abhishek Methuku and
Liana Yepremyan},
title = {Rainbow subdivisions of cliques},
journal = {Random Struct. Algorithms},
volume = {64},
number = {3},
pages = {625--644},
year = {2024},
url = {https://doi.org/10.1002/rsa.21186},
doi = {10.1002/RSA.21186},
timestamp = {Fri, 10 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JiangLMY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KammounM24,
author = {Mohamed Slim Kammoun and
Myl{\`{e}}ne Ma{\"{\i}}da},
title = {Small cycle structure for words in conjugation invariant random permutations},
journal = {Random Struct. Algorithms},
volume = {64},
number = {4},
pages = {918--939},
year = {2024},
url = {https://doi.org/10.1002/rsa.21203},
doi = {10.1002/RSA.21203},
timestamp = {Wed, 12 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KammounM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichMMS24,
author = {Michael Krivelevich and
Tam{\'{a}}s M{\'{e}}sz{\'{a}}ros and
Peleg Michaeli and
Clara Shikhelman},
title = {Greedy maximal independent sets via local limits},
journal = {Random Struct. Algorithms},
volume = {64},
number = {4},
pages = {986--1015},
year = {2024},
url = {https://doi.org/10.1002/rsa.21200},
doi = {10.1002/RSA.21200},
timestamp = {Wed, 12 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichMMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LerouxR24,
author = {Brett Leroux and
Luis Rademacher},
title = {Expansion of random 0/1 polytopes},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {309--319},
year = {2024},
url = {https://doi.org/10.1002/rsa.21184},
doi = {10.1002/RSA.21184},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LerouxR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LiuMZ24,
author = {Guanwu Liu and
Jie Ma and
Chunlei Zu},
title = {Optimal bisections of directed graphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {1},
pages = {138--153},
year = {2024},
url = {https://doi.org/10.1002/rsa.21175},
doi = {10.1002/RSA.21175},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LiuMZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MacRuryS24,
author = {Calum MacRury and
Erlang Surya},
title = {Sharp thresholds in adaptive random graph processes},
journal = {Random Struct. Algorithms},
volume = {64},
number = {3},
pages = {741--767},
year = {2024},
url = {https://doi.org/10.1002/rsa.21197},
doi = {10.1002/RSA.21197},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MacRuryS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmidS24,
author = {Colin McDiarmid and
Sophia Saller},
title = {Random graphs embeddable in order-dependent surfaces},
journal = {Random Struct. Algorithms},
volume = {64},
number = {4},
pages = {940--985},
year = {2024},
url = {https://doi.org/10.1002/rsa.21199},
doi = {10.1002/RSA.21199},
timestamp = {Wed, 12 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmidS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MoharramiSLS24,
author = {M. Moharrami and
V. Subramanian and
M. Liu and
R. Sundaresan},
title = {The Erlang weighted tree, a new branching process},
journal = {Random Struct. Algorithms},
volume = {64},
number = {3},
pages = {537--624},
year = {2024},
url = {https://doi.org/10.1002/rsa.21180},
doi = {10.1002/RSA.21180},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MoharramiSLS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PerkinsX24,
author = {Will Perkins and
Changji Xu},
title = {Frozen 1-RSB structure of the symmetric Ising perceptron},
journal = {Random Struct. Algorithms},
volume = {64},
number = {4},
pages = {856--877},
year = {2024},
url = {https://doi.org/10.1002/rsa.21202},
doi = {10.1002/RSA.21202},
timestamp = {Wed, 12 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PerkinsX24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Sorensen24,
author = {Frederik S{\o}rensen},
title = {A down-up chain with persistent labels on multifurcating trees},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {354--400},
year = {2024},
url = {https://doi.org/10.1002/rsa.21185},
doi = {10.1002/RSA.21185},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Sorensen24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TimarT24,
author = {{\'{A}}d{\'{a}}m Tim{\'{a}}r and
L{\'{a}}szl{\'{o}} M{\'{a}}rton T{\'{o}}th},
title = {A full characterization of invariant embeddability of unimodular planar
graphs},
journal = {Random Struct. Algorithms},
volume = {64},
number = {2},
pages = {320--353},
year = {2024},
url = {https://doi.org/10.1002/rsa.21188},
doi = {10.1002/RSA.21188},
timestamp = {Fri, 10 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TimarT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Tomon24,
author = {Istv{\'{a}}n Tomon},
title = {Coloring lines and Delaunay graphs with respect to boxes},
journal = {Random Struct. Algorithms},
volume = {64},
number = {3},
pages = {645--662},
year = {2024},
url = {https://doi.org/10.1002/rsa.21193},
doi = {10.1002/RSA.21193},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Tomon24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Warnke24,
author = {Lutz Warnke},
title = {Note on down-set thresholds},
journal = {Random Struct. Algorithms},
volume = {64},
number = {4},
pages = {807--813},
year = {2024},
url = {https://doi.org/10.1002/rsa.21194},
doi = {10.1002/RSA.21194},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Warnke24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AignerHorevHK23,
author = {Elad Aigner{-}Horev and
Dan Hefetz and
Michael Krivelevich},
title = {Cycle lengths in randomly perturbed graphs},
journal = {Random Struct. Algorithms},
volume = {63},
number = {4},
pages = {867--884},
year = {2023},
url = {https://doi.org/10.1002/rsa.21170},
doi = {10.1002/RSA.21170},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AignerHorevHK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AignerHorevHL23,
author = {Elad Aigner{-}Horev and
Dan Hefetz and
Abhiruk Lahiri},
title = {Rainbow trees in uniformly edge-colored graphs},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {287--303},
year = {2023},
url = {https://doi.org/10.1002/rsa.21103},
doi = {10.1002/RSA.21103},
timestamp = {Tue, 21 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AignerHorevHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlaouiMS23,
author = {Ahmed El Alaoui and
Andrea Montanari and
Mark Sellke},
title = {Local algorithms for maximum cut and minimum bisection on locally
treelike regular graphs of large degree},
journal = {Random Struct. Algorithms},
volume = {63},
number = {3},
pages = {689--715},
year = {2023},
url = {https://doi.org/10.1002/rsa.21149},
doi = {10.1002/RSA.21149},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AlaouiMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AraujoMP23,
author = {Pedro Ara{\'{u}}jo and
Luiz Moreira and
Mat{\'{\i}}as Pavez{-}Sign{\'{e}}},
title = {Ramsey goodness of trees in random graphs},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {761--790},
year = {2023},
url = {https://doi.org/10.1002/rsa.21124},
doi = {10.1002/RSA.21124},
timestamp = {Fri, 10 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AraujoMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ArratiaD23,
author = {Richard Arratia and
Stephen Desalvo},
title = {On the largest part size of low-rank combinatorial assemblies},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {3--26},
year = {2023},
url = {https://doi.org/10.1002/rsa.21132},
doi = {10.1002/RSA.21132},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ArratiaD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalisterPST23,
author = {Paul Balister and
Emil Powierski and
Alex Scott and
Jane Tan},
title = {Counting partitions of {G} n , 1 / 2 {\textdollar}{\textdollar} \{G\}{\_}\{n,1/2\}
{\textdollar}{\textdollar} with degree congruence conditions},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {564--584},
year = {2023},
url = {https://doi.org/10.1002/rsa.21115},
doi = {10.1002/RSA.21115},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BalisterPST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalkoSV23,
author = {Martin Balko and
Manfred Scheucher and
Pavel Valtr},
title = {Tight bounds on the expected number of holes in random point sets},
journal = {Random Struct. Algorithms},
volume = {62},
number = {1},
pages = {29--51},
year = {2023},
url = {https://doi.org/10.1002/rsa.21088},
doi = {10.1002/RSA.21088},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BalkoSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghKL23,
author = {J{\'{o}}zsef Balogh and
Robert A. Krueger and
Haoran Luo},
title = {Sharp threshold for the Erd{\H{o}}s-Ko-Rado theorem},
journal = {Random Struct. Algorithms},
volume = {62},
number = {1},
pages = {3--28},
year = {2023},
url = {https://doi.org/10.1002/rsa.21090},
doi = {10.1002/RSA.21090},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BansalH23,
author = {Nikhil Bansal and
David G. Harris},
title = {Some remarks on hypergraph matching and the F{\"{u}}redi-Kahn-Seymour
conjecture},
journal = {Random Struct. Algorithms},
volume = {62},
number = {1},
pages = {52--67},
year = {2023},
url = {https://doi.org/10.1002/rsa.21086},
doi = {10.1002/RSA.21086},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BansalH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Barvinok23,
author = {Alexander I. Barvinok},
title = {Smoothed counting of 0-1 points in polyhedra},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {27--60},
year = {2023},
url = {https://doi.org/10.1002/rsa.21135},
doi = {10.1002/RSA.21135},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Barvinok23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BecchettiCPTZ23,
author = {Luca Becchetti and
Andrea Clementi and
Francesco Pasquale and
Luca Trevisan and
Isabella Ziccardi},
title = {Expansion and flooding in dynamic random networks with node churn},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {61--101},
year = {2023},
url = {https://doi.org/10.1002/rsa.21133},
doi = {10.1002/RSA.21133},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BecchettiCPTZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenevidesHLO23,
author = {Fabr{\'{\i}}cio Siqueira Benevides and
Carlos Hoppen and
Hanno Lefmann and
Knut Odermann},
title = {Heilbronn triangle-type problems in the unit square [0,1]\({}^{\mbox{2}}\)},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {585--599},
year = {2023},
url = {https://doi.org/10.1002/rsa.21109},
doi = {10.1002/RSA.21109},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenevidesHLO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BlancaCSV23,
author = {Antonio Blanca and
Zongchen Chen and
Daniel Stefankovic and
Eric Vigoda},
title = {The Swendsen-Wang dynamics on trees},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {791--831},
year = {2023},
url = {https://doi.org/10.1002/rsa.21121},
doi = {10.1002/RSA.21121},
timestamp = {Fri, 10 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BlancaCSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BlasiusFGLR23,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Andreas G{\"{o}}bel and
Jordi Levy and
Ralf Rothenberger},
title = {The impact of heterogeneity and geometry on the proof complexity of
random satisfiability},
journal = {Random Struct. Algorithms},
volume = {63},
number = {4},
pages = {885--941},
year = {2023},
url = {https://doi.org/10.1002/rsa.21168},
doi = {10.1002/RSA.21168},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BlasiusFGLR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BloznelisL23,
author = {Mindaugas Bloznelis and
Lasse Leskel{\"{a}}},
title = {Clustering and percolation on superpositions of Bernoulli random graphs},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {283--342},
year = {2023},
url = {https://doi.org/10.1002/rsa.21140},
doi = {10.1002/RSA.21140},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BloznelisL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BonaP23,
author = {Mikl{\'{o}}s B{\'{o}}na and
Boris G. Pittel},
title = {Random plane increasing trees: Asymptotic enumeration of vertices
by distance from leaves},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {102--129},
year = {2023},
url = {https://doi.org/10.1002/rsa.21138},
doi = {10.1002/RSA.21138},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BonaP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BorgsCHPT23,
author = {Christian Borgs and
Jennifer T. Chayes and
Tyler Helmuth and
Will Perkins and
Prasad Tetali},
title = {Efficient sampling and counting algorithms for the Potts model on
\emph{{\(\mathbb{Z}\)}}\({}^{\mbox{\emph{d}}}\) at all temperatures},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {130--170},
year = {2023},
url = {https://doi.org/10.1002/rsa.21131},
doi = {10.1002/RSA.21131},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BorgsCHPT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BradacB23,
author = {Domagoj Bradac and
Matija Bucic},
title = {Covering random graphs with monochromatic trees},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {545--563},
year = {2023},
url = {https://doi.org/10.1002/rsa.21120},
doi = {10.1002/RSA.21120},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BradacB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BreenFGKKO23,
author = {Jane Breen and
Nolan Faught and
Cory Glover and
Mark Kempton and
Adam Knudson and
Alice Oveson},
title = {Kemeny's constant for nonbacktracking random walks},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {343--363},
year = {2023},
url = {https://doi.org/10.1002/rsa.21144},
doi = {10.1002/RSA.21144},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BreenFGKKO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CaraceniS23,
author = {Alessandra Caraceni and
Alexandre Stauffer},
title = {Growing uniform planar maps face by face},
journal = {Random Struct. Algorithms},
volume = {63},
number = {4},
pages = {942--967},
year = {2023},
url = {https://doi.org/10.1002/rsa.21165},
doi = {10.1002/RSA.21165},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CaraceniS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChakrabortiKLT23,
author = {Debsoumya Chakraborti and
Jeong Han Kim and
Joonkyung Lee and
Tuan Tran},
title = {Majority dynamics on sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {171--191},
year = {2023},
url = {https://doi.org/10.1002/rsa.21139},
doi = {10.1002/RSA.21139},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ChakrabortiKLT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChangHT23,
author = {Yulin Chang and
Jie Han and
Lubos Thoma},
title = {On powers of tight Hamilton cycles in randomly perturbed hypergraphs},
journal = {Random Struct. Algorithms},
volume = {63},
number = {3},
pages = {591--609},
year = {2023},
url = {https://doi.org/10.1002/rsa.21154},
doi = {10.1002/RSA.21154},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ChangHT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Chatterjee23,
author = {Sourav Chatterjee},
title = {Superconcentration in surface growth},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {304--334},
year = {2023},
url = {https://doi.org/10.1002/rsa.21108},
doi = {10.1002/RSA.21108},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Chatterjee23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Chatterjee23a,
author = {Sourav Chatterjee},
title = {Existence of stationary ballistic deposition on the infinite lattice},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {600--622},
year = {2023},
url = {https://doi.org/10.1002/rsa.21116},
doi = {10.1002/RSA.21116},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Chatterjee23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Coja-OghlanEGHR23,
author = {Amin Coja{-}Oghlan and
Alperen Ali Erg{\"{u}}r and
Pu Gao and
Samuel Hetterich and
Maurice Rolvien},
title = {The rank of sparse random matrices},
journal = {Random Struct. Algorithms},
volume = {62},
number = {1},
pages = {68--130},
year = {2023},
url = {https://doi.org/10.1002/rsa.21085},
doi = {10.1002/RSA.21085},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Coja-OghlanEGHR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ConlonFHMSV23,
author = {David Conlon and
Jacob Fox and
Xiaoyu He and
Dhruv Mubayi and
Andrew Suk and
Jacques Verstra{\"{e}}te},
title = {Hypergraph Ramsey numbers of cliques versus stars},
journal = {Random Struct. Algorithms},
volume = {63},
number = {3},
pages = {610--623},
year = {2023},
url = {https://doi.org/10.1002/rsa.21155},
doi = {10.1002/RSA.21155},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ConlonFHMSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CoreglianoR23,
author = {Leonardo Nagami Coregliano and
Alexander A. Razborov},
title = {Natural quasirandomness properties},
journal = {Random Struct. Algorithms},
volume = {63},
number = {3},
pages = {624--688},
year = {2023},
url = {https://doi.org/10.1002/rsa.21153},
doi = {10.1002/RSA.21153},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CoreglianoR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Corsini23,
author = {Beno{\^{\i}}t Corsini},
title = {The height of record-biased trees},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {623--644},
year = {2023},
url = {https://doi.org/10.1002/rsa.21110},
doi = {10.1002/RSA.21110},
timestamp = {Sun, 30 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Corsini23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CsikvariS23,
author = {P{\'{e}}ter Csikv{\'{a}}ri and
Bal{\'{a}}zs Szegedy},
title = {On Sidorenko's conjecture for determinants and Gaussian Markov random
fields},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {335--375},
year = {2023},
url = {https://doi.org/10.1002/rsa.21112},
doi = {10.1002/RSA.21112},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CsikvariS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CzumajKP23,
author = {Artur Czumaj and
George Kontogeorgiou and
Mike Paterson},
title = {Haystack hunting hints and locker room communication},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {832--856},
year = {2023},
url = {https://doi.org/10.1002/rsa.21114},
doi = {10.1002/RSA.21114},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CzumajKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DasHM23,
author = {Sayan Das and
Zoe M. Himwich and
Nitya Mani},
title = {A fourth-moment phenomenon for asymptotic normality of monochromatic
subgraphs},
journal = {Random Struct. Algorithms},
volume = {63},
number = {4},
pages = {968--996},
year = {2023},
url = {https://doi.org/10.1002/rsa.21166},
doi = {10.1002/RSA.21166},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DasHM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DesmaraisHW23,
author = {Colin Desmarais and
Cecilia Holmgren and
Stephan Wagner},
title = {Broadcasting-induced colorings of preferential attachment trees},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {364--405},
year = {2023},
url = {https://doi.org/10.1002/rsa.21142},
doi = {10.1002/RSA.21142},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DesmaraisHW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DiazG23,
author = {Alberto Espuny D{\'{\i}}az and
Ant{\'{o}}nio Gir{\~{a}}o},
title = {Hamiltonicity of graphs perturbed by a random regular graph},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {857--886},
year = {2023},
url = {https://doi.org/10.1002/rsa.21122},
doi = {10.1002/RSA.21122},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DiazG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DiskinK23,
author = {Sahar Diskin and
Michael Krivelevich},
title = {Site percolation on pseudo-random graphs},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {406--441},
year = {2023},
url = {https://doi.org/10.1002/rsa.21141},
doi = {10.1002/RSA.21141},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DiskinK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DodosTV23,
author = {Pandelis Dodos and
Konstantinos Tyros and
Petros Valettas},
title = {Concentration estimates for functions of finite high-dimensional random
arrays},
journal = {Random Struct. Algorithms},
volume = {63},
number = {4},
pages = {997--1053},
year = {2023},
url = {https://doi.org/10.1002/rsa.21171},
doi = {10.1002/RSA.21171},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DodosTV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FalgasRavryP23,
author = {Victor Falgas{-}Ravry and
Vincent Pfenninger},
title = {1-independent percolation on {\(\mathbb{Z}\)} 2 {\texttimes} {K} n},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {887--910},
year = {2023},
url = {https://doi.org/10.1002/rsa.21129},
doi = {10.1002/RSA.21129},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FalgasRavryP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberHK23,
author = {Asaf Ferber and
Liam Hardiman and
Michael Krivelevich},
title = {On subgraphs with degrees of prescribed residues in the random graph},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {192--214},
year = {2023},
url = {https://doi.org/10.1002/rsa.21137},
doi = {10.1002/RSA.21137},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FerberHK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FernleyO23,
author = {John Fernley and
Marcel Ortgiese},
title = {Voter models on subcritical scale-free random graphs},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {376--429},
year = {2023},
url = {https://doi.org/10.1002/rsa.21107},
doi = {10.1002/RSA.21107},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FernleyO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FredesM23,
author = {Luis Fredes and
Jean{-}Fran{\c{c}}ois Marckert},
title = {A combinatorial proof of Aldous-Broder theorem for general Markov
chains},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {430--449},
year = {2023},
url = {https://doi.org/10.1002/rsa.21101},
doi = {10.1002/RSA.21101},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FredesM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FuWY23,
author = {Weibo Fu and
Guanyang Wang and
Jun Yan},
title = {On the minimax spherical designs},
journal = {Random Struct. Algorithms},
volume = {62},
number = {1},
pages = {131--154},
year = {2023},
url = {https://doi.org/10.1002/rsa.21087},
doi = {10.1002/RSA.21087},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FuWY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Gamarnik23,
author = {David Gamarnik},
title = {Correlation decay and the absence of zeros property of partition functions},
journal = {Random Struct. Algorithms},
volume = {62},
number = {1},
pages = {155--180},
year = {2023},
url = {https://doi.org/10.1002/rsa.21083},
doi = {10.1002/RSA.21083},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Gamarnik23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Gao23,
author = {Pu Gao},
title = {The number of perfect matchings, and the nesting properties, of random
regular graphs},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {935--955},
year = {2023},
url = {https://doi.org/10.1002/rsa.21127},
doi = {10.1002/RSA.21127},
timestamp = {Fri, 10 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Gao23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GaoO23,
author = {Pu Gao and
Yuval Ohapkin},
title = {Subgraph probability of random graphs with specified degrees and applications
to chromatic number and connectivity},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {911--934},
year = {2023},
url = {https://doi.org/10.1002/rsa.21123},
doi = {10.1002/RSA.21123},
timestamp = {Fri, 10 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GaoO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GouldK23,
author = {Stephen Gould and
Tom Kelly},
title = {Hamilton transversals in random Latin squares},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {450--478},
year = {2023},
url = {https://doi.org/10.1002/rsa.21102},
doi = {10.1002/RSA.21102},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/GouldK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GunbyHN23,
author = {Benjamin Gunby and
Xiaoyu He and
Bhargav Narayanan},
title = {Down-set thresholds},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {442--456},
year = {2023},
url = {https://doi.org/10.1002/rsa.21148},
doi = {10.1002/RSA.21148},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GunbyHN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HancockKKV23,
author = {Robert Hancock and
Daniel Kr{\'{a}}l' and
Matjaz Krnc and
Jan Volec},
title = {Toward characterizing locally common graphs},
journal = {Random Struct. Algorithms},
volume = {62},
number = {1},
pages = {181--218},
year = {2023},
url = {https://doi.org/10.1002/rsa.21099},
doi = {10.1002/RSA.21099},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HancockKKV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Harris23,
author = {David G. Harris},
title = {Deterministic algorithms for the Lov{\'{a}}sz local lemma: Simpler,
more general, and more parallel},
journal = {Random Struct. Algorithms},
volume = {63},
number = {3},
pages = {716--752},
year = {2023},
url = {https://doi.org/10.1002/rsa.21152},
doi = {10.1002/RSA.21152},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Harris23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HeMV23,
author = {Jimmy He and
Tobias M{\"{u}}ller and
Teun W. Verstraaten},
title = {Cycles in Mallows random permutations},
journal = {Random Struct. Algorithms},
volume = {63},
number = {4},
pages = {1054--1099},
year = {2023},
url = {https://doi.org/10.1002/rsa.21169},
doi = {10.1002/RSA.21169},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HeMV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HuijbenPR23,
author = {Jeroen Huijben and
Viresh Patel and
Guus Regts},
title = {Sampling from the low temperature Potts model through a Markov chain
on flows},
journal = {Random Struct. Algorithms},
volume = {62},
number = {1},
pages = {219--239},
year = {2023},
url = {https://doi.org/10.1002/rsa.21089},
doi = {10.1002/RSA.21089},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HuijbenPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HwangJS23,
author = {Hsien{-}Kuei Hwang and
Emma Yu Jin and
Michael J. Schlosser},
title = {Asymptotics and statistics on Fishburn matrices: Dimension distribution
and a conjecture of Stoimenow},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {479--518},
year = {2023},
url = {https://doi.org/10.1002/rsa.21100},
doi = {10.1002/RSA.21100},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HwangJS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JahnelT23,
author = {Benedikt Jahnel and
Andr{\'{a}}s T{\'{o}}bi{\'{a}}s},
title = {Absence of percolation in graphs based on stationary point processes
with degrees bounded by two},
journal = {Random Struct. Algorithms},
volume = {62},
number = {1},
pages = {240--255},
year = {2023},
url = {https://doi.org/10.1002/rsa.21084},
doi = {10.1002/RSA.21084},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/JahnelT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JenssenPP23,
author = {Matthew Jenssen and
Will Perkins and
Aditya Potukuchi},
title = {Approximately counting independent sets in bipartite graphs via graph
containers},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {215--241},
year = {2023},
url = {https://doi.org/10.1002/rsa.21145},
doi = {10.1002/RSA.21145},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/JenssenPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JoosKKO23,
author = {Felix Joos and
Jaehoon Kim and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Hypergraph regularity and random sampling},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {956--1015},
year = {2023},
url = {https://doi.org/10.1002/rsa.21126},
doi = {10.1002/RSA.21126},
timestamp = {Fri, 10 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JoosKKO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KahleTW23,
author = {Matthew Kahle and
Minghao Tian and
Yusu Wang},
title = {On the clique number of noisy random geometric graphs},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {242--279},
year = {2023},
url = {https://doi.org/10.1002/rsa.21134},
doi = {10.1002/RSA.21134},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KahleTW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LastPY23,
author = {G{\"{u}}nter Last and
Giovanni Peccati and
D. Yogeshwaran},
title = {Phase transitions and noise sensitivity on the Poisson space via stopping
sets and decision trees},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {457--511},
year = {2023},
url = {https://doi.org/10.1002/rsa.21136},
doi = {10.1002/RSA.21136},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LastPY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LiP23,
author = {Rupert Li and
James Propp},
title = {A greedy chip-firing game},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {645--666},
year = {2023},
url = {https://doi.org/10.1002/rsa.21119},
doi = {10.1002/RSA.21119},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LiP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LichevMW23,
author = {Lyuben Lichev and
Dieter Mitsche and
Lutz Warnke},
title = {The jump of the clique chromatic number of random graphs},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {1016--1034},
year = {2023},
url = {https://doi.org/10.1002/rsa.21128},
doi = {10.1002/RSA.21128},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LichevMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LiebenauMMS23,
author = {Anita Liebenau and
Let{\'{\i}}cia Mattos and
Walner Mendon{\c{c}}a and
Jozef Skokan},
title = {Asymmetric Ramsey properties of random graphs involving cliques and
cycles},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {1035--1055},
year = {2023},
url = {https://doi.org/10.1002/rsa.21106},
doi = {10.1002/RSA.21106},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LiebenauMMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LiebenauW23,
author = {Anita Liebenau and
Nick Wormald},
title = {Asymptotic enumeration of digraphs and bipartite graphs by degree
sequence},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {259--286},
year = {2023},
url = {https://doi.org/10.1002/rsa.21105},
doi = {10.1002/RSA.21105},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LiebenauW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LimaSV23,
author = {Bernardo N. B. de Lima and
R{\'{e}}ka Szab{\'{o}} and
Daniel Valesin},
title = {Multirange percolation on oriented trees: Critical curve and limit
behavior},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {519--541},
year = {2023},
url = {https://doi.org/10.1002/rsa.21104},
doi = {10.1002/RSA.21104},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LimaSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MathieuZ23,
author = {Claire Mathieu and
Hang Zhou},
title = {A simple algorithm for graph reconstruction},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {512--532},
year = {2023},
url = {https://doi.org/10.1002/rsa.21143},
doi = {10.1002/RSA.21143},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MathieuZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MathieuZ23a,
author = {Claire Mathieu and
Hang Zhou},
title = {Iterated tour partitioning for Euclidean capacitated vehicle routing},
journal = {Random Struct. Algorithms},
volume = {62},
number = {4},
pages = {1056--1075},
year = {2023},
url = {https://doi.org/10.1002/rsa.21130},
doi = {10.1002/RSA.21130},
timestamp = {Mon, 13 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MathieuZ23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Meszaros23,
author = {Andr{\'{a}}s M{\'{e}}sz{\'{a}}ros},
title = {Matchings on trees and the adjacency matrix: {A} determinantal viewpoint},
journal = {Random Struct. Algorithms},
volume = {63},
number = {3},
pages = {753--778},
year = {2023},
url = {https://doi.org/10.1002/rsa.21167},
doi = {10.1002/RSA.21167},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Meszaros23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NeemanRS23,
author = {Joe Neeman and
Charles Radin and
Lorenzo Sadun},
title = {Moderate deviations in cycle count},
journal = {Random Struct. Algorithms},
volume = {63},
number = {3},
pages = {779--820},
year = {2023},
url = {https://doi.org/10.1002/rsa.21147},
doi = {10.1002/RSA.21147},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/NeemanRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ReisR23,
author = {Victor Reis and
Thomas Rothvoss},
title = {Vector balancing in Lebesgue spaces},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {667--688},
year = {2023},
url = {https://doi.org/10.1002/rsa.21113},
doi = {10.1002/RSA.21113},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ReisR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RodlSZ23,
author = {Vojtech R{\"{o}}dl and
Marcelo Tadeu Sales and
Yi Zhao},
title = {Independence number of hypergraphs under degree conditions},
journal = {Random Struct. Algorithms},
volume = {63},
number = {3},
pages = {821--863},
year = {2023},
url = {https://doi.org/10.1002/rsa.21151},
doi = {10.1002/RSA.21151},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/RodlSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SamorodnitskyO23,
author = {Gennady Samorodnitsky and
Takashi Owada},
title = {Large deviations for subcomplex counts and Betti numbers in multiparameter
simplicial complexes},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {533--556},
year = {2023},
url = {https://doi.org/10.1002/rsa.21146},
doi = {10.1002/RSA.21146},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/SamorodnitskyO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Sarid23,
author = {Amir Sarid},
title = {The spectral gap of random regular graphs},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {557--587},
year = {2023},
url = {https://doi.org/10.1002/rsa.21150},
doi = {10.1002/RSA.21150},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Sarid23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ShimizuS23,
author = {Nobutaka Shimizu and
Takeharu Shiraga},
title = {Reversible random walks on dynamic graphs},
journal = {Random Struct. Algorithms},
volume = {63},
number = {4},
pages = {1100--1136},
year = {2023},
url = {https://doi.org/10.1002/rsa.21164},
doi = {10.1002/RSA.21164},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ShimizuS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Slade23,
author = {Gordon Slade},
title = {Self-avoiding walk on the hypercube},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {689--736},
year = {2023},
url = {https://doi.org/10.1002/rsa.21117},
doi = {10.1002/RSA.21117},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Slade23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Yuster23,
author = {Raphael Yuster},
title = {The number of bounded-degree spanning trees},
journal = {Random Struct. Algorithms},
volume = {62},
number = {3},
pages = {737--757},
year = {2023},
url = {https://doi.org/10.1002/rsa.21118},
doi = {10.1002/RSA.21118},
timestamp = {Sun, 30 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Yuster23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonKL22,
author = {Yahav Alon and
Michael Krivelevich and
Eyal Lubetzky},
title = {Cycle lengths in sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {444--461},
year = {2022},
url = {https://doi.org/10.1002/rsa.21067},
doi = {10.1002/RSA.21067},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AltschulerN22,
author = {Dylan J. Altschuler and
Jonathan Niles{-}Weed},
title = {The discrepancy of random rectangular matrices},
journal = {Random Struct. Algorithms},
volume = {60},
number = {4},
pages = {551--593},
year = {2022},
url = {https://doi.org/10.1002/rsa.21054},
doi = {10.1002/RSA.21054},
timestamp = {Fri, 20 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AltschulerN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AnastosF22,
author = {Michael Anastos and
Alan M. Frieze},
title = {A scaling limit for the length of the longest cycle in a sparse random
digraph},
journal = {Random Struct. Algorithms},
volume = {60},
number = {1},
pages = {3--24},
year = {2022},
url = {https://doi.org/10.1002/rsa.21030},
doi = {10.1002/RSA.21030},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AnastosF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AzadC22,
author = {Elahe Zohoorian Azad and
Philippe Chassaing},
title = {Asymptotic behavior of some factorizations of random words},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {543--572},
year = {2022},
url = {https://doi.org/10.1002/rsa.21073},
doi = {10.1002/RSA.21073},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AzadC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalkoSV22,
author = {Martin Balko and
Manfred Scheucher and
Pavel Valtr},
title = {Holes and islands in random point sets},
journal = {Random Struct. Algorithms},
volume = {60},
number = {3},
pages = {308--326},
year = {2022},
url = {https://doi.org/10.1002/rsa.21037},
doi = {10.1002/RSA.21037},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BalkoSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BallB22,
author = {Frank Ball and
Tom Britton},
title = {Epidemics on networks with preventive rewiring},
journal = {Random Struct. Algorithms},
volume = {61},
number = {2},
pages = {250--297},
year = {2022},
url = {https://doi.org/10.1002/rsa.21066},
doi = {10.1002/RSA.21066},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BallB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BassinoBFGMP22,
author = {Fr{\'{e}}d{\'{e}}rique Bassino and
Mathilde Bouvel and
Valentin F{\'{e}}ray and
Lucas Gerin and
Micka{\"{e}}l Maazoun and
Adeline Pierrot},
title = {Random cographs: Brownian graphon limit and asymptotic degree distribution},
journal = {Random Struct. Algorithms},
volume = {60},
number = {2},
pages = {166--200},
year = {2022},
url = {https://doi.org/10.1002/rsa.21033},
doi = {10.1002/RSA.21033},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BassinoBFGMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BehrstockFS22,
author = {Jason A. Behrstock and
Victor Falgas{-}Ravry and
Tim Susse},
title = {Square percolation and the threshold for quadratic divergence in random
right-angled Coxeter groups},
journal = {Random Struct. Algorithms},
volume = {60},
number = {4},
pages = {594--630},
year = {2022},
url = {https://doi.org/10.1002/rsa.21049},
doi = {10.1002/RSA.21049},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BehrstockFS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BerzunzaH22,
author = {Gabriel Berzunza and
Cecilia Holmgren},
title = {The asymptotic distribution of cluster sizes for supercritical percolation
on random split trees},
journal = {Random Struct. Algorithms},
volume = {60},
number = {4},
pages = {631--652},
year = {2022},
url = {https://doi.org/10.1002/rsa.21046},
doi = {10.1002/RSA.21046},
timestamp = {Fri, 20 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BerzunzaH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhaktaMRS22,
author = {Prateek Bhakta and
Sarah Miracle and
Dana Randall and
Amanda Pascoe Streib},
title = {Mixing times of Markov chains for self-organizing lists and biased
permutations},
journal = {Random Struct. Algorithms},
volume = {61},
number = {4},
pages = {638--665},
year = {2022},
url = {https://doi.org/10.1002/rsa.21082},
doi = {10.1002/RSA.21082},
timestamp = {Fri, 02 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BhaktaMRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhamidiFFN22,
author = {Shankar Bhamidi and
Ruituo Fan and
Nicolas Fraiman and
Andrew B. Nobel},
title = {Community modulated recursive trees and population dependent branching
processes},
journal = {Random Struct. Algorithms},
volume = {60},
number = {2},
pages = {201--232},
year = {2022},
url = {https://doi.org/10.1002/rsa.21027},
doi = {10.1002/RSA.21027},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BhamidiFFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Bhattacharjee22,
author = {Chinmoy Bhattacharjee},
title = {Gaussian approximation for rooted edges in a random minimal directed
spanning tree},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {462--492},
year = {2022},
url = {https://doi.org/10.1002/rsa.21068},
doi = {10.1002/RSA.21068},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Bhattacharjee22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhattacharyaFY22,
author = {Bhaswar B. Bhattacharya and
Xiao Fang and
Han Yan},
title = {Normal approximation and fourth moment theorems for monochromatic
triangles},
journal = {Random Struct. Algorithms},
volume = {60},
number = {1},
pages = {25--53},
year = {2022},
url = {https://doi.org/10.1002/rsa.21017},
doi = {10.1002/RSA.21017},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BhattacharyaFY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BienvenuLS22,
author = {Fran{\c{c}}ois Bienvenu and
Amaury Lambert and
Mike Steel},
title = {Combinatorial and stochastic properties of ranked tree-child networks},
journal = {Random Struct. Algorithms},
volume = {60},
number = {4},
pages = {653--689},
year = {2022},
url = {https://doi.org/10.1002/rsa.21048},
doi = {10.1002/RSA.21048},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BienvenuLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BisiCGR22,
author = {Elia Bisi and
Fabio Deelan Cunden and
Shane Gibbons and
Dan Romik},
title = {The oriented swap process and last passage percolation},
journal = {Random Struct. Algorithms},
volume = {60},
number = {4},
pages = {690--715},
year = {2022},
url = {https://doi.org/10.1002/rsa.21055},
doi = {10.1002/RSA.21055},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BisiCGR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BodiniGGLN22,
author = {Olivier Bodini and
Antoine Genitrini and
Bernhard Gittenberger and
Isabella Larcher and
Mehdi Naima},
title = {Compaction for two models of logarithmic-depth trees: Analysis and
experiments},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {31--61},
year = {2022},
url = {https://doi.org/10.1002/rsa.21056},
doi = {10.1002/RSA.21056},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BodiniGGLN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BodwinV22,
author = {Greg Bodwin and
Santosh S. Vempala},
title = {A unified view of graph regularity via matrix decompositions},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {62--83},
year = {2022},
url = {https://doi.org/10.1002/rsa.21053},
doi = {10.1002/RSA.21053},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BodwinV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanLM22,
author = {Tom Bohman and
Xizhi Liu and
Dhruv Mubayi},
title = {Independent sets in hypergraphs omitting an intersection},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {493--519},
year = {2022},
url = {https://doi.org/10.1002/rsa.21071},
doi = {10.1002/RSA.21071},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BohmanLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BrandenbergerDG22,
author = {Anna M. Brandenberger and
Luc Devroye and
Marcel K. Goh},
title = {Root estimation in Galton-Watson trees},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {520--542},
year = {2022},
url = {https://doi.org/10.1002/rsa.21072},
doi = {10.1002/RSA.21072},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BrandenbergerDG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BucicFS22,
author = {Matija Bucic and
Jacob Fox and
Benny Sudakov},
title = {Clique minors in graphs with a forbidden subgraph},
journal = {Random Struct. Algorithms},
volume = {60},
number = {3},
pages = {327--338},
year = {2022},
url = {https://doi.org/10.1002/rsa.21038},
doi = {10.1002/RSA.21038},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BucicFS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChangHKMM22,
author = {Yulin Chang and
Jie Han and
Yoshiharu Kohayakawa and
Patrick Morris and
Guilherme Oliveira Mota},
title = {Factors in randomly perturbed hypergraphs},
journal = {Random Struct. Algorithms},
volume = {60},
number = {2},
pages = {153--165},
year = {2022},
url = {https://doi.org/10.1002/rsa.21035},
doi = {10.1002/RSA.21035},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChangHKMM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Contat22,
author = {Alice Contat},
title = {Sharpness of the phase transition for parking on random trees},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {84--100},
year = {2022},
url = {https://doi.org/10.1002/rsa.21061},
doi = {10.1002/RSA.21061},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Contat22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperKLM22,
author = {Jacob W. Cooper and
Daniel Kr{\'{a}}l' and
Ander Lamaison and
Samuel Mohr},
title = {Quasirandom Latin squares},
journal = {Random Struct. Algorithms},
volume = {61},
number = {2},
pages = {298--308},
year = {2022},
url = {https://doi.org/10.1002/rsa.21060},
doi = {10.1002/RSA.21060},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperKLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DraganicGK22,
author = {Nemanja Draganic and
Stefan Glock and
Michael Krivelevich},
title = {The largest hole in sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {61},
number = {4},
pages = {666--677},
year = {2022},
url = {https://doi.org/10.1002/rsa.21078},
doi = {10.1002/RSA.21078},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DraganicGK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FengGY22,
author = {Weiming Feng and
Heng Guo and
Yitong Yin},
title = {Perfect sampling from spatial mixing},
journal = {Random Struct. Algorithms},
volume = {61},
number = {4},
pages = {678--709},
year = {2022},
url = {https://doi.org/10.1002/rsa.21079},
doi = {10.1002/RSA.21079},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FengGY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FountoulakisP22,
author = {Nikolaos Fountoulakis and
Michal Przykucki},
title = {Algebraic and combinatorial expansion in random simplicial complexes},
journal = {Random Struct. Algorithms},
volume = {60},
number = {3},
pages = {339--366},
year = {2022},
url = {https://doi.org/10.1002/rsa.21036},
doi = {10.1002/RSA.21036},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FountoulakisP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FrankstonKP22,
author = {Keith Frankston and
Jeff Kahn and
Jinyoung Park},
title = {On a problem of M. Talagrand},
journal = {Random Struct. Algorithms},
volume = {61},
number = {4},
pages = {710--723},
year = {2022},
url = {https://doi.org/10.1002/rsa.21077},
doi = {10.1002/RSA.21077},
timestamp = {Fri, 02 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FrankstonKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GishbolinerKM22,
author = {Lior Gishboliner and
Michael Krivelevich and
Peleg Michaeli},
title = {Color-biased Hamilton cycles in random graphs},
journal = {Random Struct. Algorithms},
volume = {60},
number = {3},
pages = {289--307},
year = {2022},
url = {https://doi.org/10.1002/rsa.21043},
doi = {10.1002/RSA.21043},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GishbolinerKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HanHM22,
author = {Hi{\^{e}}p H{\`{a}}n and
Jie Han and
Patrick Morris},
title = {Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {101--125},
year = {2022},
url = {https://doi.org/10.1002/rsa.21052},
doi = {10.1002/RSA.21052},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HanHM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HancockT22,
author = {Robert Hancock and
Andrew Treglown},
title = {An asymmetric random Rado theorem for single equations: The 0-statement},
journal = {Random Struct. Algorithms},
volume = {60},
number = {4},
pages = {529--550},
year = {2022},
url = {https://doi.org/10.1002/rsa.21039},
doi = {10.1002/RSA.21039},
timestamp = {Fri, 20 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HancockT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HansenM22,
author = {Benjamin T. Hansen and
Tobias M{\"{u}}ller},
title = {The critical probability for Voronoi percolation in the hyperbolic
plane tends to 1/2},
journal = {Random Struct. Algorithms},
volume = {60},
number = {1},
pages = {54--67},
year = {2022},
url = {https://doi.org/10.1002/rsa.21018},
doi = {10.1002/RSA.21018},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HansenM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HofstadKV22,
author = {Remco van der Hofstad and
J{\'{u}}lia Komj{\'{a}}thy and
Vikt{\'{o}}ria Vadon},
title = {Phase transition in random intersection graphs with communities},
journal = {Random Struct. Algorithms},
volume = {60},
number = {3},
pages = {406--461},
year = {2022},
url = {https://doi.org/10.1002/rsa.21063},
doi = {10.1002/RSA.21063},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HofstadKV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/IliopoulosS22,
author = {Fotis Iliopoulos and
Alistair Sinclair},
title = {Efficiently list-edge coloring multigraphs asymptotically optimally},
journal = {Random Struct. Algorithms},
volume = {61},
number = {4},
pages = {724--753},
year = {2022},
url = {https://doi.org/10.1002/rsa.21074},
doi = {10.1002/RSA.21074},
timestamp = {Fri, 02 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/IliopoulosS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonS22,
author = {Svante Janson and
Gregory B. Sorkin},
title = {Successive minimum spanning trees},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {126--172},
year = {2022},
url = {https://doi.org/10.1002/rsa.21047},
doi = {10.1002/RSA.21047},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JoosK22,
author = {Felix Joos and
Marcus K{\"{u}}hn},
title = {Fractional cycle decompositions in hypergraphs},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {425--443},
year = {2022},
url = {https://doi.org/10.1002/rsa.21070},
doi = {10.1002/RSA.21070},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JoosK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KahnP22,
author = {Jeff D. Kahn and
Jinyoung Park},
title = {Tuza's conjecture for random graphs},
journal = {Random Struct. Algorithms},
volume = {61},
number = {2},
pages = {235--249},
year = {2022},
url = {https://doi.org/10.1002/rsa.21057},
doi = {10.1002/RSA.21057},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KahnP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kanazawa22,
author = {Shu Kanazawa},
title = {Law of large numbers for Betti numbers of homogeneous and spatially
independent random simplicial complexes},
journal = {Random Struct. Algorithms},
volume = {60},
number = {1},
pages = {68--105},
year = {2022},
url = {https://doi.org/10.1002/rsa.21015},
doi = {10.1002/RSA.21015},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kanazawa22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KangK22,
author = {Ross J. Kang and
Tom Kelly},
title = {Colorings, transversals, and local sparsity},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {173--192},
year = {2022},
url = {https://doi.org/10.1002/rsa.21051},
doi = {10.1002/RSA.21051},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/KangK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KangM22,
author = {Mihyun Kang and
Michael Missethan},
title = {Longest and shortest cycles in random planar graphs},
journal = {Random Struct. Algorithms},
volume = {60},
number = {3},
pages = {462--505},
year = {2022},
url = {https://doi.org/10.1002/rsa.21040},
doi = {10.1002/RSA.21040},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/KangM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KergorlayTV22,
author = {Henry{-}Louis de Kergorlay and
Ulrike Tillmann and
Oliver Vipond},
title = {Random {\v{C}}ech complexes on manifolds with boundary},
journal = {Random Struct. Algorithms},
volume = {61},
number = {2},
pages = {309--352},
year = {2022},
url = {https://doi.org/10.1002/rsa.21062},
doi = {10.1002/RSA.21062},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KergorlayTV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kolesnik22,
author = {Brett Kolesnik},
title = {Large deviations of the greedy independent set algorithm on sparse
random graphs},
journal = {Random Struct. Algorithms},
volume = {61},
number = {2},
pages = {353--363},
year = {2022},
url = {https://doi.org/10.1002/rsa.21064},
doi = {10.1002/RSA.21064},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kolesnik22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LarrauriMN22,
author = {L{\'{a}}zaro Alberto Larrauri and
Tobias M{\"{u}}ller and
Marc Noy},
title = {Limiting probabilities of first order properties of random sparse
graphs and hypergraphs},
journal = {Random Struct. Algorithms},
volume = {60},
number = {3},
pages = {506--526},
year = {2022},
url = {https://doi.org/10.1002/rsa.21041},
doi = {10.1002/RSA.21041},
timestamp = {Thu, 17 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LarrauriMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LichevM22,
author = {Lyuben Lichev and
Dieter Mitsche},
title = {On the modularity of 3-regular random graphs and random graphs with
given degree sequences},
journal = {Random Struct. Algorithms},
volume = {61},
number = {4},
pages = {754--802},
year = {2022},
url = {https://doi.org/10.1002/rsa.21080},
doi = {10.1002/RSA.21080},
timestamp = {Fri, 02 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LichevM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LindenstraussT22,
author = {Naomi Lindenstrauss and
Michel Talagrand},
title = {What is the satisfiability threshold of random balanced Boolean expressions?},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {599--615},
year = {2022},
url = {https://doi.org/10.1002/rsa.21069},
doi = {10.1002/RSA.21069},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LindenstraussT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Marciniak22,
author = {Mikolaj Marciniak},
title = {Hydrodynamic limit of the Robinson-Schensted-Knuth algorithm},
journal = {Random Struct. Algorithms},
volume = {60},
number = {1},
pages = {106--116},
year = {2022},
url = {https://doi.org/10.1002/rsa.21016},
doi = {10.1002/RSA.21016},
timestamp = {Wed, 08 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Marciniak22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MiermontS22,
author = {Gr{\'{e}}gory Miermont and
Sanchayan Sen},
title = {On breadth-first constructions of scaling limits of random graphs
and random unicellular maps},
journal = {Random Struct. Algorithms},
volume = {61},
number = {4},
pages = {803--843},
year = {2022},
url = {https://doi.org/10.1002/rsa.21076},
doi = {10.1002/RSA.21076},
timestamp = {Fri, 02 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MiermontS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MoussetST22,
author = {Frank Mousset and
Nemanja Skoric and
Milos Trujic},
title = {Covering cycles in sparse graphs},
journal = {Random Struct. Algorithms},
volume = {60},
number = {4},
pages = {716--748},
year = {2022},
url = {https://doi.org/10.1002/rsa.21045},
doi = {10.1002/RSA.21045},
timestamp = {Fri, 20 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MoussetST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Narayanan22,
author = {Shyam Narayanan},
title = {Three-wise independent random walks can be slightly unbounded},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {573--598},
year = {2022},
url = {https://doi.org/10.1002/rsa.21075},
doi = {10.1002/RSA.21075},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Narayanan22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Newman22,
author = {Andrew Newman},
title = {Doubly random polytopes},
journal = {Random Struct. Algorithms},
volume = {61},
number = {2},
pages = {364--382},
year = {2022},
url = {https://doi.org/10.1002/rsa.21059},
doi = {10.1002/RSA.21059},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Newman22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PallavoorRW22,
author = {Ramesh Krishnan S. Pallavoor and
Sofya Raskhodnikova and
Erik Waingarten},
title = {Approximating the distance to monotonicity of Boolean functions},
journal = {Random Struct. Algorithms},
volume = {60},
number = {2},
pages = {233--260},
year = {2022},
url = {https://doi.org/10.1002/rsa.21029},
doi = {10.1002/RSA.21029},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/PallavoorRW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PettiV22,
author = {Samantha Petti and
Santosh S. Vempala},
title = {Approximating sparse graphs: The random overlapping communities model},
journal = {Random Struct. Algorithms},
volume = {61},
number = {4},
pages = {844--908},
year = {2022},
url = {https://doi.org/10.1002/rsa.21081},
doi = {10.1002/RSA.21081},
timestamp = {Fri, 02 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/PettiV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PohoataR22,
author = {Cosmin Pohoata and
Oliver Roche{-}Newton},
title = {Four-term progression free sets with three-term progressions in all
large subsets},
journal = {Random Struct. Algorithms},
volume = {60},
number = {4},
pages = {749--770},
year = {2022},
url = {https://doi.org/10.1002/rsa.21042},
doi = {10.1002/RSA.21042},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PohoataR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PontiverosGSS22,
author = {Gonzalo Fiz Pontiveros and
Simon Griffiths and
Matheus Secco and
Oriol Serra},
title = {Deviation probabilities for arithmetic progressions and other regular
discrete structures},
journal = {Random Struct. Algorithms},
volume = {60},
number = {3},
pages = {367--405},
year = {2022},
url = {https://doi.org/10.1002/rsa.21044},
doi = {10.1002/RSA.21044},
timestamp = {Thu, 17 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/PontiverosGSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Przybylo22,
author = {Jakub Przybylo},
title = {A generalization of Faudree-Lehel conjecture holds almost surely for
random graphs},
journal = {Random Struct. Algorithms},
volume = {61},
number = {2},
pages = {383--396},
year = {2022},
url = {https://doi.org/10.1002/rsa.21058},
doi = {10.1002/RSA.21058},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Przybylo22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PrzykuckiRS22,
author = {Michal Przykucki and
Alexander Roberts and
Alex Scott},
title = {Shotgun reconstruction in the hypercube},
journal = {Random Struct. Algorithms},
volume = {60},
number = {1},
pages = {117--150},
year = {2022},
url = {https://doi.org/10.1002/rsa.21028},
doi = {10.1002/RSA.21028},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PrzykuckiRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RayS22,
author = {Gourab Ray and
Yinon Spinka},
title = {Finitary codings for gradient models and a new graphical representation
for the six-vertex model},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {193--232},
year = {2022},
url = {https://doi.org/10.1002/rsa.21032},
doi = {10.1002/RSA.21032},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RayS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Riordan22,
author = {Oliver Riordan},
title = {Random cliques in random graphs and sharp thresholds for {F} {\textdollar}{\textdollar}
{F} {\textdollar}{\textdollar} -factors},
journal = {Random Struct. Algorithms},
volume = {61},
number = {4},
pages = {619--637},
year = {2022},
url = {https://doi.org/10.1002/rsa.21111},
doi = {10.1002/RSA.21111},
timestamp = {Fri, 02 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Riordan22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SileikisW22,
author = {Matas Sileikis and
Lutz Warnke},
title = {Counting extensions revisited},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {3--30},
year = {2022},
url = {https://doi.org/10.1002/rsa.21050},
doi = {10.1002/RSA.21050},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SileikisW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Stufler22,
author = {Benedikt Stufler},
title = {A branching process approach to level-k phylogenetic networks},
journal = {Random Struct. Algorithms},
volume = {61},
number = {2},
pages = {397--421},
year = {2022},
url = {https://doi.org/10.1002/rsa.21065},
doi = {10.1002/RSA.21065},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Stufler22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SudakovTW22,
author = {Benny Sudakov and
Istv{\'{a}}n Tomon and
Adam Zsolt Wagner},
title = {Uniform chain decompositions and applications},
journal = {Random Struct. Algorithms},
volume = {60},
number = {2},
pages = {261--286},
year = {2022},
url = {https://doi.org/10.1002/rsa.21034},
doi = {10.1002/RSA.21034},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/SudakovTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AchlioptasCHLMP21,
author = {Dimitris Achlioptas and
Amin Coja{-}Oghlan and
Max Hahn{-}Klimroth and
Joon Lee and
No{\"{e}}la M{\"{u}}ller and
Manuel Penschuck and
Guangyan Zhou},
title = {The number of satisfying assignments of random 2-SAT formulas},
journal = {Random Struct. Algorithms},
volume = {58},
number = {4},
pages = {609--647},
year = {2021},
url = {https://doi.org/10.1002/rsa.20993},
doi = {10.1002/RSA.20993},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AchlioptasCHLMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Addario-BerryBS21,
author = {Louigi Addario{-}Berry and
Shankar Bhamidi and
Sanchayan Sen},
title = {A probabilistic approach to the leader problem in random graphs},
journal = {Random Struct. Algorithms},
volume = {58},
number = {1},
pages = {34--67},
year = {2021},
url = {https://doi.org/10.1002/rsa.20966},
doi = {10.1002/RSA.20966},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Addario-BerryBS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AnastosF21,
author = {Michael Anastos and
Alan M. Frieze},
title = {Finding maximum matchings in random regular graphs in linear expected
time},
journal = {Random Struct. Algorithms},
volume = {58},
number = {3},
pages = {390--429},
year = {2021},
url = {https://doi.org/10.1002/rsa.20980},
doi = {10.1002/RSA.20980},
timestamp = {Thu, 25 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AnastosF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AndreisKP21,
author = {Luisa Andreis and
Wolfgang K{\"{o}}nig and
Robert I. A. Patterson},
title = {A large-deviations principle for all the cluster sizes of a sparse
Erd{\H{o}}s-R{\'{e}}nyi graph},
journal = {Random Struct. Algorithms},
volume = {59},
number = {4},
pages = {522--553},
year = {2021},
url = {https://doi.org/10.1002/rsa.21007},
doi = {10.1002/RSA.21007},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AndreisKP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ArmanGW21,
author = {Andrii Arman and
Pu Gao and
Nicholas C. Wormald},
title = {Fast uniform generation of random graphs with given degree sequences},
journal = {Random Struct. Algorithms},
volume = {59},
number = {3},
pages = {291--314},
year = {2021},
url = {https://doi.org/10.1002/rsa.21004},
doi = {10.1002/RSA.21004},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ArmanGW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarbourBR21,
author = {Andrew D. Barbour and
Peter Braunsteins and
Nathan Ross},
title = {Local limit theorems for occupancy models},
journal = {Random Struct. Algorithms},
volume = {58},
number = {1},
pages = {3--33},
year = {2021},
url = {https://doi.org/10.1002/rsa.20967},
doi = {10.1002/RSA.20967},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarbourBR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BatesP21,
author = {Erik Bates and
Moumanti Podder},
title = {Avoidance couplings on non-complete graphs},
journal = {Random Struct. Algorithms},
volume = {59},
number = {1},
pages = {25--52},
year = {2021},
url = {https://doi.org/10.1002/rsa.20999},
doi = {10.1002/RSA.20999},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BatesP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhandariHMS21,
author = {Siddharth Bhandari and
Prahladh Harsha and
Tulasimohan Molli and
Srikanth Srinivasan},
title = {On the probabilistic degree of {OR} over the reals},
journal = {Random Struct. Algorithms},
volume = {59},
number = {1},
pages = {53--67},
year = {2021},
url = {https://doi.org/10.1002/rsa.20991},
doi = {10.1002/RSA.20991},
timestamp = {Wed, 30 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BhandariHMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhattacharyaD21,
author = {Sohom Bhattacharya and
Amir Dembo},
title = {Upper tail for homomorphism counts in constrained sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {59},
number = {3},
pages = {315--338},
year = {2021},
url = {https://doi.org/10.1002/rsa.21011},
doi = {10.1002/RSA.21011},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BhattacharyaD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BienvenuDF21,
author = {Fran{\c{c}}ois Bienvenu and
Jean{-}Jil Duchamps and
F{\'{e}}lix Foutel{-}Rodier},
title = {The Moran forest},
journal = {Random Struct. Algorithms},
volume = {59},
number = {2},
pages = {155--188},
year = {2021},
url = {https://doi.org/10.1002/rsa.20997},
doi = {10.1002/RSA.20997},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BienvenuDF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanK21,
author = {Tom Bohman and
Peter Keevash},
title = {Dynamic concentration of the triangle-free process},
journal = {Random Struct. Algorithms},
volume = {58},
number = {2},
pages = {221--293},
year = {2021},
url = {https://doi.org/10.1002/rsa.20973},
doi = {10.1002/RSA.20973},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BohmanK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BonnetKT21,
author = {Gilles Bonnet and
Zakhar Kabluchko and
Nicola Turchi},
title = {Phase transition for the volume of high-dimensional random polytopes},
journal = {Random Struct. Algorithms},
volume = {58},
number = {4},
pages = {648--663},
year = {2021},
url = {https://doi.org/10.1002/rsa.20986},
doi = {10.1002/RSA.20986},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BonnetKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Borga21,
author = {Jacopo Borga},
title = {Asymptotic normality of consecutive patterns in permutations encoded
by generating trees with one-dimensional labels},
journal = {Random Struct. Algorithms},
volume = {59},
number = {3},
pages = {339--375},
year = {2021},
url = {https://doi.org/10.1002/rsa.21005},
doi = {10.1002/RSA.21005},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Borga21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CaputoQ21,
author = {Pietro Caputo and
Matteo Quattropani},
title = {Mixing time of PageRank surfers on sparse random digraphs},
journal = {Random Struct. Algorithms},
volume = {59},
number = {3},
pages = {376--406},
year = {2021},
url = {https://doi.org/10.1002/rsa.21009},
doi = {10.1002/RSA.21009},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CaputoQ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChenGGPSV21,
author = {Zongchen Chen and
Andreas Galanis and
Leslie Ann Goldberg and
Will Perkins and
James Stewart and
Eric Vigoda},
title = {Fast algorithms at low temperatures via Markov chains},
journal = {Random Struct. Algorithms},
volume = {58},
number = {2},
pages = {294--321},
year = {2021},
url = {https://doi.org/10.1002/rsa.20968},
doi = {10.1002/RSA.20968},
timestamp = {Wed, 26 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChenGGPSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChenHS21,
author = {Antares Chen and
David G. Harris and
Aravind Srinivasan},
title = {Partial resampling to approximate covering integer programs},
journal = {Random Struct. Algorithms},
volume = {58},
number = {1},
pages = {68--93},
year = {2021},
url = {https://doi.org/10.1002/rsa.20964},
doi = {10.1002/RSA.20964},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ChenHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DamronLS21,
author = {Michael Damron and
Hanbaek Lyu and
David Sivakoff},
title = {Stretched exponential decay for subcritical parking times on},
journal = {Random Struct. Algorithms},
volume = {59},
number = {2},
pages = {143--154},
year = {2021},
url = {https://doi.org/10.1002/rsa.21001},
doi = {10.1002/RSA.21001},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DamronLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DelmasDS21,
author = {Jean{-}Fran{\c{c}}ois Delmas and
Jean{-}St{\'{e}}phane Dhersin and
Marion Sciauveau},
title = {Asymptotic for the cumulative distribution function of the degrees
and homomorphism densities for random graphs sampled from a graphon},
journal = {Random Struct. Algorithms},
volume = {58},
number = {1},
pages = {94--149},
year = {2021},
url = {https://doi.org/10.1002/rsa.20965},
doi = {10.1002/RSA.20965},
timestamp = {Fri, 18 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DelmasDS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DraganicKN21,
author = {Nemanja Draganic and
Michael Krivelevich and
Rajko Nenadov},
title = {The size-Ramsey number of short subdivisions},
journal = {Random Struct. Algorithms},
volume = {59},
number = {1},
pages = {68--78},
year = {2021},
url = {https://doi.org/10.1002/rsa.20995},
doi = {10.1002/RSA.20995},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DraganicKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrmotaFHN21,
author = {Michael Drmota and
Michael Fuchs and
Hsien{-}Kuei Hwang and
Ralph Neininger},
title = {Node profiles of symmetric digital search trees: Concentration properties},
journal = {Random Struct. Algorithms},
volume = {58},
number = {3},
pages = {430--467},
year = {2021},
url = {https://doi.org/10.1002/rsa.20979},
doi = {10.1002/RSA.20979},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DrmotaFHN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerGM21,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Haiko M{\"{u}}ller},
title = {Counting independent sets in graphs with bounded bipartite pathwidth},
journal = {Random Struct. Algorithms},
volume = {59},
number = {2},
pages = {204--237},
year = {2021},
url = {https://doi.org/10.1002/rsa.21003},
doi = {10.1002/RSA.21003},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerGM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FarberN21,
author = {Michael Farber and
Tahl Nowik},
title = {Topological embeddings into random 2-complexes},
journal = {Random Struct. Algorithms},
volume = {58},
number = {4},
pages = {664--675},
year = {2021},
url = {https://doi.org/10.1002/rsa.20987},
doi = {10.1002/RSA.20987},
timestamp = {Thu, 10 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FarberN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FoxP21,
author = {Jacob Fox and
Cosmin Pohoata},
title = {Sets without k-term progressions can have many shorter progressions},
journal = {Random Struct. Algorithms},
volume = {58},
number = {3},
pages = {383--389},
year = {2021},
url = {https://doi.org/10.1002/rsa.20984},
doi = {10.1002/RSA.20984},
timestamp = {Thu, 25 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FoxP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FoxSW21,
author = {Jacob Fox and
Lisa Sauermann and
Fan Wei},
title = {On the inducibility problem for random Cayley graphs of abelian groups
with a few deleted vertices},
journal = {Random Struct. Algorithms},
volume = {59},
number = {4},
pages = {554--615},
year = {2021},
url = {https://doi.org/10.1002/rsa.21010},
doi = {10.1002/RSA.21010},
timestamp = {Wed, 08 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FoxSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GishbolinerSS21,
author = {Lior Gishboliner and
Asaf Shapira and
Henrique Stagni},
title = {Testing linear inequalities of subgraph statistics},
journal = {Random Struct. Algorithms},
volume = {58},
number = {3},
pages = {468--479},
year = {2021},
url = {https://doi.org/10.1002/rsa.20983},
doi = {10.1002/RSA.20983},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GishbolinerSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HanMT21,
author = {Jie Han and
Patrick Morris and
Andrew Treglown},
title = {Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemer{\'{e}}di
and Johansson-Kahn-Vu},
journal = {Random Struct. Algorithms},
volume = {58},
number = {3},
pages = {480--516},
year = {2021},
url = {https://doi.org/10.1002/rsa.20981},
doi = {10.1002/RSA.20981},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HanMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaslegraveP21,
author = {John Haslegrave and
Christoforos Panagiotis},
title = {Site percolation and isoperimetric inequalities for plane graphs},
journal = {Random Struct. Algorithms},
volume = {58},
number = {1},
pages = {150--163},
year = {2021},
url = {https://doi.org/10.1002/rsa.20946},
doi = {10.1002/RSA.20946},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HaslegraveP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Heckel21,
author = {Annika Heckel},
title = {Random triangles in random graphs},
journal = {Random Struct. Algorithms},
volume = {59},
number = {4},
pages = {616--621},
year = {2021},
url = {https://doi.org/10.1002/rsa.21013},
doi = {10.1002/RSA.21013},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Heckel21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HolroydM21,
author = {Alexander E. Holroyd and
James B. Martin},
title = {Galton-Watson games},
journal = {Random Struct. Algorithms},
volume = {59},
number = {4},
pages = {495--521},
year = {2021},
url = {https://doi.org/10.1002/rsa.21008},
doi = {10.1002/RSA.21008},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HolroydM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JuskeviciusK21,
author = {Tomas Juskevicius and
Valentas Kurauskas},
title = {On the Littlewood-Offord problem for arbitrary distributions},
journal = {Random Struct. Algorithms},
volume = {58},
number = {2},
pages = {370--380},
year = {2021},
url = {https://doi.org/10.1002/rsa.20977},
doi = {10.1002/RSA.20977},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JuskeviciusK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LarssonM21,
author = {Joel Larsson and
Klas Markstr{\"{o}}m},
title = {Biased random k-SAT},
journal = {Random Struct. Algorithms},
volume = {59},
number = {2},
pages = {238--266},
year = {2021},
url = {https://doi.org/10.1002/rsa.20996},
doi = {10.1002/RSA.20996},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LarssonM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Lason21,
author = {Michal Lason},
title = {Optimal stopping for many connected components in a graph},
journal = {Random Struct. Algorithms},
volume = {59},
number = {2},
pages = {267--287},
year = {2021},
url = {https://doi.org/10.1002/rsa.21000},
doi = {10.1002/RSA.21000},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Lason21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Lee21,
author = {Joonkyung Lee},
title = {On some graph densities in locally dense graphs},
journal = {Random Struct. Algorithms},
volume = {58},
number = {2},
pages = {322--344},
year = {2021},
url = {https://doi.org/10.1002/rsa.20974},
doi = {10.1002/RSA.20974},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Lee21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LinialS21,
author = {Nati Linial and
Michael Simkin},
title = {A randomized construction of high girth regular graphs},
journal = {Random Struct. Algorithms},
volume = {58},
number = {2},
pages = {345--369},
year = {2021},
url = {https://doi.org/10.1002/rsa.20976},
doi = {10.1002/RSA.20976},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LinialS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LiuZ21,
author = {Yang P. Liu and
Yufei Zhao},
title = {On the upper tail problem for random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {58},
number = {2},
pages = {179--220},
year = {2021},
url = {https://doi.org/10.1002/rsa.20975},
doi = {10.1002/RSA.20975},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LiuZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmidSW21,
author = {Colin McDiarmid and
Alex Scott and
Paul Withers},
title = {The component structure of dense random subgraphs of the hypercube},
journal = {Random Struct. Algorithms},
volume = {59},
number = {1},
pages = {3--24},
year = {2021},
url = {https://doi.org/10.1002/rsa.20990},
doi = {10.1002/RSA.20990},
timestamp = {Wed, 30 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmidSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NieV21,
author = {Jiaxi Nie and
Jacques Verstra{\"{e}}te},
title = {Randomized greedy algorithm for independent sets in regular uniform
hypergraphs with large girth},
journal = {Random Struct. Algorithms},
volume = {59},
number = {1},
pages = {79--95},
year = {2021},
url = {https://doi.org/10.1002/rsa.20994},
doi = {10.1002/RSA.20994},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NieV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PalZ21,
author = {Soumik Pal and
Yizhe Zhu},
title = {Community detection in the sparse hypergraph stochastic block model},
journal = {Random Struct. Algorithms},
volume = {59},
number = {3},
pages = {407--463},
year = {2021},
url = {https://doi.org/10.1002/rsa.21006},
doi = {10.1002/RSA.21006},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PalZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PfaffelhuberS21,
author = {Peter Pfaffelhuber and
Jakob Stiefel},
title = {The range of once-reinforced random walk in one dimension},
journal = {Random Struct. Algorithms},
volume = {58},
number = {1},
pages = {164--175},
year = {2021},
url = {https://doi.org/10.1002/rsa.20948},
doi = {10.1002/RSA.20948},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PfaffelhuberS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pinsky21,
author = {Ross G. Pinsky},
title = {Permutations avoiding a pattern of length three under Mallows distributions},
journal = {Random Struct. Algorithms},
volume = {58},
number = {4},
pages = {676--690},
year = {2021},
url = {https://doi.org/10.1002/rsa.20988},
doi = {10.1002/RSA.20988},
timestamp = {Thu, 27 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pinsky21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pinsky21a,
author = {Ross G. Pinsky},
title = {The infinite limit of separable permutations},
journal = {Random Struct. Algorithms},
volume = {59},
number = {4},
pages = {622--639},
year = {2021},
url = {https://doi.org/10.1002/rsa.21014},
doi = {10.1002/RSA.21014},
timestamp = {Wed, 08 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Pinsky21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pittel21,
author = {Boris G. Pittel},
title = {On Bollob{\'{a}}s-Riordan random pairing model of preferential
attachment graph},
journal = {Random Struct. Algorithms},
volume = {58},
number = {4},
pages = {691--725},
year = {2021},
url = {https://doi.org/10.1002/rsa.20985},
doi = {10.1002/RSA.20985},
timestamp = {Thu, 27 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pittel21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RaskhodnikovaRV21,
author = {Sofya Raskhodnikova and
Noga Ron{-}Zewi and
Nithin Varma},
title = {Erasures versus errors in local decoding and property testing},
journal = {Random Struct. Algorithms},
volume = {59},
number = {4},
pages = {640--670},
year = {2021},
url = {https://doi.org/10.1002/rsa.21031},
doi = {10.1002/RSA.21031},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RaskhodnikovaRV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Santis21,
author = {Emilio De Santis},
title = {Ranking graphs through hitting times of Markov chains},
journal = {Random Struct. Algorithms},
volume = {59},
number = {2},
pages = {189--203},
year = {2021},
url = {https://doi.org/10.1002/rsa.20998},
doi = {10.1002/RSA.20998},
timestamp = {Thu, 05 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Santis21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ShimizuS21,
author = {Nobutaka Shimizu and
Takeharu Shiraga},
title = {Phase transitions of Best-of-two and Best-of-three on stochastic block
models},
journal = {Random Struct. Algorithms},
volume = {59},
number = {1},
pages = {96--140},
year = {2021},
url = {https://doi.org/10.1002/rsa.20992},
doi = {10.1002/RSA.20992},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ShimizuS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Stufler21,
author = {Benedikt Stufler},
title = {Graphon convergence of random cographs},
journal = {Random Struct. Algorithms},
volume = {59},
number = {3},
pages = {464--491},
year = {2021},
url = {https://doi.org/10.1002/rsa.21002},
doi = {10.1002/RSA.21002},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Stufler21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TikhomirovY21,
author = {Konstantin E. Tikhomirov and
Pierre Youssef},
title = {Outliers in spectrum of sparse Wigner matrices},
journal = {Random Struct. Algorithms},
volume = {58},
number = {3},
pages = {517--605},
year = {2021},
url = {https://doi.org/10.1002/rsa.20982},
doi = {10.1002/RSA.20982},
timestamp = {Thu, 25 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/TikhomirovY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X21,
title = {Corrigendum to "Online purchasing under uncertainty"},
journal = {Random Struct. Algorithms},
volume = {59},
number = {2},
pages = {288},
year = {2021},
url = {https://doi.org/10.1002/rsa.21012},
doi = {10.1002/RSA.21012},
timestamp = {Thu, 05 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Zeindler21,
author = {Dirk Zeindler},
title = {Long cycle of random permutations with polynomially growing cycle
weights},
journal = {Random Struct. Algorithms},
volume = {58},
number = {4},
pages = {726--739},
year = {2021},
url = {https://doi.org/10.1002/rsa.20989},
doi = {10.1002/RSA.20989},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Zeindler21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AcanP20,
author = {H{\"{u}}seyin Acan and
Boris G. Pittel},
title = {On connectivity, conductance and bootstrap percolation for a random
k-out, age-biased graph},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {37--62},
year = {2020},
url = {https://doi.org/10.1002/rsa.20872},
doi = {10.1002/RSA.20872},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AcanP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AdamaszekAGH20,
author = {Anna Adamaszek and
Peter Allen and
Codrut Grosu and
Jan Hladk{\'{y}}},
title = {Almost all trees are almost graceful},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {948--987},
year = {2020},
url = {https://doi.org/10.1002/rsa.20906},
doi = {10.1002/RSA.20906},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AdamaszekAGH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AllenBSS20,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Jozef Skokan and
Maya Stein},
title = {Regularity inheritance in pseudorandom graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {306--338},
year = {2020},
url = {https://doi.org/10.1002/rsa.20851},
doi = {10.1002/RSA.20851},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AllenBSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonK20,
author = {Yahav Alon and
Michael Krivelevich},
title = {Finding a Hamilton cycle fast on average using rotations and extensions},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {32--46},
year = {2020},
url = {https://doi.org/10.1002/rsa.20918},
doi = {10.1002/RSA.20918},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlvesRS20,
author = {Caio Teodoro De Magalhaes Alves and
Rodrigo Ribeiro and
R{\'{e}}my Sanchis},
title = {Diameter of {P.A.} random graphs with edge-step functions},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {612--636},
year = {2020},
url = {https://doi.org/10.1002/rsa.20929},
doi = {10.1002/RSA.20929},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlvesRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AmanatidisK20,
author = {Georgios Amanatidis and
Pieter Kleer},
title = {Rapid mixing of the switch Markov chain for strongly stable degree
sequences},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {637--657},
year = {2020},
url = {https://doi.org/10.1002/rsa.20949},
doi = {10.1002/RSA.20949},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AmanatidisK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AnastosF20,
author = {Michael Anastos and
Alan M. Frieze},
title = {Hamilton cycles in random graphs with minimum degree at least 3: An
improved analysis},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {865--878},
year = {2020},
url = {https://doi.org/10.1002/rsa.20978},
doi = {10.1002/RSA.20978},
timestamp = {Tue, 17 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AnastosF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AnastosF20a,
author = {Michael Anastos and
Alan M. Frieze},
title = {On the connectivity of proper colorings of random graphs and hypergraphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {988--997},
year = {2020},
url = {https://doi.org/10.1002/rsa.20912},
doi = {10.1002/RSA.20912},
timestamp = {Sun, 13 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AnastosF20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Bafna0S20,
author = {Mitali Bafna and
Srikanth Srinivasan and
Madhu Sudan},
title = {Local decoding and testing of polynomials over grids},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {658--694},
year = {2020},
url = {https://doi.org/10.1002/rsa.20933},
doi = {10.1002/RSA.20933},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Bafna0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BansalM20,
author = {Nikhil Bansal and
Raghu Meka},
title = {On the discrepancy of random low degree set systems},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {695--705},
year = {2020},
url = {https://doi.org/10.1002/rsa.20935},
doi = {10.1002/RSA.20935},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BansalM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BansalS20,
author = {Nikhil Bansal and
Joel H. Spencer},
title = {On-line balancing of random inputs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {879--891},
year = {2020},
url = {https://doi.org/10.1002/rsa.20955},
doi = {10.1002/RSA.20955},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BansalS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarberGKLMO20,
author = {Ben Barber and
Stefan Glock and
Daniela K{\"{u}}hn and
Allan Lo and
Richard Montgomery and
Deryk Osthus},
title = {Minimalist designs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {47--63},
year = {2020},
url = {https://doi.org/10.1002/rsa.20915},
doi = {10.1002/RSA.20915},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarberGKLMO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BedenknechtR20,
author = {Wiebke Bedenknecht and
Christian Reiher},
title = {Squares of Hamiltonian cycles in 3-uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {339--372},
year = {2020},
url = {https://doi.org/10.1002/rsa.20876},
doi = {10.1002/RSA.20876},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BedenknechtR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Ben-EliezerGHK20,
author = {Omri Ben{-}Eliezer and
Lior Gishboliner and
Dan Hefetz and
Michael Krivelevich},
title = {Very fast construction of bounded-degree spanning graphs via the semi-random
graph process},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {892--919},
year = {2020},
url = {https://doi.org/10.1002/rsa.20963},
doi = {10.1002/RSA.20963},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Ben-EliezerGHK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Ben-EliezerHKPS20,
author = {Omri Ben{-}Eliezer and
Dan Hefetz and
Gal Kronenberg and
Olaf Parczyk and
Clara Shikhelman and
Milos Stojakovic},
title = {Semi-random graph process},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {648--675},
year = {2020},
url = {https://doi.org/10.1002/rsa.20887},
doi = {10.1002/RSA.20887},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Ben-EliezerHKPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhamidiS20,
author = {Shankar Bhamidi and
Sanchayan Sen},
title = {Geometry of the vacant set left by random walk on random graphs, Wright's
constants, and critical random graphs with prescribed degrees},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {676--721},
year = {2020},
url = {https://doi.org/10.1002/rsa.20880},
doi = {10.1002/RSA.20880},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BhamidiS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BlancaCV20,
author = {Antonio Blanca and
Zongchen Chen and
Eric Vigoda},
title = {Swendsen-Wang dynamics for general graphs in the tree uniqueness region},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {373--400},
year = {2020},
url = {https://doi.org/10.1002/rsa.20858},
doi = {10.1002/RSA.20858},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BlancaCV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasGMRS20,
author = {B{\'{e}}la Bollob{\'{a}}s and
Simon Griffiths and
Robert Morris and
Leonardo T. Rolla and
Paul Smith},
title = {Nucleation and growth in two dimensions},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {63--96},
year = {2020},
url = {https://doi.org/10.1002/rsa.20888},
doi = {10.1002/RSA.20888},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasGMRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BordenaveFM20,
author = {Charles Bordenave and
Uriel Feige and
Elchanan Mossel},
title = {Shotgun assembly of random jigsaw puzzles},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {998--1015},
year = {2020},
url = {https://doi.org/10.1002/rsa.20899},
doi = {10.1002/RSA.20899},
timestamp = {Sun, 13 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BordenaveFM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BriquelB20,
author = {Ir{\'{e}}n{\'{e}}e Briquel and
Peter B{\"{u}}rgisser},
title = {The real tau-conjecture is true on average},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {279--303},
year = {2020},
url = {https://doi.org/10.1002/rsa.20926},
doi = {10.1002/RSA.20926},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BriquelB20.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/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/BurdzyP20,
author = {Krzysztof Burdzy and
Soumik Pal},
title = {Twin peaks},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {432--460},
year = {2020},
url = {https://doi.org/10.1002/rsa.20883},
doi = {10.1002/RSA.20883},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BurdzyP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CaoO20,
author = {Junyu Cao and
Mariana Olvera{-}Cravioto},
title = {Connectivity of a general class of inhomogeneous random digraphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {722--774},
year = {2020},
url = {https://doi.org/10.1002/rsa.20892},
doi = {10.1002/RSA.20892},
timestamp = {Mon, 20 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CaoO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CarmesinG20,
author = {Johannes Carmesin and
Agelos Georgakopoulos},
title = {Every planar graph with the Liouville property is amenable},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {706--729},
year = {2020},
url = {https://doi.org/10.1002/rsa.20936},
doi = {10.1002/RSA.20936},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CarmesinG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChanKNPSV20,
author = {Timothy F. N. Chan and
Daniel Kr{\'{a}}l' and
Jonathan A. Noel and
Yanitsa Pehova and
Maryam Sharifzadeh and
Jan Volec},
title = {Characterization of quasirandom permutations by a pattern sum},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {920--939},
year = {2020},
url = {https://doi.org/10.1002/rsa.20956},
doi = {10.1002/RSA.20956},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChanKNPSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CheliotisKLT20,
author = {Dimitris Cheliotis and
Ioannis Kontoyiannis and
Michail Loulakis and
Stavros Toumpis},
title = {A simple network of nodes moving on the circle{\({_\ast}\)}},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {317--338},
year = {2020},
url = {https://doi.org/10.1002/rsa.20932},
doi = {10.1002/RSA.20932},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CheliotisKLT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ConlonDLM20,
author = {David Conlon and
Shagnik Das and
Joonkyung Lee and
Tam{\'{a}}s M{\'{e}}sz{\'{a}}ros},
title = {Ramsey games near the critical threshold},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {940--957},
year = {2020},
url = {https://doi.org/10.1002/rsa.20959},
doi = {10.1002/RSA.20959},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ConlonDLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ConlonFS20,
author = {David Conlon and
Jacob Fox and
Benny Sudakov},
title = {Short proofs of some extremal results {III}},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {958--982},
year = {2020},
url = {https://doi.org/10.1002/rsa.20953},
doi = {10.1002/RSA.20953},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ConlonFS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooleyGKS20,
author = {Oliver Cooley and
Nicola Del Giudice and
Mihyun Kang and
Philipp Spr{\"{u}}ssel},
title = {Vanishing of cohomology groups of random simplicial complexes},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {461--500},
year = {2020},
url = {https://doi.org/10.1002/rsa.20857},
doi = {10.1002/RSA.20857},
timestamp = {Mon, 14 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooleyGKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DasMT20,
author = {Shagnik Das and
Patrick Morris and
Andrew Treglown},
title = {Vertex Ramsey properties of randomly perturbed graphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {983--1006},
year = {2020},
url = {https://doi.org/10.1002/rsa.20971},
doi = {10.1002/RSA.20971},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DasMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DaviesVKP20,
author = {Ewan Davies and
R{\'{e}}mi de Joannis de Verclos and
Ross J. Kang and
Fran{\c{c}}ois Pirot},
title = {Coloring triangle-free graphs with local list sizes},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {730--744},
year = {2020},
url = {https://doi.org/10.1002/rsa.20945},
doi = {10.1002/RSA.20945},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DaviesVKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DayFH20,
author = {A. Nicholas Day and
Victor Falgas{-}Ravry and
Robert Hancock},
title = {Long paths and connectivity in 1-independent random graphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1007--1049},
year = {2020},
url = {https://doi.org/10.1002/rsa.20972},
doi = {10.1002/RSA.20972},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DayFH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DelcourtHP20,
author = {Michelle Delcourt and
Marc Heinrich and
Guillem Perarnau},
title = {The Glauber dynamics for edge-colorings of trees},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1050--1076},
year = {2020},
url = {https://doi.org/10.1002/rsa.20960},
doi = {10.1002/RSA.20960},
timestamp = {Tue, 17 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DelcourtHP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DiazMM20,
author = {Josep D{\'{\i}}az and
Colin McDiarmid and
Dieter Mitsche},
title = {Learning random points from geometric graphs or orderings},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {339--370},
year = {2020},
url = {https://doi.org/10.1002/rsa.20922},
doi = {10.1002/RSA.20922},
timestamp = {Tue, 18 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DiazMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DowdenKK20,
author = {Chris Dowden and
Mihyun Kang and
Michael Krivelevich},
title = {The genus of the Erd{\H{o}}s-R{\'{e}}nyi random graph and the
fragile genus property},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {97--121},
year = {2020},
url = {https://doi.org/10.1002/rsa.20871},
doi = {10.1002/RSA.20871},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DowdenKK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DudekRRS20,
author = {Andrzej Dudek and
Christian Reiher and
Andrzej Rucinski and
Mathias Schacht},
title = {Powers of Hamiltonian cycles in randomly augmented graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {122--141},
year = {2020},
url = {https://doi.org/10.1002/rsa.20870},
doi = {10.1002/RSA.20870},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DudekRRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EbsenMRSS20,
author = {Oliver Ebsen and
Giulia S. Maesaka and
Christian Reiher and
Mathias Schacht and
Bjarne Sch{\"{u}}lke},
title = {Embedding spanning subgraphs in uniformly dense and inseparable graphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1077--1096},
year = {2020},
url = {https://doi.org/10.1002/rsa.20957},
doi = {10.1002/RSA.20957},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EbsenMRSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EnriquezFM20,
author = {Nathana{\"{e}}l Enriquez and
Gabriel Faraud and
Laurent M{\'{e}}nard},
title = {Limiting shape of the depth first search tree in an Erd{\H{o}}s-R{\'{e}}nyi
graph},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {501--516},
year = {2020},
url = {https://doi.org/10.1002/rsa.20878},
doi = {10.1002/RSA.20878},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/EnriquezFM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Falgas-RavryMTZ20,
author = {Victor Falgas{-}Ravry and
Klas Markstr{\"{o}}m and
Andrew Treglown and
Yi Zhao},
title = {Existence thresholds and Ramsey properties of random posets},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1097--1133},
year = {2020},
url = {https://doi.org/10.1002/rsa.20952},
doi = {10.1002/RSA.20952},
timestamp = {Fri, 11 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Falgas-RavryMTZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FeigeGNRT20,
author = {Uriel Feige and
David Gamarnik and
Joe Neeman and
Mikl{\'{o}}s Z. R{\'{a}}cz and
Prasad Tetali},
title = {Finding cliques using few probes},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {142--153},
year = {2020},
url = {https://doi.org/10.1002/rsa.20896},
doi = {10.1002/RSA.20896},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FeigeGNRT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberJ20,
author = {Asaf Ferber and
Vishesh Jain},
title = {1-Factorizations of pseudorandom graphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {259--278},
year = {2020},
url = {https://doi.org/10.1002/rsa.20927},
doi = {10.1002/RSA.20927},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FormanPRW20,
author = {Noah Forman and
Soumik Pal and
Douglas Rizzolo and
Matthias Winkel},
title = {Projections of the Aldous chain on binary trees: Intertwining and
consistency},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {745--769},
year = {2020},
url = {https://doi.org/10.1002/rsa.20930},
doi = {10.1002/RSA.20930},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FormanPRW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FountoulakisKM20,
author = {Nikolaos Fountoulakis and
Mihyun Kang and
Tam{\'{a}}s Makai},
title = {Resolution of a conjecture on majority dynamics: Rapid stabilization
in dense random graphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1134--1156},
year = {2020},
url = {https://doi.org/10.1002/rsa.20970},
doi = {10.1002/RSA.20970},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FountoulakisKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FoxHW20,
author = {Jacob Fox and
Xiaoyu He and
Yuval Wigderson},
title = {Ramsey, Paper, Scissors},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1157--1173},
year = {2020},
url = {https://doi.org/10.1002/rsa.20950},
doi = {10.1002/RSA.20950},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FoxHW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FoxL20,
author = {Jacob Fox and
Ray Li},
title = {On edge-ordered Ramsey numbers},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1174--1204},
year = {2020},
url = {https://doi.org/10.1002/rsa.20954},
doi = {10.1002/RSA.20954},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FoxL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FranksS20,
author = {Cole Franks and
Michael E. Saks},
title = {On the discrepancy of random matrices with many columns},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {64--96},
year = {2020},
url = {https://doi.org/10.1002/rsa.20909},
doi = {10.1002/RSA.20909},
timestamp = {Thu, 12 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FranksS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GangulyS20,
author = {Shirshendu Ganguly and
Insuk Seo},
title = {Information percolation and cutoff for the random-cluster model},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {770--822},
year = {2020},
url = {https://doi.org/10.1002/rsa.20931},
doi = {10.1002/RSA.20931},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GangulyS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GerkeMS20,
author = {Stefanie Gerke and
Bal{\'{a}}zs F. Mezei and
Gregory B. Sorkin},
title = {Successive shortest paths in complete graphs with random edge weights},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1205--1247},
year = {2020},
url = {https://doi.org/10.1002/rsa.20962},
doi = {10.1002/RSA.20962},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GerkeMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GheissariL20,
author = {Reza Gheissari and
Eyal Lubetzky},
title = {Quasi-polynomial mixing of critical two-dimensional random cluster
models},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {517--556},
year = {2020},
url = {https://doi.org/10.1002/rsa.20868},
doi = {10.1002/RSA.20868},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/GheissariL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GlockJ20,
author = {Stefan Glock and
Felix Joos},
title = {A rainbow blow-up lemma},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {1031--1069},
year = {2020},
url = {https://doi.org/10.1002/rsa.20907},
doi = {10.1002/RSA.20907},
timestamp = {Sun, 13 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GlockJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoldbergLR20,
author = {Leslie Ann Goldberg and
John Lapinskas and
David Richerby},
title = {Phase transitions of the Moran process and algorithmic consequences},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {597--647},
year = {2020},
url = {https://doi.org/10.1002/rsa.20890},
doi = {10.1002/RSA.20890},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GoldbergLR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GuoH20,
author = {Heng Guo and
Kun He},
title = {Tight bounds for popping algorithms},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {371--392},
year = {2020},
url = {https://doi.org/10.1002/rsa.20928},
doi = {10.1002/RSA.20928},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GuoH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Harris20,
author = {David G. Harris},
title = {New bounds for the Moser-Tardos distribution},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {97--131},
year = {2020},
url = {https://doi.org/10.1002/rsa.20914},
doi = {10.1002/RSA.20914},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Harris20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaslegraveJY20,
author = {John Haslegrave and
Jonathan H. Jordan and
Mark Yarrow},
title = {Condensation in preferential attachment models with location-based
choice},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {775--795},
year = {2020},
url = {https://doi.org/10.1002/rsa.20889},
doi = {10.1002/RSA.20889},
timestamp = {Tue, 30 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HaslegraveJY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Heilman20,
author = {Steven Heilman},
title = {A periodic isoperimetric problem related to the unique games conjecture},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {154--168},
year = {2020},
url = {https://doi.org/10.1002/rsa.20877},
doi = {10.1002/RSA.20877},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Heilman20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HitczenkoY20,
author = {Pawel Hitczenko and
Aleksandr Yaroslavskiy},
title = {Asymptotic normality of the number of corners in tableaux associated
with the partially asymmetric simple exclusion process},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1248--1271},
year = {2020},
url = {https://doi.org/10.1002/rsa.20961},
doi = {10.1002/RSA.20961},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HitczenkoY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HuangR20,
author = {Han Huang and
Mark Rudelson},
title = {Size of nodal domains of the eigenvectors of a graph},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {393--438},
year = {2020},
url = {https://doi.org/10.1002/rsa.20925},
doi = {10.1002/RSA.20925},
timestamp = {Tue, 18 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HuangR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HulshofN20,
author = {Tim Hulshof and
Asaf Nachmias},
title = {Slightly subcritical hypercube percolation},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {557--593},
year = {2020},
url = {https://doi.org/10.1002/rsa.20853},
doi = {10.1002/RSA.20853},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HulshofN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson20,
author = {Svante Janson},
title = {Random graphs with given vertex degrees and switchings},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {3--31},
year = {2020},
url = {https://doi.org/10.1002/rsa.20911},
doi = {10.1002/RSA.20911},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson20a,
author = {Svante Janson},
title = {Asymptotic normality in random graphs with given vertex degrees},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {1070--1116},
year = {2020},
url = {https://doi.org/10.1002/rsa.20905},
doi = {10.1002/RSA.20905},
timestamp = {Sun, 13 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Johansson20,
author = {Tony Johansson},
title = {On Hamilton cycles in Erd{\H{o}}s-R{\'{e}}nyi subgraphs of large
graphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {132--149},
year = {2020},
url = {https://doi.org/10.1002/rsa.20916},
doi = {10.1002/RSA.20916},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Johansson20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JohnsonPS20,
author = {Tobias Johnson and
Moumanti Podder and
Fiona Skerman},
title = {Random tree recursions: Which fixed points correspond to tangible
sets of trees?},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {796--837},
year = {2020},
url = {https://doi.org/10.1002/rsa.20895},
doi = {10.1002/RSA.20895},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JohnsonPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JoosK20,
author = {Felix Joos and
Jaehoon Kim},
title = {Spanning trees in randomly perturbed graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {169--219},
year = {2020},
url = {https://doi.org/10.1002/rsa.20886},
doi = {10.1002/RSA.20886},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/JoosK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JorritsmaK20,
author = {Joost Jorritsma and
J{\'{u}}lia Komj{\'{a}}thy},
title = {Weighted distances in scale-free preferential attachment models},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {823--859},
year = {2020},
url = {https://doi.org/10.1002/rsa.20947},
doi = {10.1002/RSA.20947},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JorritsmaK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KahleM20,
author = {Matthew Kahle and
Francisco Martinez{-}Figueroa},
title = {The chromatic number of random Borsuk graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {838--850},
year = {2020},
url = {https://doi.org/10.1002/rsa.20897},
doi = {10.1002/RSA.20897},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KahleM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KamcevKMS20,
author = {Nina Kamcev and
Michael Krivelevich and
Natasha Morrison and
Benny Sudakov},
title = {The K{\H{o}}nig graph process},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1272--1302},
year = {2020},
url = {https://doi.org/10.1002/rsa.20969},
doi = {10.1002/RSA.20969},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KamcevKMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KangMS20,
author = {Mihyun Kang and
Michael Mo{\ss}hammer and
Philipp Spr{\"{u}}ssel},
title = {Phase transitions in graphs on orientable surfaces},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {1117--1170},
year = {2020},
url = {https://doi.org/10.1002/rsa.20900},
doi = {10.1002/RSA.20900},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KangMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Karonski20,
author = {Michal Karonski},
title = {Thirty years..},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {3--4},
year = {2020},
url = {https://doi.org/10.1002/rsa.20898},
doi = {10.1002/RSA.20898},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Karonski20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KenyonKRW20,
author = {Richard W. Kenyon and
Daniel Kr{\'{a}}l' and
Charles Radin and
Peter Winkler},
title = {Permutations with fixed pattern densities},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {220--250},
year = {2020},
url = {https://doi.org/10.1002/rsa.20882},
doi = {10.1002/RSA.20882},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/KenyonKRW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KimKKO20,
author = {Jaehoon Kim and
Daniela K{\"{u}}hn and
Andrey Kupavskii and
Deryk Osthus},
title = {Rainbow structures in locally bounded colorings of graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {1171--1204},
year = {2020},
url = {https://doi.org/10.1002/rsa.20902},
doi = {10.1002/RSA.20902},
timestamp = {Sun, 13 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KimKKO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KimKL20,
author = {Jaehoon Kim and
Younjin Kim and
Hong Liu},
title = {Tree decompositions of graphs without large bipartite holes},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {150--168},
year = {2020},
url = {https://doi.org/10.1002/rsa.20913},
doi = {10.1002/RSA.20913},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KimKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KlattLY20,
author = {Michael Andreas Klatt and
G{\"{u}}nter Last and
D. Yogeshwaran},
title = {Hyperuniform and rigid stable matchings},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {439--473},
year = {2020},
url = {https://doi.org/10.1002/rsa.20923},
doi = {10.1002/RSA.20923},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KlattLY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichLS20,
author = {Michael Krivelevich and
Eyal Lubetzky and
Benny Sudakov},
title = {Asymptotics in percolation on high-girth expanders},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {927--947},
year = {2020},
url = {https://doi.org/10.1002/rsa.20903},
doi = {10.1002/RSA.20903},
timestamp = {Sun, 13 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LeckeyMW20,
author = {Kevin Leckey and
Dieter Mitsche and
Nick Wormald},
title = {The height of depth-weighted random recursive trees},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {851--866},
year = {2020},
url = {https://doi.org/10.1002/rsa.20901},
doi = {10.1002/RSA.20901},
timestamp = {Mon, 20 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LeckeyMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Li20,
author = {Zhongyang Li},
title = {Constrained percolation, Ising model, and {XOR} Ising model on planar
lattices},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {474--525},
year = {2020},
url = {https://doi.org/10.1002/rsa.20924},
doi = {10.1002/RSA.20924},
timestamp = {Tue, 18 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Li20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LinialM20,
author = {Nati Linial and
Jonathan Mosheiff},
title = {On the weight distribution of random binary linear codes},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {5--36},
year = {2020},
url = {https://doi.org/10.1002/rsa.20879},
doi = {10.1002/RSA.20879},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LinialM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LuhO20,
author = {Kyle Luh and
Sean O'Rourke},
title = {Eigenvector delocalization for non-Hermitian random matrices and applications},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {169--210},
year = {2020},
url = {https://doi.org/10.1002/rsa.20917},
doi = {10.1002/RSA.20917},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LuhO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Manstavicius20,
author = {Eugenijus Manstavicius},
title = {Sharp bounds for the variance of linear statistics on random permutations},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1303--1313},
year = {2020},
url = {https://doi.org/10.1002/rsa.20951},
doi = {10.1002/RSA.20951},
timestamp = {Tue, 17 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Manstavicius20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmidS20,
author = {Colin McDiarmid and
Fiona Skerman},
title = {Modularity of Erd{\H{o}}s-R{\'{e}}nyi random graphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {211--243},
year = {2020},
url = {https://doi.org/10.1002/rsa.20910},
doi = {10.1002/RSA.20910},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmidS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MosselX20,
author = {Elchanan Mossel and
Jiaming Xu},
title = {Seeded graph matching via large neighborhood statistics},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {570--611},
year = {2020},
url = {https://doi.org/10.1002/rsa.20934},
doi = {10.1002/RSA.20934},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MosselX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MutafchievS20,
author = {Ljuben R. Mutafchiev and
Mladen Savov},
title = {On the maximal multiplicity of block sizes in a random set partition},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {867--891},
year = {2020},
url = {https://doi.org/10.1002/rsa.20891},
doi = {10.1002/RSA.20891},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MutafchievS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NarayananS20,
author = {Bhargav P. Narayanan and
Mathias Schacht},
title = {Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {244--255},
year = {2020},
url = {https://doi.org/10.1002/rsa.20919},
doi = {10.1002/RSA.20919},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NarayananS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NetoKMM20,
author = {Maur{\'{\i}}cio Collares Neto and
Yoshiharu Kohayakawa and
Robert Morris and
Guilherme Oliveira Mota},
title = {Counting restricted orientations of random graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {1016--1030},
year = {2020},
url = {https://doi.org/10.1002/rsa.20904},
doi = {10.1002/RSA.20904},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NetoKMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NoyRR20,
author = {Marc Noy and
Cl{\'{e}}ment Requil{\'{e}} and
Juanjo Ru{\'{e}}},
title = {Further results on random cubic planar graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {892--924},
year = {2020},
url = {https://doi.org/10.1002/rsa.20893},
doi = {10.1002/RSA.20893},
timestamp = {Mon, 20 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NoyRR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SamotijS20,
author = {Wojciech Samotij and
Clara Shikhelman},
title = {A generalized Tur{\'{a}}n problem in random graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {283--305},
year = {2020},
url = {https://doi.org/10.1002/rsa.20873},
doi = {10.1002/RSA.20873},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/SamotijS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SpinkT20,
author = {Hunter Spink and
Marius Tiba},
title = {Judiciously 3-partitioning 3-uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {1205--1221},
year = {2020},
url = {https://doi.org/10.1002/rsa.20908},
doi = {10.1002/RSA.20908},
timestamp = {Sun, 13 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SpinkT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Tikhomirov20,
author = {Konstantin E. Tikhomirov},
title = {Invertibility via distance for noncentered random matrices with continuous
distributions},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {526--562},
year = {2020},
url = {https://doi.org/10.1002/rsa.20920},
doi = {10.1002/RSA.20920},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Tikhomirov20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X20,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {1--2},
year = {2020},
url = {https://doi.org/10.1002/rsa.20860},
doi = {10.1002/RSA.20860},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/X20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X20a,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {56},
number = {2},
pages = {281--282},
year = {2020},
url = {https://doi.org/10.1002/rsa.20861},
doi = {10.1002/RSA.20861},
timestamp = {Fri, 07 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/X20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X20b,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {595--596},
year = {2020},
url = {https://doi.org/10.1002/rsa.20862},
doi = {10.1002/RSA.20862},
timestamp = {Mon, 20 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X20b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X20c,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {1--2},
year = {2020},
url = {https://doi.org/10.1002/rsa.20864},
doi = {10.1002/RSA.20864},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X20c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X20d,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {57},
number = {2},
pages = {257--258},
year = {2020},
url = {https://doi.org/10.1002/rsa.20865},
doi = {10.1002/RSA.20865},
timestamp = {Tue, 18 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X20d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X20e,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {563--564},
year = {2020},
url = {https://doi.org/10.1002/rsa.20866},
doi = {10.1002/RSA.20866},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X20e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X20f,
title = {Ronald Louis Graham {(1935} - 2020)},
journal = {Random Struct. Algorithms},
volume = {57},
number = {3},
pages = {565--569},
year = {2020},
url = {https://doi.org/10.1002/rsa.20958},
doi = {10.1002/RSA.20958},
timestamp = {Sat, 17 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X20f.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X20g,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {861--864},
year = {2020},
url = {https://doi.org/10.1002/rsa.20867},
doi = {10.1002/RSA.20867},
timestamp = {Tue, 17 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/X20g.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Zhu20,
author = {Yizhe Zhu},
title = {A graphon approach to limiting spectral distributions of Wigner-type
matrices},
journal = {Random Struct. Algorithms},
volume = {56},
number = {1},
pages = {251--279},
year = {2020},
url = {https://doi.org/10.1002/rsa.20894},
doi = {10.1002/RSA.20894},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Zhu20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AcanK19,
author = {H{\"{u}}seyin Acan and
Jeff Kahn},
title = {Disproof of a packing conjecture of Alon and Spencer},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {531--544},
year = {2019},
url = {https://doi.org/10.1002/rsa.20884},
doi = {10.1002/RSA.20884},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AcanK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AhlbergDJ19,
author = {Daniel Ahlberg and
Maria Deijfen and
Svante Janson},
title = {Competing first passage percolation on random graphs with finite variance
degrees},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {545--559},
year = {2019},
url = {https://doi.org/10.1002/rsa.20846},
doi = {10.1002/RSA.20846},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AhlbergDJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AhlbergGJM19,
author = {Daniel Ahlberg and
Simon Griffiths and
Svante Janson and
Robert Morris},
title = {Competition in growth and urns},
journal = {Random Struct. Algorithms},
volume = {54},
number = {2},
pages = {211--227},
year = {2019},
url = {https://doi.org/10.1002/rsa.20779},
doi = {10.1002/RSA.20779},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AhlbergGJM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AyreCG19,
author = {Peter J. Ayre and
Amin Coja{-}Oghlan and
Catherine S. Greenhill},
title = {Hypergraph coloring up to condensation},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {615--652},
year = {2019},
url = {https://doi.org/10.1002/rsa.20824},
doi = {10.1002/RSA.20824},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AyreCG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AyyerL19,
author = {Arvind Ayyer and
Svante Linusson},
title = {Reverse juggling processes},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {56--72},
year = {2019},
url = {https://doi.org/10.1002/rsa.20825},
doi = {10.1002/RSA.20825},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AyyerL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaronK19,
author = {Jacob D. Baron and
Jeff Kahn},
title = {On the cycle space of a random graph},
journal = {Random Struct. Algorithms},
volume = {54},
number = {1},
pages = {39--68},
year = {2019},
url = {https://doi.org/10.1002/rsa.20785},
doi = {10.1002/RSA.20785},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaronK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BedenknechtHKM19,
author = {Wiebke Bedenknecht and
Jie Han and
Yoshiharu Kohayakawa and
Guilherme Oliveira Mota},
title = {Powers of tight Hamilton cycles in randomly perturbed hypergraphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {795--807},
year = {2019},
url = {https://doi.org/10.1002/rsa.20885},
doi = {10.1002/RSA.20885},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BedenknechtHKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BennettRS19,
author = {Huck Bennett and
Daniel Reichman and
Igor Shinkar},
title = {On percolation and -hardness},
journal = {Random Struct. Algorithms},
volume = {54},
number = {2},
pages = {228--257},
year = {2019},
url = {https://doi.org/10.1002/rsa.20772},
doi = {10.1002/RSA.20772},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BennettRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BermanMR19,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova},
title = {Testing convexity of figures under the uniform distribution},
journal = {Random Struct. Algorithms},
volume = {54},
number = {3},
pages = {413--443},
year = {2019},
url = {https://doi.org/10.1002/rsa.20797},
doi = {10.1002/RSA.20797},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BermanMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Bernshteyn19,
author = {Anton Bernshteyn},
title = {The Johansson-Molloy theorem for DP-coloring},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {653--664},
year = {2019},
url = {https://doi.org/10.1002/rsa.20811},
doi = {10.1002/RSA.20811},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Bernshteyn19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BetkenDO19,
author = {Carina Betken and
Hanna D{\"{o}}ring and
Marcel Ortgiese},
title = {Fluctuations in a general preferential attachment model via Stein's
method},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {808--830},
year = {2019},
url = {https://doi.org/10.1002/rsa.20852},
doi = {10.1002/RSA.20852},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BetkenDO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhattacharyaM19,
author = {Bhaswar B. Bhattacharya and
Sumit Mukherjee},
title = {Limit theorems for monochromatic stars},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {831--853},
year = {2019},
url = {https://doi.org/10.1002/rsa.20856},
doi = {10.1002/RSA.20856},
timestamp = {Tue, 05 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BhattacharyaM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BiskupL19,
author = {Marek Biskup and
Jeffrey Lin},
title = {Sharp asymptotic for the chemical distance in long-range percolation},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {560--583},
year = {2019},
url = {https://doi.org/10.1002/rsa.20849},
doi = {10.1002/RSA.20849},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BiskupL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BlaisY19,
author = {Eric Blais and
Yuichi Yoshida},
title = {A characterization of constant-sample testable properties},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {73--88},
year = {2019},
url = {https://doi.org/10.1002/rsa.20807},
doi = {10.1002/RSA.20807},
timestamp = {Wed, 03 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BlaisY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BlancaCSV19,
author = {Antonio Blanca and
Pietro Caputo and
Alistair Sinclair and
Eric Vigoda},
title = {Spatial mixing and nonlocal Markov chains},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {584--614},
year = {2019},
url = {https://doi.org/10.1002/rsa.20844},
doi = {10.1002/RSA.20844},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BlancaCSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BobrowskiO19,
author = {Omer Bobrowski and
Gon{\c{c}}alo Oliveira},
title = {Random {\v{C}}ech complexes on Riemannian manifolds},
journal = {Random Struct. Algorithms},
volume = {54},
number = {3},
pages = {373--412},
year = {2019},
url = {https://doi.org/10.1002/rsa.20800},
doi = {10.1002/RSA.20800},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BobrowskiO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BottcherHKMPP19,
author = {Julia B{\"{o}}ttcher and
Jie Han and
Yoshiharu Kohayakawa and
Richard Montgomery and
Olaf Parczyk and
Yury Person},
title = {Universality for bounded degree spanning trees in randomly perturbed
graphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {854--864},
year = {2019},
url = {https://doi.org/10.1002/rsa.20850},
doi = {10.1002/RSA.20850},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BottcherHKMPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BucicLS19,
author = {Matija Bucic and
Shoham Letzter and
Benny Sudakov},
title = {Monochromatic paths in random tournaments},
journal = {Random Struct. Algorithms},
volume = {54},
number = {1},
pages = {69--81},
year = {2019},
url = {https://doi.org/10.1002/rsa.20780},
doi = {10.1002/RSA.20780},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BucicLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CaravennaGH19,
author = {Francesco Caravenna and
Alessandro Garavaglia and
Remco van der Hofstad},
title = {Diameter in ultra-small scale-free random graphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {3},
pages = {444--498},
year = {2019},
url = {https://doi.org/10.1002/rsa.20798},
doi = {10.1002/RSA.20798},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CaravennaGH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Carrance19,
author = {Ariane Carrance},
title = {Uniform random colored complexes},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {615--648},
year = {2019},
url = {https://doi.org/10.1002/rsa.20845},
doi = {10.1002/RSA.20845},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Carrance19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperFP19,
author = {Colin Cooper and
Alan M. Frieze and
Wesley Pegden},
title = {Minors of a random binary matroid},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {865--880},
year = {2019},
url = {https://doi.org/10.1002/rsa.20881},
doi = {10.1002/RSA.20881},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CooperFP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CoulsonP19,
author = {Matthew Coulson and
Guillem Perarnau},
title = {Rainbow matchings in Dirac bipartite graphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {271--289},
year = {2019},
url = {https://doi.org/10.1002/rsa.20835},
doi = {10.1002/RSA.20835},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CoulsonP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CzumajMOS19,
author = {Artur Czumaj and
Morteza Monemizadeh and
Krzysztof Onak and
Christian Sohler},
title = {Planar graphs: Random walks and bipartiteness testing},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {104--124},
year = {2019},
url = {https://doi.org/10.1002/rsa.20826},
doi = {10.1002/RSA.20826},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CzumajMOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DevroyeDFMMR19,
author = {Luc Devroye and
Vida Dujmovic and
Alan M. Frieze and
Abbas Mehrabian and
Pat Morin and
Bruce A. Reed},
title = {Notes on growing a tree in a graph},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {290--312},
year = {2019},
url = {https://doi.org/10.1002/rsa.20828},
doi = {10.1002/RSA.20828},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DevroyeDFMMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrmotaJS19,
author = {Michael Drmota and
Emma Yu Jin and
Benedikt Stufler},
title = {Graph limits of random graphs from a subset of connected k-trees},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {125--152},
year = {2019},
url = {https://doi.org/10.1002/rsa.20802},
doi = {10.1002/RSA.20802},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DrmotaJS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EinarssonLMPS19,
author = {Hafsteinn Einarsson and
Johannes Lengler and
Frank Mousset and
Konstantinos Panagiotou and
Angelika Steger},
title = {Bootstrap percolation with inhibition},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {881--925},
year = {2019},
url = {https://doi.org/10.1002/rsa.20854},
doi = {10.1002/RSA.20854},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EinarssonLMPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EzraL19,
author = {Esther Ezra and
Shachar Lovett},
title = {On the Beck-Fiala conjecture for random set systems},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {665--675},
year = {2019},
url = {https://doi.org/10.1002/rsa.20810},
doi = {10.1002/RSA.20810},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EzraL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FaberH19,
author = {Vance Faber and
David G. Harris},
title = {Edge-coloring linear hypergraphs with medium-sized edges},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {153--159},
year = {2019},
url = {https://doi.org/10.1002/rsa.20843},
doi = {10.1002/RSA.20843},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FaberH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Falgas-RavryOU19,
author = {Victor Falgas{-}Ravry and
Kelly O'Connell and
Andrew J. Uzzell},
title = {Multicolor containers, extremal entropy, and counting},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {676--720},
year = {2019},
url = {https://doi.org/10.1002/rsa.20777},
doi = {10.1002/RSA.20777},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Falgas-RavryOU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberL19,
author = {Asaf Ferber and
Eoin Long},
title = {Packing and counting arbitrary Hamilton cycles in random digraphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {3},
pages = {499--514},
year = {2019},
url = {https://doi.org/10.1002/rsa.20796},
doi = {10.1002/RSA.20796},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberMV19,
author = {Asaf Ferber and
Daniel Montealegre and
Van Vu},
title = {Law of the iterated logarithm for random graphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {1},
pages = {3--38},
year = {2019},
url = {https://doi.org/10.1002/rsa.20784},
doi = {10.1002/RSA.20784},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberMV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeJ19,
author = {Alan M. Frieze and
Tony Johansson},
title = {On the insertion time of random walk cuckoo hashing},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {721--729},
year = {2019},
url = {https://doi.org/10.1002/rsa.20808},
doi = {10.1002/RSA.20808},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriezeJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeP19,
author = {Alan M. Frieze and
Wesley Pegden},
title = {Traveling in randomly embedded random graphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {649--676},
year = {2019},
url = {https://doi.org/10.1002/rsa.20832},
doi = {10.1002/RSA.20832},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriezeP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezePPR19,
author = {Alan M. Frieze and
Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
Pawel Pralat and
Benjamin Reiniger},
title = {Perfect matchings and Hamiltonian cycles in the preferential attachment
model},
journal = {Random Struct. Algorithms},
volume = {54},
number = {2},
pages = {258--288},
year = {2019},
url = {https://doi.org/10.1002/rsa.20778},
doi = {10.1002/RSA.20778},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriezePPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GalanisSV19,
author = {Andreas Galanis and
Daniel Stefankovic and
Eric Vigoda},
title = {Swendsen-Wang algorithm on the mean-field Potts model},
journal = {Random Struct. Algorithms},
volume = {54},
number = {1},
pages = {82--147},
year = {2019},
url = {https://doi.org/10.1002/rsa.20768},
doi = {10.1002/RSA.20768},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GalanisSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GangulyM19,
author = {Shirshendu Ganguly and
Fabio Martinelli},
title = {Upper triangular matrix walk: Cutoff for finitely many columns},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {313--341},
year = {2019},
url = {https://doi.org/10.1002/rsa.20838},
doi = {10.1002/RSA.20838},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GangulyM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GnedinG19,
author = {Alexander V. Gnedin and
Vadim Gorin},
title = {Spherically symmetric random permutations},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {342--355},
year = {2019},
url = {https://doi.org/10.1002/rsa.20847},
doi = {10.1002/RSA.20847},
timestamp = {Thu, 06 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GnedinG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GraafBHO19,
author = {Maurits de Graaf and
Richard J. Boucherie and
Johann L. Hurink and
Jan{-}Kees C. W. van Ommeren},
title = {An average case analysis of the minimum spanning tree heuristic for
the power assignment problem},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {89--103},
year = {2019},
url = {https://doi.org/10.1002/rsa.20831},
doi = {10.1002/RSA.20831},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GraafBHO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaggstromH19,
author = {Olle H{\"{a}}ggstr{\"{o}}m and
Timo Hirscher},
title = {Water transport on infinite graphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {3},
pages = {515--527},
year = {2019},
url = {https://doi.org/10.1002/rsa.20801},
doi = {10.1002/RSA.20801},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HaggstromH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HarshaS19,
author = {Prahladh Harsha and
Srikanth Srinivasan},
title = {On polynomial approximations to {AC}},
journal = {Random Struct. Algorithms},
volume = {54},
number = {2},
pages = {289--303},
year = {2019},
url = {https://doi.org/10.1002/rsa.20786},
doi = {10.1002/RSA.20786},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HarshaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HermonSZ19,
author = {Jonathan Hermon and
Allan Sly and
Yumeng Zhang},
title = {Rapid mixing of hypergraph independent sets},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {730--767},
year = {2019},
url = {https://doi.org/10.1002/rsa.20830},
doi = {10.1002/RSA.20830},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HermonSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HofstadJL19,
author = {Remco van der Hofstad and
Svante Janson and
Malwina J. Luczak},
title = {Component structure of the configuration model: Barely supercritical
case},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {3--55},
year = {2019},
url = {https://doi.org/10.1002/rsa.20837},
doi = {10.1002/RSA.20837},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HofstadJL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Huber19,
author = {Mark Huber},
title = {An optimal ({\unicode{1013}}, {\(\delta\)})-randomized approximation
scheme for the mean of random variables with bounded relative variance},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {356--370},
year = {2019},
url = {https://doi.org/10.1002/rsa.20839},
doi = {10.1002/RSA.20839},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Huber19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson19,
author = {Svante Janson},
title = {Patterns in random permutations avoiding the pattern 321},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {249--270},
year = {2019},
url = {https://doi.org/10.1002/rsa.20806},
doi = {10.1002/RSA.20806},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KohayakawaRR19,
author = {Yoshiharu Kohayakawa and
Troy Retter and
Vojtech R{\"{o}}dl},
title = {The size Ramsey number of short subdivisions of bounded degree graphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {2},
pages = {304--339},
year = {2019},
url = {https://doi.org/10.1002/rsa.20783},
doi = {10.1002/RSA.20783},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/KohayakawaRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KuschRSS19,
author = {Christopher Kusch and
Juanjo Ru{\'{e}} and
Christoph Spiegel and
Tibor Szab{\'{o}}},
title = {On the optimality of the uniform random strategy},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {371--401},
year = {2019},
url = {https://doi.org/10.1002/rsa.20829},
doi = {10.1002/RSA.20829},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KuschRSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KwasnyP19,
author = {Jakub Kwasny and
Jakub Przybylo},
title = {Asymptotically optimal bound on the adjacent vertex distinguishing
edge choice number},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {768--778},
year = {2019},
url = {https://doi.org/10.1002/rsa.20813},
doi = {10.1002/RSA.20813},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KwasnyP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Leckey19,
author = {Kevin Leckey},
title = {On densities for solutions to stochastic fixed point equations},
journal = {Random Struct. Algorithms},
volume = {54},
number = {3},
pages = {528--558},
year = {2019},
url = {https://doi.org/10.1002/rsa.20799},
doi = {10.1002/RSA.20799},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Leckey19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LimaRV19,
author = {Bernardo N. B. de Lima and
Leonardo T. Rolla and
Daniel Valesin},
title = {Monotonicity and phase diagram for multirange percolation on oriented
trees},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {160--172},
year = {2019},
url = {https://doi.org/10.1002/rsa.20805},
doi = {10.1002/RSA.20805},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LimaRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LinialP19,
author = {Nati Linial and
Yuval Peled},
title = {Enumeration and randomized constructions of hypertrees},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {677--695},
year = {2019},
url = {https://doi.org/10.1002/rsa.20841},
doi = {10.1002/RSA.20841},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LinialP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LuczakMS19,
author = {Tomasz Luczak and
Abram Magner and
Wojciech Szpankowski},
title = {Asymmetry and structural information in preferential attachment graphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {696--718},
year = {2019},
url = {https://doi.org/10.1002/rsa.20842},
doi = {10.1002/RSA.20842},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LuczakMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LuriaS19,
author = {Zur Luria and
Michael Simkin},
title = {On the threshold problem for Latin boxes},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {926--949},
year = {2019},
url = {https://doi.org/10.1002/rsa.20855},
doi = {10.1002/RSA.20855},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LuriaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MarckertW19,
author = {Jean{-}Fran{\c{c}}ois Marckert and
Minmin Wang},
title = {A new combinatorial representation of the additive coalescent},
journal = {Random Struct. Algorithms},
volume = {54},
number = {2},
pages = {340--370},
year = {2019},
url = {https://doi.org/10.1002/rsa.20775},
doi = {10.1002/RSA.20775},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MarckertW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Martinsson19,
author = {Anders Martinsson},
title = {Most edge-orderings of Kn have maximal altitude},
journal = {Random Struct. Algorithms},
volume = {54},
number = {3},
pages = {559--585},
year = {2019},
url = {https://doi.org/10.1002/rsa.20803},
doi = {10.1002/RSA.20803},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Martinsson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmidMP19,
author = {Colin McDiarmid and
Dieter Mitsche and
Pawel Pralat},
title = {Clique coloring of binomial random graphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {589--614},
year = {2019},
url = {https://doi.org/10.1002/rsa.20804},
doi = {10.1002/RSA.20804},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmidMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmidY19,
author = {Colin McDiarmid and
Nikola Yolov},
title = {Random perfect graphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {1},
pages = {148--186},
year = {2019},
url = {https://doi.org/10.1002/rsa.20770},
doi = {10.1002/RSA.20770},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmidY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MerouehT19,
author = {Ar{\`{e}}s M{\'{e}}roueh and
Andrew Thomason},
title = {List colorings of multipartite hypergraphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {950--979},
year = {2019},
url = {https://doi.org/10.1002/rsa.20848},
doi = {10.1002/RSA.20848},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MerouehT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Montgomery19,
author = {Richard Montgomery},
title = {Fractional clique decompositions of dense graphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {779--796},
year = {2019},
url = {https://doi.org/10.1002/rsa.20809},
doi = {10.1002/RSA.20809},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Montgomery19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NenadovS19,
author = {Rajko Nenadov and
Nemanja Skoric},
title = {Powers of Hamilton cycles in random graphs and tight Hamilton cycles
in random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {1},
pages = {187--208},
year = {2019},
url = {https://doi.org/10.1002/rsa.20782},
doi = {10.1002/RSA.20782},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NenadovS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NenadovST19,
author = {Rajko Nenadov and
Angelika Steger and
Milos Trujic},
title = {Resilience of perfect matchings and Hamiltonicity in random graph
processes},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {797--819},
year = {2019},
url = {https://doi.org/10.1002/rsa.20827},
doi = {10.1002/RSA.20827},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NenadovST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NewmanRRS19,
author = {Ilan Newman and
Yuri Rabinovich and
Deepak Rajendraprasad and
Christian Sohler},
title = {Testing for forbidden order patterns in an array},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {402--426},
year = {2019},
url = {https://doi.org/10.1002/rsa.20840},
doi = {10.1002/RSA.20840},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/NewmanRRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Panafieu19,
author = {Elie de Panafieu},
title = {Analytic combinatorics of connected graphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {427--495},
year = {2019},
url = {https://doi.org/10.1002/rsa.20836},
doi = {10.1002/RSA.20836},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Panafieu19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pourmiri19,
author = {Ali Pourmiri},
title = {Balanced allocation on graphs: {A} random walk approach},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {980--1009},
year = {2019},
url = {https://doi.org/10.1002/rsa.20875},
doi = {10.1002/RSA.20875},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Pourmiri19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PralatW19,
author = {Pawel Pralat and
Nicholas C. Wormald},
title = {Meyniel's conjecture holds for random d-regular graphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {719--741},
year = {2019},
url = {https://doi.org/10.1002/rsa.20874},
doi = {10.1002/RSA.20874},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PralatW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SileikisW19,
author = {Matas Sileikis and
Lutz Warnke},
title = {A counterexample to the DeMarco-Kahn upper tail conjecture},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {775--794},
year = {2019},
url = {https://doi.org/10.1002/rsa.20859},
doi = {10.1002/RSA.20859},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SileikisW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/StefanssonS19,
author = {Sigurdur {\"{O}}rn Stef{\'{a}}nsson and
Benedikt Stufler},
title = {Geometry of large Boltzmann outerplanar maps},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {742--771},
year = {2019},
url = {https://doi.org/10.1002/rsa.20834},
doi = {10.1002/RSA.20834},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/StefanssonS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Stufler19,
author = {Benedikt Stufler},
title = {The continuum random tree is the scaling limit of unlabeled unrooted
trees},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {496--528},
year = {2019},
url = {https://doi.org/10.1002/rsa.20833},
doi = {10.1002/RSA.20833},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Stufler19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Tafula19,
author = {Christian T{\'{a}}fula},
title = {An extension of the Erd{\H{o}}s-Tetali theorem},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {173--214},
year = {2019},
url = {https://doi.org/10.1002/rsa.20812},
doi = {10.1002/RSA.20812},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Tafula19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X19,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {54},
number = {1},
pages = {1--2},
year = {2019},
url = {https://doi.org/10.1002/rsa.20787},
doi = {10.1002/RSA.20787},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/X19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X19a,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {54},
number = {2},
pages = {209--210},
year = {2019},
url = {https://doi.org/10.1002/rsa.20788},
doi = {10.1002/RSA.20788},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/X19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X19b,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {54},
number = {3},
pages = {371--372},
year = {2019},
url = {https://doi.org/10.1002/rsa.20789},
doi = {10.1002/RSA.20789},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/X19b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X19c,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {587--588},
year = {2019},
url = {https://doi.org/10.1002/rsa.20790},
doi = {10.1002/RSA.20790},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X19c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X19d,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {1--2},
year = {2019},
url = {https://doi.org/10.1002/rsa.20791},
doi = {10.1002/RSA.20791},
timestamp = {Wed, 03 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X19d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X19e,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {247--248},
year = {2019},
url = {https://doi.org/10.1002/rsa.20792},
doi = {10.1002/RSA.20792},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X19e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X19f,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {529--530},
year = {2019},
url = {https://doi.org/10.1002/rsa.20793},
doi = {10.1002/RSA.20793},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X19f.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X19g,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {773--774},
year = {2019},
url = {https://doi.org/10.1002/rsa.20794},
doi = {10.1002/RSA.20794},
timestamp = {Tue, 05 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/X19g.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Zocca19,
author = {Alessandro Zocca},
title = {Tunneling of the hard-core model on finite triangular lattices},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {215--246},
year = {2019},
url = {https://doi.org/10.1002/rsa.20795},
doi = {10.1002/RSA.20795},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Zocca19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AbdullahF18,
author = {Mohammed Amin Abdullah and
Nikolaos Fountoulakis},
title = {A phase transition in the evolution of bootstrap percolation processes
on preferential attachment graphs},
journal = {Random Struct. Algorithms},
volume = {52},
number = {3},
pages = {379--418},
year = {2018},
url = {https://doi.org/10.1002/rsa.20744},
doi = {10.1002/RSA.20744},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AbdullahF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Addario-BerryE18,
author = {Louigi Addario{-}Berry and
Laura Eslava},
title = {High degrees in random recursive trees},
journal = {Random Struct. Algorithms},
volume = {52},
number = {4},
pages = {560--575},
year = {2018},
url = {https://doi.org/10.1002/rsa.20753},
doi = {10.1002/RSA.20753},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Addario-BerryE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ArlottoWX18,
author = {Alessandro Arlotto and
Yehua Wei and
Xinchang Xie},
title = {An adaptive \emph{O}(log \emph{n})-optimal policy for the online selection
of a monotone subsequence from a random sample},
journal = {Random Struct. Algorithms},
volume = {52},
number = {1},
pages = {41--53},
year = {2018},
url = {https://doi.org/10.1002/rsa.20728},
doi = {10.1002/RSA.20728},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ArlottoWX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AvinKL18,
author = {Chen Avin and
Michal Kouck{\'{y}} and
Zvi Lotker},
title = {Cover time and mixing time of random walks on dynamic graphs},
journal = {Random Struct. Algorithms},
volume = {52},
number = {4},
pages = {576--596},
year = {2018},
url = {https://doi.org/10.1002/rsa.20752},
doi = {10.1002/RSA.20752},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AvinKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BackhauszS18,
author = {{\'{A}}gnes Backhausz and
Bal{\'{a}}zs Szegedy},
title = {On large-girth regular graphs and random processes on trees},
journal = {Random Struct. Algorithms},
volume = {53},
number = {3},
pages = {389--416},
year = {2018},
url = {https://doi.org/10.1002/rsa.20769},
doi = {10.1002/RSA.20769},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BackhauszS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalisterBLN18,
author = {Paul Balister and
B{\'{e}}la Bollob{\'{a}}s and
Jonathan Lee and
Bhargav P. Narayanan},
title = {Line percolation},
journal = {Random Struct. Algorithms},
volume = {52},
number = {4},
pages = {597--616},
year = {2018},
url = {https://doi.org/10.1002/rsa.20755},
doi = {10.1002/RSA.20755},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BalisterBLN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarreLM18,
author = {J. Barr{\'{e}} and
Marc Lelarge and
Dieter Mitsche},
title = {On rigidity, orientability, and cores of random graphs with sliders},
journal = {Random Struct. Algorithms},
volume = {52},
number = {3},
pages = {419--453},
year = {2018},
url = {https://doi.org/10.1002/rsa.20749},
doi = {10.1002/RSA.20749},
timestamp = {Mon, 14 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarreLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BergB18,
author = {Jacob van den Berg and
Stein Andreas Bethuelsen},
title = {Stochastic domination in space-time for the contact process},
journal = {Random Struct. Algorithms},
volume = {53},
number = {2},
pages = {221--237},
year = {2018},
url = {https://doi.org/10.1002/rsa.20766},
doi = {10.1002/RSA.20766},
timestamp = {Wed, 15 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BergB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasR18,
author = {B{\'{e}}la Bollob{\'{a}}s and
Oliver Riordan},
title = {Counting dense connected hypergraphs via the probabilistic method},
journal = {Random Struct. Algorithms},
volume = {53},
number = {2},
pages = {185--220},
year = {2018},
url = {https://doi.org/10.1002/rsa.20762},
doi = {10.1002/RSA.20762},
timestamp = {Wed, 15 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasR18.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/rsa/CaraceniC18,
author = {Alessandra Caraceni and
Nicolas Curien},
title = {Geometry of the uniform infinite half-planar quadrangulation},
journal = {Random Struct. Algorithms},
volume = {52},
number = {3},
pages = {454--494},
year = {2018},
url = {https://doi.org/10.1002/rsa.20746},
doi = {10.1002/RSA.20746},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CaraceniC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Casselgren18,
author = {Carl Johan Casselgren},
title = {Coloring graphs of various maximum degree from random lists},
journal = {Random Struct. Algorithms},
volume = {52},
number = {1},
pages = {54--73},
year = {2018},
url = {https://doi.org/10.1002/rsa.20725},
doi = {10.1002/RSA.20725},
timestamp = {Fri, 01 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Casselgren18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooleyKK18,
author = {Oliver Cooley and
Mihyun Kang and
Christoph Koch},
title = {The size of the giant high-order component in random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {53},
number = {2},
pages = {238--288},
year = {2018},
url = {https://doi.org/10.1002/rsa.20761},
doi = {10.1002/RSA.20761},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooleyKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperMRRS18,
author = {Colin Cooper and
Andrew McDowell and
Tomasz Radzik and
Nicolas Rivera and
Takeharu Shiraga},
title = {Dispersion processes},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {561--585},
year = {2018},
url = {https://doi.org/10.1002/rsa.20822},
doi = {10.1002/RSA.20822},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CooperMRRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CraneDE18,
author = {Harry Crane and
Stephen Desalvo and
Sergi Elizalde},
title = {The probability of avoiding consecutive patterns in the Mallows distribution},
journal = {Random Struct. Algorithms},
volume = {53},
number = {3},
pages = {417--447},
year = {2018},
url = {https://doi.org/10.1002/rsa.20776},
doi = {10.1002/RSA.20776},
timestamp = {Mon, 17 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CraneDE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DaviesJPR18,
author = {Ewan Davies and
Matthew Jenssen and
Will Perkins and
Barnaby Roberts},
title = {Extremes of the internal energy of the Potts model on cubic graphs},
journal = {Random Struct. Algorithms},
volume = {53},
number = {1},
pages = {59--75},
year = {2018},
url = {https://doi.org/10.1002/rsa.20767},
doi = {10.1002/RSA.20767},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DaviesJPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EldanS18,
author = {Ronen Eldan and
Mohit Singh},
title = {Efficient algorithms for discrepancy minimization in convex sets},
journal = {Random Struct. Algorithms},
volume = {53},
number = {2},
pages = {289--307},
year = {2018},
url = {https://doi.org/10.1002/rsa.20763},
doi = {10.1002/RSA.20763},
timestamp = {Wed, 15 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EldanS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberKS18,
author = {Asaf Ferber and
Matthew Kwan and
Benny Sudakov},
title = {Counting Hamilton cycles in sparse random directed graphs},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {592--603},
year = {2018},
url = {https://doi.org/10.1002/rsa.20815},
doi = {10.1002/RSA.20815},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberN18,
author = {Asaf Ferber and
Rajko Nenadov},
title = {Spanning universality in random graphs},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {604--637},
year = {2018},
url = {https://doi.org/10.1002/rsa.20816},
doi = {10.1002/RSA.20816},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberV18,
author = {Asaf Ferber and
Van Vu},
title = {Packing perfect matchings in random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {52},
number = {3},
pages = {367--378},
year = {2018},
url = {https://doi.org/10.1002/rsa.20745},
doi = {10.1002/RSA.20745},
timestamp = {Mon, 14 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FraimanM18,
author = {Nicolas Fraiman and
Dieter Mitsche},
title = {The diameter of inhomogeneous random graphs},
journal = {Random Struct. Algorithms},
volume = {53},
number = {2},
pages = {308--326},
year = {2018},
url = {https://doi.org/10.1002/rsa.20781},
doi = {10.1002/RSA.20781},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FraimanM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeP18,
author = {Alan M. Frieze and
Wesley Pegden},
title = {Online purchasing under uncertainty},
journal = {Random Struct. Algorithms},
volume = {53},
number = {2},
pages = {327--351},
year = {2018},
url = {https://doi.org/10.1002/rsa.20764},
doi = {10.1002/RSA.20764},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FriezeP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeP18a,
author = {Alan M. Frieze and
Wesley Pegden},
title = {A note on dispersing particles on a line},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {586--591},
year = {2018},
url = {https://doi.org/10.1002/rsa.20821},
doi = {10.1002/RSA.20821},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriezeP18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GamarnikL18,
author = {David Gamarnik and
Quan Li},
title = {On the max-cut of sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {52},
number = {2},
pages = {219--262},
year = {2018},
url = {https://doi.org/10.1002/rsa.20738},
doi = {10.1002/RSA.20738},
timestamp = {Mon, 22 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GamarnikL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GaoM18,
author = {Pu Gao and
Michael Molloy},
title = {Inside the clustering window for random linear equations},
journal = {Random Struct. Algorithms},
volume = {52},
number = {2},
pages = {197--218},
year = {2018},
url = {https://doi.org/10.1002/rsa.20740},
doi = {10.1002/RSA.20740},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/GaoM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GaoM18a,
author = {Pu Gao and
Michael Molloy},
title = {The stripping process can be slow: Part {I}},
journal = {Random Struct. Algorithms},
volume = {53},
number = {1},
pages = {76--139},
year = {2018},
url = {https://doi.org/10.1002/rsa.20760},
doi = {10.1002/RSA.20760},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/GaoM18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GaoPS18,
author = {Pu Gao and
Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
Cristiane M. Sato},
title = {Arboricity and spanning-tree packing in random graphs},
journal = {Random Struct. Algorithms},
volume = {52},
number = {3},
pages = {495--535},
year = {2018},
url = {https://doi.org/10.1002/rsa.20743},
doi = {10.1002/RSA.20743},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GaoPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GarbeMM18,
author = {Frederik Garbe and
Richard Mycroft and
Andrew McDowell},
title = {Contagious sets in a degree-proportional bootstrap percolation process},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {638--651},
year = {2018},
url = {https://doi.org/10.1002/rsa.20818},
doi = {10.1002/RSA.20818},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GarbeMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GishbolinerKK18,
author = {Lior Gishboliner and
Michael Krivelevich and
Gal Kronenberg},
title = {On {MAXCUT} in strictly supercritical random graphs, and coloring
of random graphs and random tournaments},
journal = {Random Struct. Algorithms},
volume = {52},
number = {4},
pages = {545--559},
year = {2018},
url = {https://doi.org/10.1002/rsa.20751},
doi = {10.1002/RSA.20751},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GishbolinerKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HarrisS18,
author = {David G. Harris and
Aravind Srinivasan},
title = {Improved bounds and algorithms for graph cuts and network reliability},
journal = {Random Struct. Algorithms},
volume = {52},
number = {1},
pages = {74--135},
year = {2018},
url = {https://doi.org/10.1002/rsa.20724},
doi = {10.1002/RSA.20724},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HarrisS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Heckel18,
author = {Annika Heckel},
title = {The chromatic number of dense random graphs},
journal = {Random Struct. Algorithms},
volume = {53},
number = {1},
pages = {140--182},
year = {2018},
url = {https://doi.org/10.1002/rsa.20757},
doi = {10.1002/RSA.20757},
timestamp = {Fri, 13 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Heckel18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HitczenkoL18,
author = {Pawel Hitczenko and
Amanda Lohss},
title = {Probabilistic consequences of some polynomial recurrences},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {652--666},
year = {2018},
url = {https://doi.org/10.1002/rsa.20820},
doi = {10.1002/RSA.20820},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HitczenkoL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HussLS18,
author = {Wilfried Huss and
Lionel Levine and
Ecaterina Sava{-}Huss},
title = {Interpolating between random walk and rotor walk},
journal = {Random Struct. Algorithms},
volume = {52},
number = {2},
pages = {263--282},
year = {2018},
url = {https://doi.org/10.1002/rsa.20747},
doi = {10.1002/RSA.20747},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HussLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/IsaevM18,
author = {Mikhail Isaev and
Brendan D. McKay},
title = {Complex martingales and asymptotic enumeration},
journal = {Random Struct. Algorithms},
volume = {52},
number = {4},
pages = {617--661},
year = {2018},
url = {https://doi.org/10.1002/rsa.20754},
doi = {10.1002/RSA.20754},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/IsaevM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Iyer18,
author = {Srikanth K. Iyer},
title = {The random connection model: Connectivity, edge lengths, and degree
distributions},
journal = {Random Struct. Algorithms},
volume = {52},
number = {2},
pages = {283--300},
year = {2018},
url = {https://doi.org/10.1002/rsa.20741},
doi = {10.1002/RSA.20741},
timestamp = {Thu, 01 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Iyer18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JogL18,
author = {Varun S. Jog and
Po{-}Ling Loh},
title = {Persistence of centrality in random growing trees},
journal = {Random Struct. Algorithms},
volume = {52},
number = {1},
pages = {136--157},
year = {2018},
url = {https://doi.org/10.1002/rsa.20726},
doi = {10.1002/RSA.20726},
timestamp = {Thu, 11 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/JogL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KimLN18,
author = {Jeong Han Kim and
Sang June Lee and
Joohan Na},
title = {On the total variation distance between the binomial random graph
and the random intersection graph},
journal = {Random Struct. Algorithms},
volume = {52},
number = {4},
pages = {662--679},
year = {2018},
url = {https://doi.org/10.1002/rsa.20750},
doi = {10.1002/RSA.20750},
timestamp = {Thu, 21 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KimLN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KorandiMNSS18,
author = {D{\'{a}}niel Kor{\'{a}}ndi and
Frank Mousset and
Rajko Nenadov and
Nemanja Skoric and
Benny Sudakov},
title = {Monochromatic cycle covers in random graphs},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {667--691},
year = {2018},
url = {https://doi.org/10.1002/rsa.20819},
doi = {10.1002/RSA.20819},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KorandiMNSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichKLS18,
author = {Michael Krivelevich and
Matthew Kwan and
Po{-}Shen Loh and
Benny Sudakov},
title = {The random k-matching-free process},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {692--716},
year = {2018},
url = {https://doi.org/10.1002/rsa.20814},
doi = {10.1002/RSA.20814},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichKLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KwanS18,
author = {Matthew Kwan and
Benny Sudakov},
title = {Intercalates and discrepancy in random Latin squares},
journal = {Random Struct. Algorithms},
volume = {52},
number = {2},
pages = {181--196},
year = {2018},
url = {https://doi.org/10.1002/rsa.20742},
doi = {10.1002/RSA.20742},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KwanS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Marzouk18,
author = {Cyril Marzouk},
title = {Scaling limits of random bipartite planar maps with a prescribed degree
sequence},
journal = {Random Struct. Algorithms},
volume = {53},
number = {3},
pages = {448--503},
year = {2018},
url = {https://doi.org/10.1002/rsa.20773},
doi = {10.1002/RSA.20773},
timestamp = {Mon, 17 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Marzouk18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MoshkovitzS18,
author = {Guy Moshkovitz and
Asaf Shapira},
title = {Decomposing a graph into expanding subgraphs},
journal = {Random Struct. Algorithms},
volume = {52},
number = {1},
pages = {158--178},
year = {2018},
url = {https://doi.org/10.1002/rsa.20727},
doi = {10.1002/RSA.20727},
timestamp = {Fri, 01 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MoshkovitzS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MullerN18,
author = {Tobias M{\"{u}}ller and
Marc Noy},
title = {The first order convergence law fails for random perfect graphs},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {717--727},
year = {2018},
url = {https://doi.org/10.1002/rsa.20823},
doi = {10.1002/RSA.20823},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MullerN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MycroftN18,
author = {Richard Mycroft and
T{\'{a}}ssio Naia},
title = {Unavoidable trees in tournaments},
journal = {Random Struct. Algorithms},
volume = {53},
number = {2},
pages = {352--385},
year = {2018},
url = {https://doi.org/10.1002/rsa.20765},
doi = {10.1002/RSA.20765},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MycroftN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NagleRS18,
author = {Brendan Nagle and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {An algorithmic hypergraph regularity lemma},
journal = {Random Struct. Algorithms},
volume = {52},
number = {2},
pages = {301--353},
year = {2018},
url = {https://doi.org/10.1002/rsa.20739},
doi = {10.1002/RSA.20739},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NagleRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Panchenko18,
author = {Dmitry Panchenko},
title = {On the K-sat model with large number of clauses},
journal = {Random Struct. Algorithms},
volume = {52},
number = {3},
pages = {536--542},
year = {2018},
url = {https://doi.org/10.1002/rsa.20748},
doi = {10.1002/RSA.20748},
timestamp = {Mon, 14 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Panchenko18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pittel18,
author = {Boris G. Pittel},
title = {Counting strongly connected (k1, k2)-directed cores},
journal = {Random Struct. Algorithms},
volume = {53},
number = {1},
pages = {3--14},
year = {2018},
url = {https://doi.org/10.1002/rsa.20759},
doi = {10.1002/RSA.20759},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pittel18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SahaS18,
author = {Barna Saha and
Aravind Srinivasan},
title = {A new approximation technique for resource-allocation problems},
journal = {Random Struct. Algorithms},
volume = {52},
number = {4},
pages = {680--715},
year = {2018},
url = {https://doi.org/10.1002/rsa.20756},
doi = {10.1002/RSA.20756},
timestamp = {Thu, 21 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SahaS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SchachtS18,
author = {Mathias Schacht and
Fabian Schulenburg},
title = {Sharp thresholds for Ramsey properties of strictly balanced nearly
bipartite graphs},
journal = {Random Struct. Algorithms},
volume = {52},
number = {1},
pages = {3--40},
year = {2018},
url = {https://doi.org/10.1002/rsa.20723},
doi = {10.1002/RSA.20723},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SchachtS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Sen18,
author = {Subhabrata Sen},
title = {Optimization on sparse random hypergraphs and spin glasses},
journal = {Random Struct. Algorithms},
volume = {53},
number = {3},
pages = {504--536},
year = {2018},
url = {https://doi.org/10.1002/rsa.20774},
doi = {10.1002/RSA.20774},
timestamp = {Mon, 17 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Sen18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SkoricST18,
author = {Nemanja Skoric and
Angelika Steger and
Milos Trujic},
title = {Local resilience of an almost spanning k-cycle in random graphs},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {728--751},
year = {2018},
url = {https://doi.org/10.1002/rsa.20817},
doi = {10.1002/RSA.20817},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SkoricST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Stufler18,
author = {Benedikt Stufler},
title = {Gibbs partitions: The convergent case},
journal = {Random Struct. Algorithms},
volume = {53},
number = {3},
pages = {537--558},
year = {2018},
url = {https://doi.org/10.1002/rsa.20771},
doi = {10.1002/RSA.20771},
timestamp = {Mon, 17 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Stufler18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Vitanyi18,
author = {Paul M. B. Vit{\'{a}}nyi},
title = {On the average-case complexity of Shellsort},
journal = {Random Struct. Algorithms},
volume = {52},
number = {2},
pages = {354--363},
year = {2018},
url = {https://doi.org/10.1002/rsa.20737},
doi = {10.1002/RSA.20737},
timestamp = {Thu, 01 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Vitanyi18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X18,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {52},
number = {3},
pages = {365--366},
year = {2018},
url = {https://doi.org/10.1002/rsa.20731},
doi = {10.1002/RSA.20731},
timestamp = {Mon, 14 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X18a,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {52},
number = {4},
pages = {543--544},
year = {2018},
url = {https://doi.org/10.1002/rsa.20732},
doi = {10.1002/RSA.20732},
timestamp = {Thu, 21 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X18b,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {53},
number = {1},
pages = {1--2},
year = {2018},
url = {https://doi.org/10.1002/rsa.20733},
doi = {10.1002/RSA.20733},
timestamp = {Fri, 13 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X18b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X18c,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {53},
number = {2},
pages = {183--184},
year = {2018},
url = {https://doi.org/10.1002/rsa.20734},
doi = {10.1002/RSA.20734},
timestamp = {Wed, 15 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X18c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X18d,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {53},
number = {3},
pages = {387--388},
year = {2018},
url = {https://doi.org/10.1002/rsa.20735},
doi = {10.1002/RSA.20735},
timestamp = {Mon, 17 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/X18d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/X18e,
title = {Issue information},
journal = {Random Struct. Algorithms},
volume = {53},
number = {4},
pages = {559--560},
year = {2018},
url = {https://doi.org/10.1002/rsa.20736},
doi = {10.1002/RSA.20736},
timestamp = {Fri, 16 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/X18e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AllenBGKM17,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Simon Griffiths and
Yoshiharu Kohayakawa and
Robert Morris},
title = {Chromatic thresholds in dense random graphs},
journal = {Random Struct. Algorithms},
volume = {51},
number = {2},
pages = {185--214},
year = {2017},
url = {https://doi.org/10.1002/rsa.20708},
doi = {10.1002/RSA.20708},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AllenBGKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AllenBGKM17a,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Simon Griffiths and
Yoshiharu Kohayakawa and
Robert Morris},
title = {Chromatic thresholds in sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {51},
number = {2},
pages = {215--236},
year = {2017},
url = {https://doi.org/10.1002/rsa.20709},
doi = {10.1002/RSA.20709},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AllenBGKM17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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/BalBPP17,
author = {Deepak Bal and
Patrick Bennett and
Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
Pawel Pralat},
title = {Rainbow perfect matchings and Hamilton cycles in the random geometric
graph},
journal = {Random Struct. Algorithms},
volume = {51},
number = {4},
pages = {587--606},
year = {2017},
url = {https://doi.org/10.1002/rsa.20717},
doi = {10.1002/RSA.20717},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BalBPP17.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/Berzunza17,
author = {Gabriel Berzunza Ojeda},
title = {The cut-tree of large trees with small heights},
journal = {Random Struct. Algorithms},
volume = {51},
number = {3},
pages = {404--427},
year = {2017},
url = {https://doi.org/10.1002/rsa.20711},
doi = {10.1002/RSA.20711},
timestamp = {Fri, 06 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Berzunza17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BobrowskiW17,
author = {Omer Bobrowski and
Shmuel Weinberger},
title = {On the vanishing of homology in random {\v{C}}ech complexes},
journal = {Random Struct. Algorithms},
volume = {51},
number = {1},
pages = {14--51},
year = {2017},
url = {https://doi.org/10.1002/rsa.20697},
doi = {10.1002/RSA.20697},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BobrowskiW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasJS17,
author = {B{\'{e}}la Bollob{\'{a}}s and
Svante Janson and
Alex Scott},
title = {Packing random graphs and hypergraphs},
journal = {Random Struct. Algorithms},
volume = {51},
number = {1},
pages = {3--13},
year = {2017},
url = {https://doi.org/10.1002/rsa.20673},
doi = {10.1002/RSA.20673},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BollobasJS17.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/BorgsCG17,
author = {Christian Borgs and
Jennifer T. Chayes and
David Gamarnik},
title = {Convergent sequences of sparse graphs: {A} large deviations approach},
journal = {Random Struct. Algorithms},
volume = {51},
number = {1},
pages = {52--89},
year = {2017},
url = {https://doi.org/10.1002/rsa.20694},
doi = {10.1002/RSA.20694},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BorgsCG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BrightwellJL17,
author = {Graham R. Brightwell and
Svante Janson and
Malwina J. Luczak},
title = {The Greedy Independent Set in a Random Graph with Given Degrees},
journal = {Random Struct. Algorithms},
volume = {51},
number = {4},
pages = {565--586},
year = {2017},
url = {https://doi.org/10.1002/rsa.20716},
doi = {10.1002/RSA.20716},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BrightwellJL17.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/CaiD17,
author = {Xing Shi Cai and
Luc Devroye},
title = {The graph structure of a deterministic automaton chosen at random},
journal = {Random Struct. Algorithms},
volume = {51},
number = {3},
pages = {428--458},
year = {2017},
url = {https://doi.org/10.1002/rsa.20707},
doi = {10.1002/RSA.20707},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CaiD17.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/ChenLO17,
author = {Ningyuan Chen and
Nelly Litvak and
Mariana Olvera{-}Cravioto},
title = {Generalized PageRank on directed configuration networks},
journal = {Random Struct. Algorithms},
volume = {51},
number = {2},
pages = {237--274},
year = {2017},
url = {https://doi.org/10.1002/rsa.20700},
doi = {10.1002/RSA.20700},
timestamp = {Mon, 24 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChenLO17.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 = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChernFHN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Coja-OghlanCKS17,
author = {Amin Coja{-}Oghlan and
Oliver Cooley and
Mihyun Kang and
Kathrin Skubch},
title = {How does the core sit inside the mantle?},
journal = {Random Struct. Algorithms},
volume = {51},
number = {3},
pages = {459--482},
year = {2017},
url = {https://doi.org/10.1002/rsa.20712},
doi = {10.1002/RSA.20712},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Coja-OghlanCKS17.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/Corre17,
author = {Pierre{-}Antoine Corre},
title = {Oscillations in the height of the Yule tree and application to the
binary search tree},
journal = {Random Struct. Algorithms},
volume = {51},
number = {1},
pages = {90--120},
year = {2017},
url = {https://doi.org/10.1002/rsa.20701},
doi = {10.1002/RSA.20701},
timestamp = {Mon, 24 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Corre17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DavidGK17,
author = {Roee David and
Elazar Goldenberg and
Robert Krauthgamer},
title = {Local reconstruction of low-rank matrices and subspaces},
journal = {Random Struct. Algorithms},
volume = {51},
number = {4},
pages = {607--630},
year = {2017},
url = {https://doi.org/10.1002/rsa.20720},
doi = {10.1002/RSA.20720},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DavidGK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DolezalHM17,
author = {Martin Dolezal and
Jan Hladk{\'{y}} and
Andr{\'{a}}s M{\'{a}}th{\'{e}}},
title = {Cliques in dense inhomogeneous random graphs},
journal = {Random Struct. Algorithms},
volume = {51},
number = {2},
pages = {275--314},
year = {2017},
url = {https://doi.org/10.1002/rsa.20715},
doi = {10.1002/RSA.20715},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DolezalHM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrmotaRR17,
author = {Michael Drmota and
Lander Ramos and
Juanjo Ru{\'{e}}},
title = {Subgraph statistics in subcritical graph classes},
journal = {Random Struct. Algorithms},
volume = {51},
number = {4},
pages = {631--673},
year = {2017},
url = {https://doi.org/10.1002/rsa.20721},
doi = {10.1002/RSA.20721},
timestamp = {Fri, 03 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DrmotaRR17.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/Even-Zohar17,
author = {Chaim Even{-}Zohar},
title = {The writhe of permutations and random framed knots},
journal = {Random Struct. Algorithms},
volume = {51},
number = {1},
pages = {121--142},
year = {2017},
url = {https://doi.org/10.1002/rsa.20704},
doi = {10.1002/RSA.20704},
timestamp = {Mon, 24 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Even-Zohar17.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/FriezeP17,
author = {Alan M. Frieze and
Wesley Pegden},
title = {Separating subadditive euclidean functionals},
journal = {Random Struct. Algorithms},
volume = {51},
number = {3},
pages = {375--403},
year = {2017},
url = {https://doi.org/10.1002/rsa.20706},
doi = {10.1002/RSA.20706},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriezeP17.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/GraafM17,
author = {Maurits de Graaf and
Bodo Manthey},
title = {Probabilistic analysis of power assignments},
journal = {Random Struct. Algorithms},
volume = {51},
number = {3},
pages = {483--505},
year = {2017},
url = {https://doi.org/10.1002/rsa.20714},
doi = {10.1002/RSA.20714},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/GraafM17.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/GundersonKP17,
author = {Karen Gunderson and
Sebastian Koch and
Michal Przykucki},
title = {The time of graph bootstrap percolation},
journal = {Random Struct. Algorithms},
volume = {51},
number = {1},
pages = {143--168},
year = {2017},
url = {https://doi.org/10.1002/rsa.20660},
doi = {10.1002/RSA.20660},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/GundersonKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HiraokaS17,
author = {Yasuaki Hiraoka and
Tomoyuki Shirai},
title = {Minimum spanning acycle and lifetime of persistent homology in the
Linial-Meshulam process},
journal = {Random Struct. Algorithms},
volume = {51},
number = {2},
pages = {315--340},
year = {2017},
url = {https://doi.org/10.1002/rsa.20718},
doi = {10.1002/RSA.20718},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HiraokaS17.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/KnowlesR17,
author = {Antti Knowles and
Ron Rosenthal},
title = {Eigenvalue confinement and spectral gap for random simplicial complexes},
journal = {Random Struct. Algorithms},
volume = {51},
number = {3},
pages = {506--537},
year = {2017},
url = {https://doi.org/10.1002/rsa.20710},
doi = {10.1002/RSA.20710},
timestamp = {Fri, 25 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KnowlesR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KorandiS17,
author = {D{\'{a}}niel Kor{\'{a}}ndi and
Benny Sudakov},
title = {Saturation in random graphs},
journal = {Random Struct. Algorithms},
volume = {51},
number = {1},
pages = {169--181},
year = {2017},
url = {https://doi.org/10.1002/rsa.20703},
doi = {10.1002/RSA.20703},
timestamp = {Mon, 24 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KorandiS17.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/LeLV17,
author = {Can M. Le and
Elizaveta Levina and
Roman Vershynin},
title = {Concentration and regularization of random graphs},
journal = {Random Struct. Algorithms},
volume = {51},
number = {3},
pages = {538--561},
year = {2017},
url = {https://doi.org/10.1002/rsa.20713},
doi = {10.1002/RSA.20713},
timestamp = {Fri, 25 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LeLV17.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/NesetrilM17,
author = {Jaroslav Nesetril and
Patrice Ossona de Mendez},
title = {Cluster analysis of local convergent sequences of structures},
journal = {Random Struct. Algorithms},
volume = {51},
number = {4},
pages = {674--728},
year = {2017},
url = {https://doi.org/10.1002/rsa.20719},
doi = {10.1002/RSA.20719},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/NesetrilM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NguyenV17,
author = {Tuan{-}Minh Nguyen and
Stanislav Volkov},
title = {A universal result for consecutive random subdivision of polygons},
journal = {Random Struct. Algorithms},
volume = {51},
number = {2},
pages = {341--371},
year = {2017},
url = {https://doi.org/10.1002/rsa.20702},
doi = {10.1002/RSA.20702},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NguyenV17.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}
}
@article{DBLP:journals/rsa/Wen17,
author = {Yuting Wen},
title = {The Brownian plane with minimal neck baby universe},
journal = {Random Struct. Algorithms},
volume = {51},
number = {4},
pages = {729--752},
year = {2017},
url = {https://doi.org/10.1002/rsa.20722},
doi = {10.1002/RSA.20722},
timestamp = {Fri, 03 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Wen17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AasS16,
author = {Erik Aas and
Jonas Sj{\"{o}}strand},
title = {A product formula for the {TASEP} on a ring},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {247--259},
year = {2016},
url = {https://doi.org/10.1002/rsa.20595},
doi = {10.1002/RSA.20595},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AasS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AdamczakCW16,
author = {Radoslaw Adamczak and
Djalil Chafa{\"{\i}} and
Pawel Wolff},
title = {Circular law for random matrices with exchangeable entries},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {454--479},
year = {2016},
url = {https://doi.org/10.1002/rsa.20599},
doi = {10.1002/RSA.20599},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AdamczakCW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AngelNR16,
author = {Omer Angel and
Asaf Nachmias and
Gourab Ray},
title = {Random walks on stochastic hyperbolic half planar triangulations},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {213--234},
year = {2016},
url = {https://doi.org/10.1002/rsa.20625},
doi = {10.1002/RSA.20625},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AngelNR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ArlottoMS16,
author = {Alessandro Arlotto and
Elchanan Mossel and
J. Michael Steele},
title = {Quickest online selection of an increasing subsequence of specified
size},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {235--252},
year = {2016},
url = {https://doi.org/10.1002/rsa.20634},
doi = {10.1002/RSA.20634},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ArlottoMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AronshtamL16,
author = {Lior Aronshtam and
Nathan Linial},
title = {The threshold for d-collapsibility in random complexes},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {260--269},
year = {2016},
url = {https://doi.org/10.1002/rsa.20585},
doi = {10.1002/RSA.20585},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AronshtamL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ArratiaGK16,
author = {Richard Arratia and
Skip Garibaldi and
Joe Kilian},
title = {Asymptotic distribution for the birthday problem with multiple coincidences,
via an embedding of the collision process},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {480--502},
year = {2016},
url = {https://doi.org/10.1002/rsa.20591},
doi = {10.1002/RSA.20591},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ArratiaGK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalF16,
author = {Deepak Bal and
Alan M. Frieze},
title = {Rainbow matchings and Hamilton cycles in random graphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {503--523},
year = {2016},
url = {https://doi.org/10.1002/rsa.20594},
doi = {10.1002/RSA.20594},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BalF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalisterBS16,
author = {Paul Balister and
B{\'{e}}la Bollob{\'{a}}s and
Amites Sarkar},
title = {Barrier Coverage},
journal = {Random Struct. Algorithms},
volume = {49},
number = {3},
pages = {429--478},
year = {2016},
url = {https://doi.org/10.1002/rsa.20656},
doi = {10.1002/RSA.20656},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BalisterBS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghBHL16,
author = {J{\'{o}}zsef Balogh and
Jane Butterfield and
Ping Hu and
John Lenz},
title = {Mantel's theorem for random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {641--654},
year = {2016},
url = {https://doi.org/10.1002/rsa.20629},
doi = {10.1002/RSA.20629},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghBHL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghMS16,
author = {J{\'{o}}zsef Balogh and
Theodore Molla and
Maryam Sharifzadeh},
title = {Triangle factors of graphs without large independent sets and of weighted
graphs},
journal = {Random Struct. Algorithms},
volume = {49},
number = {4},
pages = {669--693},
year = {2016},
url = {https://doi.org/10.1002/rsa.20670},
doi = {10.1002/RSA.20670},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghTW16,
author = {J{\'{o}}zsef Balogh and
Andrew Treglown and
Zsolt Adam Wagner},
title = {Applications of graph containers in the Boolean lattice},
journal = {Random Struct. Algorithms},
volume = {49},
number = {4},
pages = {845--872},
year = {2016},
url = {https://doi.org/10.1002/rsa.20666},
doi = {10.1002/RSA.20666},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BapstC16,
author = {Victor Bapst and
Amin Coja{-}Oghlan},
title = {Harnessing the Bethe free energy},
journal = {Random Struct. Algorithms},
volume = {49},
number = {4},
pages = {694--741},
year = {2016},
url = {https://doi.org/10.1002/rsa.20692},
doi = {10.1002/RSA.20692},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BapstC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Baur16,
author = {Erich Baur},
title = {Percolation on random recursive trees},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {655--680},
year = {2016},
url = {https://doi.org/10.1002/rsa.20603},
doi = {10.1002/RSA.20603},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Baur16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Ben-SassonV16,
author = {Eli Ben{-}Sasson and
Michael Viderman},
title = {A combinatorial characterization of smooth LTCs and applications},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {280--307},
year = {2016},
url = {https://doi.org/10.1002/rsa.20637},
doi = {10.1002/RSA.20637},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Ben-SassonV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenjaminiEFKS16,
author = {Itai Benjamini and
David Ellis and
Ehud Friedgut and
Nathan Keller and
Arnab Sen},
title = {Juntas in the \emph{{\(\mathscr{l}\)}}\({}_{\mbox{1}}\)-grid and Lipschitz
maps between discrete tori},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {253--279},
year = {2016},
url = {https://doi.org/10.1002/rsa.20623},
doi = {10.1002/RSA.20623},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenjaminiEFKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BennettB16,
author = {Patrick Bennett and
Tom Bohman},
title = {A note on the random greedy independent set algorithm},
journal = {Random Struct. Algorithms},
volume = {49},
number = {3},
pages = {479--502},
year = {2016},
url = {https://doi.org/10.1002/rsa.20667},
doi = {10.1002/RSA.20667},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BennettB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BodeFM16,
author = {Michel Bode and
Nikolaos Fountoulakis and
Tobias M{\"{u}}ller},
title = {The probability of connectivity in a hyperbolic model of complex networks},
journal = {Random Struct. Algorithms},
volume = {49},
number = {1},
pages = {65--94},
year = {2016},
url = {https://doi.org/10.1002/rsa.20626},
doi = {10.1002/RSA.20626},
timestamp = {Thu, 17 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BodeFM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BordewichGP16,
author = {Magnus Bordewich and
Catherine S. Greenhill and
Viresh Patel},
title = {Mixing of the Glauber dynamics for the ferromagnetic Potts model},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {21--52},
year = {2016},
url = {https://doi.org/10.1002/rsa.20569},
doi = {10.1002/RSA.20569},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BordewichGP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BottcherTW16,
author = {Julia B{\"{o}}ttcher and
Anusch Taraz and
Andreas W{\"{u}}rfl},
title = {Spanning embeddings of arrangeable graphs with sublinear bandwidth},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {270--289},
year = {2016},
url = {https://doi.org/10.1002/rsa.20593},
doi = {10.1002/RSA.20593},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BottcherTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BringmannSSS16,
author = {Karl Bringmann and
Thomas Sauerwald and
Alexandre Stauffer and
He Sun},
title = {Balls into bins via local search: Cover time and maximum load},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {681--702},
year = {2016},
url = {https://doi.org/10.1002/rsa.20602},
doi = {10.1002/RSA.20602},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BringmannSSS16.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/BubeckDER16,
author = {S{\'{e}}bastien Bubeck and
Jian Ding and
Ronen Eldan and
Mikl{\'{o}}s Z. R{\'{a}}cz},
title = {Testing for high-dimensional geometry in random graphs},
journal = {Random Struct. Algorithms},
volume = {49},
number = {3},
pages = {503--532},
year = {2016},
url = {https://doi.org/10.1002/rsa.20633},
doi = {10.1002/RSA.20633},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BubeckDER16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChoiSV16,
author = {JiHyeok Choi and
Sunder Sethuraman and
Shankar C. Venkataramani},
title = {A scaling limit for the degree distribution in sublinear preferential
attachment schemes},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {703--731},
year = {2016},
url = {https://doi.org/10.1002/rsa.20615},
doi = {10.1002/RSA.20615},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChoiSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ClementiCDFPS16,
author = {Andrea Clementi and
Pierluigi Crescenzi and
Carola Doerr and
Pierre Fraigniaud and
Francesco Pasquale and
Riccardo Silvestri},
title = {Rumor spreading in random evolving graphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {290--312},
year = {2016},
url = {https://doi.org/10.1002/rsa.20586},
doi = {10.1002/RSA.20586},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ClementiCDFPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DaniHMR16,
author = {Varsha Dani and
Thomas P. Hayes and
Cristopher Moore and
Alexander Russell},
title = {Codes, lower bounds, and phase transitions in the symmetric rendezvous
problem},
journal = {Random Struct. Algorithms},
volume = {49},
number = {4},
pages = {742--765},
year = {2016},
url = {https://doi.org/10.1002/rsa.20691},
doi = {10.1002/RSA.20691},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DaniHMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DellamonicaFR16,
author = {Domingos Dellamonica Jr. and
Steve La Fleur and
Vojtech R{\"{o}}dl},
title = {On induced Ramsey numbers for \emph{k}-uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {5--20},
year = {2016},
url = {https://doi.org/10.1002/rsa.20580},
doi = {10.1002/RSA.20580},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DellamonicaFR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DiazGRS16,
author = {Josep D{\'{\i}}az and
Leslie Ann Goldberg and
David Richerby and
Maria J. Serna},
title = {Absorption time of the Moran process},
journal = {Random Struct. Algorithms},
volume = {49},
number = {1},
pages = {137--159},
year = {2016},
url = {https://doi.org/10.1002/rsa.20617},
doi = {10.1002/RSA.20617},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DiazGRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DumitriuJ16,
author = {Ioana Dumitriu and
Tobias Johnson},
title = {The Mar{\v{c}}enko-Pastur law for sparse random bipartite biregular
graphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {313--340},
year = {2016},
url = {https://doi.org/10.1002/rsa.20581},
doi = {10.1002/RSA.20581},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DumitriuJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EnriquezM16,
author = {Nathana{\"{e}}l Enriquez and
Laurent M{\'{e}}nard},
title = {Spectra of large diluted but bushy random graphs},
journal = {Random Struct. Algorithms},
volume = {49},
number = {1},
pages = {160--184},
year = {2016},
url = {https://doi.org/10.1002/rsa.20618},
doi = {10.1002/RSA.20618},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EnriquezM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FeigeHR16,
author = {Uriel Feige and
Jonathan Hermon and
Daniel Reichman},
title = {On giant components and treewidth in the layers model},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {524--545},
year = {2016},
url = {https://doi.org/10.1002/rsa.20597},
doi = {10.1002/RSA.20597},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FeigeHR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberKSV16,
author = {Asaf Ferber and
Michael Krivelevich and
Benny Sudakov and
Pedro Vieira},
title = {Finding Hamilton cycles in random graphs with few queries},
journal = {Random Struct. Algorithms},
volume = {49},
number = {4},
pages = {635--668},
year = {2016},
url = {https://doi.org/10.1002/rsa.20679},
doi = {10.1002/RSA.20679},
timestamp = {Wed, 21 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberKSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberNP16,
author = {Asaf Ferber and
Rajko Nenadov and
Ueli Peter},
title = {Universality of random graphs and rainbow embedding},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {546--564},
year = {2016},
url = {https://doi.org/10.1002/rsa.20596},
doi = {10.1002/RSA.20596},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberNP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GilmerK16,
author = {Justin Gilmer and
Swastik Kopparty},
title = {A local central limit theorem for triangles in a random graph},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {732--750},
year = {2016},
url = {https://doi.org/10.1002/rsa.20604},
doi = {10.1002/RSA.20604},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GilmerK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoldreichS16,
author = {Oded Goldreich and
Igor Shinkar},
title = {Two-sided error proximity oblivious testing},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {341--383},
year = {2016},
url = {https://doi.org/10.1002/rsa.20582},
doi = {10.1002/RSA.20582},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/GoldreichS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GroschwitzS16,
author = {Jonas Groschwitz and
Tibor Szab{\'{o}}},
title = {Sharp thresholds for half-random games {I}},
journal = {Random Struct. Algorithms},
volume = {49},
number = {4},
pages = {766--794},
year = {2016},
url = {https://doi.org/10.1002/rsa.20681},
doi = {10.1002/RSA.20681},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GroschwitzS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaeuplerPPRS16,
author = {Bernhard Haeupler and
Gopal Pandurangan and
David Peleg and
Rajmohan Rajaraman and
Zhifeng Sun},
title = {Discovery Through Gossip},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {565--587},
year = {2016},
url = {https://doi.org/10.1002/rsa.20621},
doi = {10.1002/RSA.20621},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HaeuplerPPRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HarrisMPRS16,
author = {David G. Harris and
Ehab Morsy and
Gopal Pandurangan and
Peter Robinson and
Aravind Srinivasan},
title = {Efficient computation of sparse structures},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {322--344},
year = {2016},
url = {https://doi.org/10.1002/rsa.20653},
doi = {10.1002/RSA.20653},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HarrisMPRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HarrisS16,
author = {David G. Harris and
Aravind Srinivasan},
title = {A note on near-optimal coloring of shift hypergraphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {53--56},
year = {2016},
url = {https://doi.org/10.1002/rsa.20565},
doi = {10.1002/RSA.20565},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HarrisS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaslegraveJ16,
author = {John Haslegrave and
Jonathan H. Jordan},
title = {Preferential attachment with choice},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {751--766},
year = {2016},
url = {https://doi.org/10.1002/rsa.20616},
doi = {10.1002/RSA.20616},
timestamp = {Tue, 30 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HaslegraveJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Hastad16,
author = {Johan H{\aa}stad},
title = {The square lattice shuffle, correction},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {213},
year = {2016},
url = {https://doi.org/10.1002/rsa.20620},
doi = {10.1002/RSA.20620},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Hastad16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HefetzSS16,
author = {Dan Hefetz and
Angelika Steger and
Benny Sudakov},
title = {Random directed graphs are robustly Hamiltonian},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {345--362},
year = {2016},
url = {https://doi.org/10.1002/rsa.20631},
doi = {10.1002/RSA.20631},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HefetzSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HornKR16,
author = {Paul Horn and
V{\'{a}}clav Koubek and
Vojtech R{\"{o}}dl},
title = {Isomorphic edge disjoint subgraphs of hypergraphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {767--793},
year = {2016},
url = {https://doi.org/10.1002/rsa.20635},
doi = {10.1002/RSA.20635},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HornKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson16,
author = {Svante Janson},
title = {Asymptotic normality of fringe subtrees and additive functionals in
conditioned Galton-Watson trees},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {57--101},
year = {2016},
url = {https://doi.org/10.1002/rsa.20568},
doi = {10.1002/RSA.20568},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonW16,
author = {Svante Janson and
Lutz Warnke},
title = {The lower tail: Poisson approximation revisited},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {219--246},
year = {2016},
url = {https://doi.org/10.1002/rsa.20590},
doi = {10.1002/RSA.20590},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KahleP16,
author = {Matthew Kahle and
Boris G. Pittel},
title = {Inside the critical window for cohomology of random \emph{k}-complexes},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {102--124},
year = {2016},
url = {https://doi.org/10.1002/rsa.20577},
doi = {10.1002/RSA.20577},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KahleP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KahnLW16,
author = {Jeff Kahn and
Eyal Lubetzky and
Nicholas C. Wormald},
title = {The threshold for combs in random graphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {794--802},
year = {2016},
url = {https://doi.org/10.1002/rsa.20614},
doi = {10.1002/RSA.20614},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KahnLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kozik16,
author = {Jakub Kozik},
title = {Multipass greedy coloring of simple uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {125--146},
year = {2016},
url = {https://doi.org/10.1002/rsa.20613},
doi = {10.1002/RSA.20613},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kozik16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichLS16,
author = {Michael Krivelevich and
Choongbum Lee and
Benny Sudakov},
title = {Compatible Hamilton cycles in random graphs},
journal = {Random Struct. Algorithms},
volume = {49},
number = {3},
pages = {533--557},
year = {2016},
url = {https://doi.org/10.1002/rsa.20636},
doi = {10.1002/RSA.20636},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KuhnOP16,
author = {Daniela K{\"{u}}hn and
Deryk Osthus and
Viresh Patel},
title = {A domination algorithm for \{0, 1\}-instances of the travelling salesman
problem},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {427--453},
year = {2016},
url = {https://doi.org/10.1002/rsa.20600},
doi = {10.1002/RSA.20600},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KuhnOP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LavrovL16,
author = {Mikhail Lavrov and
Po{-}Shen Loh},
title = {Increasing Hamiltonian paths in random edge orderings},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {588--611},
year = {2016},
url = {https://doi.org/10.1002/rsa.20592},
doi = {10.1002/RSA.20592},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LavrovL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LeeLS16,
author = {Choongbum Lee and
Po{-}Shen Loh and
Benny Sudakov},
title = {Judicious partitions of directed graphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {147--170},
year = {2016},
url = {https://doi.org/10.1002/rsa.20579},
doi = {10.1002/RSA.20579},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LeeLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LenzMM16,
author = {John Lenz and
Dhruv Mubayi and
Richard Mycroft},
title = {Hamilton cycles in quasirandom hypergraphs},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {363--378},
year = {2016},
url = {https://doi.org/10.1002/rsa.20638},
doi = {10.1002/RSA.20638},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LenzMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Lohss16,
author = {Amanda Lohss},
title = {The asymptotic distribution of symbols on diagonals of random weighted
staircase tableaux},
journal = {Random Struct. Algorithms},
volume = {49},
number = {4},
pages = {795--818},
year = {2016},
url = {https://doi.org/10.1002/rsa.20665},
doi = {10.1002/RSA.20665},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Lohss16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MadrasP16,
author = {Neal Madras and
Lerna Pehlivan},
title = {Structure of random 312-avoiding permutations},
journal = {Random Struct. Algorithms},
volume = {49},
number = {3},
pages = {599--631},
year = {2016},
url = {https://doi.org/10.1002/rsa.20601},
doi = {10.1002/RSA.20601},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MadrasP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MagniezNSSTX16,
author = {Fr{\'{e}}d{\'{e}}ric Magniez and
Ashwin Nayak and
Miklos Santha and
Jonah Sherman and
G{\'{a}}bor Tardos and
David Xiao},
title = {Improved bounds for the randomized decision tree Complexity of recursive
majority},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {612--638},
year = {2016},
url = {https://doi.org/10.1002/rsa.20598},
doi = {10.1002/RSA.20598},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MagniezNSSTX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MehrabianP16,
author = {Abbas Mehrabian and
Ali Pourmiri},
title = {Randomized rumor spreading in poorly connected small-world networks},
journal = {Random Struct. Algorithms},
volume = {49},
number = {1},
pages = {185--208},
year = {2016},
url = {https://doi.org/10.1002/rsa.20624},
doi = {10.1002/RSA.20624},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MehrabianP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MukherjeeS16,
author = {Sayan Mukherjee and
John Steenbergen},
title = {Random walks on simplicial complexes and harmonics},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {379--405},
year = {2016},
url = {https://doi.org/10.1002/rsa.20645},
doi = {10.1002/RSA.20645},
timestamp = {Tue, 30 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MukherjeeS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NaparstekL16,
author = {Oshri Naparstek and
Amir Leshem},
title = {Expected time complexity of the auction algorithm and the push relabel
algorithm for maximum bipartite matching on random graphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {384--395},
year = {2016},
url = {https://doi.org/10.1002/rsa.20578},
doi = {10.1002/RSA.20578},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NaparstekL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NenadovSS16,
author = {Rajko Nenadov and
Angelika Steger and
Milos Stojakovic},
title = {On the threshold for the Maker-Breaker \emph{H}-game},
journal = {Random Struct. Algorithms},
volume = {49},
number = {3},
pages = {558--578},
year = {2016},
url = {https://doi.org/10.1002/rsa.20628},
doi = {10.1002/RSA.20628},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NenadovSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NetoM16,
author = {Maur{\'{\i}}cio Collares Neto and
Robert Morris},
title = {Maximum-size antichains in random set-systems},
journal = {Random Struct. Algorithms},
volume = {49},
number = {2},
pages = {308--321},
year = {2016},
url = {https://doi.org/10.1002/rsa.20647},
doi = {10.1002/RSA.20647},
timestamp = {Tue, 24 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NetoM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/OonoY16,
author = {Kenta Oono and
Yuichi Yoshida},
title = {Testing properties of functions on finite groups},
journal = {Random Struct. Algorithms},
volume = {49},
number = {3},
pages = {579--598},
year = {2016},
url = {https://doi.org/10.1002/rsa.20639},
doi = {10.1002/RSA.20639},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/OonoY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ParczykP16,
author = {Olaf Parczyk and
Yury Person},
title = {Spanning structures and universality in sparse hypergraphs},
journal = {Random Struct. Algorithms},
volume = {49},
number = {4},
pages = {819--844},
year = {2016},
url = {https://doi.org/10.1002/rsa.20690},
doi = {10.1002/RSA.20690},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ParczykP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PemantlePR16,
author = {Robin Pemantle and
Yuval Peres and
Igor Rivin},
title = {Four random permutations conjugated by an adversary generate \emph{S}\({}_{\mbox{n}}\)
with high probability},
journal = {Random Struct. Algorithms},
volume = {49},
number = {3},
pages = {409--428},
year = {2016},
url = {https://doi.org/10.1002/rsa.20632},
doi = {10.1002/RSA.20632},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PemantlePR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PittelP16,
author = {Boris G. Pittel and
Daniel J. Poole},
title = {Asymptotic distribution of the numbers of vertices and arcs of the
giant strong component in sparse random digraphs},
journal = {Random Struct. Algorithms},
volume = {49},
number = {1},
pages = {3--64},
year = {2016},
url = {https://doi.org/10.1002/rsa.20622},
doi = {10.1002/RSA.20622},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PittelP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PralatW16,
author = {Pawel Pralat and
Nicholas C. Wormald},
title = {Meyniel's conjecture holds for random graphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {396--421},
year = {2016},
url = {https://doi.org/10.1002/rsa.20587},
doi = {10.1002/RSA.20587},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PralatW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RomikS16,
author = {Dan Romik and
Piotr Sniady},
title = {Limit shapes of bumping routes in the Robinson-Schensted correspondence},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {171--182},
year = {2016},
url = {https://doi.org/10.1002/rsa.20570},
doi = {10.1002/RSA.20570},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RomikS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RudelsonZ16,
author = {Mark Rudelson and
Ofer Zeitouni},
title = {Singular values of Gaussian matrices and permanent estimators},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {183--212},
year = {2016},
url = {https://doi.org/10.1002/rsa.20564},
doi = {10.1002/RSA.20564},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RudelsonZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AchlioptasM15,
author = {Dimitris Achlioptas and
Michael Molloy},
title = {The solution space geometry of random linear equations},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {197--231},
year = {2015},
url = {https://doi.org/10.1002/rsa.20494},
doi = {10.1002/RSA.20494},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AchlioptasM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AllenBKP15,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Yoshiharu Kohayakawa and
Yury Person},
title = {Tight Hamilton cycles in random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {46},
number = {3},
pages = {446--465},
year = {2015},
url = {https://doi.org/10.1002/rsa.20519},
doi = {10.1002/RSA.20519},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AllenBKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AndjelV15,
author = {Enrique D. Andjel and
Maria Eulalia Vares},
title = {First passage percolation and escape strategies},
journal = {Random Struct. Algorithms},
volume = {47},
number = {3},
pages = {414--423},
year = {2015},
url = {https://doi.org/10.1002/rsa.20548},
doi = {10.1002/RSA.20548},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AndjelV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AronshtamL15,
author = {Lior Aronshtam and
Nathan Linial},
title = {When does the top homology of a random simplicial complex vanish?},
journal = {Random Struct. Algorithms},
volume = {46},
number = {1},
pages = {26--35},
year = {2015},
url = {https://doi.org/10.1002/rsa.20495},
doi = {10.1002/RSA.20495},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AronshtamL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BackhauszSV15,
author = {{\'{A}}gnes Backhausz and
Bal{\'{a}}zs Szegedy and
B{\'{a}}lint Vir{\'{a}}g},
title = {Ramanujan graphings and correlation decay in local algorithms},
journal = {Random Struct. Algorithms},
volume = {47},
number = {3},
pages = {424--435},
year = {2015},
url = {https://doi.org/10.1002/rsa.20562},
doi = {10.1002/RSA.20562},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BackhauszSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarghiW15,
author = {Amir Barghi and
Peter Winkler},
title = {Firefighting on a random geometric graph},
journal = {Random Struct. Algorithms},
volume = {46},
number = {3},
pages = {466--477},
year = {2015},
url = {https://doi.org/10.1002/rsa.20511},
doi = {10.1002/RSA.20511},
timestamp = {Mon, 23 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarghiW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Ben-ZwiNW15,
author = {Oren Ben{-}Zwi and
Ilan Newman and
Guy Wolfovitz},
title = {Hats, auctions and derandomization},
journal = {Random Struct. Algorithms},
volume = {46},
number = {3},
pages = {478--493},
year = {2015},
url = {https://doi.org/10.1002/rsa.20512},
doi = {10.1002/RSA.20512},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Ben-ZwiNW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenaimBCL15,
author = {Michel Bena{\"{\i}}m and
Itai Benjamini and
Jun Chen and
Yuri Lima},
title = {A generalized P{\'{o}}lya's urn with graph based interactions},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {614--634},
year = {2015},
url = {https://doi.org/10.1002/rsa.20523},
doi = {10.1002/RSA.20523},
timestamp = {Tue, 04 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenaimBCL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BerenbrinkCF15,
author = {Petra Berenbrink and
Colin Cooper and
Tom Friedetzky},
title = {Random walks which prefer unvisited edges: Exploring high girth even
degree expanders in linear time},
journal = {Random Struct. Algorithms},
volume = {46},
number = {1},
pages = {36--54},
year = {2015},
url = {https://doi.org/10.1002/rsa.20504},
doi = {10.1002/RSA.20504},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BerenbrinkCF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhamidiBW15,
author = {Shankar Bhamidi and
Amarjit Budhiraja and
Xuan Wang},
title = {Aggregation models with limited choice and the multiplicative coalescent},
journal = {Random Struct. Algorithms},
volume = {46},
number = {1},
pages = {55--116},
year = {2015},
url = {https://doi.org/10.1002/rsa.20493},
doi = {10.1002/RSA.20493},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BhamidiBW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhattacharyyaGS15,
author = {Arnab Bhattacharyya and
Elena Grigorescu and
Asaf Shapira},
title = {A unified framework for testing linear-invariant properties},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {232--260},
year = {2015},
url = {https://doi.org/10.1002/rsa.20507},
doi = {10.1002/RSA.20507},
timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BhattacharyyaGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Bogachev15,
author = {Leonid V. Bogachev},
title = {Unified derivation of the limit shape for multiplicative ensembles
of random integer partitions with equiweighted parts},
journal = {Random Struct. Algorithms},
volume = {47},
number = {2},
pages = {227--266},
year = {2015},
url = {https://doi.org/10.1002/rsa.20540},
doi = {10.1002/RSA.20540},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Bogachev15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BoissardCEN15,
author = {Emmanuel Boissard and
Serge Cohen and
Thibault Espinasse and
James Norris},
title = {Diffusivity of a random walk on random walks},
journal = {Random Struct. Algorithms},
volume = {47},
number = {2},
pages = {267--283},
year = {2015},
url = {https://doi.org/10.1002/rsa.20541},
doi = {10.1002/RSA.20541},
timestamp = {Thu, 28 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BoissardCEN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasSU15,
author = {B{\'{e}}la Bollob{\'{a}}s and
Paul Smith and
Andrew J. Uzzell},
title = {The time of bootstrap percolation with dense initial sets for all
thresholds},
journal = {Random Struct. Algorithms},
volume = {47},
number = {1},
pages = {1--29},
year = {2015},
url = {https://doi.org/10.1002/rsa.20529},
doi = {10.1002/RSA.20529},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasSU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CenacCPP15,
author = {Peggy C{\'{e}}nac and
Brigitte Chauvin and
Fr{\'{e}}d{\'{e}}ric Paccaut and
Nicolas Pouyanne},
title = {Uncommon suffix tries},
journal = {Random Struct. Algorithms},
volume = {46},
number = {1},
pages = {117--141},
year = {2015},
url = {https://doi.org/10.1002/rsa.20500},
doi = {10.1002/RSA.20500},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CenacCPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChauvinGM15,
author = {Brigitte Chauvin and
Dani{\`{e}}le Gardy and
C{\'{e}}cile Mailler},
title = {A sprouting tree model for random boolean functions},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {635--662},
year = {2015},
url = {https://doi.org/10.1002/rsa.20567},
doi = {10.1002/RSA.20567},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ChauvinGM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CherkashinK15,
author = {Danila D. Cherkashin and
Jakub Kozik},
title = {A note on random greedy coloring of uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {47},
number = {3},
pages = {407--413},
year = {2015},
url = {https://doi.org/10.1002/rsa.20556},
doi = {10.1002/RSA.20556},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CherkashinK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Coja-OghlanE15,
author = {Amin Coja{-}Oghlan and
Charilaos Efthymiou},
title = {On independent sets in random graphs},
journal = {Random Struct. Algorithms},
volume = {47},
number = {3},
pages = {436--486},
year = {2015},
url = {https://doi.org/10.1002/rsa.20550},
doi = {10.1002/RSA.20550},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Coja-OghlanE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperM15,
author = {Jeff Cooper and
Dhruv Mubayi},
title = {List coloring triangle-free hypergraphs},
journal = {Random Struct. Algorithms},
volume = {47},
number = {3},
pages = {487--519},
year = {2015},
url = {https://doi.org/10.1002/rsa.20552},
doi = {10.1002/RSA.20552},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CooperM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CostaF15,
author = {A. E. Costa and
Michael Farber},
title = {The asphericity of random 2-dimensional complexes},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {261--273},
year = {2015},
url = {https://doi.org/10.1002/rsa.20499},
doi = {10.1002/RSA.20499},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CostaF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CsokaGHV15,
author = {Endre Cs{\'{o}}ka and
Bal{\'{a}}zs Gerencs{\'{e}}r and
Viktor Harangi and
B{\'{a}}lint Vir{\'{a}}g},
title = {Invariant Gaussian processes and independent sets on regular graphs
of large girth},
journal = {Random Struct. Algorithms},
volume = {47},
number = {2},
pages = {284--303},
year = {2015},
url = {https://doi.org/10.1002/rsa.20547},
doi = {10.1002/RSA.20547},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CsokaGHV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CurienHK15,
author = {Nicolas Curien and
B{\'{e}}n{\'{e}}dicte Haas and
Igor Kortchemski},
title = {The {CRT} is the scaling limit of random dissections},
journal = {Random Struct. Algorithms},
volume = {47},
number = {2},
pages = {304--327},
year = {2015},
url = {https://doi.org/10.1002/rsa.20554},
doi = {10.1002/RSA.20554},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CurienHK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CurienM15,
author = {Nicolas Curien and
Gr{\'{e}}gory Miermont},
title = {Uniform infinite planar quadrangulations with a boundary},
journal = {Random Struct. Algorithms},
volume = {47},
number = {1},
pages = {30--58},
year = {2015},
url = {https://doi.org/10.1002/rsa.20531},
doi = {10.1002/RSA.20531},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CurienM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DamronNS15,
author = {Michael Damron and
Charles M. Newman and
Vladas Sidoravicius},
title = {Absence of site percolation at criticality in {\(\mathbb{Z}\)}2{\texttimes}\{0,
1\}},
journal = {Random Struct. Algorithms},
volume = {47},
number = {2},
pages = {328--340},
year = {2015},
url = {https://doi.org/10.1002/rsa.20544},
doi = {10.1002/RSA.20544},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DamronNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DeMarcoK15,
author = {Bobby DeMarco and
Jeff Kahn},
title = {Mantel's theorem for random graphs},
journal = {Random Struct. Algorithms},
volume = {47},
number = {1},
pages = {59--72},
year = {2015},
url = {https://doi.org/10.1002/rsa.20535},
doi = {10.1002/RSA.20535},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DeMarcoK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DeMarcoK15a,
author = {Bobby DeMarco and
Jeff Kahn},
title = {Note on a problem of M. Talagrand},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {663--668},
year = {2015},
url = {https://doi.org/10.1002/rsa.20559},
doi = {10.1002/RSA.20559},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DeMarcoK15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DellamonicaKR015,
author = {Domingos Dellamonica Jr. and
Yoshiharu Kohayakawa and
Vojtech R{\"{o}}dl and
Andrzej Rucinski},
title = {An improved upper bound on the density of universal random graphs},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {274--299},
year = {2015},
url = {https://doi.org/10.1002/rsa.20545},
doi = {10.1002/RSA.20545},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DellamonicaKR015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DereichM15,
author = {Steffen Dereich and
Peter M{\"{o}}rters},
title = {Cycle length distributions in random permutations with diverging cycle
weights},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {635--650},
year = {2015},
url = {https://doi.org/10.1002/rsa.20520},
doi = {10.1002/RSA.20520},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DereichM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Don15,
author = {Henk Don},
title = {New methods to bound the critical probability in fractal percolation},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {710--730},
year = {2015},
url = {https://doi.org/10.1002/rsa.20566},
doi = {10.1002/RSA.20566},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Don15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EllisFF15,
author = {David Ellis and
Yuval Filmus and
Ehud Friedgut},
title = {A stability result for balanced dictatorships in S\({}_{\mbox{n}}\)},
journal = {Random Struct. Algorithms},
volume = {46},
number = {3},
pages = {494--530},
year = {2015},
url = {https://doi.org/10.1002/rsa.20515},
doi = {10.1002/RSA.20515},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EllisFF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FeigeR15,
author = {Uriel Feige and
Daniel Reichman},
title = {Recoverable values for independent sets},
journal = {Random Struct. Algorithms},
volume = {46},
number = {1},
pages = {142--159},
year = {2015},
url = {https://doi.org/10.1002/rsa.20492},
doi = {10.1002/RSA.20492},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FeigeR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberGKN15,
author = {Asaf Ferber and
Roman Glebov and
Michael Krivelevich and
Alon Naor},
title = {Biased games on random boards},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {651--676},
year = {2015},
url = {https://doi.org/10.1002/rsa.20528},
doi = {10.1002/RSA.20528},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberGKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FerberKN15,
author = {Asaf Ferber and
Michael Krivelevich and
Humberto Naves},
title = {Generating random graphs in biased Maker-Breaker games},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {615--634},
year = {2015},
url = {https://doi.org/10.1002/rsa.20619},
doi = {10.1002/RSA.20619},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FerberKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FinucanePY15,
author = {Hilary K. Finucane and
Ron Peled and
Yariv Yaari},
title = {A recursive construction of \emph{t}-wise uniform permutations},
journal = {Random Struct. Algorithms},
volume = {46},
number = {3},
pages = {531--540},
year = {2015},
url = {https://doi.org/10.1002/rsa.20509},
doi = {10.1002/RSA.20509},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FinucanePY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeH15,
author = {Alan M. Frieze and
Simi Haber},
title = {An almost linear time algorithm for finding Hamilton cycles in sparse
random graphs with minimum degree at least three},
journal = {Random Struct. Algorithms},
volume = {47},
number = {1},
pages = {73--98},
year = {2015},
url = {https://doi.org/10.1002/rsa.20542},
doi = {10.1002/RSA.20542},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriezeH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeS15,
author = {Alan M. Frieze and
Gregory B. Sorkin},
title = {Efficient algorithms for three-dimensional axial and planar random
assignment problems},
journal = {Random Struct. Algorithms},
volume = {46},
number = {1},
pages = {160--196},
year = {2015},
url = {https://doi.org/10.1002/rsa.20525},
doi = {10.1002/RSA.20525},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FriezeS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Fuchs15,
author = {Michael Fuchs},
title = {A note on the quicksort asymptotics},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {677--687},
year = {2015},
url = {https://doi.org/10.1002/rsa.20524},
doi = {10.1002/RSA.20524},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Fuchs15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Gacs15,
author = {P{\'{e}}ter G{\'{a}}cs},
title = {Clairvoyant embedding in one dimension},
journal = {Random Struct. Algorithms},
volume = {47},
number = {3},
pages = {520--560},
year = {2015},
url = {https://doi.org/10.1002/rsa.20551},
doi = {10.1002/RSA.20551},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Gacs15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GamarnikKM15,
author = {David Gamarnik and
Dmitriy Katz and
Sidhant Misra},
title = {Strong spatial mixing of list coloring of graphs},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {599--613},
year = {2015},
url = {https://doi.org/10.1002/rsa.20518},
doi = {10.1002/RSA.20518},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GamarnikKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Gao15,
author = {Pu Gao},
title = {Sandwiching a densest subgraph by consecutive cores},
journal = {Random Struct. Algorithms},
volume = {47},
number = {2},
pages = {341--360},
year = {2015},
url = {https://doi.org/10.1002/rsa.20543},
doi = {10.1002/RSA.20543},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Gao15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Garivier15,
author = {Aur{\'{e}}lien Garivier},
title = {Perfect simulation of processes with long memory: {A} "coupling into
and from the past" algorithm},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {300--319},
year = {2015},
url = {https://doi.org/10.1002/rsa.20527},
doi = {10.1002/RSA.20527},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Garivier15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GavinskyLSS15,
author = {Dmitry Gavinsky and
Shachar Lovett and
Michael E. Saks and
Srikanth Srinivasan},
title = {A tail bound for read-\emph{k} families of functions},
journal = {Random Struct. Algorithms},
volume = {47},
number = {1},
pages = {99--108},
year = {2015},
url = {https://doi.org/10.1002/rsa.20532},
doi = {10.1002/RSA.20532},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GavinskyLSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GnedinG15,
author = {Alexander V. Gnedin and
Vadim Gorin},
title = {Record-dependent measures on the symmetric groups},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {688--706},
year = {2015},
url = {https://doi.org/10.1002/rsa.20526},
doi = {10.1002/RSA.20526},
timestamp = {Thu, 06 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GnedinG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HayesVV15,
author = {Thomas P. Hayes and
Juan Carlos Vera and
Eric Vigoda},
title = {Randomly coloring planar graphs with fewer colors than the maximum
degree},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {731--759},
year = {2015},
url = {https://doi.org/10.1002/rsa.20560},
doi = {10.1002/RSA.20560},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HayesVV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Hirsch15,
author = {Christian Hirsch},
title = {A Harris-Kesten theorem for confetti percolation},
journal = {Random Struct. Algorithms},
volume = {47},
number = {2},
pages = {361--385},
year = {2015},
url = {https://doi.org/10.1002/rsa.20563},
doi = {10.1002/RSA.20563},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Hirsch15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HwangZ15,
author = {Hsien{-}Kuei Hwang and
Vytas Zacharovas},
title = {Limit distribution of the coefficients of polynomials with only unit
roots},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {707--738},
year = {2015},
url = {https://doi.org/10.1002/rsa.20516},
doi = {10.1002/RSA.20516},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HwangZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kahn15,
author = {Jonas Kahn},
title = {How many T-tessellations on \emph{k} lines? Existence of associated
Gibbs measures on bounded convex domains},
journal = {Random Struct. Algorithms},
volume = {47},
number = {3},
pages = {561--587},
year = {2015},
url = {https://doi.org/10.1002/rsa.20557},
doi = {10.1002/RSA.20557},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kahn15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KijimaKM15,
author = {Shuji Kijima and
Kentaro Koga and
Kazuhisa Makino},
title = {Deterministic random walks on finite graphs},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {739--761},
year = {2015},
url = {https://doi.org/10.1002/rsa.20533},
doi = {10.1002/RSA.20533},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/KijimaKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KnoxKO15,
author = {Fiachra Knox and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Edge-disjoint Hamilton cycles in random graphs},
journal = {Random Struct. Algorithms},
volume = {46},
number = {3},
pages = {397--445},
year = {2015},
url = {https://doi.org/10.1002/rsa.20510},
doi = {10.1002/RSA.20510},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KnoxKO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KohayakawaLRS15,
author = {Yoshiharu Kohayakawa and
Sangjune Lee and
Vojtech R{\"{o}}dl and
Wojciech Samotij},
title = {The number of Sidon sets and the maximum size of Sidon sets contained
in a sparse random set of integers},
journal = {Random Struct. Algorithms},
volume = {46},
number = {1},
pages = {1--25},
year = {2015},
url = {https://doi.org/10.1002/rsa.20496},
doi = {10.1002/RSA.20496},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KohayakawaLRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichLS15,
author = {Michael Krivelevich and
Choongbum Lee and
Benny Sudakov},
title = {Long paths and cycles in random subgraphs of graphs with large minimum
degree},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {320--345},
year = {2015},
url = {https://doi.org/10.1002/rsa.20508},
doi = {10.1002/RSA.20508},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Lachieze-Rey15,
author = {Rapha{\"{e}}l Lachi{\`{e}}ze{-}Rey},
title = {Realisability conditions for second-order marginals of biphased media},
journal = {Random Struct. Algorithms},
volume = {47},
number = {3},
pages = {588--604},
year = {2015},
url = {https://doi.org/10.1002/rsa.20546},
doi = {10.1002/RSA.20546},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Lachieze-Rey15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LenzM15,
author = {John Lenz and
Dhruv Mubayi},
title = {The poset of hypergraph quasirandomness},
journal = {Random Struct. Algorithms},
volume = {46},
number = {4},
pages = {762--800},
year = {2015},
url = {https://doi.org/10.1002/rsa.20521},
doi = {10.1002/RSA.20521},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LenzM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LovettMR15,
author = {Shachar Lovett and
Cristopher Moore and
Alexander Russell},
title = {Group representations that resist random sampling},
journal = {Random Struct. Algorithms},
volume = {47},
number = {3},
pages = {605--614},
year = {2015},
url = {https://doi.org/10.1002/rsa.20555},
doi = {10.1002/RSA.20555},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LovettMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LubetzkyZ15,
author = {Eyal Lubetzky and
Yufei Zhao},
title = {On replica symmetry of large deviations in random graphs},
journal = {Random Struct. Algorithms},
volume = {47},
number = {1},
pages = {109--146},
year = {2015},
url = {https://doi.org/10.1002/rsa.20536},
doi = {10.1002/RSA.20536},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LubetzkyZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MaNS15,
author = {Jie Ma and
Humberto Naves and
Benny Sudakov},
title = {Discrepancy of random graphs and hypergraphs},
journal = {Random Struct. Algorithms},
volume = {47},
number = {1},
pages = {147--162},
year = {2015},
url = {https://doi.org/10.1002/rsa.20522},
doi = {10.1002/RSA.20522},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MaNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MakarychevSS15,
author = {Konstantin Makarychev and
Warren Schudy and
Maxim Sviridenko},
title = {Concentration inequalities for nonlinear matroid intersection},
journal = {Random Struct. Algorithms},
volume = {46},
number = {3},
pages = {541--571},
year = {2015},
url = {https://doi.org/10.1002/rsa.20514},
doi = {10.1002/RSA.20514},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MakarychevSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Neininger15,
author = {Ralph Neininger},
title = {Refined quicksort asymptotics},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {346--361},
year = {2015},
url = {https://doi.org/10.1002/rsa.20497},
doi = {10.1002/RSA.20497},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Neininger15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PeresTW15,
author = {Yuval Peres and
Kunal Talwar and
Udi Wieder},
title = {Graphical balanced allocations and the {(1} + {\(\beta\)})-choice
process},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {760--775},
year = {2015},
url = {https://doi.org/10.1002/rsa.20558},
doi = {10.1002/RSA.20558},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PeresTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Perkins15,
author = {Will Perkins},
title = {Random \emph{k}-SAT and the power of two choices},
journal = {Random Struct. Algorithms},
volume = {47},
number = {1},
pages = {163--173},
year = {2015},
url = {https://doi.org/10.1002/rsa.20534},
doi = {10.1002/RSA.20534},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Perkins15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pinsky15,
author = {Ross G. Pinsky},
title = {Probabilistic and combinatorial aspects of the card-cyclic to random
insertion shuffle},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {362--390},
year = {2015},
url = {https://doi.org/10.1002/rsa.20505},
doi = {10.1002/RSA.20505},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pinsky15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Przybylo15,
author = {Jakub Przybylo},
title = {Asymptotically optimal neighbour sum distinguishing colourings of
graphs},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {776--791},
year = {2015},
url = {https://doi.org/10.1002/rsa.20553},
doi = {10.1002/RSA.20553},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Przybylo15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RiordanW15,
author = {Oliver Riordan and
Lutz Warnke},
title = {The Janson inequalities for general up-sets},
journal = {Random Struct. Algorithms},
volume = {46},
number = {2},
pages = {391--395},
year = {2015},
url = {https://doi.org/10.1002/rsa.20506},
doi = {10.1002/RSA.20506},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RiordanW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RiordanW15a,
author = {Oliver Riordan and
Lutz Warnke},
title = {The evolution of subcritical Achlioptas processes},
journal = {Random Struct. Algorithms},
volume = {47},
number = {1},
pages = {174--203},
year = {2015},
url = {https://doi.org/10.1002/rsa.20530},
doi = {10.1002/RSA.20530},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RiordanW15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TamakiY15,
author = {Suguru Tamaki and
Yuichi Yoshida},
title = {A query efficient non-adaptive long code test with perfect completeness},
journal = {Random Struct. Algorithms},
volume = {47},
number = {2},
pages = {386--406},
year = {2015},
url = {https://doi.org/10.1002/rsa.20549},
doi = {10.1002/RSA.20549},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TamakiY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TschoppDG15,
author = {Dominique Tschopp and
Suhas N. Diggavi and
Matthias Grossglauser},
title = {Hierarchical routing over dynamic wireless networks},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {669--709},
year = {2015},
url = {https://doi.org/10.1002/rsa.20589},
doi = {10.1002/RSA.20589},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TschoppDG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Viderman15,
author = {Michael Viderman},
title = {A combination of testability and decodability by tensor products},
journal = {Random Struct. Algorithms},
volume = {46},
number = {3},
pages = {572--598},
year = {2015},
url = {https://doi.org/10.1002/rsa.20498},
doi = {10.1002/RSA.20498},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Viderman15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/VuW15,
author = {Van H. Vu and
Ke Wang},
title = {Random weighted projections, random quadratic forms and random eigenvectors},
journal = {Random Struct. Algorithms},
volume = {47},
number = {4},
pages = {792--821},
year = {2015},
url = {https://doi.org/10.1002/rsa.20561},
doi = {10.1002/RSA.20561},
timestamp = {Tue, 22 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/VuW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Zhao15,
author = {Yufei Zhao},
title = {Hypergraph limits: {A} regularity approach},
journal = {Random Struct. Algorithms},
volume = {47},
number = {2},
pages = {205--226},
year = {2015},
url = {https://doi.org/10.1002/rsa.20537},
doi = {10.1002/RSA.20537},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Zhao15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AbbeM14,
author = {Emmanuel Abbe and
Andrea Montanari},
title = {On the concentration of the number of solutions of random satisfiability
formulas},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {362--382},
year = {2014},
url = {https://doi.org/10.1002/rsa.20501},
doi = {10.1002/RSA.20501},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AbbeM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalisterB14,
author = {Paul Balister and
B{\'{e}}la Bollob{\'{a}}s},
title = {Interference percolation},
journal = {Random Struct. Algorithms},
volume = {44},
number = {4},
pages = {399--418},
year = {2014},
url = {https://doi.org/10.1002/rsa.20484},
doi = {10.1002/RSA.20484},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BalisterB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenjaminiKW14,
author = {Itai Benjamini and
Gady Kozma and
Nicholas C. Wormald},
title = {The mixing time of the giant component of a random graph},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {383--407},
year = {2014},
url = {https://doi.org/10.1002/rsa.20539},
doi = {10.1002/RSA.20539},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenjaminiKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Bertoin14,
author = {Jean Bertoin},
title = {Sizes of the largest clusters for supercritical percolation on random
recursive trees},
journal = {Random Struct. Algorithms},
volume = {44},
number = {1},
pages = {29--44},
year = {2014},
url = {https://doi.org/10.1002/rsa.20448},
doi = {10.1002/RSA.20448},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Bertoin14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BeveridgeDFMS14,
author = {Andrew Beveridge and
Andrzej Dudek and
Alan M. Frieze and
Tobias M{\"{u}}ller and
Milos Stojakovic},
title = {Maker-breaker games on random geometric graphs},
journal = {Random Struct. Algorithms},
volume = {45},
number = {4},
pages = {553--607},
year = {2014},
url = {https://doi.org/10.1002/rsa.20572},
doi = {10.1002/RSA.20572},
timestamp = {Thu, 17 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BeveridgeDFMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BorokhovichAL14,
author = {Michael Borokhovich and
Chen Avin and
Zvi Lotker},
title = {Bounds for algebraic gossip on graphs},
journal = {Random Struct. Algorithms},
volume = {45},
number = {2},
pages = {185--217},
year = {2014},
url = {https://doi.org/10.1002/rsa.20480},
doi = {10.1002/RSA.20480},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BorokhovichAL14.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/rsa/Casselgren14,
author = {Carl Johan Casselgren},
title = {Coloring graphs from random lists of fixed size},
journal = {Random Struct. Algorithms},
volume = {44},
number = {3},
pages = {317--327},
year = {2014},
url = {https://doi.org/10.1002/rsa.20469},
doi = {10.1002/RSA.20469},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Casselgren14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChernFHM14,
author = {Hua{-}Huai Chern and
Mar{\'{\i}}a{-}In{\'{e}}s Fern{\'{a}}ndez{-}Camacho and
Hsien{-}Kuei Hwang and
Conrado Mart{\'{\i}}nez},
title = {Psi-series method for equality of random trees and quadratic convolution
recurrences},
journal = {Random Struct. Algorithms},
volume = {44},
number = {1},
pages = {67--108},
year = {2014},
url = {https://doi.org/10.1002/rsa.20428},
doi = {10.1002/RSA.20428},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ChernFHM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChristofidesM14,
author = {Demetres Christofides and
Klas Markstr{\"{o}}m},
title = {The thresholds for diameter 2 in random Cayley graphs},
journal = {Random Struct. Algorithms},
volume = {45},
number = {2},
pages = {218--235},
year = {2014},
url = {https://doi.org/10.1002/rsa.20486},
doi = {10.1002/RSA.20486},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChristofidesM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ConlonFS14,
author = {David Conlon and
Jacob Fox and
Benny Sudakov},
title = {Cycle packing},
journal = {Random Struct. Algorithms},
volume = {45},
number = {4},
pages = {608--626},
year = {2014},
url = {https://doi.org/10.1002/rsa.20574},
doi = {10.1002/RSA.20574},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ConlonFS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperFL14,
author = {Colin Cooper and
Alan M. Frieze and
Eyal Lubetzky},
title = {Cover time of a random graph with a degree sequence {II:} Allowing
vertices of degree two},
journal = {Random Struct. Algorithms},
volume = {45},
number = {4},
pages = {627--674},
year = {2014},
url = {https://doi.org/10.1002/rsa.20573},
doi = {10.1002/RSA.20573},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperFL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperFU14,
author = {Colin Cooper and
Alan M. Frieze and
Ryuhei Uehara},
title = {The height of random \emph{k}-trees and related branching processes},
journal = {Random Struct. Algorithms},
volume = {45},
number = {4},
pages = {675--702},
year = {2014},
url = {https://doi.org/10.1002/rsa.20576},
doi = {10.1002/RSA.20576},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperFU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CurienK14,
author = {Nicolas Curien and
Igor Kortchemski},
title = {Random non-crossing plane configurations: {A} conditioned Galton-Watson
tree approach},
journal = {Random Struct. Algorithms},
volume = {45},
number = {2},
pages = {236--260},
year = {2014},
url = {https://doi.org/10.1002/rsa.20481},
doi = {10.1002/RSA.20481},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CurienK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CzumajGRSSS14,
author = {Artur Czumaj and
Oded Goldreich and
Dana Ron and
C. Seshadhri and
Asaf Shapira and
Christian Sohler},
title = {Finding cycles and trees in sublinear time},
journal = {Random Struct. Algorithms},
volume = {45},
number = {2},
pages = {139--184},
year = {2014},
url = {https://doi.org/10.1002/rsa.20462},
doi = {10.1002/RSA.20462},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CzumajGRSSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DevroyeF14,
author = {Luc Devroye and
Nicolas Fraiman},
title = {Connectivity of inhomogeneous random graphs},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {408--420},
year = {2014},
url = {https://doi.org/10.1002/rsa.20490},
doi = {10.1002/RSA.20490},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DevroyeF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DuchJM14,
author = {Amalia Duch and
Rosa M. Jim{\'{e}}nez and
Conrado Mart{\'{\i}}nez},
title = {Selection by rank in \emph{K}-dimensional binary search trees},
journal = {Random Struct. Algorithms},
volume = {45},
number = {1},
pages = {14--37},
year = {2014},
url = {https://doi.org/10.1002/rsa.20476},
doi = {10.1002/RSA.20476},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DuchJM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EbbersKLV14,
author = {Mirko Ebbers and
Holger Kn{\"{o}}pfel and
Matthias L{\"{o}}we and
Franck Vermet},
title = {Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths
model},
journal = {Random Struct. Algorithms},
volume = {45},
number = {1},
pages = {38--77},
year = {2014},
url = {https://doi.org/10.1002/rsa.20461},
doi = {10.1002/RSA.20461},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EbbersKLV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ErcolaniU14,
author = {Nicholas M. Ercolani and
Daniel Ueltschi},
title = {Cycle structure of random permutations with cycle weights},
journal = {Random Struct. Algorithms},
volume = {44},
number = {1},
pages = {109--133},
year = {2014},
url = {https://doi.org/10.1002/rsa.20430},
doi = {10.1002/RSA.20430},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ErcolaniU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EschenfeldtGP14,
author = {Patrick Eschenfeldt and
Ben Gross and
Nicholas Pippenger},
title = {Stochastic service systems, random interval graphs and search algorithms},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {421--442},
year = {2014},
url = {https://doi.org/10.1002/rsa.20485},
doi = {10.1002/RSA.20485},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EschenfeldtGP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Feierl14,
author = {Thomas Feierl},
title = {Asymptotics for the number of walks in a Weyl chamber of type \emph{B}},
journal = {Random Struct. Algorithms},
volume = {45},
number = {2},
pages = {261--305},
year = {2014},
url = {https://doi.org/10.1002/rsa.20467},
doi = {10.1002/RSA.20467},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Feierl14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Frieze14,
author = {Alan M. Frieze},
title = {On a greedy 2-matching algorithm and Hamilton cycles in random graphs
with minimum degree at least three},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {443--497},
year = {2014},
url = {https://doi.org/10.1002/rsa.20482},
doi = {10.1002/RSA.20482},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Frieze14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeL14,
author = {Alan M. Frieze and
Po{-}Shen Loh},
title = {Rainbow hamilton cycles in random graphs},
journal = {Random Struct. Algorithms},
volume = {44},
number = {3},
pages = {328--354},
year = {2014},
url = {https://doi.org/10.1002/rsa.20475},
doi = {10.1002/RSA.20475},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FriezeL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GalanisGSVY14,
author = {Andreas Galanis and
Qi Ge and
Daniel Stefankovic and
Eric Vigoda and
Linji Yang},
title = {Improved inapproximability results for counting independent sets in
the hard-core model},
journal = {Random Struct. Algorithms},
volume = {45},
number = {1},
pages = {78--110},
year = {2014},
url = {https://doi.org/10.1002/rsa.20479},
doi = {10.1002/RSA.20479},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GalanisGSVY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GlebovKS14,
author = {Roman Glebov and
Michael Krivelevich and
Tibor Szab{\'{o}}},
title = {On covering expander graphs by hamilton cycles},
journal = {Random Struct. Algorithms},
volume = {44},
number = {2},
pages = {183--200},
year = {2014},
url = {https://doi.org/10.1002/rsa.20455},
doi = {10.1002/RSA.20455},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GlebovKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GorodezkyP14,
author = {Igor Gorodezky and
Igor Pak},
title = {Generalized loop-erased random walks and approximate reachability},
journal = {Random Struct. Algorithms},
volume = {44},
number = {2},
pages = {201--223},
year = {2014},
url = {https://doi.org/10.1002/rsa.20460},
doi = {10.1002/RSA.20460},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GorodezkyP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HeimanSS14,
author = {Eyal Heiman and
Gideon Schechtman and
Adi Shraibman},
title = {Deterministic algorithms for matrix completion},
journal = {Random Struct. Algorithms},
volume = {45},
number = {2},
pages = {306--317},
year = {2014},
url = {https://doi.org/10.1002/rsa.20483},
doi = {10.1002/RSA.20483},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HeimanSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HolmesS14,
author = {Mark Holmes and
Thomas S. Salisbury},
title = {Degenerate random environments},
journal = {Random Struct. Algorithms},
volume = {45},
number = {1},
pages = {111--137},
year = {2014},
url = {https://doi.org/10.1002/rsa.20473},
doi = {10.1002/RSA.20473},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HolmesS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonLW14,
author = {Svante Janson and
Malwina J. Luczak and
Peter Windridge},
title = {Law of large numbers for the {SIR} epidemic on a random graph with
given degrees},
journal = {Random Struct. Algorithms},
volume = {45},
number = {4},
pages = {726--763},
year = {2014},
url = {https://doi.org/10.1002/rsa.20575},
doi = {10.1002/RSA.20575},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonLW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KangMRS14,
author = {Ross J. Kang and
Colin McDiarmid and
Bruce A. Reed and
Alex D. Scott},
title = {For most graphs \emph{H}, most \emph{H}-free graphs have a linear
homogeneous set},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {343--361},
year = {2014},
url = {https://doi.org/10.1002/rsa.20488},
doi = {10.1002/RSA.20488},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KangMRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KohayakawaSS14,
author = {Yoshiharu Kohayakawa and
Mathias Schacht and
Reto Sp{\"{o}}hel},
title = {Upper bounds on probability thresholds for asymmetric Ramsey properties},
journal = {Random Struct. Algorithms},
volume = {44},
number = {1},
pages = {1--28},
year = {2014},
url = {https://doi.org/10.1002/rsa.20446},
doi = {10.1002/RSA.20446},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KohayakawaSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KostochkaMV14,
author = {Alexandr V. Kostochka and
Dhruv Mubayi and
Jacques Verstra{\"{e}}te},
title = {On independent sets in hypergraphs},
journal = {Random Struct. Algorithms},
volume = {44},
number = {2},
pages = {224--239},
year = {2014},
url = {https://doi.org/10.1002/rsa.20453},
doi = {10.1002/RSA.20453},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KostochkaMV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LevineP14,
author = {Lionel Levine and
Yuval Peres},
title = {The looping constant of {\(\mathbb{Z}\)}\({}^{\mbox{d}}\)},
journal = {Random Struct. Algorithms},
volume = {45},
number = {1},
pages = {1--13},
year = {2014},
url = {https://doi.org/10.1002/rsa.20478},
doi = {10.1002/RSA.20478},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LevineP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmidK14,
author = {Colin McDiarmid and
Valentas Kurauskas},
title = {Random graphs containing few disjoint excluded minors},
journal = {Random Struct. Algorithms},
volume = {44},
number = {2},
pages = {240--268},
year = {2014},
url = {https://doi.org/10.1002/rsa.20447},
doi = {10.1002/RSA.20447},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmidK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Molloy14,
author = {Michael Molloy},
title = {Sets that are connected in two random graphs},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {498--512},
year = {2014},
url = {https://doi.org/10.1002/rsa.20491},
doi = {10.1002/RSA.20491},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Molloy14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MullerS14,
author = {Tobias M{\"{u}}ller and
Milos Stojakovic},
title = {A threshold for the Maker-Breaker clique game},
journal = {Random Struct. Algorithms},
volume = {45},
number = {2},
pages = {318--341},
year = {2014},
url = {https://doi.org/10.1002/rsa.20489},
doi = {10.1002/RSA.20489},
timestamp = {Thu, 17 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MullerS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MutzeRS14,
author = {Torsten M{\"{u}}tze and
Thomas Rast and
Reto Sp{\"{o}}hel},
title = {Coloring random graphs online without creating monochromatic subgraphs},
journal = {Random Struct. Algorithms},
volume = {44},
number = {4},
pages = {419--464},
year = {2014},
url = {https://doi.org/10.1002/rsa.20445},
doi = {10.1002/RSA.20445},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MutzeRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PanholzerS14,
author = {Alois Panholzer and
Georg Seitz},
title = {Ancestors and descendants in evolving \emph{k}-tree models},
journal = {Random Struct. Algorithms},
volume = {44},
number = {4},
pages = {465--489},
year = {2014},
url = {https://doi.org/10.1002/rsa.20474},
doi = {10.1002/RSA.20474},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PanholzerS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Picollelli14,
author = {Michael E. Picollelli},
title = {The diamond-free process},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {513--551},
year = {2014},
url = {https://doi.org/10.1002/rsa.20517},
doi = {10.1002/RSA.20517},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Picollelli14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Riordan14,
author = {Oliver Riordan},
title = {Long cycles in random subgraphs of graphs with large minimum degree},
journal = {Random Struct. Algorithms},
volume = {45},
number = {4},
pages = {764--767},
year = {2014},
url = {https://doi.org/10.1002/rsa.20571},
doi = {10.1002/RSA.20571},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Riordan14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Samotij14,
author = {Wojciech Samotij},
title = {Stability results for random discrete structures},
journal = {Random Struct. Algorithms},
volume = {44},
number = {3},
pages = {269--289},
year = {2014},
url = {https://doi.org/10.1002/rsa.20477},
doi = {10.1002/RSA.20477},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Samotij14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TamakiY14,
author = {Ehsan Ebrahimzadeh and
Linda Farczadi and
Pu Gao and
Abbas Mehrabian and
Cristiane M. Sato and
Nick Wormald and
Jonathan Zung},
title = {On longest paths and diameter in random apollonian network},
journal = {Random Struct. Algorithms},
volume = {45},
number = {4},
pages = {703--725},
year = {2014},
url = {https://doi.org/10.1002/rsa.20538},
doi = {10.1002/RSA.20538},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TamakiY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Vershynin14,
author = {Roman Vershynin},
title = {Invertibility of symmetric random matrices},
journal = {Random Struct. Algorithms},
volume = {44},
number = {2},
pages = {135--182},
year = {2014},
url = {https://doi.org/10.1002/rsa.20429},
doi = {10.1002/RSA.20429},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Vershynin14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Warnke14,
author = {Lutz Warnke},
title = {When does the \emph{K}\({}_{\mbox{4}}\)-free process stop?},
journal = {Random Struct. Algorithms},
volume = {44},
number = {3},
pages = {355--397},
year = {2014},
url = {https://doi.org/10.1002/rsa.20444},
doi = {10.1002/RSA.20444},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Warnke14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Warnke14a,
author = {Lutz Warnke},
title = {The \emph{C}\({}_{\mbox{{\(\mathscr{l}\)}}}\)-free process},
journal = {Random Struct. Algorithms},
volume = {44},
number = {4},
pages = {490--526},
year = {2014},
url = {https://doi.org/10.1002/rsa.20468},
doi = {10.1002/RSA.20468},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Warnke14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AllenBHP13,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Diana Piguet},
title = {Tur{\'{a}}nnical hypergraphs},
journal = {Random Struct. Algorithms},
volume = {42},
number = {1},
pages = {29--58},
year = {2013},
url = {https://doi.org/10.1002/rsa.20399},
doi = {10.1002/RSA.20399},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AllenBHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AnandkumarHK13,
author = {Animashree Anandkumar and
Avinatan Hassidim and
Jonathan A. Kelner},
title = {Topology discovery of sparse random graphs with few participants},
journal = {Random Struct. Algorithms},
volume = {43},
number = {1},
pages = {16--48},
year = {2013},
url = {https://doi.org/10.1002/rsa.20420},
doi = {10.1002/RSA.20420},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AnandkumarHK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarvinokH13,
author = {Alexander I. Barvinok and
J. A. Hartigan},
title = {The number of graphs and a random graph with a given degree sequence},
journal = {Random Struct. Algorithms},
volume = {42},
number = {3},
pages = {301--348},
year = {2013},
url = {https://doi.org/10.1002/rsa.20409},
doi = {10.1002/RSA.20409},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarvinokH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BassinoMNVW13,
author = {Fr{\'{e}}d{\'{e}}rique Bassino and
Armando Martino and
Cyril Nicaud and
Enric Ventura and
Pascal Weil},
title = {Statistical properties of subgroups of free groups},
journal = {Random Struct. Algorithms},
volume = {42},
number = {3},
pages = {349--373},
year = {2013},
url = {https://doi.org/10.1002/rsa.20407},
doi = {10.1002/RSA.20407},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BassinoMNVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BelkinNN13,
author = {Mikhail Belkin and
Hariharan Narayanan and
Partha Niyogi},
title = {Heat flow and a faster algorithm to compute the surface area of a
convex body},
journal = {Random Struct. Algorithms},
volume = {43},
number = {4},
pages = {407--428},
year = {2013},
url = {https://doi.org/10.1002/rsa.20513},
doi = {10.1002/RSA.20513},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BelkinNN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BlanchetS13,
author = {Jose H. Blanchet and
Alexandre Stauffer},
title = {Characterizing optimal sampling of binary contingency tables via the
configuration model},
journal = {Random Struct. Algorithms},
volume = {42},
number = {2},
pages = {159--184},
year = {2013},
url = {https://doi.org/10.1002/rsa.20403},
doi = {10.1002/RSA.20403},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BlanchetS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BorgsCKL13,
author = {Christian Borgs and
Jennifer T. Chayes and
Jeff Kahn and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {Left and right convergence of graphs with bounded degree},
journal = {Random Struct. Algorithms},
volume = {42},
number = {1},
pages = {1--28},
year = {2013},
url = {https://doi.org/10.1002/rsa.20414},
doi = {10.1002/RSA.20414},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BorgsCKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CernyT13,
author = {Jir{\'{\i}} Cern{\'{y}} and
Augusto Teixeira},
title = {Critical window for the vacant set left by random walk on random regular
graphs},
journal = {Random Struct. Algorithms},
volume = {43},
number = {3},
pages = {313--337},
year = {2013},
url = {https://doi.org/10.1002/rsa.20425},
doi = {10.1002/RSA.20425},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CernyT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperF13,
author = {Colin Cooper and
Alan M. Frieze},
title = {Component structure of the vacant set induced by a random walk on
a random graph},
journal = {Random Struct. Algorithms},
volume = {42},
number = {2},
pages = {135--158},
year = {2013},
url = {https://doi.org/10.1002/rsa.20402},
doi = {10.1002/RSA.20402},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CoupierT13,
author = {David Coupier and
Viet{-}Chi Tran},
title = {The 2D-directed spanning forest is almost surely a tree},
journal = {Random Struct. Algorithms},
volume = {42},
number = {1},
pages = {59--72},
year = {2013},
url = {https://doi.org/10.1002/rsa.20400},
doi = {10.1002/RSA.20400},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CoupierT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Dasse-HartautH13,
author = {Sandrine Dasse{-}Hartaut and
Pawel Hitczenko},
title = {Greek letters in random staircase tableaux},
journal = {Random Struct. Algorithms},
volume = {42},
number = {1},
pages = {73--96},
year = {2013},
url = {https://doi.org/10.1002/rsa.20405},
doi = {10.1002/RSA.20405},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Dasse-HartautH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DiaconisW13,
author = {Persi Diaconis and
Philip Matchett Wood},
title = {Random doubly stochastic tridiagonal matrices},
journal = {Random Struct. Algorithms},
volume = {42},
number = {4},
pages = {403--437},
year = {2013},
url = {https://doi.org/10.1002/rsa.20452},
doi = {10.1002/RSA.20452},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DiaconisW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DudekF13,
author = {Andrzej Dudek and
Alan M. Frieze},
title = {Tight Hamilton cycles in random uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {42},
number = {3},
pages = {374--385},
year = {2013},
url = {https://doi.org/10.1002/rsa.20404},
doi = {10.1002/RSA.20404},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DudekF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerFHV13,
author = {Martin E. Dyer and
Alan M. Frieze and
Thomas P. Hayes and
Eric Vigoda},
title = {Randomly coloring constant degree graphs},
journal = {Random Struct. Algorithms},
volume = {43},
number = {2},
pages = {181--200},
year = {2013},
url = {https://doi.org/10.1002/rsa.20451},
doi = {10.1002/RSA.20451},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerFHV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FountoulakisP13,
author = {Nikolaos Fountoulakis and
Konstantinos Panagiotou},
title = {Rumor spreading on random regular graphs and expanders},
journal = {Random Struct. Algorithms},
volume = {43},
number = {2},
pages = {201--220},
year = {2013},
url = {https://doi.org/10.1002/rsa.20432},
doi = {10.1002/RSA.20432},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FountoulakisP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriedrichL13,
author = {Tobias Friedrich and
Lionel Levine},
title = {Fast simulation of large-scale growth models},
journal = {Random Struct. Algorithms},
volume = {42},
number = {2},
pages = {185--213},
year = {2013},
url = {https://doi.org/10.1002/rsa.20412},
doi = {10.1002/RSA.20412},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriedrichL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Gao13,
author = {Pu Gao},
title = {Distribution of the number of spanning regular subgraphs in random
graphs},
journal = {Random Struct. Algorithms},
volume = {43},
number = {3},
pages = {338--353},
year = {2013},
url = {https://doi.org/10.1002/rsa.20418},
doi = {10.1002/RSA.20418},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Gao13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GarrodM13,
author = {Bryn Garrod and
Robert Morris},
title = {The secretary problem on an unknown poset},
journal = {Random Struct. Algorithms},
volume = {43},
number = {4},
pages = {429--451},
year = {2013},
url = {https://doi.org/10.1002/rsa.20466},
doi = {10.1002/RSA.20466},
timestamp = {Tue, 24 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GarrodM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GimenezNR13,
author = {Omer Gim{\'{e}}nez and
Marc Noy and
Juan Jos{\'{e}} Ru{\'{e}}},
title = {Graph classes with given 3-connected components: Asymptotic enumeration
and random graphs},
journal = {Random Struct. Algorithms},
volume = {42},
number = {4},
pages = {438--479},
year = {2013},
url = {https://doi.org/10.1002/rsa.20421},
doi = {10.1002/RSA.20421},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GimenezNR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GrytczukKM13,
author = {Jaroslaw Grytczuk and
Jakub Kozik and
Piotr Micek},
title = {New approach to nonrepetitive sequences},
journal = {Random Struct. Algorithms},
volume = {42},
number = {2},
pages = {214--225},
year = {2013},
url = {https://doi.org/10.1002/rsa.20411},
doi = {10.1002/RSA.20411},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GrytczukKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Hayes13,
author = {Thomas P. Hayes},
title = {Local uniformity properties for glauber dynamics on graph colorings},
journal = {Random Struct. Algorithms},
volume = {43},
number = {2},
pages = {139--180},
year = {2013},
url = {https://doi.org/10.1002/rsa.20502},
doi = {10.1002/RSA.20502},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Hayes13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Hofstad13,
author = {Remco van der Hofstad},
title = {Critical behavior in inhomogeneous random graphs},
journal = {Random Struct. Algorithms},
volume = {42},
number = {4},
pages = {480--508},
year = {2013},
url = {https://doi.org/10.1002/rsa.20450},
doi = {10.1002/RSA.20450},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Hofstad13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KangPS13,
author = {Mihyun Kang and
Will Perkins and
Joel Spencer},
title = {The Bohman-Frieze process near criticality},
journal = {Random Struct. Algorithms},
volume = {43},
number = {2},
pages = {221--250},
year = {2013},
url = {https://doi.org/10.1002/rsa.20437},
doi = {10.1002/RSA.20437},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KangPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KemkesSW13,
author = {Graeme Kemkes and
Cristiane M. Sato and
Nicholas C. Wormald},
title = {Asymptotic enumeration of sparse 2-connected graphs},
journal = {Random Struct. Algorithms},
volume = {43},
number = {3},
pages = {354--376},
year = {2013},
url = {https://doi.org/10.1002/rsa.20415},
doi = {10.1002/RSA.20415},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KemkesSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KhotN13,
author = {Subhash Khot and
Assaf Naor},
title = {Sharp kernel clustering algorithms and their associated Grothendieck
inequalities},
journal = {Random Struct. Algorithms},
volume = {42},
number = {3},
pages = {269--300},
year = {2013},
url = {https://doi.org/10.1002/rsa.20398},
doi = {10.1002/RSA.20398},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KhotN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichLS13,
author = {Michael Krivelevich and
Eyal Lubetzky and
Benny Sudakov},
title = {Longest cycles in sparse random digraphs},
journal = {Random Struct. Algorithms},
volume = {43},
number = {1},
pages = {1--15},
year = {2013},
url = {https://doi.org/10.1002/rsa.20435},
doi = {10.1002/RSA.20435},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichS13,
author = {Michael Krivelevich and
Benny Sudakov},
title = {The phase transition in random graphs: {A} simple proof},
journal = {Random Struct. Algorithms},
volume = {43},
number = {2},
pages = {131--138},
year = {2013},
url = {https://doi.org/10.1002/rsa.20470},
doi = {10.1002/RSA.20470},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LastP13,
author = {G{\"{u}}nter Last and
Mathew D. Penrose},
title = {Percolation and limit theory for the poisson lilypond model},
journal = {Random Struct. Algorithms},
volume = {42},
number = {2},
pages = {226--249},
year = {2013},
url = {https://doi.org/10.1002/rsa.20410},
doi = {10.1002/RSA.20410},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LastP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Letzter13,
author = {Shoham Letzter},
title = {The property of having a \emph{k} -regular subgraph has a sharp threshold},
journal = {Random Struct. Algorithms},
volume = {42},
number = {4},
pages = {509--519},
year = {2013},
url = {https://doi.org/10.1002/rsa.20434},
doi = {10.1002/RSA.20434},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Letzter13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LinialL13,
author = {Nathan Linial and
Zur Luria},
title = {An upper bound on the number of Steiner triple systems},
journal = {Random Struct. Algorithms},
volume = {43},
number = {4},
pages = {399--406},
year = {2013},
url = {https://doi.org/10.1002/rsa.20487},
doi = {10.1002/RSA.20487},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LinialL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MarcoK13,
author = {Gianluca De Marco and
Dariusz R. Kowalski},
title = {Searching for a subset of counterfeit coins: Randomization vs determinism
and adaptiveness vs non-adaptiveness},
journal = {Random Struct. Algorithms},
volume = {42},
number = {1},
pages = {97--109},
year = {2013},
url = {https://doi.org/10.1002/rsa.20417},
doi = {10.1002/RSA.20417},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MarcoK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Perez-GimenezW13,
author = {Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
Nicholas C. Wormald},
title = {Asymptotic enumeration of strongly connected digraphs by vertices
and edges},
journal = {Random Struct. Algorithms},
volume = {43},
number = {1},
pages = {80--114},
year = {2013},
url = {https://doi.org/10.1002/rsa.20416},
doi = {10.1002/RSA.20416},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Perez-GimenezW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Perkins13,
author = {Will Perkins},
title = {The forgetfulness of balls and bins},
journal = {Random Struct. Algorithms},
volume = {42},
number = {2},
pages = {250--267},
year = {2013},
url = {https://doi.org/10.1002/rsa.20408},
doi = {10.1002/RSA.20408},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Perkins13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pittel13,
author = {Boris G. Pittel},
title = {Counting strongly-connected, moderately sparse directed graphs},
journal = {Random Struct. Algorithms},
volume = {43},
number = {1},
pages = {49--79},
year = {2013},
url = {https://doi.org/10.1002/rsa.20433},
doi = {10.1002/RSA.20433},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pittel13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ReshefV13,
author = {Yakir Reshef and
Salil P. Vadhan},
title = {On extractors and exposure-resilient functions for sublogarithmic
entropy},
journal = {Random Struct. Algorithms},
volume = {42},
number = {3},
pages = {386--401},
year = {2013},
url = {https://doi.org/10.1002/rsa.20424},
doi = {10.1002/RSA.20424},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ReshefV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RubinfeldX13,
author = {Ronitt Rubinfeld and
Ning Xie},
title = {Robust characterizations of \emph{k}-wise independence over product
spaces and related testing results},
journal = {Random Struct. Algorithms},
volume = {43},
number = {3},
pages = {265--312},
year = {2013},
url = {https://doi.org/10.1002/rsa.20423},
doi = {10.1002/RSA.20423},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RubinfeldX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Salez13,
author = {Justin Salez},
title = {Weighted enumeration of spanning subgraphs in locally tree-like graphs},
journal = {Random Struct. Algorithms},
volume = {43},
number = {3},
pages = {377--397},
year = {2013},
url = {https://doi.org/10.1002/rsa.20436},
doi = {10.1002/RSA.20436},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Salez13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Seierstad13,
author = {Taral Guldahl Seierstad},
title = {On the normality of giant components},
journal = {Random Struct. Algorithms},
volume = {43},
number = {4},
pages = {452--485},
year = {2013},
url = {https://doi.org/10.1002/rsa.20464},
doi = {10.1002/RSA.20464},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Seierstad13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SinclairV13,
author = {Alistair Sinclair and
Dan Vilenchik},
title = {Delaying satisfiability for random 2SAT},
journal = {Random Struct. Algorithms},
volume = {43},
number = {2},
pages = {251--263},
year = {2013},
url = {https://doi.org/10.1002/rsa.20465},
doi = {10.1002/RSA.20465},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SinclairV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TranVW13,
author = {Linh V. Tran and
Van H. Vu and
Ke Wang},
title = {Sparse random graphs: Eigenvalues and eigenvectors},
journal = {Random Struct. Algorithms},
volume = {42},
number = {1},
pages = {110--134},
year = {2013},
url = {https://doi.org/10.1002/rsa.20406},
doi = {10.1002/RSA.20406},
timestamp = {Tue, 22 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TranVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Turova13,
author = {Tatyana S. Turova},
title = {Diffusion approximation for the components in critical inhomogeneous
random graphs of rank 1},
journal = {Random Struct. Algorithms},
volume = {43},
number = {4},
pages = {486--539},
year = {2013},
url = {https://doi.org/10.1002/rsa.20503},
doi = {10.1002/RSA.20503},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Turova13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Ullrich13,
author = {Mario Ullrich},
title = {Comparison of Swendsen-Wang and heat-bath dynamics},
journal = {Random Struct. Algorithms},
volume = {42},
number = {4},
pages = {520--535},
year = {2013},
url = {https://doi.org/10.1002/rsa.20431},
doi = {10.1002/RSA.20431},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Ullrich13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Volkov13,
author = {Stanislav Volkov},
title = {Random geometric subdivisions},
journal = {Random Struct. Algorithms},
volume = {43},
number = {1},
pages = {115--130},
year = {2013},
url = {https://doi.org/10.1002/rsa.20454},
doi = {10.1002/RSA.20454},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Volkov13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Addario-Berry12,
author = {Louigi Addario{-}Berry},
title = {Tail bounds for the height and width of a random tree with a given
degree sequence},
journal = {Random Struct. Algorithms},
volume = {41},
number = {2},
pages = {253--261},
year = {2012},
url = {https://doi.org/10.1002/rsa.20438},
doi = {10.1002/RSA.20438},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Addario-Berry12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghBM12,
author = {J{\'{o}}zsef Balogh and
B{\'{e}}la Bollob{\'{a}}s and
Robert Morris},
title = {Graph bootstrap percolation},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {413--440},
year = {2012},
url = {https://doi.org/10.1002/rsa.20458},
doi = {10.1002/RSA.20458},
timestamp = {Tue, 24 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghBM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Banaszczyk12,
author = {Wojciech Banaszczyk},
title = {On series of signed vectors and their rearrangements},
journal = {Random Struct. Algorithms},
volume = {40},
number = {3},
pages = {301--316},
year = {2012},
url = {https://doi.org/10.1002/rsa.20373},
doi = {10.1002/RSA.20373},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Banaszczyk12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Ben-ShimonFHK12,
author = {Sonny Ben{-}Shimon and
Asaf Ferber and
Dan Hefetz and
Michael Krivelevich},
title = {Hitting time results for Maker-Breaker games},
journal = {Random Struct. Algorithms},
volume = {41},
number = {1},
pages = {23--46},
year = {2012},
url = {https://doi.org/10.1002/rsa.20392},
doi = {10.1002/RSA.20392},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Ben-ShimonFHK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BergLN12,
author = {Jacob van den Berg and
Bernardo N. B. de Lima and
Pierre Nolin},
title = {A percolation process on the square lattice where large finite clusters
are frozen},
journal = {Random Struct. Algorithms},
volume = {40},
number = {2},
pages = {220--226},
year = {2012},
url = {https://doi.org/10.1002/rsa.20375},
doi = {10.1002/RSA.20375},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BergLN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanP12,
author = {Tom Bohman and
Michael E. Picollelli},
title = {{SIR} epidemics on random graphs with a fixed degree sequence},
journal = {Random Struct. Algorithms},
volume = {41},
number = {2},
pages = {179--214},
year = {2012},
url = {https://doi.org/10.1002/rsa.20401},
doi = {10.1002/RSA.20401},
timestamp = {Fri, 02 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BohmanP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasR12,
author = {B{\'{e}}la Bollob{\'{a}}s and
Oliver Riordan},
title = {Asymptotic normality of the size of the giant component in a random
hypergraph},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {441--450},
year = {2012},
url = {https://doi.org/10.1002/rsa.20456},
doi = {10.1002/RSA.20456},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BottcherKP12,
author = {Julia B{\"{o}}ttcher and
Yoshiharu Kohayakawa and
Aldo Procacci},
title = {Properly coloured copies and rainbow copies of large graphs with small
maximum degree},
journal = {Random Struct. Algorithms},
volume = {40},
number = {4},
pages = {425--436},
year = {2012},
url = {https://doi.org/10.1002/rsa.20383},
doi = {10.1002/RSA.20383},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BottcherKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BrightwellPS12,
author = {Graham R. Brightwell and
Konstantinos Panagiotou and
Angelika Steger},
title = {Extremal subgraphs of random graphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {2},
pages = {147--178},
year = {2012},
url = {https://doi.org/10.1002/rsa.20413},
doi = {10.1002/RSA.20413},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BrightwellPS12.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}
}
@article{DBLP:journals/rsa/CandelleroG12,
author = {Elisabetta Candellero and
Lorenz A. Gilch},
title = {Phase transitions for random walk asymptotics on free products of
groups},
journal = {Random Struct. Algorithms},
volume = {40},
number = {2},
pages = {150--181},
year = {2012},
url = {https://doi.org/10.1002/rsa.20370},
doi = {10.1002/RSA.20370},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CandelleroG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Chatterjee12,
author = {Sourav Chatterjee},
title = {The missing log in large deviations for triangle counts},
journal = {Random Struct. Algorithms},
volume = {40},
number = {4},
pages = {437--451},
year = {2012},
url = {https://doi.org/10.1002/rsa.20381},
doi = {10.1002/RSA.20381},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Chatterjee12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChayesS12,
author = {Lincoln Chayes and
S. Alex Smith},
title = {Large deviation analysis for layered percolation problems on the complete
graph},
journal = {Random Struct. Algorithms},
volume = {40},
number = {4},
pages = {460--492},
year = {2012},
url = {https://doi.org/10.1002/rsa.20387},
doi = {10.1002/RSA.20387},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChayesS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChristofidesM12,
author = {Demetres Christofides and
Klas Markstr{\"{o}}m},
title = {Random Latin square graphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {1},
pages = {47--65},
year = {2012},
url = {https://doi.org/10.1002/rsa.20390},
doi = {10.1002/RSA.20390},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChristofidesM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Chung12,
author = {Fan Chung Graham},
title = {Quasi-random hypergraphs revisited},
journal = {Random Struct. Algorithms},
volume = {40},
number = {1},
pages = {39--48},
year = {2012},
url = {https://doi.org/10.1002/rsa.20388},
doi = {10.1002/RSA.20388},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Chung12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ConlonHPS12,
author = {David Conlon and
Hi{\^{e}}p H{\`{a}}n and
Yury Person and
Mathias Schacht},
title = {Weak quasi-randomness for uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {40},
number = {1},
pages = {1--38},
year = {2012},
url = {https://doi.org/10.1002/rsa.20389},
doi = {10.1002/RSA.20389},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ConlonHPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DeMarcoK12,
author = {Bobby DeMarco and
Jeff Kahn},
title = {Upper tails for triangles},
journal = {Random Struct. Algorithms},
volume = {40},
number = {4},
pages = {452--459},
year = {2012},
url = {https://doi.org/10.1002/rsa.20382},
doi = {10.1002/RSA.20382},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DeMarcoK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Dellamonica12,
author = {Domingos Dellamonica Jr.},
title = {The size-Ramsey number of trees},
journal = {Random Struct. Algorithms},
volume = {40},
number = {1},
pages = {49--73},
year = {2012},
url = {https://doi.org/10.1002/rsa.20363},
doi = {10.1002/RSA.20363},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Dellamonica12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DemarcoK12,
author = {Bobby DeMarco and
Jeff Kahn},
title = {Tight upper tail bounds for cliques},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {469--487},
year = {2012},
url = {https://doi.org/10.1002/rsa.20440},
doi = {10.1002/RSA.20440},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DemarcoK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DevroyeFF12,
author = {Luc Devroye and
Omar Fawzi and
Nicolas Fraiman},
title = {Depth Properties of scaled attachment random recursive trees},
journal = {Random Struct. Algorithms},
volume = {41},
number = {1},
pages = {66--98},
year = {2012},
url = {https://doi.org/10.1002/rsa.20391},
doi = {10.1002/RSA.20391},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DevroyeFF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DudekRR12,
author = {Andrzej Dudek and
Reshma Ramadurai and
Vojtech R{\"{o}}dl},
title = {On induced Folkman numbers},
journal = {Random Struct. Algorithms},
volume = {40},
number = {4},
pages = {493--500},
year = {2012},
url = {https://doi.org/10.1002/rsa.20397},
doi = {10.1002/RSA.20397},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DudekRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FountoulakisP12,
author = {Nikolaos Fountoulakis and
Konstantinos Panagiotou},
title = {Sharp load thresholds for cuckoo hashing},
journal = {Random Struct. Algorithms},
volume = {41},
number = {3},
pages = {306--333},
year = {2012},
url = {https://doi.org/10.1002/rsa.20426},
doi = {10.1002/RSA.20426},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FountoulakisP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FournierGGG12,
author = {Herv{\'{e}} Fournier and
Dani{\`{e}}le Gardy and
Antoine Genitrini and
Bernhard Gittenberger},
title = {The fraction of large random trees representing a given Boolean function
in implicational logic},
journal = {Random Struct. Algorithms},
volume = {40},
number = {3},
pages = {317--349},
year = {2012},
url = {https://doi.org/10.1002/rsa.20379},
doi = {10.1002/RSA.20379},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FournierGGG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeK12,
author = {Alan M. Frieze and
Michael Krivelevich},
title = {Packing hamilton cycles in random and pseudo-random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {1},
pages = {1--22},
year = {2012},
url = {https://doi.org/10.1002/rsa.20396},
doi = {10.1002/RSA.20396},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FriezeK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeKL12,
author = {Alan M. Frieze and
Michael Krivelevich and
Po{-}Shen Loh},
title = {Packing tight Hamilton cycles in 3-uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {40},
number = {3},
pages = {269--300},
year = {2012},
url = {https://doi.org/10.1002/rsa.20374},
doi = {10.1002/RSA.20374},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FriezeKL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeM12,
author = {Alan M. Frieze and
P{\'{a}}ll Melsted},
title = {Maximum matchings in random bipartite graphs and the space utilization
of Cuckoo Hash tables},
journal = {Random Struct. Algorithms},
volume = {41},
number = {3},
pages = {334--364},
year = {2012},
url = {https://doi.org/10.1002/rsa.20427},
doi = {10.1002/RSA.20427},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FriezeM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GabizonS12,
author = {Ariel Gabizon and
Ronen Shaltiel},
title = {Increasing the output length of zero-error dispersers},
journal = {Random Struct. Algorithms},
volume = {40},
number = {1},
pages = {74--104},
year = {2012},
url = {https://doi.org/10.1002/rsa.20359},
doi = {10.1002/RSA.20359},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GabizonS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GalligoM12,
author = {Andr{\'{e}} Galligo and
Laurent Miclo},
title = {On the cut-off phenomenon for the transitivity of randomly generated
subgroups},
journal = {Random Struct. Algorithms},
volume = {40},
number = {2},
pages = {182--219},
year = {2012},
url = {https://doi.org/10.1002/rsa.20369},
doi = {10.1002/RSA.20369},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GalligoM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GrahamYZ12,
author = {Fan Chung Graham and
Stephen J. Young and
Wenbo Zhao},
title = {Braess's paradox in expanders},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {451--468},
year = {2012},
url = {https://doi.org/10.1002/rsa.20457},
doi = {10.1002/RSA.20457},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GrahamYZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GronauMS12,
author = {Ilan Gronau and
Shlomo Moran and
Sagi Snir},
title = {Fast and reliable reconstruction of phylogenetic trees with indistinguishable
edges},
journal = {Random Struct. Algorithms},
volume = {40},
number = {3},
pages = {350--384},
year = {2012},
url = {https://doi.org/10.1002/rsa.20372},
doi = {10.1002/RSA.20372},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GronauMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GugelmannPST12,
author = {Luca Gugelmann and
Yury Person and
Angelika Steger and
Henning Thomas},
title = {A randomized version of Ramsey's theorem},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {488--505},
year = {2012},
url = {https://doi.org/10.1002/rsa.20449},
doi = {10.1002/RSA.20449},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GugelmannPST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HatamiM12,
author = {Hamed Hatami and
Michael Molloy},
title = {The scaling window for a random graph with a given degree sequence},
journal = {Random Struct. Algorithms},
volume = {41},
number = {1},
pages = {99--123},
year = {2012},
url = {https://doi.org/10.1002/rsa.20394},
doi = {10.1002/RSA.20394},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HatamiM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HefetzKS12,
author = {Dan Hefetz and
Michael Krivelevich and
Tibor Szab{\'{o}}},
title = {Sharp threshold for the appearance of certain spanning trees in random
graphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {391--412},
year = {2012},
url = {https://doi.org/10.1002/rsa.20472},
doi = {10.1002/RSA.20472},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HefetzKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HornR12,
author = {Paul Horn and
Mary Radcliffe},
title = {Giant components in Kronecker graphs},
journal = {Random Struct. Algorithms},
volume = {40},
number = {3},
pages = {385--397},
year = {2012},
url = {https://doi.org/10.1002/rsa.20380},
doi = {10.1002/RSA.20380},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HornR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HuangL12,
author = {Hao Huang and
Choongbum Lee},
title = {Quasi-randomness of graph balanced cut properties},
journal = {Random Struct. Algorithms},
volume = {41},
number = {1},
pages = {124--145},
year = {2012},
url = {https://doi.org/10.1002/rsa.20384},
doi = {10.1002/RSA.20384},
timestamp = {Wed, 17 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HuangL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Jalsenius12,
author = {Markus Jalsenius},
title = {Sampling colourings of the triangular lattice},
journal = {Random Struct. Algorithms},
volume = {40},
number = {4},
pages = {501--533},
year = {2012},
url = {https://doi.org/10.1002/rsa.20386},
doi = {10.1002/RSA.20386},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Jalsenius12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KahnN12,
author = {Jeff Kahn and
M. Neiman},
title = {Conditional negative association for competing urns},
journal = {Random Struct. Algorithms},
volume = {41},
number = {2},
pages = {262--281},
year = {2012},
url = {https://doi.org/10.1002/rsa.20395},
doi = {10.1002/RSA.20395},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KahnN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KardosKV12,
author = {Frantisek Kardos and
Daniel Kr{\'{a}}l' and
Jan Volec},
title = {Maximum edge-cuts in cubic graphs with large girth and in random cubic
graphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {506--520},
year = {2012},
url = {https://doi.org/10.1002/rsa.20471},
doi = {10.1002/RSA.20471},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KardosKV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KnoxKO12,
author = {Fiachra Knox and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Approximate Hamilton decompositions of random graphs},
journal = {Random Struct. Algorithms},
volume = {40},
number = {2},
pages = {133--149},
year = {2012},
url = {https://doi.org/10.1002/rsa.20365},
doi = {10.1002/RSA.20365},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KnoxKO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kulich12,
author = {Tom{\'{a}}s Kulich},
title = {The diameter of a random subgraph of the hypercube},
journal = {Random Struct. Algorithms},
volume = {41},
number = {2},
pages = {282--291},
year = {2012},
url = {https://doi.org/10.1002/rsa.20442},
doi = {10.1002/RSA.20442},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kulich12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LeeS12,
author = {Choongbum Lee and
Benny Sudakov},
title = {Dirac's theorem for random graphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {3},
pages = {293--305},
year = {2012},
url = {https://doi.org/10.1002/rsa.20419},
doi = {10.1002/RSA.20419},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LeeS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LuP12,
author = {Linyuan Lu and
Xing Peng},
title = {Loose laplacian spectra of random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {521--545},
year = {2012},
url = {https://doi.org/10.1002/rsa.20443},
doi = {10.1002/RSA.20443},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LuP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MadimanMT12,
author = {Mokshay M. Madiman and
Adam W. Marcus and
Prasad Tetali},
title = {Entropy and set cardinality inequalities for partition-determined
functions},
journal = {Random Struct. Algorithms},
volume = {40},
number = {4},
pages = {399--424},
year = {2012},
url = {https://doi.org/10.1002/rsa.20385},
doi = {10.1002/RSA.20385},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MadimanMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pegden12,
author = {Wesley Pegden},
title = {The lefthanded local lemma characterizes chordal dependency graphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {546--556},
year = {2012},
url = {https://doi.org/10.1002/rsa.20439},
doi = {10.1002/RSA.20439},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pegden12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Rath12,
author = {Bal{\'{a}}zs R{\'{a}}th},
title = {Time evolution of dense multigraph limits under edge-conservative
preferential attachment dynamics},
journal = {Random Struct. Algorithms},
volume = {41},
number = {3},
pages = {365--390},
year = {2012},
url = {https://doi.org/10.1002/rsa.20422},
doi = {10.1002/RSA.20422},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Rath12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RodlS12,
author = {Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Complete Partite subgraphs in dense hypergraphs},
journal = {Random Struct. Algorithms},
volume = {41},
number = {4},
pages = {557--573},
year = {2012},
url = {https://doi.org/10.1002/rsa.20441},
doi = {10.1002/RSA.20441},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RodlS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Shabanov12,
author = {Dmitry A. Shabanov},
title = {Random coloring method in the combinatorial problem of Erd{\H{o}}s
and Lov{\'{a}}sz},
journal = {Random Struct. Algorithms},
volume = {40},
number = {2},
pages = {227--253},
year = {2012},
url = {https://doi.org/10.1002/rsa.20366},
doi = {10.1002/RSA.20366},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Shabanov12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ShapiraY12,
author = {Asaf Shapira and
Raphael Yuster},
title = {The quasi-randomness of hypergraph cut properties},
journal = {Random Struct. Algorithms},
volume = {40},
number = {1},
pages = {105--131},
year = {2012},
url = {https://doi.org/10.1002/rsa.20364},
doi = {10.1002/RSA.20364},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ShapiraY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Wolfovitz12,
author = {Guy Wolfovitz},
title = {A concentration result with application to subgraph count},
journal = {Random Struct. Algorithms},
volume = {40},
number = {2},
pages = {254--267},
year = {2012},
url = {https://doi.org/10.1002/rsa.20371},
doi = {10.1002/RSA.20371},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Wolfovitz12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AchlioptasCR11,
author = {Dimitris Achlioptas and
Amin Coja{-}Oghlan and
Federico Ricci{-}Tersenghi},
title = {On the solution-space geometry of random constraint satisfaction problems},
journal = {Random Struct. Algorithms},
volume = {38},
number = {3},
pages = {251--268},
year = {2011},
url = {https://doi.org/10.1002/rsa.20323},
doi = {10.1002/RSA.20323},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AchlioptasCR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlmJL11,
author = {Sven Erick Alm and
Svante Janson and
Svante Linusson},
title = {Correlations for paths in random orientations of G(n, p) and G(n,
m)},
journal = {Random Struct. Algorithms},
volume = {39},
number = {4},
pages = {486--506},
year = {2011},
url = {https://doi.org/10.1002/rsa.20358},
doi = {10.1002/RSA.20358},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlmJL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonK11,
author = {Noga Alon and
Alexandr V. Kostochka},
title = {Hypergraph list coloring and Euclidean Ramsey theory},
journal = {Random Struct. Algorithms},
volume = {39},
number = {3},
pages = {377--390},
year = {2011},
url = {https://doi.org/10.1002/rsa.20361},
doi = {10.1002/RSA.20361},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghB11,
author = {J{\'{o}}zsef Balogh and
Jane Butterfield},
title = {Excluding induced subgraphs: Critical graphs},
journal = {Random Struct. Algorithms},
volume = {38},
number = {1-2},
pages = {100--120},
year = {2011},
url = {https://doi.org/10.1002/rsa.20353},
doi = {10.1002/RSA.20353},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghCS11,
author = {J{\'{o}}zsef Balogh and
B{\'{e}}la Csaba and
Wojciech Samotij},
title = {Local resilience of almost spanning trees in random graphs},
journal = {Random Struct. Algorithms},
volume = {38},
number = {1-2},
pages = {121--139},
year = {2011},
url = {https://doi.org/10.1002/rsa.20345},
doi = {10.1002/RSA.20345},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BaloghCS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarbourR11,
author = {Andrew D. Barbour and
Gesine Reinert},
title = {The shortest distance in random multi-type intersection graphs},
journal = {Random Struct. Algorithms},
volume = {39},
number = {2},
pages = {179--209},
year = {2011},
url = {https://doi.org/10.1002/rsa.20351},
doi = {10.1002/RSA.20351},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarbourR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Biskup11,
author = {Marek Biskup},
title = {Graph diameter in long-range percolation},
journal = {Random Struct. Algorithms},
volume = {39},
number = {2},
pages = {210--227},
year = {2011},
url = {https://doi.org/10.1002/rsa.20349},
doi = {10.1002/RSA.20349},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Biskup11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanFKLS11,
author = {Tom Bohman and
Alan M. Frieze and
Michael Krivelevich and
Po{-}Shen Loh and
Benny Sudakov},
title = {Ramsey games with giants},
journal = {Random Struct. Algorithms},
volume = {38},
number = {1-2},
pages = {1--32},
year = {2011},
url = {https://doi.org/10.1002/rsa.20343},
doi = {10.1002/RSA.20343},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BohmanFKLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasJR11,
author = {B{\'{e}}la Bollob{\'{a}}s and
Svante Janson and
Oliver Riordan},
title = {On covering by translates of a set},
journal = {Random Struct. Algorithms},
volume = {38},
number = {1-2},
pages = {33--67},
year = {2011},
url = {https://doi.org/10.1002/rsa.20346},
doi = {10.1002/RSA.20346},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasJR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasJR11a,
author = {B{\'{e}}la Bollob{\'{a}}s and
Svante Janson and
Oliver Riordan},
title = {Sparse random graphs with clustering},
journal = {Random Struct. Algorithms},
volume = {38},
number = {3},
pages = {269--323},
year = {2011},
url = {https://doi.org/10.1002/rsa.20322},
doi = {10.1002/RSA.20322},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasJR11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasR11,
author = {B{\'{e}}la Bollob{\'{a}}s and
Oliver Riordan},
title = {Sparse graphs: Metrics and random models},
journal = {Random Struct. Algorithms},
volume = {39},
number = {1},
pages = {1--38},
year = {2011},
url = {https://doi.org/10.1002/rsa.20334},
doi = {10.1002/RSA.20334},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CaputoMT11,
author = {Pietro Caputo and
Fabio Martinelli and
Fabio Lucio Toninelli},
title = {Convergence to equilibrium of biased plane Partitions},
journal = {Random Struct. Algorithms},
volume = {39},
number = {1},
pages = {83--114},
year = {2011},
url = {https://doi.org/10.1002/rsa.20339},
doi = {10.1002/RSA.20339},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CaputoMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChatterjeeD11,
author = {Shirshendu Chatterjee and
Rick Durrett},
title = {Persistence of activity in threshold contact processes, an "Annealed
approximation" of random Boolean networks},
journal = {Random Struct. Algorithms},
volume = {39},
number = {2},
pages = {228--246},
year = {2011},
url = {https://doi.org/10.1002/rsa.20357},
doi = {10.1002/RSA.20357},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChatterjeeD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChauDK11,
author = {Phong Ch{\^{a}}u and
Louis DeBiasio and
Hal A. Kierstead},
title = {P{\'{o}}sa's conjecture for graphs of order at least 2 {\texttimes}
10\({}^{\mbox{8}}\)},
journal = {Random Struct. Algorithms},
volume = {39},
number = {4},
pages = {507--525},
year = {2011},
url = {https://doi.org/10.1002/rsa.20376},
doi = {10.1002/RSA.20376},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChauDK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperF11,
author = {Colin Cooper and
Alan M. Frieze},
title = {The cover time of random geometric graphs},
journal = {Random Struct. Algorithms},
volume = {38},
number = {3},
pages = {324--349},
year = {2011},
url = {https://doi.org/10.1002/rsa.20320},
doi = {10.1002/RSA.20320},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperP11,
author = {Colin Cooper and
Pawel Pralat},
title = {Scale-free graphs of increasing degree},
journal = {Random Struct. Algorithms},
volume = {38},
number = {4},
pages = {396--421},
year = {2011},
url = {https://doi.org/10.1002/rsa.20318},
doi = {10.1002/RSA.20318},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CooperP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CzygrinowN11,
author = {Andrzej Czygrinow and
Brendan Nagle},
title = {On random sampling in uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {38},
number = {4},
pages = {422--440},
year = {2011},
url = {https://doi.org/10.1002/rsa.20326},
doi = {10.1002/RSA.20326},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CzygrinowN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DekelLL11,
author = {Yael Dekel and
James R. Lee and
Nathan Linial},
title = {Eigenvectors of random graphs: Nodal Domains},
journal = {Random Struct. Algorithms},
volume = {39},
number = {1},
pages = {39--58},
year = {2011},
url = {https://doi.org/10.1002/rsa.20330},
doi = {10.1002/RSA.20330},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DekelLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DevroyeJ11,
author = {Luc Devroye and
Svante Janson},
title = {Distances between pairs of vertices and vertical profile in conditioned
Galton-Watson trees},
journal = {Random Struct. Algorithms},
volume = {38},
number = {4},
pages = {381--395},
year = {2011},
url = {https://doi.org/10.1002/rsa.20319},
doi = {10.1002/RSA.20319},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DevroyeJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DingKLP11,
author = {Jian Ding and
Jeong Han Kim and
Eyal Lubetzky and
Yuval Peres},
title = {Anatomy of a young giant component in the random graph},
journal = {Random Struct. Algorithms},
volume = {39},
number = {2},
pages = {139--178},
year = {2011},
url = {https://doi.org/10.1002/rsa.20342},
doi = {10.1002/RSA.20342},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DingKLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FischerPS11,
author = {Felix A. Fischer and
Ariel D. Procaccia and
Alex Samorodnitsky},
title = {A new perspective on implementation by voting trees},
journal = {Random Struct. Algorithms},
volume = {39},
number = {1},
pages = {59--82},
year = {2011},
url = {https://doi.org/10.1002/rsa.20336},
doi = {10.1002/RSA.20336},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FischerPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FlaxmanGS11,
author = {Abraham Flaxman and
David Gamarnik and
Gregory B. Sorkin},
title = {First-passage percolation on a ladder graph, and the path cost in
a {VCG} auction},
journal = {Random Struct. Algorithms},
volume = {38},
number = {3},
pages = {350--364},
year = {2011},
url = {https://doi.org/10.1002/rsa.20328},
doi = {10.1002/RSA.20328},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FlaxmanGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FoxS11,
author = {Jacob Fox and
Benny Sudakov},
title = {Dependent random choice},
journal = {Random Struct. Algorithms},
volume = {38},
number = {1-2},
pages = {68--99},
year = {2011},
url = {https://doi.org/10.1002/rsa.20344},
doi = {10.1002/RSA.20344},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FoxS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriedrichSV11,
author = {Tobias Friedrich and
Thomas Sauerwald and
Dan Vilenchik},
title = {Smoothed analysis of balancing networks},
journal = {Random Struct. Algorithms},
volume = {39},
number = {1},
pages = {115--138},
year = {2011},
url = {https://doi.org/10.1002/rsa.20341},
doi = {10.1002/RSA.20341},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriedrichSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Gacs11,
author = {P{\'{e}}ter G{\'{a}}cs},
title = {Clairvoyant scheduling of random walks},
journal = {Random Struct. Algorithms},
volume = {39},
number = {4},
pages = {413--485},
year = {2011},
url = {https://doi.org/10.1002/rsa.20368},
doi = {10.1002/RSA.20368},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Gacs11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GrytczukPZ11,
author = {Jaroslaw Grytczuk and
Jakub Przybylo and
Xuding Zhu},
title = {Nonrepetitive list colourings of paths},
journal = {Random Struct. Algorithms},
volume = {38},
number = {1-2},
pages = {162--173},
year = {2011},
url = {https://doi.org/10.1002/rsa.20347},
doi = {10.1002/RSA.20347},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GrytczukPZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HinrichsV11,
author = {Aicke Hinrichs and
Jan Vyb{\'{\i}}ral},
title = {Johnson-Lindenstrauss lemma for circulant matrices},
journal = {Random Struct. Algorithms},
volume = {39},
number = {3},
pages = {391--398},
year = {2011},
url = {https://doi.org/10.1002/rsa.20360},
doi = {10.1002/RSA.20360},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HinrichsV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonR11,
author = {Svante Janson and
Oliver Riordan},
title = {Duality in inhomogeneous random graphs, and the cut metric},
journal = {Random Struct. Algorithms},
volume = {39},
number = {3},
pages = {399--411},
year = {2011},
url = {https://doi.org/10.1002/rsa.20348},
doi = {10.1002/RSA.20348},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Joseph11,
author = {Adrien Joseph},
title = {A phase transition for the heights of a fragmentation tree},
journal = {Random Struct. Algorithms},
volume = {39},
number = {2},
pages = {247--274},
year = {2011},
url = {https://doi.org/10.1002/rsa.20340},
doi = {10.1002/RSA.20340},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Joseph11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KangM11,
author = {Mihyun Kang and
Colin McDiarmid},
title = {Random unlabelled graphs containing few disjoint cycles},
journal = {Random Struct. Algorithms},
volume = {38},
number = {1-2},
pages = {174--204},
year = {2011},
url = {https://doi.org/10.1002/rsa.20355},
doi = {10.1002/RSA.20355},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KangM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Keevash11,
author = {Peter Keevash},
title = {A hypergraph blow-up lemma},
journal = {Random Struct. Algorithms},
volume = {39},
number = {3},
pages = {275--376},
year = {2011},
url = {https://doi.org/10.1002/rsa.20362},
doi = {10.1002/RSA.20362},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Keevash11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichSW11,
author = {Michael Krivelevich and
Benny Sudakov and
Nicholas C. Wormald},
title = {Regular induced subgraphs of a random Graph},
journal = {Random Struct. Algorithms},
volume = {38},
number = {3},
pages = {235--250},
year = {2011},
url = {https://doi.org/10.1002/rsa.20324},
doi = {10.1002/RSA.20324},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LatuszynskiKPR11,
author = {Krzysztof Latuszynski and
Ioannis Kosmidis and
Omiros Papaspiliopoulos and
Gareth O. Roberts},
title = {Simulating events of unknown probabilities via reverse time martingales},
journal = {Random Struct. Algorithms},
volume = {38},
number = {4},
pages = {441--452},
year = {2011},
url = {https://doi.org/10.1002/rsa.20333},
doi = {10.1002/RSA.20333},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LatuszynskiKPR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MahdianX11,
author = {Mohammad Mahdian and
Ying Xu},
title = {Stochastic kronecker graphs},
journal = {Random Struct. Algorithms},
volume = {38},
number = {4},
pages = {453--466},
year = {2011},
url = {https://doi.org/10.1002/rsa.20335},
doi = {10.1002/RSA.20335},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MahdianX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MarckertM11,
author = {Jean{-}Fran{\c{c}}ois Marckert and
Gr{\'{e}}gory Miermont},
title = {The {CRT} is the scaling limit of unordered binary trees},
journal = {Random Struct. Algorithms},
volume = {38},
number = {4},
pages = {467--501},
year = {2011},
url = {https://doi.org/10.1002/rsa.20332},
doi = {10.1002/RSA.20332},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MarckertM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pegden11,
author = {Wesley Pegden},
title = {Highly nonrepetitive sequences: Winning strategies from the local
lemma},
journal = {Random Struct. Algorithms},
volume = {38},
number = {1-2},
pages = {140--161},
year = {2011},
url = {https://doi.org/10.1002/rsa.20354},
doi = {10.1002/RSA.20354},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pegden11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PeledYY11,
author = {Ron Peled and
Ariel Yadin and
Amir Yehudayoff},
title = {The maximal probability that \emph{k}-wise independent bits are all
1},
journal = {Random Struct. Algorithms},
volume = {38},
number = {4},
pages = {502--525},
year = {2011},
url = {https://doi.org/10.1002/rsa.20329},
doi = {10.1002/RSA.20329},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/PeledYY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Rybarczyk11,
author = {Katarzyna Rybarczyk},
title = {Equivalence of a random intersection graph and \emph{G}(\emph{n},
\emph{p})},
journal = {Random Struct. Algorithms},
volume = {38},
number = {1-2},
pages = {205--234},
year = {2011},
url = {https://doi.org/10.1002/rsa.20356},
doi = {10.1002/RSA.20356},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Rybarczyk11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Salvy11,
author = {Bruno Salvy},
title = {In Memoriam: Philippe Flajolet The Father of Analytic Combinatorics},
journal = {Random Struct. Algorithms},
volume = {39},
number = {1},
pages = {iii--iv},
year = {2011},
url = {https://doi.org/10.1002/rsa.20377},
doi = {10.1002/RSA.20377},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Salvy11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Tran11,
author = {Linh V. Tran},
title = {Piercing random boxes},
journal = {Random Struct. Algorithms},
volume = {38},
number = {3},
pages = {365--380},
year = {2011},
url = {https://doi.org/10.1002/rsa.20321},
doi = {10.1002/RSA.20321},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Tran11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Vu11,
author = {Van Vu},
title = {Singular vectors under random perturbation},
journal = {Random Struct. Algorithms},
volume = {39},
number = {4},
pages = {526--538},
year = {2011},
url = {https://doi.org/10.1002/rsa.20367},
doi = {10.1002/RSA.20367},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Vu11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Wolfovitz11,
author = {Guy Wolfovitz},
title = {Triangle-free subgraphs in the triangle-free process},
journal = {Random Struct. Algorithms},
volume = {39},
number = {4},
pages = {539--543},
year = {2011},
url = {https://doi.org/10.1002/rsa.20378},
doi = {10.1002/RSA.20378},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Wolfovitz11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AldousB10,
author = {David J. Aldous and
Shankar Bhamidi},
title = {Edge flows in the complete random-lengths network},
journal = {Random Struct. Algorithms},
volume = {37},
number = {3},
pages = {271--311},
year = {2010},
url = {https://doi.org/10.1002/rsa.20306},
doi = {10.1002/RSA.20306},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AldousB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AustinT10,
author = {Tim Austin and
Terence Tao},
title = {Testability and repair of hereditary hypergraph properties},
journal = {Random Struct. Algorithms},
volume = {36},
number = {4},
pages = {373--463},
year = {2010},
url = {https://doi.org/10.1002/rsa.20300},
doi = {10.1002/RSA.20300},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AustinT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Bakhtin10,
author = {Yuri Bakhtin},
title = {Thermodynamic limit for large random trees},
journal = {Random Struct. Algorithms},
volume = {37},
number = {3},
pages = {312--331},
year = {2010},
url = {https://doi.org/10.1002/rsa.20317},
doi = {10.1002/RSA.20317},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Bakhtin10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalisterB10,
author = {Paul N. Balister and
B{\'{e}}la Bollob{\'{a}}s},
title = {Bond percolation with attenuation in high dimensional Voronoi tilings},
journal = {Random Struct. Algorithms},
volume = {36},
number = {1},
pages = {5--10},
year = {2010},
url = {https://doi.org/10.1002/rsa.20295},
doi = {10.1002/RSA.20295},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BalisterB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalisterBJW10,
author = {Paul Balister and
B{\'{e}}la Bollob{\'{a}}s and
J. Robert Johnson and
Mark Walters},
title = {Random majority percolation},
journal = {Random Struct. Algorithms},
volume = {36},
number = {3},
pages = {315--340},
year = {2010},
url = {https://doi.org/10.1002/rsa.20281},
doi = {10.1002/RSA.20281},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BalisterBJW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarvinokLSY10,
author = {Alexander I. Barvinok and
Zur Luria and
Alex Samorodnitsky and
Alexander Yong},
title = {An approximation algorithm for counting contingency tables},
journal = {Random Struct. Algorithms},
volume = {37},
number = {1},
pages = {25--66},
year = {2010},
url = {https://doi.org/10.1002/rsa.20301},
doi = {10.1002/RSA.20301},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarvinokLSY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BehrischCK10,
author = {Michael Behrisch and
Amin Coja{-}Oghlan and
Mihyun Kang},
title = {The order of the giant component of random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {36},
number = {2},
pages = {149--184},
year = {2010},
url = {https://doi.org/10.1002/rsa.20282},
doi = {10.1002/RSA.20282},
timestamp = {Wed, 24 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BehrischCK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BertoinSV10,
author = {Jean Bertoin and
Vladas Sidoravicius and
Maria Eulalia Vares},
title = {A system of grabbing particles related to Galton-Watson trees},
journal = {Random Struct. Algorithms},
volume = {36},
number = {4},
pages = {477--487},
year = {2010},
url = {https://doi.org/10.1002/rsa.20310},
doi = {10.1002/RSA.20310},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BertoinSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhamidiRR10,
author = {Shankar Bhamidi and
Ram Rajagopal and
S{\'{e}}bastien Roch},
title = {Network delay inference from additive metrics},
journal = {Random Struct. Algorithms},
volume = {37},
number = {2},
pages = {176--203},
year = {2010},
url = {https://doi.org/10.1002/rsa.20305},
doi = {10.1002/RSA.20305},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BhamidiRR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanFM10,
author = {Tom Bohman and
Alan M. Frieze and
Dhruv Mubayi},
title = {Coloring H-free hypergraphs},
journal = {Random Struct. Algorithms},
volume = {36},
number = {1},
pages = {11--25},
year = {2010},
url = {https://doi.org/10.1002/rsa.20298},
doi = {10.1002/RSA.20298},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BohmanFM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BordenaveL10,
author = {Charles Bordenave and
Marc Lelarge},
title = {Resolvent of large random graphs},
journal = {Random Struct. Algorithms},
volume = {37},
number = {3},
pages = {332--352},
year = {2010},
url = {https://doi.org/10.1002/rsa.20313},
doi = {10.1002/RSA.20313},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BordenaveL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BorgsCGS10,
author = {Christian Borgs and
Jennifer T. Chayes and
Ayalvadi Ganesh and
Amin Saberi},
title = {How to distribute antidote to control epidemics},
journal = {Random Struct. Algorithms},
volume = {37},
number = {2},
pages = {204--222},
year = {2010},
url = {https://doi.org/10.1002/rsa.20315},
doi = {10.1002/RSA.20315},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BorgsCGS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BrightwellG10,
author = {Graham R. Brightwell and
Nicholas Georgiou},
title = {Continuum limits for classical sequential growth models},
journal = {Random Struct. Algorithms},
volume = {36},
number = {2},
pages = {218--250},
year = {2010},
url = {https://doi.org/10.1002/rsa.20278},
doi = {10.1002/RSA.20278},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BrightwellG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Capalbo10,
author = {Michael R. Capalbo},
title = {Explicit sparse almost-universal graphs for G(n, k/n)},
journal = {Random Struct. Algorithms},
volume = {37},
number = {4},
pages = {437--454},
year = {2010},
url = {https://doi.org/10.1002/rsa.20337},
doi = {10.1002/RSA.20337},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Capalbo10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CillerueloKRV10,
author = {Javier Cilleruelo and
S{\'{a}}ndor Z. Kiss and
Imre Z. Ruzsa and
Carlos Vinuesa},
title = {Generalization of a theorem of Erdos and R{\'{e}}nyi on Sidon
sequences},
journal = {Random Struct. Algorithms},
volume = {37},
number = {4},
pages = {455--464},
year = {2010},
url = {https://doi.org/10.1002/rsa.20350},
doi = {10.1002/RSA.20350},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CillerueloKRV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperDFS10,
author = {Joshua N. Cooper and
Benjamin Doerr and
Tobias Friedrich and
Joel Spencer},
title = {Deterministic random walks on regular trees},
journal = {Random Struct. Algorithms},
volume = {37},
number = {3},
pages = {353--366},
year = {2010},
url = {https://doi.org/10.1002/rsa.20314},
doi = {10.1002/RSA.20314},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperDFS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DombryM10,
author = {Cl{\'{e}}ment Dombry and
Christian Mazza},
title = {Some remarks on Betti numbers of random polygon spaces},
journal = {Random Struct. Algorithms},
volume = {37},
number = {1},
pages = {67--84},
year = {2010},
url = {https://doi.org/10.1002/rsa.20291},
doi = {10.1002/RSA.20291},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DombryM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrmotaGN10,
author = {Michael Drmota and
Omer Gim{\'{e}}nez and
Marc Noy},
title = {Vertices of given degree in series-parallel graphs},
journal = {Random Struct. Algorithms},
volume = {36},
number = {3},
pages = {273--314},
year = {2010},
url = {https://doi.org/10.1002/rsa.20290},
doi = {10.1002/RSA.20290},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DrmotaGN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerF10,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Randomly coloring random graphs},
journal = {Random Struct. Algorithms},
volume = {36},
number = {3},
pages = {251--272},
year = {2010},
url = {https://doi.org/10.1002/rsa.20286},
doi = {10.1002/RSA.20286},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Elek10,
author = {G{\'{a}}bor Elek},
title = {Parameter testing in bounded degree graphs of subexponential growth},
journal = {Random Struct. Algorithms},
volume = {37},
number = {2},
pages = {248--270},
year = {2010},
url = {https://doi.org/10.1002/rsa.20308},
doi = {10.1002/RSA.20308},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Elek10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FlemingP10,
author = {Kevin Fleming and
Nicholas Pippenger},
title = {Large deviations and moments for the Euler characteristic of a random
surface},
journal = {Random Struct. Algorithms},
volume = {37},
number = {4},
pages = {465--476},
year = {2010},
url = {https://doi.org/10.1002/rsa.20331},
doi = {10.1002/RSA.20331},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FlemingP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriedgutRS10,
author = {Ehud Friedgut and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {Ramsey properties of random discrete structures},
journal = {Random Struct. Algorithms},
volume = {37},
number = {4},
pages = {407--436},
year = {2010},
url = {https://doi.org/10.1002/rsa.20352},
doi = {10.1002/RSA.20352},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FriedgutRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoldbergJK10,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Marek Karpinski},
title = {The mixing time of Glauber dynamics for coloring regular trees},
journal = {Random Struct. Algorithms},
volume = {36},
number = {4},
pages = {464--476},
year = {2010},
url = {https://doi.org/10.1002/rsa.20303},
doi = {10.1002/RSA.20303},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GoldbergJK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GrimmettJ10,
author = {Geoffrey R. Grimmett and
Svante Janson},
title = {Random graphs with forbidden vertex degrees},
journal = {Random Struct. Algorithms},
volume = {37},
number = {2},
pages = {137--175},
year = {2010},
url = {https://doi.org/10.1002/rsa.20307},
doi = {10.1002/RSA.20307},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GrimmettJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GrimmettLR10,
author = {Geoffrey R. Grimmett and
Thomas M. Liggett and
Thomas Richthammer},
title = {Percolation of arbitrary words in one dimension},
journal = {Random Struct. Algorithms},
volume = {37},
number = {1},
pages = {85--99},
year = {2010},
url = {https://doi.org/10.1002/rsa.20312},
doi = {10.1002/RSA.20312},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GrimmettLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HofstadLS10,
author = {Remco van der Hofstad and
Malwina J. Luczak and
Joel Spencer},
title = {The second largest component in the supercritical 2D Hamming graph},
journal = {Random Struct. Algorithms},
volume = {36},
number = {1},
pages = {80--89},
year = {2010},
url = {https://doi.org/10.1002/rsa.20288},
doi = {10.1002/RSA.20288},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HofstadLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ItohW10,
author = {Toshiya Itoh and
Osamu Watanabe},
title = {Weighted random popular matchings},
journal = {Random Struct. Algorithms},
volume = {37},
number = {4},
pages = {477--494},
year = {2010},
url = {https://doi.org/10.1002/rsa.20316},
doi = {10.1002/RSA.20316},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ItohW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson10,
author = {Svante Janson},
title = {Asymptotic equivalence and contiguity of some random graphs},
journal = {Random Struct. Algorithms},
volume = {36},
number = {1},
pages = {26--45},
year = {2010},
url = {https://doi.org/10.1002/rsa.20297},
doi = {10.1002/RSA.20297},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KahnN10,
author = {Jeff Kahn and
M. Neiman},
title = {Negative correlation and log-concavity},
journal = {Random Struct. Algorithms},
volume = {37},
number = {3},
pages = {367--388},
year = {2010},
url = {https://doi.org/10.1002/rsa.20292},
doi = {10.1002/RSA.20292},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KahnN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KostochkaR10,
author = {Alexandr V. Kostochka and
Vojtech R{\"{o}}dl},
title = {Constructions of sparse uniform hypergraphs with high chromatic number},
journal = {Random Struct. Algorithms},
volume = {36},
number = {1},
pages = {46--56},
year = {2010},
url = {https://doi.org/10.1002/rsa.20293},
doi = {10.1002/RSA.20293},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KostochkaR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichLS10,
author = {Michael Krivelevich and
Eyal Lubetzky and
Benny Sudakov},
title = {Hamiltonicity thresholds in Achlioptas processes},
journal = {Random Struct. Algorithms},
volume = {37},
number = {1},
pages = {1--24},
year = {2010},
url = {https://doi.org/10.1002/rsa.20302},
doi = {10.1002/RSA.20302},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichSS10,
author = {Michael Krivelevich and
Reto Sp{\"{o}}hel and
Angelika Steger},
title = {Offline thresholds for Ramsey-type games on random graphs},
journal = {Random Struct. Algorithms},
volume = {36},
number = {1},
pages = {57--79},
year = {2010},
url = {https://doi.org/10.1002/rsa.20294},
doi = {10.1002/RSA.20294},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LiitiainenLC10,
author = {Elia Liiti{\"{a}}inen and
Amaury Lendasse and
Francesco Corona},
title = {A boundary corrected expansion of the moments of nearest neighbor
distributions},
journal = {Random Struct. Algorithms},
volume = {37},
number = {2},
pages = {223--247},
year = {2010},
url = {https://doi.org/10.1002/rsa.20311},
doi = {10.1002/RSA.20311},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LiitiainenLC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LinialP10,
author = {Nati Linial and
Doron Puder},
title = {Word maps and spectra of random graph lifts},
journal = {Random Struct. Algorithms},
volume = {37},
number = {1},
pages = {100--135},
year = {2010},
url = {https://doi.org/10.1002/rsa.20304},
doi = {10.1002/RSA.20304},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LinialP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LuczakP10,
author = {Tomasz Luczak and
Pawel Pralat},
title = {Chasing robbers on random graphs: Zigzag theorem},
journal = {Random Struct. Algorithms},
volume = {37},
number = {4},
pages = {516--524},
year = {2010},
url = {https://doi.org/10.1002/rsa.20338},
doi = {10.1002/RSA.20338},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LuczakP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Mieghem10,
author = {Piet Van Mieghem},
title = {Weight of a link in a shortest path tree and the Dedekind Eta function},
journal = {Random Struct. Algorithms},
volume = {36},
number = {3},
pages = {341--371},
year = {2010},
url = {https://doi.org/10.1002/rsa.20299},
doi = {10.1002/RSA.20299},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Mieghem10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NachmiasP10,
author = {Asaf Nachmias and
Yuval Peres},
title = {Critical percolation on random regular graphs},
journal = {Random Struct. Algorithms},
volume = {36},
number = {2},
pages = {111--148},
year = {2010},
url = {https://doi.org/10.1002/rsa.20277},
doi = {10.1002/RSA.20277},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NachmiasP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PetrovV10,
author = {Fedor Petrov and
Anatoly M. Vershik},
title = {Uncountable graphs and invariant measures on the set of universal
countable graphs},
journal = {Random Struct. Algorithms},
volume = {37},
number = {3},
pages = {389--406},
year = {2010},
url = {https://doi.org/10.1002/rsa.20309},
doi = {10.1002/RSA.20309},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PetrovV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ShapiraY10,
author = {Asaf Shapira and
Raphael Yuster},
title = {The effect of induced subgraphs on quasi-randomness},
journal = {Random Struct. Algorithms},
volume = {36},
number = {1},
pages = {90--109},
year = {2010},
url = {https://doi.org/10.1002/rsa.20289},
doi = {10.1002/RSA.20289},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ShapiraY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Spencer10,
author = {Joel Spencer},
title = {Phase transitions for random structures and algorithms},
journal = {Random Struct. Algorithms},
volume = {36},
number = {1},
pages = {1--4},
year = {2010},
url = {https://doi.org/10.1002/rsa.20296},
doi = {10.1002/RSA.20296},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Spencer10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TaoV10,
author = {Terence Tao and
Van H. Vu},
title = {A sharp inverse Littlewood-Offord theorem},
journal = {Random Struct. Algorithms},
volume = {37},
number = {4},
pages = {525--539},
year = {2010},
url = {https://doi.org/10.1002/rsa.20327},
doi = {10.1002/RSA.20327},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TaoV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TurovaV10,
author = {Tatyana S. Turova and
Thomas Vallier},
title = {Merging percolation on \emph{Z}\({}^{\mbox{\emph{d}}}\) and classical
random graphs: Phase transition},
journal = {Random Struct. Algorithms},
volume = {36},
number = {2},
pages = {185--217},
year = {2010},
url = {https://doi.org/10.1002/rsa.20287},
doi = {10.1002/RSA.20287},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TurovaV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ValiantR10,
author = {Gregory Valiant and
Tim Roughgarden},
title = {Braess's Paradox in large random graphs},
journal = {Random Struct. Algorithms},
volume = {37},
number = {4},
pages = {495--515},
year = {2010},
url = {https://doi.org/10.1002/rsa.20325},
doi = {10.1002/RSA.20325},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ValiantR10.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/rsa/AlonK09,
author = {Noga Alon and
Alexandr V. Kostochka},
title = {Induced subgraphs with distinct sizes},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {45--53},
year = {2009},
url = {https://doi.org/10.1002/rsa.20250},
doi = {10.1002/RSA.20250},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AmbrusB09,
author = {Gergely Ambrus and
Imre B{\'{a}}r{\'{a}}ny},
title = {Longest convex chains},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
pages = {137--162},
year = {2009},
url = {https://doi.org/10.1002/rsa.20269},
doi = {10.1002/RSA.20269},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AmbrusB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghBS09,
author = {J{\'{o}}zsef Balogh and
B{\'{e}}la Bollob{\'{a}}s and
Mikl{\'{o}}s Simonovits},
title = {The typical structure of graphs without given excluded subgraphs},
journal = {Random Struct. Algorithms},
volume = {34},
number = {3},
pages = {305--318},
year = {2009},
url = {https://doi.org/10.1002/rsa.20242},
doi = {10.1002/RSA.20242},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghBS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghMP09,
author = {J{\'{o}}zsef Balogh and
Ryan R. Martin and
Andr{\'{a}}s Pluh{\'{a}}r},
title = {The diameter game},
journal = {Random Struct. Algorithms},
volume = {35},
number = {3},
pages = {369--389},
year = {2009},
url = {https://doi.org/10.1002/rsa.20280},
doi = {10.1002/RSA.20280},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BanderierKP09,
author = {Cyril Banderier and
Markus Kuba and
Alois Panholzer},
title = {Analysis of three graph parameters for random trees},
journal = {Random Struct. Algorithms},
volume = {35},
number = {1},
pages = {42--69},
year = {2009},
url = {https://doi.org/10.1002/rsa.20259},
doi = {10.1002/RSA.20259},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BanderierKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BergL09,
author = {Jacob van den Berg and
Bernardo N. B. de Lima},
title = {Linear lower bounds for delta\({}_{\mbox{\emph{c}}}\)(\emph{p}) for
a class of 2D self-destructive percolation models},
journal = {Random Struct. Algorithms},
volume = {34},
number = {4},
pages = {520--526},
year = {2009},
url = {https://doi.org/10.1002/rsa.20265},
doi = {10.1002/RSA.20265},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BergL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanF09,
author = {Tom Bohman and
Alan M. Frieze},
title = {Hamilton cycles in 3-out},
journal = {Random Struct. Algorithms},
volume = {35},
number = {4},
pages = {393--417},
year = {2009},
url = {https://doi.org/10.1002/rsa.20272},
doi = {10.1002/RSA.20272},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BohmanF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasR09,
author = {B{\'{e}}la Bollob{\'{a}}s and
Oliver Riordan},
title = {Clique percolation},
journal = {Random Struct. Algorithms},
volume = {35},
number = {3},
pages = {294--322},
year = {2009},
url = {https://doi.org/10.1002/rsa.20270},
doi = {10.1002/RSA.20270},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BorgsCMN09,
author = {Christian Borgs and
Jennifer T. Chayes and
Stephan Mertens and
Chandra Nair},
title = {Proof of the local {REM} conjecture for number partitioning. {I:}
Constant energy scales},
journal = {Random Struct. Algorithms},
volume = {34},
number = {2},
pages = {217--240},
year = {2009},
url = {https://doi.org/10.1002/rsa.20255},
doi = {10.1002/RSA.20255},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BorgsCMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BorgsCMN09a,
author = {Christian Borgs and
Jennifer T. Chayes and
Stephan Mertens and
Chandra Nair},
title = {Proof of the local {REM} conjecture for number partitioning. {II.}
Growing energy scales},
journal = {Random Struct. Algorithms},
volume = {34},
number = {2},
pages = {241--284},
year = {2009},
url = {https://doi.org/10.1002/rsa.20256},
doi = {10.1002/RSA.20256},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BorgsCMN09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BorkarEF09,
author = {Vivek S. Borkar and
Vladimir Ejov and
Jerzy A. Filar},
title = {On the Hamiltonicity Gap and doubly stochastic matrices},
journal = {Random Struct. Algorithms},
volume = {34},
number = {4},
pages = {502--519},
year = {2009},
url = {https://doi.org/10.1002/rsa.20237},
doi = {10.1002/RSA.20237},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BorkarEF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CalinescuCV09,
author = {Gruia C{\u{a}}linescu and
Chandra Chekuri and
Jan Vondr{\'{a}}k},
title = {Disjoint bases in a polymatroid},
journal = {Random Struct. Algorithms},
volume = {35},
number = {4},
pages = {418--430},
year = {2009},
url = {https://doi.org/10.1002/rsa.20274},
doi = {10.1002/RSA.20274},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CalinescuCV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChenPST09,
author = {Xiaomin Chen and
J{\'{a}}nos Pach and
Mario Szegedy and
G{\'{a}}bor Tardos},
title = {Delaunay graphs of point sets in the plane with respect to axis-parallel
rectangles},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {11--23},
year = {2009},
url = {https://doi.org/10.1002/rsa.20246},
doi = {10.1002/RSA.20246},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChenPST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ConlonFS09,
author = {David Conlon and
Jacob Fox and
Benny Sudakov},
title = {Ramsey numbers of sparse hypergraphs},
journal = {Random Struct. Algorithms},
volume = {35},
number = {1},
pages = {1--14},
year = {2009},
url = {https://doi.org/10.1002/rsa.20260},
doi = {10.1002/RSA.20260},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ConlonFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperF09,
author = {Colin Cooper and
Alan M. Frieze},
title = {Corrigendum: The cover time of the giant component of a random graph,
Random Structures and Algorithms 32 (2008), 401-439},
journal = {Random Struct. Algorithms},
volume = {34},
number = {2},
pages = {300--304},
year = {2009},
url = {https://doi.org/10.1002/rsa.20258},
doi = {10.1002/RSA.20258},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CotarHR09,
author = {Codina Cotar and
Alexander E. Holroyd and
David Revelle},
title = {A percolating hard sphere model},
journal = {Random Struct. Algorithms},
volume = {34},
number = {2},
pages = {285--299},
year = {2009},
url = {https://doi.org/10.1002/rsa.20230},
doi = {10.1002/RSA.20230},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CotarHR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DevroyeLPS09,
author = {Luc Devroye and
G{\'{a}}bor Lugosi and
GaHyun Park and
Wojciech Szpankowski},
title = {Multiple choice tries and distributed hash tables},
journal = {Random Struct. Algorithms},
volume = {34},
number = {3},
pages = {337--367},
year = {2009},
url = {https://doi.org/10.1002/rsa.20234},
doi = {10.1002/RSA.20234},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DevroyeLPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrmotaIMR09,
author = {Michael Drmota and
Alexander Iksanov and
Martin M{\"{o}}hle and
Uwe Roesler},
title = {A limiting distribution for the number of cuts needed to isolate the
root of a random recursive tree},
journal = {Random Struct. Algorithms},
volume = {34},
number = {3},
pages = {319--336},
year = {2009},
url = {https://doi.org/10.1002/rsa.20233},
doi = {10.1002/RSA.20233},
timestamp = {Sun, 30 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DrmotaIMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FinchS09,
author = {Steven Finch and
Pascal Sebah},
title = {Comment on "Volumes spanned by random points in the hypercube"},
journal = {Random Struct. Algorithms},
volume = {35},
number = {3},
pages = {390--392},
year = {2009},
url = {https://doi.org/10.1002/rsa.20271},
doi = {10.1002/RSA.20271},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FinchS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FountoulakisKO09,
author = {Nikolaos Fountoulakis and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Minors in random regular graphs},
journal = {Random Struct. Algorithms},
volume = {35},
number = {4},
pages = {444--463},
year = {2009},
url = {https://doi.org/10.1002/rsa.20285},
doi = {10.1002/RSA.20285},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FountoulakisKO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Fusy09,
author = {{\'{E}}ric Fusy},
title = {Uniform random sampling of planar graphs in linear time},
journal = {Random Struct. Algorithms},
volume = {35},
number = {4},
pages = {464--522},
year = {2009},
url = {https://doi.org/10.1002/rsa.20275},
doi = {10.1002/RSA.20275},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Fusy09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GamburdHSSV09,
author = {Alexander Gamburd and
Shlomo Hoory and
Mehrdad Shahshahani and
Aner Shalev and
B{\'{a}}lint Vir{\'{a}}g},
title = {On the girth of random Cayley graphs},
journal = {Random Struct. Algorithms},
volume = {35},
number = {1},
pages = {100--117},
year = {2009},
url = {https://doi.org/10.1002/rsa.20266},
doi = {10.1002/RSA.20266},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GamburdHSSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GaoW09,
author = {Pu Gao and
Nicholas C. Wormald},
title = {Short cycle distribution in random regular graphs recursively generated
by pegging},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {54--86},
year = {2009},
url = {https://doi.org/10.1002/rsa.20253},
doi = {10.1002/RSA.20253},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GaoW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GebauerS09,
author = {Heidi Gebauer and
Tibor Szab{\'{o}}},
title = {Asymptotic random graph intuition for the biased connectivity game},
journal = {Random Struct. Algorithms},
volume = {35},
number = {4},
pages = {431--443},
year = {2009},
url = {https://doi.org/10.1002/rsa.20279},
doi = {10.1002/RSA.20279},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GebauerS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GreenhillM09,
author = {Catherine S. Greenhill and
Brendan D. McKay},
title = {Random dense bipartite graphs and directed graphs with specified degrees},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
pages = {222--249},
year = {2009},
url = {https://doi.org/10.1002/rsa.20273},
doi = {10.1002/RSA.20273},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GreenhillM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GuilleminR09,
author = {Fabrice Guillemin and
Philippe Robert},
title = {Analysis of Steiner subtrees of random trees for traceroute algorithms},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
pages = {194--215},
year = {2009},
url = {https://doi.org/10.1002/rsa.20263},
doi = {10.1002/RSA.20263},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GuilleminR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HansenJ09,
author = {Jennie C. Hansen and
Jerzy Jaworski},
title = {A random mapping with preferential attachment},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {87--111},
year = {2009},
url = {https://doi.org/10.1002/rsa.20251},
doi = {10.1002/RSA.20251},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HansenJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HefetzKSS09,
author = {Dan Hefetz and
Michael Krivelevich and
Milos Stojakovic and
Tibor Szab{\'{o}}},
title = {A sharp threshold for the Hamilton cycle Maker-Breaker game},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {112--122},
year = {2009},
url = {https://doi.org/10.1002/rsa.20252},
doi = {10.1002/RSA.20252},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HefetzKSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HegartyM09,
author = {Peter Hegarty and
Steven J. Miller},
title = {When almost all sets are difference dominated},
journal = {Random Struct. Algorithms},
volume = {35},
number = {1},
pages = {118--136},
year = {2009},
url = {https://doi.org/10.1002/rsa.20268},
doi = {10.1002/RSA.20268},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HegartyM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonL09,
author = {Svante Janson and
Malwina J. Luczak},
title = {A new approach to the giant component problem},
journal = {Random Struct. Algorithms},
volume = {34},
number = {2},
pages = {197--216},
year = {2009},
url = {https://doi.org/10.1002/rsa.20231},
doi = {10.1002/RSA.20231},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JutlaPRZ09,
author = {Charanjit S. Jutla and
Anindya C. Patthak and
Atri Rudra and
David Zuckerman},
title = {Testing low-degree polynomials over prime fields},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
pages = {163--193},
year = {2009},
url = {https://doi.org/10.1002/rsa.20262},
doi = {10.1002/RSA.20262},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JutlaPRZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Keevash09,
author = {Peter Keevash},
title = {A hypergraph regularity method for generalized Tur{\'{a}}n problems},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {123--164},
year = {2009},
url = {https://doi.org/10.1002/rsa.20249},
doi = {10.1002/RSA.20249},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Keevash09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KostochkaK09,
author = {Alexandr V. Kostochka and
Mohit Kumbhat},
title = {Coloring uniform hypergraphs with few edges},
journal = {Random Struct. Algorithms},
volume = {35},
number = {3},
pages = {348--368},
year = {2009},
url = {https://doi.org/10.1002/rsa.20284},
doi = {10.1002/RSA.20284},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KostochkaK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichLS09,
author = {Michael Krivelevich and
Po{-}Shen Loh and
Benny Sudakov},
title = {Avoiding small subgraphs in Achlioptas processes},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {165--195},
year = {2009},
url = {https://doi.org/10.1002/rsa.20254},
doi = {10.1002/RSA.20254},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichP09,
author = {Michael Krivelevich and
Bal{\'{a}}zs Patk{\'{o}}s},
title = {Equitable coloring of random graphs},
journal = {Random Struct. Algorithms},
volume = {35},
number = {1},
pages = {83--99},
year = {2009},
url = {https://doi.org/10.1002/rsa.20264},
doi = {10.1002/RSA.20264},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LinialS09,
author = {Nati Linial and
Adi Shraibman},
title = {Lower bounds in communication complexity based on factorization norms},
journal = {Random Struct. Algorithms},
volume = {34},
number = {3},
pages = {368--394},
year = {2009},
url = {https://doi.org/10.1002/rsa.20232},
doi = {10.1002/RSA.20232},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LinialS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LuczakS09,
author = {Tomasz Luczak and
Taral Guldahl Seierstad},
title = {The critical behavior of random digraphs},
journal = {Random Struct. Algorithms},
volume = {35},
number = {3},
pages = {271--293},
year = {2009},
url = {https://doi.org/10.1002/rsa.20283},
doi = {10.1002/RSA.20283},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LuczakS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MarciniszynSSS09,
author = {Martin Marciniszyn and
Jozef Skokan and
Reto Sp{\"{o}}hel and
Angelika Steger},
title = {Asymmetric Ramsey properties of random graphs involving cliques},
journal = {Random Struct. Algorithms},
volume = {34},
number = {4},
pages = {419--453},
year = {2009},
url = {https://doi.org/10.1002/rsa.20239},
doi = {10.1002/RSA.20239},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MarciniszynSSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MeshulamW09,
author = {Roy Meshulam and
N. Wallach},
title = {Homological connectivity of random \emph{k}-dimensional complexes},
journal = {Random Struct. Algorithms},
volume = {34},
number = {3},
pages = {408--417},
year = {2009},
url = {https://doi.org/10.1002/rsa.20238},
doi = {10.1002/RSA.20238},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MeshulamW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Montenegro09,
author = {Ravi Montenegro},
title = {The simple random walk and max-degree walk on a directed graph},
journal = {Random Struct. Algorithms},
volume = {34},
number = {3},
pages = {395--407},
year = {2009},
url = {https://doi.org/10.1002/rsa.20227},
doi = {10.1002/RSA.20227},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Montenegro09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MosselS09,
author = {Elchanan Mossel and
Allan Sly},
title = {Rapid mixing of Gibbs sampling on graphs that are sparse on average},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
pages = {250--270},
year = {2009},
url = {https://doi.org/10.1002/rsa.20276},
doi = {10.1002/RSA.20276},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MosselS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Newman09,
author = {Ilan Newman},
title = {Computing in fault tolerant broadcast networks and noisy decision
trees},
journal = {Random Struct. Algorithms},
volume = {34},
number = {4},
pages = {478--501},
year = {2009},
url = {https://doi.org/10.1002/rsa.20240},
doi = {10.1002/RSA.20240},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Newman09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Oliveira09,
author = {Roberto Imbuzeiro Oliveira},
title = {The onset of dominance in balls-in-bins processes with feedback},
journal = {Random Struct. Algorithms},
volume = {34},
number = {4},
pages = {454--477},
year = {2009},
url = {https://doi.org/10.1002/rsa.20261},
doi = {10.1002/RSA.20261},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Oliveira09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pagh09,
author = {Rasmus Pagh},
title = {Dispersing hash functions},
journal = {Random Struct. Algorithms},
volume = {35},
number = {1},
pages = {70--82},
year = {2009},
url = {https://doi.org/10.1002/rsa.20257},
doi = {10.1002/RSA.20257},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pagh09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pedersen09,
author = {Kasper Pedersen},
title = {On systematic scan for sampling H-colorings of the path},
journal = {Random Struct. Algorithms},
volume = {35},
number = {1},
pages = {15--41},
year = {2009},
url = {https://doi.org/10.1002/rsa.20243},
doi = {10.1002/RSA.20243},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pedersen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pluhar09,
author = {Andr{\'{a}}s Pluh{\'{a}}r},
title = {Greedy colorings of uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
pages = {216--221},
year = {2009},
url = {https://doi.org/10.1002/rsa.20267},
doi = {10.1002/RSA.20267},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pluhar09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RubinfeldS09,
author = {Ronitt Rubinfeld and
Rocco A. Servedio},
title = {Testing monotone high-dimensional distributions},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {24--44},
year = {2009},
url = {https://doi.org/10.1002/rsa.20247},
doi = {10.1002/RSA.20247},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RubinfeldS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Ruzsa09,
author = {Imre Z. Ruzsa},
title = {Sumsets and entropy},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {1--10},
year = {2009},
url = {https://doi.org/10.1002/rsa.20248},
doi = {10.1002/RSA.20248},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Ruzsa09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonS08,
author = {Noga Alon and
Uri Stav},
title = {What is the furthest graph from a hereditary property?},
journal = {Random Struct. Algorithms},
volume = {33},
number = {1},
pages = {87--104},
year = {2008},
url = {https://doi.org/10.1002/rsa.20209},
doi = {10.1002/RSA.20209},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AngelBOW08,
author = {Omer Angel and
Itai Benjamini and
Eran Ofek and
Udi Wieder},
title = {Routing complexity of faulty networks},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {71--87},
year = {2008},
url = {https://doi.org/10.1002/rsa.20163},
doi = {10.1002/RSA.20163},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AngelBOW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BandyopadhyayG08,
author = {Antar Bandyopadhyay and
David Gamarnik},
title = {Counting without sampling: Asymptotics of the log-partition function
for certain statistical physics models},
journal = {Random Struct. Algorithms},
volume = {33},
number = {4},
pages = {452--479},
year = {2008},
url = {https://doi.org/10.1002/rsa.20236},
doi = {10.1002/RSA.20236},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BandyopadhyayG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BeisDZ08,
author = {Mihalis Beis and
William Duckworth and
Michele Zito},
title = {Packing vertices and edges in random regular graphs},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {20--37},
year = {2008},
url = {https://doi.org/10.1002/rsa.20165},
doi = {10.1002/RSA.20165},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BeisDZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Ben-orCLR08,
author = {Michael Ben{-}Or and
Don Coppersmith and
Michael Luby and
Ronitt Rubinfeld},
title = {Non-abelian homomorphism testing, and distributions close to their
self-convolutions},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {49--70},
year = {2008},
url = {https://doi.org/10.1002/rsa.20182},
doi = {10.1002/RSA.20182},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Ben-orCLR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenjaminiHKL08,
author = {Itai Benjamini and
Simi Haber and
Michael Krivelevich and
Eyal Lubetzky},
title = {The isoperimetric constant of the random graph process},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {101--114},
year = {2008},
url = {https://doi.org/10.1002/rsa.20171},
doi = {10.1002/RSA.20171},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenjaminiHKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BodirskyGK08,
author = {Manuel Bodirsky and
Clemens Gr{\"{o}}pl and
Mihyun Kang},
title = {Generating unlabeled connected cubic planar graphs uniformly at random},
journal = {Random Struct. Algorithms},
volume = {32},
number = {2},
pages = {157--180},
year = {2008},
url = {https://doi.org/10.1002/rsa.20206},
doi = {10.1002/RSA.20206},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BodirskyGK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanFS08,
author = {Tom Bohman and
Alan M. Frieze and
Benny Sudakov},
title = {The game chromatic number of random graphs},
journal = {Random Struct. Algorithms},
volume = {32},
number = {2},
pages = {223--235},
year = {2008},
url = {https://doi.org/10.1002/rsa.20179},
doi = {10.1002/RSA.20179},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BohmanFS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasR08,
author = {B{\'{e}}la Bollob{\'{a}}s and
Oliver Riordan},
title = {Percolation on dual lattices with \emph{k}-fold symmetry},
journal = {Random Struct. Algorithms},
volume = {32},
number = {4},
pages = {463--472},
year = {2008},
url = {https://doi.org/10.1002/rsa.20205},
doi = {10.1002/RSA.20205},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Bordenave08,
author = {Charles Bordenave},
title = {Eigenvalues of Euclidean random matrices},
journal = {Random Struct. Algorithms},
volume = {33},
number = {4},
pages = {515--532},
year = {2008},
url = {https://doi.org/10.1002/rsa.20228},
doi = {10.1002/RSA.20228},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Bordenave08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BordewichDK08,
author = {Magnus Bordewich and
Martin E. Dyer and
Marek Karpinski},
title = {Path coupling using stopping times and counting independent sets and
colorings in hypergraphs},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {375--399},
year = {2008},
url = {https://doi.org/10.1002/rsa.20204},
doi = {10.1002/RSA.20204},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BordewichDK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BrodskyH08,
author = {Alex Brodsky and
Shlomo Hoory},
title = {Simple permutations mix even better},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {274--289},
year = {2008},
url = {https://doi.org/10.1002/rsa.20194},
doi = {10.1002/RSA.20194},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BrodskyH08.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/rsa/Camia08,
author = {Federico Camia},
title = {Universality in two-dimensional enhancement percolation},
journal = {Random Struct. Algorithms},
volume = {33},
number = {3},
pages = {377--408},
year = {2008},
url = {https://doi.org/10.1002/rsa.20220},
doi = {10.1002/RSA.20220},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Camia08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CavenaghGW08,
author = {Nicholas J. Cavenagh and
Catherine S. Greenhill and
Ian M. Wanless},
title = {The cycle structure of two rows in a random Latin square},
journal = {Random Struct. Algorithms},
volume = {33},
number = {3},
pages = {286--309},
year = {2008},
url = {https://doi.org/10.1002/rsa.20216},
doi = {10.1002/RSA.20216},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CavenaghGW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CernyG08,
author = {Jir{\'{\i}} Cern{\'{y}} and
V{\'{e}}ronique Gayrard},
title = {Hitting time of large subsets of the hypercube},
journal = {Random Struct. Algorithms},
volume = {33},
number = {2},
pages = {252--267},
year = {2008},
url = {https://doi.org/10.1002/rsa.20217},
doi = {10.1002/RSA.20217},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CernyG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChenS08,
author = {Guan{-}Yu Chen and
Laurent Saloff{-}Coste},
title = {The cutoff phenomenon for randomized riffle shuffles},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {346--374},
year = {2008},
url = {https://doi.org/10.1002/rsa.20195},
doi = {10.1002/RSA.20195},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChenS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChristofidesM08,
author = {Demetres Christofides and
Klas Markstr{\"{o}}m},
title = {Expansion properties of random Cayley graphs and vertex transitive
graphs via matrix martingales},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {88--100},
year = {2008},
url = {https://doi.org/10.1002/rsa.20177},
doi = {10.1002/RSA.20177},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChristofidesM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChungG08,
author = {Fan Chung Graham and
Ronald L. Graham},
title = {Quasi-random graphs with given degree sequences},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {1--19},
year = {2008},
url = {https://doi.org/10.1002/rsa.20188},
doi = {10.1002/RSA.20188},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChungG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChungG08a,
author = {Fan Chung Graham and
Ronald L. Graham},
title = {Erratum: Quasi-random graphs with given degree sequences},
journal = {Random Struct. Algorithms},
volume = {33},
number = {4},
pages = {536},
year = {2008},
url = {https://doi.org/10.1002/rsa.25131},
doi = {10.1002/RSA.25131},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChungG08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperF08,
author = {Colin Cooper and
Alan M. Frieze},
title = {The cover time of the giant component of a random graph},
journal = {Random Struct. Algorithms},
volume = {32},
number = {4},
pages = {401--439},
year = {2008},
url = {https://doi.org/10.1002/rsa.20201},
doi = {10.1002/RSA.20201},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperF08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CostelloV08,
author = {Kevin P. Costello and
Van H. Vu},
title = {The rank of random graphs},
journal = {Random Struct. Algorithms},
volume = {33},
number = {3},
pages = {269--285},
year = {2008},
url = {https://doi.org/10.1002/rsa.20219},
doi = {10.1002/RSA.20219},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CostelloV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CryanDMS08,
author = {Mary Cryan and
Martin E. Dyer and
Haiko M{\"{u}}ller and
Leen Stougie},
title = {Random walks on the vertices of transportation polytopes with constant
number of sources},
journal = {Random Struct. Algorithms},
volume = {33},
number = {3},
pages = {333--355},
year = {2008},
url = {https://doi.org/10.1002/rsa.20222},
doi = {10.1002/RSA.20222},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CryanDMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CzabarkaSSV08,
author = {{\'{E}}va Czabarka and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
title = {Biplanar crossing numbers. {II.} Comparing crossing numbers and biplanar
crossing numbers using the probabilistic method},
journal = {Random Struct. Algorithms},
volume = {33},
number = {4},
pages = {480--496},
year = {2008},
url = {https://doi.org/10.1002/rsa.20221},
doi = {10.1002/RSA.20221},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CzabarkaSSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DekkingS08,
author = {Michel Dekking and
K{\'{a}}roly Simon},
title = {On the size of the algebraic difference of two random Cantor sets},
journal = {Random Struct. Algorithms},
volume = {32},
number = {2},
pages = {205--222},
year = {2008},
url = {https://doi.org/10.1002/rsa.20178},
doi = {10.1002/RSA.20178},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DekkingS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrineasKM08,
author = {Petros Drineas and
Ravi Kannan and
Michael W. Mahoney},
title = {Sampling subproblems of heterogeneous Max-Cut problems and approximation
algorithms},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {307--333},
year = {2008},
url = {https://doi.org/10.1002/rsa.20196},
doi = {10.1002/RSA.20196},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DrineasKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DuchiS08,
author = {Enrica Duchi and
Gilles Schaeffer},
title = {A combinatorial approach to jumping particles: The parallel {TASEP}},
journal = {Random Struct. Algorithms},
volume = {33},
number = {4},
pages = {434--451},
year = {2008},
url = {https://doi.org/10.1002/rsa.20229},
doi = {10.1002/RSA.20229},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DuchiS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DvirR08,
author = {Zeev Dvir and
Ran Raz},
title = {Analyzing linear mergers},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {334--345},
year = {2008},
url = {https://doi.org/10.1002/rsa.20193},
doi = {10.1002/RSA.20193},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DvirR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EngebretsenH08,
author = {Lars Engebretsen and
Jonas Holmerin},
title = {More efficient queries in PCPs for {NP} and improved approximation
hardness of maximum {CSP}},
journal = {Random Struct. Algorithms},
volume = {33},
number = {4},
pages = {497--514},
year = {2008},
url = {https://doi.org/10.1002/rsa.20226},
doi = {10.1002/RSA.20226},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EngebretsenH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Flaxman08,
author = {Abraham Flaxman},
title = {A spectral technique for random satisfiable 3CNF formulas},
journal = {Random Struct. Algorithms},
volume = {32},
number = {4},
pages = {519--534},
year = {2008},
url = {https://doi.org/10.1002/rsa.20213},
doi = {10.1002/RSA.20213},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Flaxman08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FountoulakisKO08,
author = {Nikolaos Fountoulakis and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {The order of the largest complete minor in a random graph},
journal = {Random Struct. Algorithms},
volume = {33},
number = {2},
pages = {127--141},
year = {2008},
url = {https://doi.org/10.1002/rsa.20215},
doi = {10.1002/RSA.20215},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FountoulakisKO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FountoulakisR08,
author = {Nikolaos Fountoulakis and
Bruce A. Reed},
title = {The evolution of the mixing rate of a simple random walk on the giant
component of a random graph},
journal = {Random Struct. Algorithms},
volume = {33},
number = {1},
pages = {68--86},
year = {2008},
url = {https://doi.org/10.1002/rsa.20210},
doi = {10.1002/RSA.20210},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FountoulakisR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Galvin08,
author = {David J. Galvin},
title = {Sampling independent sets in the discrete torus},
journal = {Random Struct. Algorithms},
volume = {33},
number = {3},
pages = {356--376},
year = {2008},
url = {https://doi.org/10.1002/rsa.20223},
doi = {10.1002/RSA.20223},
timestamp = {Thu, 27 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Galvin08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GaoW08,
author = {Zhicheng Gao and
Nicholas C. Wormald},
title = {Distribution of subgraphs of random regular graphs},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {38--48},
year = {2008},
url = {https://doi.org/10.1002/rsa.20189},
doi = {10.1002/RSA.20189},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GaoW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GeorgiouKMN08,
author = {Nicholas Georgiou and
Malgorzata Kuchta and
Michal Morayne and
Jaroslaw Niemiec},
title = {On a universal best choice algorithm for partially ordered sets},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {263--273},
year = {2008},
url = {https://doi.org/10.1002/rsa.20192},
doi = {10.1002/RSA.20192},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GeorgiouKMN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GerkeSST08,
author = {Stefanie Gerke and
Dirk Schlatter and
Angelika Steger and
Anusch Taraz},
title = {The random planar graph process},
journal = {Random Struct. Algorithms},
volume = {32},
number = {2},
pages = {236--261},
year = {2008},
url = {https://doi.org/10.1002/rsa.20186},
doi = {10.1002/RSA.20186},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GerkeSST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GohH08,
author = {William M. Y. Goh and
Pawel Hitczenko},
title = {Random partitions with restricted part sizes},
journal = {Random Struct. Algorithms},
volume = {32},
number = {4},
pages = {440--462},
year = {2008},
url = {https://doi.org/10.1002/rsa.20191},
doi = {10.1002/RSA.20191},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/GohH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoldreichR08,
author = {Oded Goldreich and
Dana Ron},
title = {Approximating average parameters of graphs},
journal = {Random Struct. Algorithms},
volume = {32},
number = {4},
pages = {473--493},
year = {2008},
url = {https://doi.org/10.1002/rsa.20203},
doi = {10.1002/RSA.20203},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/GoldreichR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GuptaIM08,
author = {Bhupendra Gupta and
Srikanth K. Iyer and
D. Manjunath},
title = {Topological properties of the one dimensional exponential random geometric
graph},
journal = {Random Struct. Algorithms},
volume = {32},
number = {2},
pages = {181--204},
year = {2008},
url = {https://doi.org/10.1002/rsa.20174},
doi = {10.1002/RSA.20174},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GuptaIM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaberK08,
author = {Simi Haber and
Michael Krivelevich},
title = {Corrigendum: On fractional K-factors of random graphs},
journal = {Random Struct. Algorithms},
volume = {33},
number = {4},
pages = {533--535},
year = {2008},
url = {https://doi.org/10.1002/rsa.20245},
doi = {10.1002/RSA.20245},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HaberK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HalevyK08,
author = {Shirley Halevy and
Eyal Kushilevitz},
title = {Testing monotonicity over graph products},
journal = {Random Struct. Algorithms},
volume = {33},
number = {1},
pages = {44--67},
year = {2008},
url = {https://doi.org/10.1002/rsa.20211},
doi = {10.1002/RSA.20211},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HalevyK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HansenJ08,
author = {Jennie C. Hansen and
Jerzy Jaworski},
title = {Random mappings with exchangeable in-degrees},
journal = {Random Struct. Algorithms},
volume = {33},
number = {1},
pages = {105--126},
year = {2008},
url = {https://doi.org/10.1002/rsa.20187},
doi = {10.1002/RSA.20187},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HansenJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HatamiM08,
author = {Hamed Hatami and
Michael Molloy},
title = {Sharp thresholds for constraint satisfaction problems and homomorphisms},
journal = {Random Struct. Algorithms},
volume = {33},
number = {3},
pages = {310--332},
year = {2008},
url = {https://doi.org/10.1002/rsa.20225},
doi = {10.1002/RSA.20225},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HatamiM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Huber08,
author = {Mark Huber},
title = {Perfect simulation with exponential tails on the running time},
journal = {Random Struct. Algorithms},
volume = {33},
number = {1},
pages = {29--43},
year = {2008},
url = {https://doi.org/10.1002/rsa.20212},
doi = {10.1002/RSA.20212},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Huber08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JelenkovicR08,
author = {Predrag R. Jelenkovic and
Ana Radovanovic},
title = {The persistent-access-caching algorithm},
journal = {Random Struct. Algorithms},
volume = {33},
number = {2},
pages = {219--251},
year = {2008},
url = {https://doi.org/10.1002/rsa.20214},
doi = {10.1002/RSA.20214},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JelenkovicR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JohanssonKV08,
author = {Anders Johansson and
Jeff Kahn and
Van H. Vu},
title = {Factors in random graphs},
journal = {Random Struct. Algorithms},
volume = {33},
number = {1},
pages = {1--28},
year = {2008},
url = {https://doi.org/10.1002/rsa.20224},
doi = {10.1002/RSA.20224},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JohanssonKV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KirschM08,
author = {Adam Kirsch and
Michael Mitzenmacher},
title = {Less hashing, same performance: Building a better Bloom filter},
journal = {Random Struct. Algorithms},
volume = {33},
number = {2},
pages = {187--218},
year = {2008},
url = {https://doi.org/10.1002/rsa.20208},
doi = {10.1002/RSA.20208},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KirschM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kravitz08,
author = {David Kravitz},
title = {On an online random k-SAT model},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {115--124},
year = {2008},
url = {https://doi.org/10.1002/rsa.20200},
doi = {10.1002/RSA.20200},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kravitz08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Matousek08,
author = {Jir{\'{\i}} Matousek},
title = {On variants of the Johnson-Lindenstrauss lemma},
journal = {Random Struct. Algorithms},
volume = {33},
number = {2},
pages = {142--156},
year = {2008},
url = {https://doi.org/10.1002/rsa.20218},
doi = {10.1002/RSA.20218},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Matousek08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PenroseW08,
author = {Mathew D. Penrose and
Andrew R. Wade},
title = {Limit theory for the random on-line nearest-neighbor graph},
journal = {Random Struct. Algorithms},
volume = {32},
number = {2},
pages = {125--156},
year = {2008},
url = {https://doi.org/10.1002/rsa.20185},
doi = {10.1002/RSA.20185},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PenroseW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Shaltiel08,
author = {Ronen Shaltiel},
title = {How to get more mileage from randomness extractors},
journal = {Random Struct. Algorithms},
volume = {33},
number = {2},
pages = {157--186},
year = {2008},
url = {https://doi.org/10.1002/rsa.20207},
doi = {10.1002/RSA.20207},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Shaltiel08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SudakovV08,
author = {Benny Sudakov and
Jan Vondr{\'{a}}k},
title = {How many random edges make a dense hypergraph non-2-colorable?},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {290--306},
year = {2008},
url = {https://doi.org/10.1002/rsa.25155},
doi = {10.1002/RSA.25155},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SudakovV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SudakovV08a,
author = {Benny Sudakov and
Van H. Vu},
title = {Local resilience of graphs},
journal = {Random Struct. Algorithms},
volume = {33},
number = {4},
pages = {409--433},
year = {2008},
url = {https://doi.org/10.1002/rsa.20235},
doi = {10.1002/RSA.20235},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SudakovV08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AilonCCL07,
author = {Nir Ailon and
Bernard Chazelle and
Seshadhri Comandur and
Ding Liu},
title = {Estimating the distance to a monotone function},
journal = {Random Struct. Algorithms},
volume = {31},
number = {3},
pages = {371--383},
year = {2007},
url = {https://doi.org/10.1002/rsa.20167},
doi = {10.1002/RSA.20167},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AilonCCL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Albert07,
author = {Michael H. Albert},
title = {On the length of the longest subsequence avoiding an arbitrary pattern
in a random permutation},
journal = {Random Struct. Algorithms},
volume = {31},
number = {2},
pages = {227--238},
year = {2007},
url = {https://doi.org/10.1002/rsa.20140},
doi = {10.1002/RSA.20140},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Albert07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonC07,
author = {Noga Alon and
Michael R. Capalbo},
title = {Sparse universal graphs for bounded-degree graphs},
journal = {Random Struct. Algorithms},
volume = {31},
number = {2},
pages = {123--133},
year = {2007},
url = {https://doi.org/10.1002/rsa.20143},
doi = {10.1002/RSA.20143},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonIN07,
author = {Noga Alon and
Toshiya Itoh and
Tatsuya Nagatani},
title = {On (epsilon, k)-min-wise independent permutations},
journal = {Random Struct. Algorithms},
volume = {31},
number = {3},
pages = {384--389},
year = {2007},
url = {https://doi.org/10.1002/rsa.20184},
doi = {10.1002/RSA.20184},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonIN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghP07,
author = {J{\'{o}}zsef Balogh and
Boris G. Pittel},
title = {Bootstrap percolation on the random regular graph},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {257--286},
year = {2007},
url = {https://doi.org/10.1002/rsa.20158},
doi = {10.1002/RSA.20158},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghP07a,
author = {J{\'{o}}zsef Balogh and
Robin Pemantle},
title = {The Klee-Minty random edge chain moves with linear speed},
journal = {Random Struct. Algorithms},
volume = {30},
number = {4},
pages = {464--483},
year = {2007},
url = {https://doi.org/10.1002/rsa.20127},
doi = {10.1002/RSA.20127},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghP07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaloghPS07,
author = {J{\'{o}}zsef Balogh and
Boris G. Pittel and
Gelasio Salazar},
title = {Large harmonic sets of noncrossing edges for n randomly labeled vertices
in convex position},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {105--130},
year = {2007},
url = {https://doi.org/10.1002/rsa.20153},
doi = {10.1002/RSA.20153},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaloghPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaltzDSTW07,
author = {Andreas Baltz and
Devdatt P. Dubhashi and
Anand Srivastav and
Libertad Tansini and
S{\"{o}}ren Werth},
title = {Probabilistic analysis for a multiple depot vehicle routing problem},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {206--225},
year = {2007},
url = {https://doi.org/10.1002/rsa.20156},
doi = {10.1002/RSA.20156},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaltzDSTW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Barany07,
author = {Imre B{\'{a}}r{\'{a}}ny},
title = {The chance that a convex body is lattice-point free: {A} relative
of Buffon's needle problem},
journal = {Random Struct. Algorithms},
volume = {30},
number = {3},
pages = {414--426},
year = {2007},
url = {https://doi.org/10.1002/rsa.20138},
doi = {10.1002/RSA.20138},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Barany07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaranyVV07,
author = {Imre B{\'{a}}r{\'{a}}ny and
Santosh S. Vempala and
Adrian Vetta},
title = {Nash equilibria in random games},
journal = {Random Struct. Algorithms},
volume = {31},
number = {4},
pages = {391--405},
year = {2007},
url = {https://doi.org/10.1002/rsa.20199},
doi = {10.1002/RSA.20199},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaranyVV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaswanaS07,
author = {Surender Baswana and
Sandeep Sen},
title = {A simple and linear time randomized algorithm for computing sparse
spanners in weighted graphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {4},
pages = {532--563},
year = {2007},
url = {https://doi.org/10.1002/rsa.20130},
doi = {10.1002/RSA.20130},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaswanaS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BezakovaBV07,
author = {Ivona Bez{\'{a}}kov{\'{a}} and
Nayantara Bhatnagar and
Eric Vigoda},
title = {Sampling binary contingency tables with a greedy start},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {168--205},
year = {2007},
url = {https://doi.org/10.1002/rsa.20155},
doi = {10.1002/RSA.20155},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BezakovaBV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BiskupCS07,
author = {Marek Biskup and
Lincoln Chayes and
S. Alex Smith},
title = {Large-deviations/thermodynamic approach to percolation on the complete
graph},
journal = {Random Struct. Algorithms},
volume = {31},
number = {3},
pages = {354--370},
year = {2007},
url = {https://doi.org/10.1002/rsa.20169},
doi = {10.1002/RSA.20169},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BiskupCS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BodirskyKLM07,
author = {Manuel Bodirsky and
Mihyun Kang and
Mike L{\"{o}}ffler and
Colin McDiarmid},
title = {Random cubic planar graphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {78--94},
year = {2007},
url = {https://doi.org/10.1002/rsa.20149},
doi = {10.1002/RSA.20149},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BodirskyKLM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanFMRS07,
author = {Tom Bohman and
Alan M. Frieze and
Ryan R. Martin and
Mikl{\'{o}}s Ruszink{\'{o}} and
Cliff Smyth},
title = {Randomly generated intersecting hypergraphs {II}},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {17--34},
year = {2007},
url = {https://doi.org/10.1002/rsa.20152},
doi = {10.1002/RSA.20152},
timestamp = {Wed, 09 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BohmanFMRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasJR07,
author = {B{\'{e}}la Bollob{\'{a}}s and
Svante Janson and
Oliver Riordan},
title = {The phase transition in inhomogeneous random graphs},
journal = {Random Struct. Algorithms},
volume = {31},
number = {1},
pages = {3--122},
year = {2007},
url = {https://doi.org/10.1002/rsa.20168},
doi = {10.1002/RSA.20168},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasJR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasJR07a,
author = {B{\'{e}}la Bollob{\'{a}}s and
Svante Janson and
Oliver Riordan},
title = {Spread-out percolation in R\({}^{\mbox{d}}\)},
journal = {Random Struct. Algorithms},
volume = {31},
number = {2},
pages = {239--246},
year = {2007},
url = {https://doi.org/10.1002/rsa.20175},
doi = {10.1002/RSA.20175},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasJR07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BovierK07,
author = {Anton Bovier and
Irina A. Kurkova},
title = {Poisson convergence in the restricted \emph{k}-partitioning problem},
journal = {Random Struct. Algorithms},
volume = {30},
number = {4},
pages = {505--531},
year = {2007},
url = {https://doi.org/10.1002/rsa.20128},
doi = {10.1002/RSA.20128},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BovierK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChakrabartiK07,
author = {Amit Chakrabarti and
Subhash Khot},
title = {Improved lower bounds on the randomized complexity of graph properties},
journal = {Random Struct. Algorithms},
volume = {30},
number = {3},
pages = {427--440},
year = {2007},
url = {https://doi.org/10.1002/rsa.20164},
doi = {10.1002/RSA.20164},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChakrabartiK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Coja-OghlanMS07,
author = {Amin Coja{-}Oghlan and
Cristopher Moore and
Vishal Sanwalani},
title = {Counting connected graphs and hypergraphs via the probabilistic method},
journal = {Random Struct. Algorithms},
volume = {31},
number = {3},
pages = {288--329},
year = {2007},
url = {https://doi.org/10.1002/rsa.20160},
doi = {10.1002/RSA.20160},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Coja-OghlanMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CometsDS07,
author = {Francis Comets and
Fran{\c{c}}ois Delarue and
Ren{\'{e}} Schott},
title = {Distributed algorithms in an ergodic Markovian environment},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {131--167},
year = {2007},
url = {https://doi.org/10.1002/rsa.20154},
doi = {10.1002/RSA.20154},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CometsDS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperF07,
author = {Colin Cooper and
Alan M. Frieze},
title = {The cover time of sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {1--16},
year = {2007},
url = {https://doi.org/10.1002/rsa.20151},
doi = {10.1002/RSA.20151},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CzumajS07,
author = {Artur Czumaj and
Christian Sohler},
title = {Sublinear-time approximation algorithms for clustering via random
sampling},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {226--256},
year = {2007},
url = {https://doi.org/10.1002/rsa.20157},
doi = {10.1002/RSA.20157},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CzumajS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DvorakJKKS07,
author = {Zdenek Dvor{\'{a}}k and
V{\'{\i}}t Jel{\'{\i}}nek and
Daniel Kr{\'{a}}l and
Jan Kyncl and
Michael E. Saks},
title = {Probabilistic strategies for the partition and plurality problems},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {63--77},
year = {2007},
url = {https://doi.org/10.1002/rsa.20148},
doi = {10.1002/RSA.20148},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DvorakJKKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FengS07,
author = {Qunqiang Feng and
Chun Su},
title = {The structure and distances in Yule recursive trees},
journal = {Random Struct. Algorithms},
volume = {31},
number = {3},
pages = {273--287},
year = {2007},
url = {https://doi.org/10.1002/rsa.20183},
doi = {10.1002/RSA.20183},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FengS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FernholzR07,
author = {Daniel Fernholz and
Vijaya Ramachandran},
title = {The diameter of sparse random graphs},
journal = {Random Struct. Algorithms},
volume = {31},
number = {4},
pages = {482--516},
year = {2007},
url = {https://doi.org/10.1002/rsa.20197},
doi = {10.1002/RSA.20197},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FernholzR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FlaxmanF07,
author = {Abraham D. Flaxman and
Alan M. Frieze},
title = {The diameter of randomly perturbed digraphs and some applications},
journal = {Random Struct. Algorithms},
volume = {30},
number = {4},
pages = {484--504},
year = {2007},
url = {https://doi.org/10.1002/rsa.20172},
doi = {10.1002/RSA.20172},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FlaxmanF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GerkeMS07,
author = {Stefanie Gerke and
Martin Marciniszyn and
Angelika Steger},
title = {A probabilistic counting lemma for complete graphs},
journal = {Random Struct. Algorithms},
volume = {31},
number = {4},
pages = {517--534},
year = {2007},
url = {https://doi.org/10.1002/rsa.20198},
doi = {10.1002/RSA.20198},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GerkeMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaberK07,
author = {Simi Haber and
Michael Krivelevich},
title = {On fractional \emph{K}-factors of random graphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {4},
pages = {441--463},
year = {2007},
url = {https://doi.org/10.1002/rsa.20144},
doi = {10.1002/RSA.20144},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HaberK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HansenJ07,
author = {Jennie C. Hansen and
Jerzy Jaworski},
title = {A cutting process for random mappings},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {287--306},
year = {2007},
url = {https://doi.org/10.1002/rsa.20159},
doi = {10.1002/RSA.20159},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HansenJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HayesV07,
author = {Thomas P. Hayes and
Eric Vigoda},
title = {Variable length path coupling},
journal = {Random Struct. Algorithms},
volume = {31},
number = {3},
pages = {251--272},
year = {2007},
url = {https://doi.org/10.1002/rsa.20166},
doi = {10.1002/RSA.20166},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HayesV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HofstadHM07,
author = {Remco van der Hofstad and
Gerard Hooghiemstra and
Piet Van Mieghem},
title = {The weight of the shortest path tree},
journal = {Random Struct. Algorithms},
volume = {30},
number = {3},
pages = {359--379},
year = {2007},
url = {https://doi.org/10.1002/rsa.20141},
doi = {10.1002/RSA.20141},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HofstadHM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Hwang07,
author = {Hsien{-}Kuei Hwang},
title = {Profiles of random trees: Plane-oriented recursive trees},
journal = {Random Struct. Algorithms},
volume = {30},
number = {3},
pages = {380--413},
year = {2007},
url = {https://doi.org/10.1002/rsa.20139},
doi = {10.1002/RSA.20139},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Hwang07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Jaggard07,
author = {Aaron D. Jaggard},
title = {An almost-bijective proof of an asymptotic property of partitions},
journal = {Random Struct. Algorithms},
volume = {31},
number = {2},
pages = {247--250},
year = {2007},
url = {https://doi.org/10.1002/rsa.20180},
doi = {10.1002/RSA.20180},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Jaggard07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonL07,
author = {Svante Janson and
Malwina J. Luczak},
title = {A simple solution to the \emph{k}-core problem},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {50--62},
year = {2007},
url = {https://doi.org/10.1002/rsa.20147},
doi = {10.1002/RSA.20147},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonW07,
author = {Svante Janson and
Nicholas C. Wormald},
title = {Rainbow Hamilton cycles in random regular graphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {35--49},
year = {2007},
url = {https://doi.org/10.1002/rsa.20146},
doi = {10.1002/RSA.20146},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KangS07,
author = {Mihyun Kang and
Taral Guldahl Seierstad},
title = {Phase transition of the minimum degree random multigraph process},
journal = {Random Struct. Algorithms},
volume = {31},
number = {3},
pages = {330--353},
year = {2007},
url = {https://doi.org/10.1002/rsa.20170},
doi = {10.1002/RSA.20170},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KangS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LovaszV07,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Santosh S. Vempala},
title = {The geometry of logconcave functions and sampling algorithms},
journal = {Random Struct. Algorithms},
volume = {30},
number = {3},
pages = {307--358},
year = {2007},
url = {https://doi.org/10.1002/rsa.20135},
doi = {10.1002/RSA.20135},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LovaszV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-09-12 20:23 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:
