Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/rsa/AilonCCL07,
  author       = {Nir Ailon and
                  Bernard Chazelle and
                  Seshadhri Comandur and
                  Ding Liu},
  title        = {Estimating the distance to a monotone function},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {3},
  pages        = {371--383},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20167},
  doi          = {10.1002/RSA.20167},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/AilonCCL07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Albert07,
  author       = {Michael H. Albert},
  title        = {On the length of the longest subsequence avoiding an arbitrary pattern
                  in a random permutation},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {227--238},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20140},
  doi          = {10.1002/RSA.20140},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Albert07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/AlonC07,
  author       = {Noga Alon and
                  Michael R. Capalbo},
  title        = {Sparse universal graphs for bounded-degree graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {123--133},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20143},
  doi          = {10.1002/RSA.20143},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/AlonC07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/AlonIN07,
  author       = {Noga Alon and
                  Toshiya Itoh and
                  Tatsuya Nagatani},
  title        = {On (epsilon, k)-min-wise independent permutations},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {3},
  pages        = {384--389},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20184},
  doi          = {10.1002/RSA.20184},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/AlonIN07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BaranyVV07,
  author       = {Imre B{\'{a}}r{\'{a}}ny and
                  Santosh S. Vempala and
                  Adrian Vetta},
  title        = {Nash equilibria in random games},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {4},
  pages        = {391--405},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20199},
  doi          = {10.1002/RSA.20199},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BaranyVV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BiskupCS07,
  author       = {Marek Biskup and
                  Lincoln Chayes and
                  S. Alex Smith},
  title        = {Large-deviations/thermodynamic approach to percolation on the complete
                  graph},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {3},
  pages        = {354--370},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20169},
  doi          = {10.1002/RSA.20169},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BiskupCS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BollobasJR07,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Svante Janson and
                  Oliver Riordan},
  title        = {The phase transition in inhomogeneous random graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {3--122},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20168},
  doi          = {10.1002/RSA.20168},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BollobasJR07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BollobasJR07a,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Svante Janson and
                  Oliver Riordan},
  title        = {Spread-out percolation in R\({}^{\mbox{d}}\)},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {239--246},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20175},
  doi          = {10.1002/RSA.20175},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BollobasJR07a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Coja-OghlanMS07,
  author       = {Amin Coja{-}Oghlan and
                  Cristopher Moore and
                  Vishal Sanwalani},
  title        = {Counting connected graphs and hypergraphs via the probabilistic method},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {3},
  pages        = {288--329},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20160},
  doi          = {10.1002/RSA.20160},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/Coja-OghlanMS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/FengS07,
  author       = {Qunqiang Feng and
                  Chun Su},
  title        = {The structure and distances in Yule recursive trees},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {3},
  pages        = {273--287},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20183},
  doi          = {10.1002/RSA.20183},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/FengS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/FernholzR07,
  author       = {Daniel Fernholz and
                  Vijaya Ramachandran},
  title        = {The diameter of sparse random graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {4},
  pages        = {482--516},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20197},
  doi          = {10.1002/RSA.20197},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/FernholzR07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/GerkeMS07,
  author       = {Stefanie Gerke and
                  Martin Marciniszyn and
                  Angelika Steger},
  title        = {A probabilistic counting lemma for complete graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {4},
  pages        = {517--534},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20198},
  doi          = {10.1002/RSA.20198},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/GerkeMS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/HayesV07,
  author       = {Thomas P. Hayes and
                  Eric Vigoda},
  title        = {Variable length path coupling},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {3},
  pages        = {251--272},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20166},
  doi          = {10.1002/RSA.20166},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/HayesV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Jaggard07,
  author       = {Aaron D. Jaggard},
  title        = {An almost-bijective proof of an asymptotic property of partitions},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {247--250},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20180},
  doi          = {10.1002/RSA.20180},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Jaggard07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/KangS07,
  author       = {Mihyun Kang and
                  Taral Guldahl Seierstad},
  title        = {Phase transition of the minimum degree random multigraph process},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {3},
  pages        = {330--353},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20170},
  doi          = {10.1002/RSA.20170},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/KangS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/MartinelliSW07,
  author       = {Fabio Martinelli and
                  Alistair Sinclair and
                  Dror Weitz},
  title        = {Fast mixing for independent sets, colorings, and other models on trees},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {134--172},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20132},
  doi          = {10.1002/RSA.20132},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/MartinelliSW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/MooreIDV07,
  author       = {Cristopher Moore and
                  Gabriel Istrate and
                  Demetrios D. Demopoulos and
                  Moshe Y. Vardi},
  title        = {A continuous-discontinuous second-order transition in the satisfiability
                  of random Horn-SAT formulas},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {173--185},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20176},
  doi          = {10.1002/RSA.20176},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/MooreIDV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/PanholzerP07,
  author       = {Alois Panholzer and
                  Helmut Prodinger},
  title        = {Level of nodes in increasing trees revisited},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {203--226},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20161},
  doi          = {10.1002/RSA.20161},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/PanholzerP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Roch07,
  author       = {S{\'{e}}bastien Roch},
  title        = {On learning thresholds of parities and unions of rectangles in random
                  walk models},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {4},
  pages        = {406--417},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20162},
  doi          = {10.1002/RSA.20162},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Roch07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/RudasTV07,
  author       = {Anna Rudas and
                  B{\'{a}}lint T{\'{o}}th and
                  Benedek Valk{\'{o}}},
  title        = {Random trees and general branching processes},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {186--202},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20137},
  doi          = {10.1002/RSA.20137},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/RudasTV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/ShamirT07,
  author       = {Ron Shamir and
                  Dekel Tsur},
  title        = {Improved algorithms for the random cluster graph model},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {4},
  pages        = {418--449},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20181},
  doi          = {10.1002/RSA.20181},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/ShamirT07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/TelcsWZ07,
  author       = {Andr{\'{a}}s Telcs and
                  Nicholas C. Wormald and
                  Sanming Zhou},
  title        = {Hamiltonicity of random graphs produced by 2-processes},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {4},
  pages        = {450--481},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20133},
  doi          = {10.1002/RSA.20133},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/TelcsWZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/X07,
  title        = {Ubiquitous percolation},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {1--2},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20173},
  doi          = {10.1002/RSA.20173},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/X07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.