Search dblp for Publications

export results for "toc:db/journals/rsa/rsa28.bht:"

 download as .bib file

@article{DBLP:journals/rsa/Ben-SassonS06,
  author       = {Eli Ben{-}Sasson and
                  Madhu Sudan},
  title        = {Robust locally testable codes and products of codes},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {4},
  pages        = {387--402},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20120},
  doi          = {10.1002/RSA.20120},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Ben-SassonS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BohmanK06,
  author       = {Tom Bohman and
                  Jeong Han Kim},
  title        = {A phase transition for avoiding a giant component},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {2},
  pages        = {195--214},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20085},
  doi          = {10.1002/RSA.20085},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BohmanK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Coja-OghlanMS06,
  author       = {Amin Coja{-}Oghlan and
                  Cristopher Moore and
                  Vishal Sanwalani},
  title        = {{MAX} \emph{k}-CUT and approximating the chromatic number of random
                  graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {3},
  pages        = {289--322},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20096},
  doi          = {10.1002/RSA.20096},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/Coja-OghlanMS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Doerr06,
  author       = {Benjamin Doerr},
  title        = {Matrix rounding with respect to small submatrices},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {1},
  pages        = {107--112},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20078},
  doi          = {10.1002/RSA.20078},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Doerr06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/DombryGPS06,
  author       = {Cl{\'{e}}ment Dombry and
                  Nadine Guillotin{-}Plantard and
                  Bruno Pin{\c{c}}on and
                  Ren{\'{e}} Schott},
  title        = {Data structures with dynamical random transitions},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {4},
  pages        = {403--426},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20091},
  doi          = {10.1002/RSA.20091},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/DombryGPS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/FlaxmanFK06,
  author       = {Abraham D. Flaxman and
                  Alan M. Frieze and
                  Michael Krivelevich},
  title        = {On the random 2-stage minimum spanning tree},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {1},
  pages        = {24--36},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20079},
  doi          = {10.1002/RSA.20079},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/FlaxmanFK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/FriezeK06,
  author       = {Alan M. Frieze and
                  Michael Krivelevich},
  title        = {Almost universal graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {4},
  pages        = {499--510},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20121},
  doi          = {10.1002/RSA.20121},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/FriezeK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/FriezeM06,
  author       = {Alan M. Frieze and
                  Michael Molloy},
  title        = {The satisfiability threshold for randomly generated binary constraint
                  satisfaction problems},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {3},
  pages        = {323--339},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20118},
  doi          = {10.1002/RSA.20118},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/FriezeM06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/GalvinT06,
  author       = {David J. Galvin and
                  Prasad Tetali},
  title        = {Slow mixing of Glauber dynamics for the hard-core model on regular
                  bipartite graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {4},
  pages        = {427--443},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20094},
  doi          = {10.1002/RSA.20094},
  timestamp    = {Thu, 27 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/GalvinT06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/GamarnikNS06,
  author       = {David Gamarnik and
                  Tomasz Nowicki and
                  Grzegorz Swirszcz},
  title        = {Maximum weight independent sets and matchings in sparse random graphs.
                  Exact results using the local weak convergence method},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {1},
  pages        = {76--106},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20072},
  doi          = {10.1002/RSA.20072},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/GamarnikNS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Gittenberger06,
  author       = {Bernhard Gittenberger},
  title        = {Nodes of large degree in random trees and forests},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {3},
  pages        = {374--385},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20119},
  doi          = {10.1002/RSA.20119},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Gittenberger06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/JansonW06,
  author       = {Svante Janson and
                  Johan W{\"{a}}stlund},
  title        = {Addendum to "The Minimal Spanning Tree in a Complete Graph and a Functional
                  Limit Theorem for Trees in a Random Graph"},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {4},
  pages        = {511--512},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20122},
  doi          = {10.1002/RSA.20122},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/JansonW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/KaporisKL06,
  author       = {Alexis C. Kaporis and
                  Lefteris M. Kirousis and
                  Efthimios G. Lalas},
  title        = {The probabilistic analysis of a greedy satisfiability algorithm},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {4},
  pages        = {444--480},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20104},
  doi          = {10.1002/RSA.20104},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/KaporisKL06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/LuczakL06,
  author       = {Malwina J. Luczak and
                  Tomasz Luczak},
  title        = {The phase transition in the cluster-scaled model of a random graph},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {2},
  pages        = {215--246},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20088},
  doi          = {10.1002/RSA.20088},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/LuczakL06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/MatzingerR06,
  author       = {Heinrich Matzinger and
                  Silke W. W. Rolles},
  title        = {Finding blocks and other patterns in a random coloring of {Z}},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {1},
  pages        = {37--75},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20110},
  doi          = {10.1002/RSA.20110},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/MatzingerR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/MertensMZ06,
  author       = {Stephan Mertens and
                  Marc M{\'{e}}zard and
                  Riccardo Zecchina},
  title        = {Threshold values of random \emph{K}-SAT from the cavity method},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {3},
  pages        = {340--373},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20090},
  doi          = {10.1002/RSA.20090},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/MertensMZ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/NagleRS06,
  author       = {Brendan Nagle and
                  Vojtech R{\"{o}}dl and
                  Mathias Schacht},
  title        = {The counting lemma for regular \emph{k}-uniform hypergraphs},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {2},
  pages        = {113--179},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20117},
  doi          = {10.1002/RSA.20117},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/NagleRS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/PippengerS06,
  author       = {Nicholas Pippenger and
                  Kristin Schleich},
  title        = {Topological characteristics of random triangulated surfaces},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {3},
  pages        = {247--288},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20080},
  doi          = {10.1002/RSA.20080},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/PippengerS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/RodlS06,
  author       = {Vojtech R{\"{o}}dl and
                  Jozef Skokan},
  title        = {Applications of the regularity lemma for uniform hypergraphs},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {2},
  pages        = {180--194},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20108},
  doi          = {10.1002/RSA.20108},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/RodlS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/TaoV06,
  author       = {Terence Tao and
                  Van H. Vu},
  title        = {On random plus/minus 1 matrices: Singularity and determinant},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {1},
  pages        = {1--23},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20109},
  doi          = {10.1002/RSA.20109},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/TaoV06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Tsai06,
  author       = {Tsung{-}Hsi Tsai},
  title        = {Average case analysis of the Boyer-Moore algorithm},
  journal      = {Random Struct. Algorithms},
  volume       = {28},
  number       = {4},
  pages        = {481--498},
  year         = {2006},
  url          = {https://doi.org/10.1002/rsa.20111},
  doi          = {10.1002/RSA.20111},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Tsai06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.