Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 58
Volume 58, Number 1, January 2021
- Andrew D. Barbour, Peter Braunsteins
, Nathan Ross:
Local limit theorems for occupancy models. 3-33 - Louigi Addario-Berry, Shankar Bhamidi, Sanchayan Sen:
A probabilistic approach to the leader problem in random graphs. 34-67 - Antares Chen, David G. Harris, Aravind Srinivasan:
Partial resampling to approximate covering integer programs. 68-93 - Jean-François Delmas, Jean-Stéphane Dhersin, Marion Sciauveau:
Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon. 94-149 - John Haslegrave, Christoforos Panagiotis:
Site percolation and isoperimetric inequalities for plane graphs. 150-163 - Peter Pfaffelhuber, Jakob Stiefel:
The range of once-reinforced random walk in one dimension. 164-175
Volume 58, Number 2, March 2021
- Yang P. Liu, Yufei Zhao:
On the upper tail problem for random hypergraphs. 179-220 - Tom Bohman, Peter Keevash:
Dynamic concentration of the triangle-free process. 221-293 - Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast algorithms at low temperatures via Markov chains. 294-321 - Joonkyung Lee:
On some graph densities in locally dense graphs. 322-344 - Nati Linial, Michael Simkin:
A randomized construction of high girth regular graphs. 345-369 - Tomas Juskevicius, Valentas Kurauskas:
On the Littlewood-Offord problem for arbitrary distributions. 370-380
Volume 58, Number 3, May 2021
- Jacob Fox, Cosmin Pohoata:
Sets without k-term progressions can have many shorter progressions. 383-389 - Michael Anastos, Alan M. Frieze:
Finding maximum matchings in random regular graphs in linear expected time. 390-429 - Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Node profiles of symmetric digital search trees: Concentration properties. 430-467 - Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing linear inequalities of subgraph statistics. 468-479 - Jie Han, Patrick Morris, Andrew Treglown:
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. 480-516 - Konstantin E. Tikhomirov, Pierre Youssef:
Outliers in spectrum of sparse Wigner matrices. 517-605
Volume 58, Number 4, July 2021
- Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou:
The number of satisfying assignments of random 2-SAT formulas. 609-647 - Gilles Bonnet, Zakhar Kabluchko, Nicola Turchi:
Phase transition for the volume of high-dimensional random polytopes. 648-663 - Michael Farber, Tahl Nowik:
Topological embeddings into random 2-complexes. 664-675 - Ross G. Pinsky:
Permutations avoiding a pattern of length three under Mallows distributions. 676-690 - Boris G. Pittel:
On Bollobás-Riordan random pairing model of preferential attachment graph. 691-725 - Dirk Zeindler:
Long cycle of random permutations with polynomially growing cycle weights. 726-739
a service of 
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.
last updated on 2024-07-03 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
