default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 48
Volume 48, Number 1, January 2016
- Domingos Dellamonica Jr., Steve La Fleur, Vojtech Rödl:
On induced Ramsey numbers for k-uniform hypergraphs. 5-20 - Magnus Bordewich
, Catherine S. Greenhill, Viresh Patel:
Mixing of the Glauber dynamics for the ferromagnetic Potts model. 21-52 - David G. Harris, Aravind Srinivasan:
A note on near-optimal coloring of shift hypergraphs. 53-56 - Svante Janson:
Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees. 57-101 - Matthew Kahle, Boris G. Pittel:
Inside the critical window for cohomology of random k-complexes. 102-124 - Jakub Kozik:
Multipass greedy coloring of simple uniform hypergraphs. 125-146 - Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Judicious partitions of directed graphs. 147-170 - Dan Romik, Piotr Sniady:
Limit shapes of bumping routes in the Robinson-Schensted correspondence. 171-182 - Mark Rudelson, Ofer Zeitouni:
Singular values of Gaussian matrices and permanent estimators. 183-212
- Johan Håstad:
The square lattice shuffle, correction. 213
Volume 48, Number 2, March 2016
- Svante Janson, Lutz Warnke:
The lower tail: Poisson approximation revisited. 219-246 - Erik Aas, Jonas Sjöstrand:
A product formula for the TASEP on a ring. 247-259 - Lior Aronshtam, Nathan Linial:
The threshold for d-collapsibility in random complexes. 260-269 - Julia Böttcher, Anusch Taraz, Andreas Würfl:
Spanning embeddings of arrangeable graphs with sublinear bandwidth. 270-289 - Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri:
Rumor spreading in random evolving graphs. 290-312 - Ioana Dumitriu, Tobias Johnson:
The Marčenko-Pastur law for sparse random bipartite biregular graphs. 313-340 - Oded Goldreich, Igor Shinkar:
Two-sided error proximity oblivious testing. 341-383 - Oshri Naparstek, Amir Leshem:
Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs. 384-395 - Pawel Pralat, Nicholas C. Wormald:
Meyniel's conjecture holds for random graphs. 396-421
Volume 48, Number 3, May 2016
- Daniela Kühn, Deryk Osthus, Viresh Patel:
A domination algorithm for {0, 1}-instances of the travelling salesman problem. 427-453 - Radoslaw Adamczak, Djalil Chafaï, Pawel Wolff:
Circular law for random matrices with exchangeable entries. 454-479 - Richard Arratia, Skip Garibaldi, Joe Kilian:
Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process. 480-502 - Deepak Bal, Alan M. Frieze:
Rainbow matchings and Hamilton cycles in random graphs. 503-523 - Uriel Feige, Jonathan Hermon, Daniel Reichman:
On giant components and treewidth in the layers model. 524-545 - Asaf Ferber, Rajko Nenadov, Ueli Peter:
Universality of random graphs and rainbow embedding. 546-564 - Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery Through Gossip. 565-587 - Mikhail Lavrov, Po-Shen Loh:
Increasing Hamiltonian paths in random edge orderings. 588-611 - Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao:
Improved bounds for the randomized decision tree Complexity of recursive majority. 612-638
Volume 48, Number 4, July 2016
- József Balogh, Jane Butterfield, Ping Hu, John Lenz:
Mantel's theorem for random hypergraphs. 641-654 - Erich Baur:
Percolation on random recursive trees. 655-680 - Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: Cover time and maximum load. 681-702 - JiHyeok Choi, Sunder Sethuraman, Shankar C. Venkataramani:
A scaling limit for the degree distribution in sublinear preferential attachment schemes. 703-731 - Justin Gilmer, Swastik Kopparty:
A local central limit theorem for triangles in a random graph. 732-750 - John Haslegrave, Jonathan H. Jordan:
Preferential attachment with choice. 751-766 - Paul Horn, Václav Koubek, Vojtech Rödl:
Isomorphic edge disjoint subgraphs of hypergraphs. 767-793 - Jeff Kahn, Eyal Lubetzky, Nicholas C. Wormald:
The threshold for combs in random graphs. 794-802
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-04 22:09 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:
