Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/rsa/AndreisKP21,
  author       = {Luisa Andreis and
                  Wolfgang K{\"{o}}nig and
                  Robert I. A. Patterson},
  title        = {A large-deviations principle for all the cluster sizes of a sparse
                  Erd{\H{o}}s-R{\'{e}}nyi graph},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {4},
  pages        = {522--553},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21007},
  doi          = {10.1002/RSA.21007},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/AndreisKP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/ArmanGW21,
  author       = {Andrii Arman and
                  Pu Gao and
                  Nicholas C. Wormald},
  title        = {Fast uniform generation of random graphs with given degree sequences},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {3},
  pages        = {291--314},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21004},
  doi          = {10.1002/RSA.21004},
  timestamp    = {Thu, 09 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/ArmanGW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BatesP21,
  author       = {Erik Bates and
                  Moumanti Podder},
  title        = {Avoidance couplings on non-complete graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {1},
  pages        = {25--52},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20999},
  doi          = {10.1002/RSA.20999},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/BatesP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BhandariHMS21,
  author       = {Siddharth Bhandari and
                  Prahladh Harsha and
                  Tulasimohan Molli and
                  Srikanth Srinivasan},
  title        = {On the probabilistic degree of {OR} over the reals},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {1},
  pages        = {53--67},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20991},
  doi          = {10.1002/RSA.20991},
  timestamp    = {Wed, 30 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BhandariHMS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BhattacharyaD21,
  author       = {Sohom Bhattacharya and
                  Amir Dembo},
  title        = {Upper tail for homomorphism counts in constrained sparse random graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {3},
  pages        = {315--338},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21011},
  doi          = {10.1002/RSA.21011},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BhattacharyaD21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/BienvenuDF21,
  author       = {Fran{\c{c}}ois Bienvenu and
                  Jean{-}Jil Duchamps and
                  F{\'{e}}lix Foutel{-}Rodier},
  title        = {The Moran forest},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {2},
  pages        = {155--188},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20997},
  doi          = {10.1002/RSA.20997},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/BienvenuDF21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Borga21,
  author       = {Jacopo Borga},
  title        = {Asymptotic normality of consecutive patterns in permutations encoded
                  by generating trees with one-dimensional labels},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {3},
  pages        = {339--375},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21005},
  doi          = {10.1002/RSA.21005},
  timestamp    = {Thu, 09 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Borga21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/CaputoQ21,
  author       = {Pietro Caputo and
                  Matteo Quattropani},
  title        = {Mixing time of PageRank surfers on sparse random digraphs},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {3},
  pages        = {376--406},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21009},
  doi          = {10.1002/RSA.21009},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/CaputoQ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/DamronLS21,
  author       = {Michael Damron and
                  Hanbaek Lyu and
                  David Sivakoff},
  title        = {Stretched exponential decay for subcritical parking times on},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {2},
  pages        = {143--154},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21001},
  doi          = {10.1002/RSA.21001},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/DamronLS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/DraganicKN21,
  author       = {Nemanja Draganic and
                  Michael Krivelevich and
                  Rajko Nenadov},
  title        = {The size-Ramsey number of short subdivisions},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {1},
  pages        = {68--78},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20995},
  doi          = {10.1002/RSA.20995},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/DraganicKN21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/DyerGM21,
  author       = {Martin E. Dyer and
                  Catherine S. Greenhill and
                  Haiko M{\"{u}}ller},
  title        = {Counting independent sets in graphs with bounded bipartite pathwidth},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {2},
  pages        = {204--237},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21003},
  doi          = {10.1002/RSA.21003},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/DyerGM21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/FoxSW21,
  author       = {Jacob Fox and
                  Lisa Sauermann and
                  Fan Wei},
  title        = {On the inducibility problem for random Cayley graphs of abelian groups
                  with a few deleted vertices},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {4},
  pages        = {554--615},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21010},
  doi          = {10.1002/RSA.21010},
  timestamp    = {Wed, 08 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/FoxSW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Heckel21,
  author       = {Annika Heckel},
  title        = {Random triangles in random graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {4},
  pages        = {616--621},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21013},
  doi          = {10.1002/RSA.21013},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Heckel21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/HolroydM21,
  author       = {Alexander E. Holroyd and
                  James B. Martin},
  title        = {Galton-Watson games},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {4},
  pages        = {495--521},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21008},
  doi          = {10.1002/RSA.21008},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/HolroydM21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/LarssonM21,
  author       = {Joel Larsson and
                  Klas Markstr{\"{o}}m},
  title        = {Biased random k-SAT},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {2},
  pages        = {238--266},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20996},
  doi          = {10.1002/RSA.20996},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/LarssonM21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Lason21,
  author       = {Michal Lason},
  title        = {Optimal stopping for many connected components in a graph},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {2},
  pages        = {267--287},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21000},
  doi          = {10.1002/RSA.21000},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/Lason21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/McDiarmidSW21,
  author       = {Colin McDiarmid and
                  Alex Scott and
                  Paul Withers},
  title        = {The component structure of dense random subgraphs of the hypercube},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {1},
  pages        = {3--24},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20990},
  doi          = {10.1002/RSA.20990},
  timestamp    = {Wed, 30 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/McDiarmidSW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/NieV21,
  author       = {Jiaxi Nie and
                  Jacques Verstra{\"{e}}te},
  title        = {Randomized greedy algorithm for independent sets in regular uniform
                  hypergraphs with large girth},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {1},
  pages        = {79--95},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20994},
  doi          = {10.1002/RSA.20994},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/NieV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/PalZ21,
  author       = {Soumik Pal and
                  Yizhe Zhu},
  title        = {Community detection in the sparse hypergraph stochastic block model},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {3},
  pages        = {407--463},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21006},
  doi          = {10.1002/RSA.21006},
  timestamp    = {Thu, 09 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/PalZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Pinsky21a,
  author       = {Ross G. Pinsky},
  title        = {The infinite limit of separable permutations},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {4},
  pages        = {622--639},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21014},
  doi          = {10.1002/RSA.21014},
  timestamp    = {Wed, 08 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/Pinsky21a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/RaskhodnikovaRV21,
  author       = {Sofya Raskhodnikova and
                  Noga Ron{-}Zewi and
                  Nithin Varma},
  title        = {Erasures versus errors in local decoding and property testing},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {4},
  pages        = {640--670},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21031},
  doi          = {10.1002/RSA.21031},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/RaskhodnikovaRV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Santis21,
  author       = {Emilio De Santis},
  title        = {Ranking graphs through hitting times of Markov chains},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {2},
  pages        = {189--203},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20998},
  doi          = {10.1002/RSA.20998},
  timestamp    = {Thu, 05 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Santis21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/ShimizuS21,
  author       = {Nobutaka Shimizu and
                  Takeharu Shiraga},
  title        = {Phase transitions of Best-of-two and Best-of-three on stochastic block
                  models},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {1},
  pages        = {96--140},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20992},
  doi          = {10.1002/RSA.20992},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/ShimizuS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/Stufler21,
  author       = {Benedikt Stufler},
  title        = {Graphon convergence of random cographs},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {3},
  pages        = {464--491},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21002},
  doi          = {10.1002/RSA.21002},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Stufler21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/X21,
  title        = {Corrigendum to "Online purchasing under uncertainty"},
  journal      = {Random Struct. Algorithms},
  volume       = {59},
  number       = {2},
  pages        = {288},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.21012},
  doi          = {10.1002/RSA.21012},
  timestamp    = {Thu, 05 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/X21.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.