default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 52
Volume 52, Number 1, January 2018
- Mathias Schacht
, Fabian Schulenburg:
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs. 3-40 - Alessandro Arlotto, Yehua Wei, Xinchang Xie:
An adaptive O(log n)-optimal policy for the online selection of a monotone subsequence from a random sample. 41-53 - Carl Johan Casselgren:
Coloring graphs of various maximum degree from random lists. 54-73 - David G. Harris, Aravind Srinivasan:
Improved bounds and algorithms for graph cuts and network reliability. 74-135 - Varun S. Jog, Po-Ling Loh:
Persistence of centrality in random growing trees. 136-157 - Guy Moshkovitz, Asaf Shapira:
Decomposing a graph into expanding subgraphs. 158-178
Volume 52, Number 2, March 2018
- Matthew Kwan, Benny Sudakov:
Intercalates and discrepancy in random Latin squares. 181-196 - Pu Gao, Michael Molloy:
Inside the clustering window for random linear equations. 197-218 - David Gamarnik, Quan Li:
On the max-cut of sparse random graphs. 219-262 - Wilfried Huss, Lionel Levine, Ecaterina Sava-Huss:
Interpolating between random walk and rotor walk. 263-282 - Srikanth K. Iyer:
The random connection model: Connectivity, edge lengths, and degree distributions. 283-300 - Brendan Nagle, Vojtech Rödl, Mathias Schacht:
An algorithmic hypergraph regularity lemma. 301-353 - Paul M. B. Vitányi:
On the average-case complexity of Shellsort. 354-363
Volume 52, Number 3, May 2018
- Issue information. 365-366
- Asaf Ferber, Van Vu:
Packing perfect matchings in random hypergraphs. 367-378 - Mohammed Amin Abdullah, Nikolaos Fountoulakis:
A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs. 379-418 - J. Barré, Marc Lelarge, Dieter Mitsche:
On rigidity, orientability, and cores of random graphs with sliders. 419-453 - Alessandra Caraceni, Nicolas Curien:
Geometry of the uniform infinite half-planar quadrangulation. 454-494 - Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato:
Arboricity and spanning-tree packing in random graphs. 495-535 - Dmitry Panchenko:
On the K-sat model with large number of clauses. 536-542
Volume 52, Number 4, July 2018
- Issue information. 543-544
- Lior Gishboliner, Michael Krivelevich, Gal Kronenberg:
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. 545-559 - Louigi Addario-Berry, Laura Eslava:
High degrees in random recursive trees. 560-575 - Chen Avin, Michal Koucký, Zvi Lotker:
Cover time and mixing time of random walks on dynamic graphs. 576-596 - Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan:
Line percolation. 597-616 - Mikhail Isaev, Brendan D. McKay:
Complex martingales and asymptotic enumeration. 617-661 - Jeong Han Kim, Sang June Lee, Joohan Na:
On the total variation distance between the binomial random graph and the random intersection graph. 662-679 - Barna Saha, Aravind Srinivasan:
A new approximation technique for resource-allocation problems. 680-715
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-11-27 20: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:
