default search action
Search dblp for Publications
export results for "toc:db/journals/rsa/rsa15.bht:"
@article{DBLP:journals/rsa/AizenmanBNW99, author = {Michael Aizenman and Almut Burchard and Charles M. Newman and David Bruce Wilson}, title = {Scaling limits for minimal and random spanning trees in two dimensions}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {319--367}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<319::AID-RSA8\>3.0.CO;2-G}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<319::AID-RSA8\>3.0.CO;2-G}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/AizenmanBNW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/AldousP99, author = {David J. Aldous and Jim Pitman}, title = {A family of random trees with random edge lengths}, journal = {Random Struct. Algorithms}, volume = {15}, number = {2}, pages = {176--195}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199909)15:2\<176::AID-RSA4\>3.0.CO;2-4}, doi = {10.1002/(SICI)1098-2418(199909)15:2\<176::AID-RSA4\>3.0.CO;2-4}, timestamp = {Wed, 27 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/AldousP99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/BohmanG99, author = {Tom Bohman and Janko Gravner}, title = {Random threshold growth dynamics}, journal = {Random Struct. Algorithms}, volume = {15}, number = {1}, pages = {93--111}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199908)15:1\<93::AID-RSA4\>3.0.CO;2-K}, doi = {10.1002/(SICI)1098-2418(199908)15:1\<93::AID-RSA4\>3.0.CO;2-K}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/BohmanG99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/BorgsCKS99, author = {Christian Borgs and Jennifer T. Chayes and Harry Kesten and Joel Spencer}, title = {Uniform boundedness of critical crossing probabilities implies hyperscaling}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {368--413}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<368::AID-RSA9\>3.0.CO;2-B}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<368::AID-RSA9\>3.0.CO;2-B}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/BorgsCKS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/ChayesR99, author = {Jennifer T. Chayes and Dana Randall}, title = {Foreword}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {209}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<209::AID-RSA1\>3.0.CO;2-4}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<209::AID-RSA1\>3.0.CO;2-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/ChayesR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/CooperF99, author = {Colin Cooper and Alan M. Frieze}, title = {Mixing properties of the Swendsen-Wang process on classes of graphs}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {242--261}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<242::AID-RSA4\>3.0.CO;2-C}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<242::AID-RSA4\>3.0.CO;2-C}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/CooperF99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/CoppersmithS99, author = {Don Coppersmith and Gregory B. Sorkin}, title = {Constructive bounds and exact expectations for the random assignment problem}, journal = {Random Struct. Algorithms}, volume = {15}, number = {2}, pages = {113--144}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199909)15:2\<113::AID-RSA1\>3.0.CO;2-S}, doi = {10.1002/(SICI)1098-2418(199909)15:2\<113::AID-RSA1\>3.0.CO;2-S}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/CoppersmithS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Garmo99, author = {Hans Garmo}, title = {The asymptotic distribution of long cycles in random regular graphs}, journal = {Random Struct. Algorithms}, volume = {15}, number = {1}, pages = {43--92}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199908)15:1\<43::AID-RSA3\>3.0.CO;2-S}, doi = {10.1002/(SICI)1098-2418(199908)15:1\<43::AID-RSA3\>3.0.CO;2-S}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Garmo99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/HaggstromP99, author = {Olle H{\"{a}}ggstr{\"{o}}m and Robin Pemantle}, title = {On near-critical and dynamical percolation in the tree case}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {311--318}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<311::AID-RSA7\>3.0.CO;2-6}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<311::AID-RSA7\>3.0.CO;2-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/HaggstromP99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/KarpKW99, author = {Richard M. Karp and Claire Kenyon and Orli Waarts}, title = {Error-resilient {DNA} computation}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {450--466}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<450::AID-RSA12\>3.0.CO;2-2}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<450::AID-RSA12\>3.0.CO;2-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/KarpKW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Louchard99, author = {Guy Louchard}, title = {Probabilistic analysis of column-convex and directed diagonally-convex animals. {II:} Trajectories and shapes}, journal = {Random Struct. Algorithms}, volume = {15}, number = {1}, pages = {1--23}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199908)15:1\<1::AID-RSA1\>3.0.CO;2-5}, doi = {10.1002/(SICI)1098-2418(199908)15:1\<1::AID-RSA1\>3.0.CO;2-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Louchard99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/LubyV99, author = {Michael Luby and Eric Vigoda}, title = {Fast convergence of the Glauber dynamics for sampling independent sets}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {229--241}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<229::AID-RSA3\>3.0.CO;2-X}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<229::AID-RSA3\>3.0.CO;2-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/LubyV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Matzinger99, author = {Heinrich Matzinger}, title = {Reconstructing a three-color scenery by observing it along a simple random walk path}, journal = {Random Struct. Algorithms}, volume = {15}, number = {2}, pages = {196--207}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199909)15:2\<196::AID-RSA5\>3.0.CO;2-\%23}, doi = {10.1002/(SICI)1098-2418(199909)15:2\<196::AID-RSA5\>3.0.CO;2-\%23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Matzinger99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/MonassonZKST99, author = {R{\'{e}}mi Monasson and Riccardo Zecchina and Scott Kirkpatrick and Bart Selman and Lidror Troyansky}, title = {2+p-SAT: Relation of typical-case complexity to the nature of the phase transition}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {414--435}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<414::AID-RSA10\>3.0.CO;2-G}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<414::AID-RSA10\>3.0.CO;2-G}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/MonassonZKST99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/NandaN99, author = {S. Nanda and Charles M. Newman}, title = {Random nearest neighbor and influence graphs on Z\({}^{\mbox{d}}\)}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {262--278}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<262::AID-RSA5\>3.0.CO;2-7}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<262::AID-RSA5\>3.0.CO;2-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/NandaN99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/NeiningerR99, author = {Ralph Neininger and Ludger R{\"{u}}schendorf}, title = {On the internal path length of d-dimensional quad trees}, journal = {Random Struct. Algorithms}, volume = {15}, number = {1}, pages = {25--41}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199908)15:1\<25::AID-RSA2\>3.0.CO;2-R}, doi = {10.1002/(SICI)1098-2418(199908)15:1\<25::AID-RSA2\>3.0.CO;2-R}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/NeiningerR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Penrose99, author = {Mathew D. Penrose}, title = {On k-connectivity for a geometric random graph}, journal = {Random Struct. Algorithms}, volume = {15}, number = {2}, pages = {145--164}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199909)15:2\<145::AID-RSA2\>3.0.CO;2-G}, doi = {10.1002/(SICI)1098-2418(199909)15:2\<145::AID-RSA2\>3.0.CO;2-G}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Penrose99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/PittelW99, author = {Boris G. Pittel and Robert S. Weishaar}, title = {The random bipartite nearest neighbor graphs}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {279--310}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<279::AID-RSA6\>3.0.CO;2-J}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<279::AID-RSA6\>3.0.CO;2-J}, timestamp = {Fri, 26 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/PittelW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Rhee99, author = {Wansoo T. Rhee}, title = {Some exact rates for the random weighted interval packing problem}, journal = {Random Struct. Algorithms}, volume = {15}, number = {2}, pages = {165--175}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199909)15:2\<165::AID-RSA3\>3.0.CO;2-B}, doi = {10.1002/(SICI)1098-2418(199909)15:2\<165::AID-RSA3\>3.0.CO;2-B}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Rhee99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Talagrand99a, author = {Michel Talagrand}, title = {Intersecting random half cubes}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {436--449}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<436::AID-RSA11\>3.0.CO;2-5}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<436::AID-RSA11\>3.0.CO;2-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Talagrand99a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Welsh99, author = {Dominic Welsh}, title = {The Tutte polynomial}, journal = {Random Struct. Algorithms}, volume = {15}, number = {3-4}, pages = {210--228}, year = {1999}, url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\<210::AID-RSA2\>3.0.CO;2-R}, doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\<210::AID-RSA2\>3.0.CO;2-R}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Welsh99.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.