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/rsa21.bht:"
download as .bib file
@article{DBLP:journals/rsa/Alon02,
author = {Noga Alon},
title = {Testing subgraphs in large graphs},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {359--370},
year = {2002},
url = {https://doi.org/10.1002/rsa.10056},
doi = {10.1002/RSA.10056},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Alon02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonDLS02,
author = {Noga Alon and
Benjamin Doerr and
Tomasz Luczak and
Tomasz Schoen},
title = {On the discrepancy of combinatorial rectangles},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {205--215},
year = {2002},
url = {https://doi.org/10.1002/rsa.10055},
doi = {10.1002/RSA.10055},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AlonDLS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonGHR02,
author = {Noga Alon and
Jaroslaw Grytczuk and
Mariusz Haluszczak and
Oliver Riordan},
title = {Nonrepetitive colorings of graphs},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {336--346},
year = {2002},
url = {https://doi.org/10.1002/rsa.10057},
doi = {10.1002/RSA.10057},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonGHR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AnderssonE02,
author = {Gunnar Andersson and
Lars Engebretsen},
title = {Property testers for dense constraint satisfaction programs on finite
domains},
journal = {Random Struct. Algorithms},
volume = {21},
number = {1},
pages = {14--32},
year = {2002},
url = {https://doi.org/10.1002/rsa.10041},
doi = {10.1002/RSA.10041},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AnderssonE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BauWZ02,
author = {Sheng Bau and
Nicholas C. Wormald and
Sanming Zhou},
title = {Decycling numbers of random regular graphs},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {397--413},
year = {2002},
url = {https://doi.org/10.1002/rsa.10069},
doi = {10.1002/RSA.10069},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BauWZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasS02,
author = {B{\'{e}}la Bollob{\'{a}}s and
Alex D. Scott},
title = {Problems and results on judicious partitions},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {414--430},
year = {2002},
url = {https://doi.org/10.1002/rsa.10062},
doi = {10.1002/RSA.10062},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BuckCR02,
author = {Marshall W. Buck and
Clara S. Chan and
David P. Robbins},
title = {On the expected value of the minimum assignment},
journal = {Random Struct. Algorithms},
volume = {21},
number = {1},
pages = {33--58},
year = {2002},
url = {https://doi.org/10.1002/rsa.10045},
doi = {10.1002/RSA.10045},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BuckCR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChassaingL02,
author = {Philippe Chassaing and
Guy Louchard},
title = {Phase transition for Parking blocks, Brownian excursion and coalescence},
journal = {Random Struct. Algorithms},
volume = {21},
number = {1},
pages = {76--119},
year = {2002},
url = {https://doi.org/10.1002/rsa.10039},
doi = {10.1002/RSA.10039},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChassaingL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CoppersmithGS02,
author = {Don Coppersmith and
David Gamarnik and
Maxim Sviridenko},
title = {The diameter of a long-range percolation graph},
journal = {Random Struct. Algorithms},
volume = {21},
number = {1},
pages = {1--13},
year = {2002},
url = {https://doi.org/10.1002/rsa.10042},
doi = {10.1002/RSA.10042},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CoppersmithGS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DementievaHNR02,
author = {Y. Dementieva and
Penny E. Haxell and
Brendan Nagle and
Vojtech R{\"{o}}dl},
title = {On characterizing hypergraph regularity},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {293--335},
year = {2002},
url = {https://doi.org/10.1002/rsa.10058},
doi = {10.1002/RSA.10058},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DementievaHNR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DuckworthW02,
author = {William Duckworth and
Nicholas C. Wormald},
title = {Minimum independent dominating sets of random cubic graphs},
journal = {Random Struct. Algorithms},
volume = {21},
number = {2},
pages = {147--161},
year = {2002},
url = {https://doi.org/10.1002/rsa.10047},
doi = {10.1002/RSA.10047},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DuckworthW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EppsteinL02,
author = {David Eppstein and
George S. Lueker},
title = {The minimum expectation selection problem},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {278--292},
year = {2002},
url = {https://doi.org/10.1002/rsa.10061},
doi = {10.1002/RSA.10061},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EppsteinL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Guillotin-PlantardS02,
author = {Nadine Guillotin{-}Plantard and
Ren{\'{e}} Schott},
title = {Distributed algorithms with dynamical random transitions},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {371--396},
year = {2002},
url = {https://doi.org/10.1002/rsa.10060},
doi = {10.1002/RSA.10060},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Guillotin-PlantardS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonRS02,
author = {Svante Janson and
Dana Randall and
Joel Spencer},
title = {Random dyadic tilings of the unit square},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {225--251},
year = {2002},
url = {https://doi.org/10.1002/rsa.10051},
doi = {10.1002/RSA.10051},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KimSV02,
author = {Jeong Han Kim and
Benny Sudakov and
Van H. Vu},
title = {On the asymmetry of random regular graphs and random graphs},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {216--224},
year = {2002},
url = {https://doi.org/10.1002/rsa.10054},
doi = {10.1002/RSA.10054},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KimSV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KiwiL02,
author = {Marcos A. Kiwi and
Martin Loebl},
title = {Largest planar matching in random bipartite graphs},
journal = {Random Struct. Algorithms},
volume = {21},
number = {2},
pages = {162--181},
year = {2002},
url = {https://doi.org/10.1002/rsa.10048},
doi = {10.1002/RSA.10048},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KiwiL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Morris02,
author = {Ben J. Morris},
title = {Improved bounds for sampling contingency tables},
journal = {Random Struct. Algorithms},
volume = {21},
number = {2},
pages = {135--146},
year = {2002},
url = {https://doi.org/10.1002/rsa.10049},
doi = {10.1002/RSA.10049},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Morris02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Nebel02,
author = {Markus E. Nebel},
title = {A unified approach to the analysis of Horton-Strahler parameters of
binary tree structures},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {252--277},
year = {2002},
url = {https://doi.org/10.1002/rsa.10052},
doi = {10.1002/RSA.10052},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Nebel02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SmytheW02,
author = {Robert T. Smythe and
J. A. Wellner},
title = {Asymptotic analysis of (3, 2, 1)-shell sort},
journal = {Random Struct. Algorithms},
volume = {21},
number = {1},
pages = {59--75},
year = {2002},
url = {https://doi.org/10.1002/rsa.10046},
doi = {10.1002/RSA.10046},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SmytheW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SpencerT02,
author = {Joel Spencer and
G{\'{e}}za T{\'{o}}th},
title = {Crossing numbers of random graphs},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {347--358},
year = {2002},
url = {https://doi.org/10.1002/rsa.10053},
doi = {10.1002/RSA.10053},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SpencerT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Talagrand02,
author = {Michel Talagrand},
title = {Gaussian averages, Bernoulli averages, and Gibbs' measures},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {197--204},
year = {2002},
url = {https://doi.org/10.1002/rsa.10059},
doi = {10.1002/RSA.10059},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Talagrand02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Wilson02,
author = {David Bruce Wilson},
title = {On the critical exponents of random k-SAT},
journal = {Random Struct. Algorithms},
volume = {21},
number = {2},
pages = {182--195},
year = {2002},
url = {https://doi.org/10.1002/rsa.10050},
doi = {10.1002/RSA.10050},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Wilson02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Yuster02,
author = {Raphael Yuster},
title = {The decomposition threshold for bipartite graphs with minimum degree
one},
journal = {Random Struct. Algorithms},
volume = {21},
number = {2},
pages = {121--134},
year = {2002},
url = {https://doi.org/10.1002/rsa.10044},
doi = {10.1002/RSA.10044},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Yuster02.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-08-23 08:57 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:
