default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 63
Volume 63, Number 1, August 2023
- Richard Arratia, Stephen Desalvo:
On the largest part size of low-rank combinatorial assemblies. 3-26 - Alexander I. Barvinok:
Smoothed counting of 0-1 points in polyhedra. 27-60 - Luca Becchetti
, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and flooding in dynamic random networks with node churn. 61-101 - Miklós Bóna, Boris G. Pittel:
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves. 102-129 - Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali:
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures. 130-170 - Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, Tuan Tran:
Majority dynamics on sparse random graphs. 171-191 - Asaf Ferber, Liam Hardiman, Michael Krivelevich:
On subgraphs with degrees of prescribed residues in the random graph. 192-214 - Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. 215-241 - Matthew Kahle, Minghao Tian, Yusu Wang:
On the clique number of noisy random geometric graphs. 242-279
Volume 63, Number 2, September 2023
- Mindaugas Bloznelis, Lasse Leskelä:
Clustering and percolation on superpositions of Bernoulli random graphs. 283-342 - Jane Breen, Nolan Faught, Cory Glover, Mark Kempton, Adam Knudson, Alice Oveson:
Kemeny's constant for nonbacktracking random walks. 343-363 - Colin Desmarais, Cecilia Holmgren, Stephan Wagner:
Broadcasting-induced colorings of preferential attachment trees. 364-405 - Sahar Diskin, Michael Krivelevich:
Site percolation on pseudo-random graphs. 406-441 - Benjamin Gunby, Xiaoyu He, Bhargav Narayanan:
Down-set thresholds. 442-456 - Günter Last, Giovanni Peccati, D. Yogeshwaran:
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees. 457-511 - Claire Mathieu, Hang Zhou:
A simple algorithm for graph reconstruction. 512-532 - Gennady Samorodnitsky, Takashi Owada:
Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes. 533-556 - Amir Sarid:
The spectral gap of random regular graphs. 557-587
Volume 63, Number 3, October 2023
- Yulin Chang, Jie Han, Lubos Thoma:
On powers of tight Hamilton cycles in randomly perturbed hypergraphs. 591-609 - David Conlon, Jacob Fox, Xiaoyu He, Dhruv Mubayi, Andrew Suk, Jacques Verstraëte:
Hypergraph Ramsey numbers of cliques versus stars. 610-623 - Leonardo Nagami Coregliano, Alexander A. Razborov:
Natural quasirandomness properties. 624-688 - Ahmed El Alaoui, Andrea Montanari, Mark Sellke:
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree. 689-715 - David G. Harris:
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel. 716-752 - András Mészáros:
Matchings on trees and the adjacency matrix: A determinantal viewpoint. 753-778 - Joe Neeman, Charles Radin, Lorenzo Sadun:
Moderate deviations in cycle count. 779-820 - Vojtech Rödl, Marcelo Tadeu Sales, Yi Zhao:
Independence number of hypergraphs under degree conditions. 821-863
Volume 63, Number 4, December 2023
- Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich:
Cycle lengths in randomly perturbed graphs. 867-884 - Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The impact of heterogeneity and geometry on the proof complexity of random satisfiability. 885-941 - Alessandra Caraceni, Alexandre Stauffer:
Growing uniform planar maps face by face. 942-967 - Sayan Das, Zoe M. Himwich, Nitya Mani:
A fourth-moment phenomenon for asymptotic normality of monochromatic subgraphs. 968-996 - Pandelis Dodos, Konstantinos Tyros, Petros Valettas:
Concentration estimates for functions of finite high-dimensional random arrays. 997-1053 - Jimmy He, Tobias Müller, Teun W. Verstraaten:
Cycles in Mallows random permutations. 1054-1099 - Nobutaka Shimizu, Takeharu Shiraga:
Reversible random walks on dynamic graphs. 1100-1136
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 2025-12-05 22:25 CET 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:
