Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/rsa/AdlerAR01,
  author       = {Ilan Adler and
                  Noga Alon and
                  Sheldon M. Ross},
  title        = {On the maximum number of Hamiltonian paths in tournaments},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {3},
  pages        = {291--296},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1010},
  doi          = {10.1002/RSA.1010},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/AdlerAR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Aldous01,
  author       = {David J. Aldous},
  title        = {The zeta(2) limit in the random assignment problem},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {4},
  pages        = {381--418},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1015},
  doi          = {10.1002/RSA.1015},
  timestamp    = {Sat, 30 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Aldous01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BednarskaL01,
  author       = {Malgorzata Bednarska and
                  Tomasz Luczak},
  title        = {Biased positional games and the phase transition},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {2},
  pages        = {141--152},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200103)18:2\<141::AID-RSA1002\>3.0.CO;2-W},
  doi          = {10.1002/1098-2418(200103)18:2\<141::AID-RSA1002\>3.0.CO;2-W},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BednarskaL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BollobasBCKW01,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Christian Borgs and
                  Jennifer T. Chayes and
                  Jeong Han Kim and
                  David Bruce Wilson},
  title        = {The scaling window of the 2-SAT transition},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {3},
  pages        = {201--256},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1006},
  doi          = {10.1002/RSA.1006},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/BollobasBCKW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BollobasRST01,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Oliver Riordan and
                  Joel Spencer and
                  G{\'{a}}bor E. Tusn{\'{a}}dy},
  title        = {The degree sequence of a scale-free random graph process},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {3},
  pages        = {279--290},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1009},
  doi          = {10.1002/RSA.1009},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/BollobasRST01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BroderM01,
  author       = {Andrei Z. Broder and
                  Michael Mitzenmacher},
  title        = {Completeness and robustness properties of min-wise independent permutations},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {1},
  pages        = {18--30},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200101)18:1\<18::AID-RSA2\>3.0.CO;2-M},
  doi          = {10.1002/1098-2418(200101)18:1\<18::AID-RSA2\>3.0.CO;2-M},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BroderM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/CondonK01,
  author       = {Anne Condon and
                  Richard M. Karp},
  title        = {Algorithms for graph partitioning on the planted partition model},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {2},
  pages        = {116--140},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200103)18:2\<116::AID-RSA1001\>3.0.CO;2-2},
  doi          = {10.1002/1098-2418(200103)18:2\<116::AID-RSA1001\>3.0.CO;2-2},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/CondonK01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Cooper01,
  author       = {Colin Cooper},
  title        = {The union of two random permutations does not have a directed Hamilton
                  cycle},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {1},
  pages        = {95--98},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200101)18:1\<95::AID-RSA7\>3.0.CO;2-8},
  doi          = {10.1002/1098-2418(200101)18:1\<95::AID-RSA7\>3.0.CO;2-8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Cooper01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/CzumajS01,
  author       = {Artur Czumaj and
                  Volker Stemann},
  title        = {Randomized allocation processes},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {4},
  pages        = {297--331},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1011},
  doi          = {10.1002/RSA.1011},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/CzumajS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Frieze01,
  author       = {Alan M. Frieze},
  title        = {Hamilton cycles in the union of random permutations},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {1},
  pages        = {83--94},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200101)18:1\<83::AID-RSA6\>3.0.CO;2-I},
  doi          = {10.1002/1098-2418(200101)18:1\<83::AID-RSA6\>3.0.CO;2-I},
  timestamp    = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/Frieze01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Grimmett01,
  author       = {Geoffrey R. Grimmett},
  title        = {Infinite paths in randomly oriented lattices},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {3},
  pages        = {257--266},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1007},
  doi          = {10.1002/RSA.1007},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Grimmett01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Haggstrom01,
  author       = {Olle H{\"{a}}ggstr{\"{o}}m},
  title        = {A note on disagreement percolation},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {3},
  pages        = {267--278},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1008},
  doi          = {10.1002/RSA.1008},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Haggstrom01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/JansonSV01,
  author       = {Svante Janson and
                  Yannis C. Stamatiou and
                  Malvina Vamvakari},
  title        = {Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {1},
  pages        = {99--100},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200101)18:1\<99::AID-RSA8\>3.0.CO;2-U},
  doi          = {10.1002/1098-2418(200101)18:1\<99::AID-RSA8\>3.0.CO;2-U},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/JansonSV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/KrivelevichSVW01,
  author       = {Michael Krivelevich and
                  Benny Sudakov and
                  Van H. Vu and
                  Nicholas C. Wormald},
  title        = {Random regular graphs of high degree},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {4},
  pages        = {346--363},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1013},
  doi          = {10.1002/RSA.1013},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/KrivelevichSVW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/KumarR01,
  author       = {V. S. Anil Kumar and
                  H. Ramesh},
  title        = {Coupling vs. conductance for the Jerrum-Sinclair chain},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {1},
  pages        = {1--17},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200101)18:1\<1::AID-RSA1\>3.0.CO;2-7},
  doi          = {10.1002/1098-2418(200101)18:1\<1::AID-RSA1\>3.0.CO;2-7},
  timestamp    = {Fri, 08 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/KumarR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/LuczakM01,
  author       = {Malwina J. Luczak and
                  Colin McDiarmid},
  title        = {Bisecting sparse random graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {1},
  pages        = {31--38},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200101)18:1\<31::AID-RSA3\>3.0.CO;2-1},
  doi          = {10.1002/1098-2418(200101)18:1\<31::AID-RSA3\>3.0.CO;2-1},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/LuczakM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Marckert01,
  author       = {Jean{-}Fran{\c{c}}ois Marckert},
  title        = {Parking with density},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {4},
  pages        = {364--380},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1014},
  doi          = {10.1002/RSA.1014},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Marckert01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/MazzaP01,
  author       = {Christian Mazza and
                  Didier Piau},
  title        = {On the effect of selection in genetic algorithms},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {2},
  pages        = {185--200},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200103)18:2\<185::AID-RSA1005\>3.0.CO;2-7},
  doi          = {10.1002/1098-2418(200103)18:2\<185::AID-RSA1005\>3.0.CO;2-7},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/MazzaP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Molloy01,
  author       = {Michael Molloy},
  title        = {Very rapidly mixing Markov chains for 2-colorings and for independent
                  sets in a graph with maximum degree 4},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {2},
  pages        = {101--115},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200103)18:2\<101::AID-RSA1000\>3.0.CO;2-D},
  doi          = {10.1002/1098-2418(200103)18:2\<101::AID-RSA1000\>3.0.CO;2-D},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/Molloy01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/OsthusT01,
  author       = {Deryk Osthus and
                  Anusch Taraz},
  title        = {Random maximal H-free graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {1},
  pages        = {61--82},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200101)18:1\<61::AID-RSA5\>3.0.CO;2-T},
  doi          = {10.1002/1098-2418(200101)18:1\<61::AID-RSA5\>3.0.CO;2-T},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/OsthusT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/PittelT01,
  author       = {Boris G. Pittel and
                  R. Tungol},
  title        = {A phase transition phenomenon in a random directed acyclic graph},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {2},
  pages        = {164--184},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200103)18:2\<164::AID-RSA1004\>3.0.CO;2-H},
  doi          = {10.1002/1098-2418(200103)18:2\<164::AID-RSA1004\>3.0.CO;2-H},
  timestamp    = {Fri, 26 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/PittelT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Smythe01,
  author       = {Robert T. Smythe},
  title        = {The Boyer-Moore-Horspool heuristic with Markovian input},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {2},
  pages        = {153--163},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200103)18:2\<153::AID-RSA1003\>3.0.CO;2-O},
  doi          = {10.1002/1098-2418(200103)18:2\<153::AID-RSA1003\>3.0.CO;2-O},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Smythe01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Stark01,
  author       = {Dudley Stark},
  title        = {Compound Poisson approximations of subgraph counts in random graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {1},
  pages        = {39--60},
  year         = {2001},
  url          = {https://doi.org/10.1002/1098-2418(200101)18:1\<39::AID-RSA4\>3.0.CO;2-B},
  doi          = {10.1002/1098-2418(200101)18:1\<39::AID-RSA4\>3.0.CO;2-B},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Stark01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/White01,
  author       = {Damien G. White},
  title        = {On the value of the critical point in fractal percolation},
  journal      = {Random Struct. Algorithms},
  volume       = {18},
  number       = {4},
  pages        = {332--345},
  year         = {2001},
  url          = {https://doi.org/10.1002/rsa.1012},
  doi          = {10.1002/RSA.1012},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/White01.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.