Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/rsa/AchlioptasCHLMP21,
  author       = {Dimitris Achlioptas and
                  Amin Coja{-}Oghlan and
                  Max Hahn{-}Klimroth and
                  Joon Lee and
                  No{\"{e}}la M{\"{u}}ller and
                  Manuel Penschuck and
                  Guangyan Zhou},
  title        = {The number of satisfying assignments of random 2-SAT formulas},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {4},
  pages        = {609--647},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20993},
  doi          = {10.1002/RSA.20993},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/AchlioptasCHLMP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Addario-BerryBS21,
  author       = {Louigi Addario{-}Berry and
                  Shankar Bhamidi and
                  Sanchayan Sen},
  title        = {A probabilistic approach to the leader problem in random graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {1},
  pages        = {34--67},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20966},
  doi          = {10.1002/RSA.20966},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Addario-BerryBS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AnastosF21,
  author       = {Michael Anastos and
                  Alan M. Frieze},
  title        = {Finding maximum matchings in random regular graphs in linear expected
                  time},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {3},
  pages        = {390--429},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20980},
  doi          = {10.1002/RSA.20980},
  timestamp    = {Thu, 25 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/AnastosF21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarbourBR21,
  author       = {Andrew D. Barbour and
                  Peter Braunsteins and
                  Nathan Ross},
  title        = {Local limit theorems for occupancy models},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {1},
  pages        = {3--33},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20967},
  doi          = {10.1002/RSA.20967},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BarbourBR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanK21,
  author       = {Tom Bohman and
                  Peter Keevash},
  title        = {Dynamic concentration of the triangle-free process},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {2},
  pages        = {221--293},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20973},
  doi          = {10.1002/RSA.20973},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/BohmanK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BonnetKT21,
  author       = {Gilles Bonnet and
                  Zakhar Kabluchko and
                  Nicola Turchi},
  title        = {Phase transition for the volume of high-dimensional random polytopes},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {4},
  pages        = {648--663},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20986},
  doi          = {10.1002/RSA.20986},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BonnetKT21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChenGGPSV21,
  author       = {Zongchen Chen and
                  Andreas Galanis and
                  Leslie Ann Goldberg and
                  Will Perkins and
                  James Stewart and
                  Eric Vigoda},
  title        = {Fast algorithms at low temperatures via Markov chains},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {2},
  pages        = {294--321},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20968},
  doi          = {10.1002/RSA.20968},
  timestamp    = {Wed, 26 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/ChenGGPSV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChenHS21,
  author       = {Antares Chen and
                  David G. Harris and
                  Aravind Srinivasan},
  title        = {Partial resampling to approximate covering integer programs},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {1},
  pages        = {68--93},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20964},
  doi          = {10.1002/RSA.20964},
  timestamp    = {Thu, 24 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/ChenHS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DelmasDS21,
  author       = {Jean{-}Fran{\c{c}}ois Delmas and
                  Jean{-}St{\'{e}}phane Dhersin and
                  Marion Sciauveau},
  title        = {Asymptotic for the cumulative distribution function of the degrees
                  and homomorphism densities for random graphs sampled from a graphon},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {1},
  pages        = {94--149},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20965},
  doi          = {10.1002/RSA.20965},
  timestamp    = {Fri, 18 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/DelmasDS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrmotaFHN21,
  author       = {Michael Drmota and
                  Michael Fuchs and
                  Hsien{-}Kuei Hwang and
                  Ralph Neininger},
  title        = {Node profiles of symmetric digital search trees: Concentration properties},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {3},
  pages        = {430--467},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20979},
  doi          = {10.1002/RSA.20979},
  timestamp    = {Thu, 25 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/DrmotaFHN21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FarberN21,
  author       = {Michael Farber and
                  Tahl Nowik},
  title        = {Topological embeddings into random 2-complexes},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {4},
  pages        = {664--675},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20987},
  doi          = {10.1002/RSA.20987},
  timestamp    = {Thu, 10 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/FarberN21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FoxP21,
  author       = {Jacob Fox and
                  Cosmin Pohoata},
  title        = {Sets without k-term progressions can have many shorter progressions},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {3},
  pages        = {383--389},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20984},
  doi          = {10.1002/RSA.20984},
  timestamp    = {Thu, 25 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/FoxP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GishbolinerSS21,
  author       = {Lior Gishboliner and
                  Asaf Shapira and
                  Henrique Stagni},
  title        = {Testing linear inequalities of subgraph statistics},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {3},
  pages        = {468--479},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20983},
  doi          = {10.1002/RSA.20983},
  timestamp    = {Mon, 01 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/GishbolinerSS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HanMT21,
  author       = {Jie Han and
                  Patrick Morris and
                  Andrew Treglown},
  title        = {Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemer{\'{e}}di
                  and Johansson-Kahn-Vu},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {3},
  pages        = {480--516},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20981},
  doi          = {10.1002/RSA.20981},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/HanMT21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaslegraveP21,
  author       = {John Haslegrave and
                  Christoforos Panagiotis},
  title        = {Site percolation and isoperimetric inequalities for plane graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {1},
  pages        = {150--163},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20946},
  doi          = {10.1002/RSA.20946},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/HaslegraveP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JuskeviciusK21,
  author       = {Tomas Juskevicius and
                  Valentas Kurauskas},
  title        = {On the Littlewood-Offord problem for arbitrary distributions},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {2},
  pages        = {370--380},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20977},
  doi          = {10.1002/RSA.20977},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/JuskeviciusK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Lee21,
  author       = {Joonkyung Lee},
  title        = {On some graph densities in locally dense graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {2},
  pages        = {322--344},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20974},
  doi          = {10.1002/RSA.20974},
  timestamp    = {Thu, 21 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/Lee21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LinialS21,
  author       = {Nati Linial and
                  Michael Simkin},
  title        = {A randomized construction of high girth regular graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {2},
  pages        = {345--369},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20976},
  doi          = {10.1002/RSA.20976},
  timestamp    = {Wed, 19 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/LinialS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LiuZ21,
  author       = {Yang P. Liu and
                  Yufei Zhao},
  title        = {On the upper tail problem for random hypergraphs},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {2},
  pages        = {179--220},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20975},
  doi          = {10.1002/RSA.20975},
  timestamp    = {Thu, 21 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/LiuZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PfaffelhuberS21,
  author       = {Peter Pfaffelhuber and
                  Jakob Stiefel},
  title        = {The range of once-reinforced random walk in one dimension},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {1},
  pages        = {164--175},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20948},
  doi          = {10.1002/RSA.20948},
  timestamp    = {Fri, 14 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/PfaffelhuberS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pinsky21,
  author       = {Ross G. Pinsky},
  title        = {Permutations avoiding a pattern of length three under Mallows distributions},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {4},
  pages        = {676--690},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20988},
  doi          = {10.1002/RSA.20988},
  timestamp    = {Thu, 27 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Pinsky21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Pittel21,
  author       = {Boris G. Pittel},
  title        = {On Bollob{\'{a}}s-Riordan random pairing model of preferential
                  attachment graph},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {4},
  pages        = {691--725},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20985},
  doi          = {10.1002/RSA.20985},
  timestamp    = {Thu, 27 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Pittel21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TikhomirovY21,
  author       = {Konstantin E. Tikhomirov and
                  Pierre Youssef},
  title        = {Outliers in spectrum of sparse Wigner matrices},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {3},
  pages        = {517--605},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20982},
  doi          = {10.1002/RSA.20982},
  timestamp    = {Thu, 25 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/TikhomirovY21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Zeindler21,
  author       = {Dirk Zeindler},
  title        = {Long cycle of random permutations with polynomially growing cycle
                  weights},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {4},
  pages        = {726--739},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20989},
  doi          = {10.1002/RSA.20989},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/Zeindler21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics