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/rsa40.bht:"
download as .bib file
@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/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/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/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/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/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/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/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/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/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/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/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/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/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/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}
}
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-06-06 02:28 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:
