default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 33 matches
- 2015
- Dimitris Achlioptas, Michael Molloy:
The solution space geometry of random linear equations. Random Struct. Algorithms 46(2): 197-231 (2015) - Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person:
Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 46(3): 446-465 (2015) - Lior Aronshtam, Nathan Linial:
When does the top homology of a random simplicial complex vanish? Random Struct. Algorithms 46(1): 26-35 (2015) - Amir Barghi, Peter Winkler:
Firefighting on a random geometric graph. Random Struct. Algorithms 46(3): 466-477 (2015) - Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz:
Hats, auctions and derandomization. Random Struct. Algorithms 46(3): 478-493 (2015) - Michel Benaïm, Itai Benjamini, Jun Chen, Yuri Lima:
A generalized Pólya's urn with graph based interactions. Random Struct. Algorithms 46(4): 614-634 (2015) - Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time. Random Struct. Algorithms 46(1): 36-54 (2015) - Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang:
Aggregation models with limited choice and the multiplicative coalescent. Random Struct. Algorithms 46(1): 55-116 (2015) - Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapira:
A unified framework for testing linear-invariant properties. Random Struct. Algorithms 46(2): 232-260 (2015) - Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne:
Uncommon suffix tries. Random Struct. Algorithms 46(1): 117-141 (2015) - A. E. Costa, Michael Farber:
The asphericity of random 2-dimensional complexes. Random Struct. Algorithms 46(2): 261-273 (2015) - Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An improved upper bound on the density of universal random graphs. Random Struct. Algorithms 46(2): 274-299 (2015) - Steffen Dereich, Peter Mörters:
Cycle length distributions in random permutations with diverging cycle weights. Random Struct. Algorithms 46(4): 635-650 (2015) - David Ellis, Yuval Filmus, Ehud Friedgut:
A stability result for balanced dictatorships in Sn. Random Struct. Algorithms 46(3): 494-530 (2015) - Uriel Feige, Daniel Reichman:
Recoverable values for independent sets. Random Struct. Algorithms 46(1): 142-159 (2015) - Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor:
Biased games on random boards. Random Struct. Algorithms 46(4): 651-676 (2015) - Hilary K. Finucane, Ron Peled, Yariv Yaari:
A recursive construction of t-wise uniform permutations. Random Struct. Algorithms 46(3): 531-540 (2015) - Alan M. Frieze, Gregory B. Sorkin:
Efficient algorithms for three-dimensional axial and planar random assignment problems. Random Struct. Algorithms 46(1): 160-196 (2015) - Michael Fuchs:
A note on the quicksort asymptotics. Random Struct. Algorithms 46(4): 677-687 (2015) - David Gamarnik, Dmitriy Katz, Sidhant Misra:
Strong spatial mixing of list coloring of graphs. Random Struct. Algorithms 46(4): 599-613 (2015) - Aurélien Garivier:
Perfect simulation of processes with long memory: A "coupling into and from the past" algorithm. Random Struct. Algorithms 46(2): 300-319 (2015) - Alexander V. Gnedin, Vadim Gorin:
Record-dependent measures on the symmetric groups. Random Struct. Algorithms 46(4): 688-706 (2015) - Hsien-Kuei Hwang, Vytas Zacharovas:
Limit distribution of the coefficients of polynomials with only unit roots. Random Struct. Algorithms 46(4): 707-738 (2015) - Shuji Kijima, Kentaro Koga, Kazuhisa Makino:
Deterministic random walks on finite graphs. Random Struct. Algorithms 46(4): 739-761 (2015) - Fiachra Knox, Daniela Kühn, Deryk Osthus:
Edge-disjoint Hamilton cycles in random graphs. Random Struct. Algorithms 46(3): 397-445 (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. Random Struct. Algorithms 46(1): 1-25 (2015) - Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 46(2): 320-345 (2015) - John Lenz, Dhruv Mubayi:
The poset of hypergraph quasirandomness. Random Struct. Algorithms 46(4): 762-800 (2015) - Konstantin Makarychev, Warren Schudy, Maxim Sviridenko:
Concentration inequalities for nonlinear matroid intersection. Random Struct. Algorithms 46(3): 541-571 (2015) - Ralph Neininger:
Refined quicksort asymptotics. Random Struct. Algorithms 46(2): 346-361 (2015)
skipping 3 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-09 21:03 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint