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/rsa22.bht:"
download as .bib file
@article{DBLP:journals/rsa/BohmanFM03,
author = {Tom Bohman and
Alan M. Frieze and
Ryan R. Martin},
title = {How many random edges make a dense graph hamiltonian?},
journal = {Random Struct. Algorithms},
volume = {22},
number = {1},
pages = {33--42},
year = {2003},
url = {https://doi.org/10.1002/rsa.10070},
doi = {10.1002/RSA.10070},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BohmanFM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasB03,
author = {B{\'{e}}la Bollob{\'{a}}s and
Graham R. Brightwell},
title = {The number of k-SAT functions},
journal = {Random Struct. Algorithms},
volume = {22},
number = {3},
pages = {227--247},
year = {2003},
url = {https://doi.org/10.1002/rsa.10079},
doi = {10.1002/RSA.10079},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Carlsund03,
author = {Anna Carlsund},
title = {Notes on the variance of the number of maxima in three dimensions},
journal = {Random Struct. Algorithms},
volume = {22},
number = {4},
pages = {440--447},
year = {2003},
url = {https://doi.org/10.1002/rsa.10086},
doi = {10.1002/RSA.10086},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Carlsund03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CooperF03,
author = {Colin Cooper and
Alan M. Frieze},
title = {A general model of web graphs},
journal = {Random Struct. Algorithms},
volume = {22},
number = {3},
pages = {311--335},
year = {2003},
url = {https://doi.org/10.1002/rsa.10084},
doi = {10.1002/RSA.10084},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CooperF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DasguptaG03,
author = {Sanjoy Dasgupta and
Anupam Gupta},
title = {An elementary proof of a theorem of Johnson and Lindenstrauss},
journal = {Random Struct. Algorithms},
volume = {22},
number = {1},
pages = {60--65},
year = {2003},
url = {https://doi.org/10.1002/rsa.10073},
doi = {10.1002/RSA.10073},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DasguptaG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HastadW03,
author = {Johan H{\aa}stad and
Avi Wigderson},
title = {Simple analysis of graph tests for linearity and {PCP}},
journal = {Random Struct. Algorithms},
volume = {22},
number = {2},
pages = {139--160},
year = {2003},
url = {https://doi.org/10.1002/rsa.10068},
doi = {10.1002/RSA.10068},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/HastadW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaxellNR03,
author = {Penny E. Haxell and
Brendan Nagle and
Vojtech R{\"{o}}dl},
title = {Integer and fractional packings in dense 3-uniform hypergraphs},
journal = {Random Struct. Algorithms},
volume = {22},
number = {3},
pages = {248--310},
year = {2003},
url = {https://doi.org/10.1002/rsa.10075},
doi = {10.1002/RSA.10075},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HaxellNR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Huber03,
author = {Mark Huber},
title = {A bounding chain for Swendsen-Wang},
journal = {Random Struct. Algorithms},
volume = {22},
number = {1},
pages = {43--59},
year = {2003},
url = {https://doi.org/10.1002/rsa.10071},
doi = {10.1002/RSA.10071},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Huber03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson03,
author = {Svante Janson},
title = {The Wiener Index of simply generated random trees},
journal = {Random Struct. Algorithms},
volume = {22},
number = {4},
pages = {337--358},
year = {2003},
url = {https://doi.org/10.1002/rsa.10074},
doi = {10.1002/RSA.10074},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KohayakawaR03,
author = {Yoshiharu Kohayakawa and
Vojtech R{\"{o}}dl},
title = {Regular pairs in sparse random graphs {I}},
journal = {Random Struct. Algorithms},
volume = {22},
number = {4},
pages = {359--434},
year = {2003},
url = {https://doi.org/10.1002/rsa.10081},
doi = {10.1002/RSA.10081},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KohayakawaR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichSVW03,
author = {Michael Krivelevich and
Benny Sudakov and
Van H. Vu and
Nicholas C. Wormald},
title = {On the probability of independent sets in random graphs},
journal = {Random Struct. Algorithms},
volume = {22},
number = {1},
pages = {1--14},
year = {2003},
url = {https://doi.org/10.1002/rsa.10063},
doi = {10.1002/RSA.10063},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichSVW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KuhnO03,
author = {Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Minors in graphs of large girth},
journal = {Random Struct. Algorithms},
volume = {22},
number = {2},
pages = {213--225},
year = {2003},
url = {https://doi.org/10.1002/rsa.10076},
doi = {10.1002/RSA.10076},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KuhnO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MadrasZ03,
author = {Neal Madras and
Zhongrong Zheng},
title = {On the swapping algorithm},
journal = {Random Struct. Algorithms},
volume = {22},
number = {1},
pages = {66--97},
year = {2003},
url = {https://doi.org/10.1002/rsa.10066},
doi = {10.1002/RSA.10066},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MadrasZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmid03,
author = {Colin McDiarmid},
title = {Random channel assignment in the plane},
journal = {Random Struct. Algorithms},
volume = {22},
number = {2},
pages = {187--212},
year = {2003},
url = {https://doi.org/10.1002/rsa.10077},
doi = {10.1002/RSA.10077},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmid03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ParnasRR03,
author = {Michal Parnas and
Dana Ron and
Ronitt Rubinfeld},
title = {Testing membership in parenthesis languages},
journal = {Random Struct. Algorithms},
volume = {22},
number = {1},
pages = {98--138},
year = {2003},
url = {https://doi.org/10.1002/rsa.10067},
doi = {10.1002/RSA.10067},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/ParnasRR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pippenger03,
author = {Nicholas Pippenger},
title = {The shortest disjunctive normal form of a random Boolean function},
journal = {Random Struct. Algorithms},
volume = {22},
number = {2},
pages = {161--186},
year = {2003},
url = {https://doi.org/10.1002/rsa.10065},
doi = {10.1002/RSA.10065},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Pippenger03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Radhakrishnan03,
author = {Jaikumar Radhakrishnan},
title = {A note on scrambling permutations},
journal = {Random Struct. Algorithms},
volume = {22},
number = {4},
pages = {435--439},
year = {2003},
url = {https://doi.org/10.1002/rsa.10082},
doi = {10.1002/RSA.10082},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Radhakrishnan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Siegrist03,
author = {Kyle Siegrist},
title = {Renewal processes on partially ordered sets},
journal = {Random Struct. Algorithms},
volume = {22},
number = {1},
pages = {15--32},
year = {2003},
url = {https://doi.org/10.1002/rsa.10064},
doi = {10.1002/RSA.10064},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Siegrist03.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-04 00:46 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:
