Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/rsa/BarbourR04,
  author       = {Andrew D. Barbour and
                  Gesine Reinert},
  title        = {Correction: Small worlds},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {1},
  pages        = {115},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20028},
  doi          = {10.1002/RSA.20028},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/BarbourR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BenderSS04,
  author       = {Michael A. Bender and
                  Saurabh Sethia and
                  Steven Skiena},
  title        = {Data structures for maintaining set partitions},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {1},
  pages        = {43--67},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20025},
  doi          = {10.1002/RSA.20025},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BenderSS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Bertoin04,
  author       = {Jean Bertoin},
  title        = {Random covering of an interval and a variation of Kingman's coalescent},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {3},
  pages        = {277--292},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20022},
  doi          = {10.1002/RSA.20022},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Bertoin04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BohmanFW04,
  author       = {Tom Bohman and
                  Alan M. Frieze and
                  Nicholas C. Wormald},
  title        = {Avoidance of a giant component in half the edge set of a random graph},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {4},
  pages        = {432--449},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20038},
  doi          = {10.1002/RSA.20038},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/BohmanFW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BorkarEF04,
  author       = {Vivek S. Borkar and
                  Vladimir Ejov and
                  Jerzy A. Filar},
  title        = {Directed graphs, Hamiltonicity and doubly stochastic matrices},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {4},
  pages        = {376--395},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20034},
  doi          = {10.1002/RSA.20034},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BorkarEF04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/ChungC04,
  author       = {Fan R. K. Chung and
                  Joshua N. Cooper},
  title        = {De Bruijn cycles for covering codes},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {4},
  pages        = {421--431},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20033},
  doi          = {10.1002/RSA.20033},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/ChungC04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Cooper04,
  author       = {Colin Cooper},
  title        = {The cores of random hypergraphs with a given degree sequence},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {4},
  pages        = {353--375},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20040},
  doi          = {10.1002/RSA.20040},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Cooper04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/CsorgoW04,
  author       = {S{\'{a}}ndor Cs{\"{o}}rgo and
                  Wei Biao Wu},
  title        = {On the clustering of independent uniform random variables},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {4},
  pages        = {396--420},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20030},
  doi          = {10.1002/RSA.20030},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/CsorgoW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/DyerG04,
  author       = {Martin E. Dyer and
                  Catherine S. Greenhill},
  title        = {Corrigendum: The complexity of counting graph homomorphisms},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {3},
  pages        = {346--352},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20036},
  doi          = {10.1002/RSA.20036},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/DyerG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/EngebretsenG04,
  author       = {Lars Engebretsen and
                  Venkatesan Guruswami},
  title        = {Is constraint satisfaction over two variables always easy?},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {2},
  pages        = {150--178},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20026},
  doi          = {10.1002/RSA.20026},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/EngebretsenG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/ErlihsonG04,
  author       = {Michael M. Erlihson and
                  Boris L. Granovsky},
  title        = {Reversible coagulation-fragmentation processes and random combinatorial
                  structures: Asymptotics for the number of groups},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {2},
  pages        = {227--245},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20020},
  doi          = {10.1002/RSA.20020},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/ErlihsonG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/GeigerK04,
  author       = {Jochen Geiger and
                  Lars Kauffmann},
  title        = {The shape of large Galton-Watson trees with possibly infinite variance},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {3},
  pages        = {311--335},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20021},
  doi          = {10.1002/RSA.20021},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/GeigerK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/HastadV04,
  author       = {Johan H{\aa}stad and
                  Srinivasan Venkatesh},
  title        = {On the advantage over a random assignment},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {2},
  pages        = {117--149},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20031},
  doi          = {10.1002/RSA.20031},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/HastadV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/KnesslS04,
  author       = {Charles Knessl and
                  Wojciech Szpankowski},
  title        = {On the number of full levels in tries},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {3},
  pages        = {247--276},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20023},
  doi          = {10.1002/RSA.20023},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/KnesslS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/LevinP04,
  author       = {David A. Levin and
                  Yuval Peres},
  title        = {Identifying several biased coins encountered by a hidden random walk},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {1},
  pages        = {91--114},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20018},
  doi          = {10.1002/RSA.20018},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/LevinP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Martinez04,
  author       = {Servet Mart{\'{\i}}nez},
  title        = {Some bounds on the coupon collector problem},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {2},
  pages        = {208--226},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20019},
  doi          = {10.1002/RSA.20019},
  timestamp    = {Mon, 26 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Martinez04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Mazza04,
  author       = {Christian Mazza},
  title        = {Simply generated trees, B-series and Wigner processes},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {3},
  pages        = {293--310},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20024},
  doi          = {10.1002/RSA.20024},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Mazza04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Panholzer04,
  author       = {Alois Panholzer},
  title        = {The distribution of the size of the ancestor-tree and of the induced
                  spanning subtree for random trees},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {2},
  pages        = {179--207},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20027},
  doi          = {10.1002/RSA.20027},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Panholzer04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/PrescottS04,
  author       = {Timothy Prescott and
                  Francis Edward Su},
  title        = {Random walks on the torus with several generators},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {3},
  pages        = {336--345},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20029},
  doi          = {10.1002/RSA.20029},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/PrescottS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/RodlS04,
  author       = {Vojtech R{\"{o}}dl and
                  Jozef Skokan},
  title        = {Regularity Lemma for k-uniform hypergraphs},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {1},
  pages        = {1--42},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20017},
  doi          = {10.1002/RSA.20017},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/RodlS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Salavatipour04,
  author       = {Mohammad R. Salavatipour},
  title        = {A {(1} + varepsilon )-approximation algorithm for partitioning hypergraphs
                  using a new algorithmic version of the Lova'sz Local Lemma},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {1},
  pages        = {68--90},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20016},
  doi          = {10.1002/RSA.20016},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Salavatipour04.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.