default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 50
Volume 50, Number 1, January 2017
- Imre Bárány, Daniel Hug
, Matthias Reitzner, Rolf Schneider:
Random points in halfspheres. 3-22 - Nicholas A. Cook:
Discrepancy properties for random regular digraphs. 23-58 - Genghua Fan, Jianfeng Hou:
Bounds for pairs in judicious partitioning of graphs. 59-70 - Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding paths in sparse random graphs requires many queries. 71-85 - Robert Graf:
Self-destructive percolation as a limit of forest-fire models on regular rooted trees. 86-113 - Henry Towsner:
σ-algebras for quasirandom hypergraphs. 114-139
Volume 50, Number 2, March 2017
- Alan M. Frieze, Tony Johansson:
On random k-out subgraphs of large graphs. 143-157 - Sébastien Bubeck, Luc Devroye, Gábor Lugosi:
Finding Adam in random growing trees. 158-172 - Mark Huber:
A Bernoulli mean estimate with known relative error distribution. 173-182 - Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing near spanning trees with few local inspections. 183-200 - Abbas Mehrabian:
Justifying the small-world phenomenon via random recursive trees. 201-224 - Ori Parzanchevski, Ron Rosenthal:
Simplicial complexes: Spectrum, homology and random walks. 225-261 - Matthias Schulte, Christoph Thäle:
Central limit theorems for the radial spanning tree. 262-286 - Aaron Smith:
The cutoff phenomenon for random birth and death chains. 287-321
Volume 50, Number 3, May 2017
- Béla Bollobás, Oliver Riordan:
Exploring hypergraphs with martingales. 325-352 - Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Dependence and phase changes in random m-ary search trees. 353-379 - David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric:
Almost-spanning universality in random graphs. 380-393 - Christopher Hoffman, Douglas Rizzolo, Erik Slivken:
Pattern-avoiding permutations and Brownian excursion part I: Shapes and fluctuations. 394-419 - Eyal Lubetzky, Yufei Zhao:
On the variational problem for upper tails in sparse random graphs. 420-436 - Colin McDiarmid, Alex Scott, Paul Withers:
Uniform multicommodity flows in the hypercube with random edge-capacities. 437-463 - Andreas Noever:
Online Ramsey games for more than two colors. 464-492 - Henning Sulzbach:
On martingale tail sums for the path length in random trees. 493-508
Volume 50, Number 4, July 2017
- Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. 511-533 - Tonci Antunovic, Yael Dekel, Elchanan Mossel, Yuval Peres:
Competing first passage percolation on random regular graphs. 534-583 - Ronen Eldan, Miklós Z. Rácz, Tselil Schramm:
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors. 584-611 - Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma:
First order limits of sparse graphs: Plane trees and path-width. 612-635 - Christof Külske, Utkir A. Rozikov:
Fuzzy transformations and extremality of Gibbs measures for the potts model on a Cayley tree. 636-678 - Tobias Müller:
The critical probability for confetti percolation equals 1/2. 679-697
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 01:29 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:
