Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/rsa/rsa52.bht:"
download as .bib file
@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/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/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/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/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/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/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/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 = {Fri, 30 Nov 2018 00:00:00 +0100},
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/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/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/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 = {Thu, 01 Feb 2018 00:00:00 +0100},
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/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 = {Fri, 01 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/SchachtS18.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}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-07 22:27 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:
