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 19 matches
- 2014
- Paul Balister, Béla Bollobás:
Interference percolation. Random Struct. Algorithms 44(4): 399-418 (2014) - Jean Bertoin:
Sizes of the largest clusters for supercritical percolation on random recursive trees. Random Struct. Algorithms 44(1): 29-44 (2014) - Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi:
Connectivity threshold of Bluetooth graphs. Random Struct. Algorithms 44(1): 45-66 (2014) - Nicolas Broutin, Jean-François Marckert:
Asymptotics of trees with a prescribed degree sequence and applications. Random Struct. Algorithms 44(3): 290-316 (2014) - Carl Johan Casselgren:
Coloring graphs from random lists of fixed size. Random Struct. Algorithms 44(3): 317-327 (2014) - Hua-Huai Chern, María-Inés Fernández-Camacho, Hsien-Kuei Hwang, Conrado Martínez:
Psi-series method for equality of random trees and quadratic convolution recurrences. Random Struct. Algorithms 44(1): 67-108 (2014) - Nicholas M. Ercolani, Daniel Ueltschi:
Cycle structure of random permutations with cycle weights. Random Struct. Algorithms 44(1): 109-133 (2014) - Alan M. Frieze, Po-Shen Loh:
Rainbow hamilton cycles in random graphs. Random Struct. Algorithms 44(3): 328-354 (2014) - Roman Glebov, Michael Krivelevich, Tibor Szabó:
On covering expander graphs by hamilton cycles. Random Struct. Algorithms 44(2): 183-200 (2014) - Igor Gorodezky, Igor Pak:
Generalized loop-erased random walks and approximate reachability. Random Struct. Algorithms 44(2): 201-223 (2014) - Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel:
Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Struct. Algorithms 44(1): 1-28 (2014) - Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
On independent sets in hypergraphs. Random Struct. Algorithms 44(2): 224-239 (2014) - Colin McDiarmid, Valentas Kurauskas:
Random graphs containing few disjoint excluded minors. Random Struct. Algorithms 44(2): 240-268 (2014) - Torsten Mütze, Thomas Rast, Reto Spöhel:
Coloring random graphs online without creating monochromatic subgraphs. Random Struct. Algorithms 44(4): 419-464 (2014) - Alois Panholzer, Georg Seitz:
Ancestors and descendants in evolving k-tree models. Random Struct. Algorithms 44(4): 465-489 (2014) - Wojciech Samotij:
Stability results for random discrete structures. Random Struct. Algorithms 44(3): 269-289 (2014) - Roman Vershynin:
Invertibility of symmetric random matrices. Random Struct. Algorithms 44(2): 135-182 (2014) - Lutz Warnke:
When does the K4-free process stop? Random Struct. Algorithms 44(3): 355-397 (2014) - Lutz Warnke:
The Cℓ-free process. Random Struct. Algorithms 44(4): 490-526 (2014)
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-01 07:40 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