default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 46
Volume 46, Number 1, January 2015
- Yoshiharu Kohayakawa
, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. 1-25 - Lior Aronshtam, Nathan Linial:
When does the top homology of a random simplicial complex vanish? 26-35 - Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time. 36-54 - Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang:
Aggregation models with limited choice and the multiplicative coalescent. 55-116 - Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne:
Uncommon suffix tries. 117-141 - Uriel Feige, Daniel Reichman:
Recoverable values for independent sets. 142-159 - Alan M. Frieze, Gregory B. Sorkin:
Efficient algorithms for three-dimensional axial and planar random assignment problems. 160-196
Volume 46, Number 2, March 2015
- Dimitris Achlioptas, Michael Molloy:
The solution space geometry of random linear equations. 197-231 - Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A unified framework for testing linear-invariant properties. 232-260 - A. E. Costa, Michael Farber:
The asphericity of random 2-dimensional complexes. 261-273 - Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An improved upper bound on the density of universal random graphs. 274-299 - Aurélien Garivier:
Perfect simulation of processes with long memory: A "coupling into and from the past" algorithm. 300-319 - Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Long paths and cycles in random subgraphs of graphs with large minimum degree. 320-345 - Ralph Neininger:
Refined quicksort asymptotics. 346-361 - Ross G. Pinsky:
Probabilistic and combinatorial aspects of the card-cyclic to random insertion shuffle. 362-390 - Oliver Riordan, Lutz Warnke:
The Janson inequalities for general up-sets. 391-395
Volume 46, Number 3, May 2015
- Fiachra Knox, Daniela Kühn, Deryk Osthus:
Edge-disjoint Hamilton cycles in random graphs. 397-445 - Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person:
Tight Hamilton cycles in random hypergraphs. 446-465 - Amir Barghi, Peter Winkler:
Firefighting on a random geometric graph. 466-477 - Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz:
Hats, auctions and derandomization. 478-493 - David Ellis, Yuval Filmus, Ehud Friedgut:
A stability result for balanced dictatorships in Sn. 494-530 - Hilary K. Finucane, Ron Peled, Yariv Yaari:
A recursive construction of t-wise uniform permutations. 531-540 - Konstantin Makarychev, Warren Schudy, Maxim Sviridenko:
Concentration inequalities for nonlinear matroid intersection. 541-571 - Michael Viderman:
A combination of testability and decodability by tensor products. 572-598
Volume 46, Number 4, July 2015
- David Gamarnik, Dmitriy Katz, Sidhant Misra:
Strong spatial mixing of list coloring of graphs. 599-613 - Michel Benaïm, Itai Benjamini, Jun Chen, Yuri Lima:
A generalized Pólya's urn with graph based interactions. 614-634 - Steffen Dereich, Peter Mörters:
Cycle length distributions in random permutations with diverging cycle weights. 635-650 - Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor:
Biased games on random boards. 651-676 - Michael Fuchs:
A note on the quicksort asymptotics. 677-687 - Alexander V. Gnedin, Vadim Gorin:
Record-dependent measures on the symmetric groups. 688-706 - Hsien-Kuei Hwang, Vytas Zacharovas:
Limit distribution of the coefficients of polynomials with only unit roots. 707-738 - Shuji Kijima, Kentaro Koga, Kazuhisa Makino:
Deterministic random walks on finite graphs. 739-761 - John Lenz, Dhruv Mubayi:
The poset of hypergraph quasirandomness. 762-800
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:
