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/rsa32.bht:"
download as .bib file
@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/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/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/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/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/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/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/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/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/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/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/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}
}
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-04-23 13:05 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:
