Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/rsa/AbbeM14,
  author       = {Emmanuel Abbe and
                  Andrea Montanari},
  title        = {On the concentration of the number of solutions of random satisfiability
                  formulas},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {3},
  pages        = {362--382},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20501},
  doi          = {10.1002/RSA.20501},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/AbbeM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BenjaminiKW14,
  author       = {Itai Benjamini and
                  Gady Kozma and
                  Nicholas C. Wormald},
  title        = {The mixing time of the giant component of a random graph},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {3},
  pages        = {383--407},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20539},
  doi          = {10.1002/RSA.20539},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BenjaminiKW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BeveridgeDFMS14,
  author       = {Andrew Beveridge and
                  Andrzej Dudek and
                  Alan M. Frieze and
                  Tobias M{\"{u}}ller and
                  Milos Stojakovic},
  title        = {Maker-breaker games on random geometric graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {4},
  pages        = {553--607},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20572},
  doi          = {10.1002/RSA.20572},
  timestamp    = {Thu, 17 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/BeveridgeDFMS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BorokhovichAL14,
  author       = {Michael Borokhovich and
                  Chen Avin and
                  Zvi Lotker},
  title        = {Bounds for algebraic gossip on graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {2},
  pages        = {185--217},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20480},
  doi          = {10.1002/RSA.20480},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BorokhovichAL14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/ChristofidesM14,
  author       = {Demetres Christofides and
                  Klas Markstr{\"{o}}m},
  title        = {The thresholds for diameter 2 in random Cayley graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {2},
  pages        = {218--235},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20486},
  doi          = {10.1002/RSA.20486},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/ChristofidesM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/ConlonFS14,
  author       = {David Conlon and
                  Jacob Fox and
                  Benny Sudakov},
  title        = {Cycle packing},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {4},
  pages        = {608--626},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20574},
  doi          = {10.1002/RSA.20574},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/ConlonFS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/CooperFL14,
  author       = {Colin Cooper and
                  Alan M. Frieze and
                  Eyal Lubetzky},
  title        = {Cover time of a random graph with a degree sequence {II:} Allowing
                  vertices of degree two},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {4},
  pages        = {627--674},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20573},
  doi          = {10.1002/RSA.20573},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/CooperFL14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/CooperFU14,
  author       = {Colin Cooper and
                  Alan M. Frieze and
                  Ryuhei Uehara},
  title        = {The height of random \emph{k}-trees and related branching processes},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {4},
  pages        = {675--702},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20576},
  doi          = {10.1002/RSA.20576},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/CooperFU14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/CurienK14,
  author       = {Nicolas Curien and
                  Igor Kortchemski},
  title        = {Random non-crossing plane configurations: {A} conditioned Galton-Watson
                  tree approach},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {2},
  pages        = {236--260},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20481},
  doi          = {10.1002/RSA.20481},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/CurienK14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/CzumajGRSSS14,
  author       = {Artur Czumaj and
                  Oded Goldreich and
                  Dana Ron and
                  C. Seshadhri and
                  Asaf Shapira and
                  Christian Sohler},
  title        = {Finding cycles and trees in sublinear time},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {2},
  pages        = {139--184},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20462},
  doi          = {10.1002/RSA.20462},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/CzumajGRSSS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/DevroyeF14,
  author       = {Luc Devroye and
                  Nicolas Fraiman},
  title        = {Connectivity of inhomogeneous random graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {3},
  pages        = {408--420},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20490},
  doi          = {10.1002/RSA.20490},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/DevroyeF14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/DuchJM14,
  author       = {Amalia Duch and
                  Rosa M. Jim{\'{e}}nez and
                  Conrado Mart{\'{\i}}nez},
  title        = {Selection by rank in \emph{K}-dimensional binary search trees},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {1},
  pages        = {14--37},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20476},
  doi          = {10.1002/RSA.20476},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/DuchJM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/EbbersKLV14,
  author       = {Mirko Ebbers and
                  Holger Kn{\"{o}}pfel and
                  Matthias L{\"{o}}we and
                  Franck Vermet},
  title        = {Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths
                  model},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {1},
  pages        = {38--77},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20461},
  doi          = {10.1002/RSA.20461},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/EbbersKLV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/EschenfeldtGP14,
  author       = {Patrick Eschenfeldt and
                  Ben Gross and
                  Nicholas Pippenger},
  title        = {Stochastic service systems, random interval graphs and search algorithms},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {3},
  pages        = {421--442},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20485},
  doi          = {10.1002/RSA.20485},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/EschenfeldtGP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Feierl14,
  author       = {Thomas Feierl},
  title        = {Asymptotics for the number of walks in a Weyl chamber of type \emph{B}},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {2},
  pages        = {261--305},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20467},
  doi          = {10.1002/RSA.20467},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Feierl14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Frieze14,
  author       = {Alan M. Frieze},
  title        = {On a greedy 2-matching algorithm and Hamilton cycles in random graphs
                  with minimum degree at least three},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {3},
  pages        = {443--497},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20482},
  doi          = {10.1002/RSA.20482},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/Frieze14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/GalanisGSVY14,
  author       = {Andreas Galanis and
                  Qi Ge and
                  Daniel Stefankovic and
                  Eric Vigoda and
                  Linji Yang},
  title        = {Improved inapproximability results for counting independent sets in
                  the hard-core model},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {1},
  pages        = {78--110},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20479},
  doi          = {10.1002/RSA.20479},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/GalanisGSVY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/HeimanSS14,
  author       = {Eyal Heiman and
                  Gideon Schechtman and
                  Adi Shraibman},
  title        = {Deterministic algorithms for matrix completion},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {2},
  pages        = {306--317},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20483},
  doi          = {10.1002/RSA.20483},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/HeimanSS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/HolmesS14,
  author       = {Mark Holmes and
                  Thomas S. Salisbury},
  title        = {Degenerate random environments},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {1},
  pages        = {111--137},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20473},
  doi          = {10.1002/RSA.20473},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/HolmesS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/JansonLW14,
  author       = {Svante Janson and
                  Malwina J. Luczak and
                  Peter Windridge},
  title        = {Law of large numbers for the {SIR} epidemic on a random graph with
                  given degrees},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {4},
  pages        = {726--763},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20575},
  doi          = {10.1002/RSA.20575},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/JansonLW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/KangMRS14,
  author       = {Ross J. Kang and
                  Colin McDiarmid and
                  Bruce A. Reed and
                  Alex D. Scott},
  title        = {For most graphs \emph{H}, most \emph{H}-free graphs have a linear
                  homogeneous set},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {3},
  pages        = {343--361},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20488},
  doi          = {10.1002/RSA.20488},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/KangMRS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/LevineP14,
  author       = {Lionel Levine and
                  Yuval Peres},
  title        = {The looping constant of {\(\mathbb{Z}\)}\({}^{\mbox{d}}\)},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {1},
  pages        = {1--13},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20478},
  doi          = {10.1002/RSA.20478},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/LevineP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Molloy14,
  author       = {Michael Molloy},
  title        = {Sets that are connected in two random graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {3},
  pages        = {498--512},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20491},
  doi          = {10.1002/RSA.20491},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/Molloy14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/MullerS14,
  author       = {Tobias M{\"{u}}ller and
                  Milos Stojakovic},
  title        = {A threshold for the Maker-Breaker clique game},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {2},
  pages        = {318--341},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20489},
  doi          = {10.1002/RSA.20489},
  timestamp    = {Thu, 17 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/MullerS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Picollelli14,
  author       = {Michael E. Picollelli},
  title        = {The diamond-free process},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {3},
  pages        = {513--551},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20517},
  doi          = {10.1002/RSA.20517},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Picollelli14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Riordan14,
  author       = {Oliver Riordan},
  title        = {Long cycles in random subgraphs of graphs with large minimum degree},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {4},
  pages        = {764--767},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20571},
  doi          = {10.1002/RSA.20571},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Riordan14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/TamakiY14,
  author       = {Ehsan Ebrahimzadeh and
                  Linda Farczadi and
                  Pu Gao and
                  Abbas Mehrabian and
                  Cristiane M. Sato and
                  Nick Wormald and
                  Jonathan Zung},
  title        = {On longest paths and diameter in random apollonian network},
  journal      = {Random Struct. Algorithms},
  volume       = {45},
  number       = {4},
  pages        = {703--725},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20538},
  doi          = {10.1002/RSA.20538},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/TamakiY14.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.