Остановите войну!
for scientists:
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 26 matches
- 2017
- Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris:
Chromatic thresholds in dense random graphs. Random Struct. Algorithms 51(2): 185-214 (2017) - Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris:
Chromatic thresholds in sparse random graphs. Random Struct. Algorithms 51(2): 215-236 (2017) - Deepak Bal, Patrick Bennett, Xavier Pérez-Giménez, Pawel Pralat:
Rainbow perfect matchings and Hamilton cycles in the random geometric graph. Random Struct. Algorithms 51(4): 587-606 (2017) - Gabriel Berzunza Ojeda:
The cut-tree of large trees with small heights. Random Struct. Algorithms 51(3): 404-427 (2017) - Omer Bobrowski, Shmuel Weinberger:
On the vanishing of homology in random Čech complexes. Random Struct. Algorithms 51(1): 14-51 (2017) - Béla Bollobás, Svante Janson, Alex Scott:
Packing random graphs and hypergraphs. Random Struct. Algorithms 51(1): 3-13 (2017) - Christian Borgs, Jennifer T. Chayes, David Gamarnik:
Convergent sequences of sparse graphs: A large deviations approach. Random Struct. Algorithms 51(1): 52-89 (2017) - Graham R. Brightwell, Svante Janson, Malwina J. Luczak:
The Greedy Independent Set in a Random Graph with Given Degrees. Random Struct. Algorithms 51(4): 565-586 (2017) - Xing Shi Cai, Luc Devroye:
The graph structure of a deterministic automaton chosen at random. Random Struct. Algorithms 51(3): 428-458 (2017) - Ningyuan Chen, Nelly Litvak, Mariana Olvera-Cravioto:
Generalized PageRank on directed configuration networks. Random Struct. Algorithms 51(2): 237-274 (2017) - Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? Random Struct. Algorithms 51(3): 459-482 (2017) - Pierre-Antoine Corre:
Oscillations in the height of the Yule tree and application to the binary search tree. Random Struct. Algorithms 51(1): 90-120 (2017) - Roee David, Elazar Goldenberg, Robert Krauthgamer:
Local reconstruction of low-rank matrices and subspaces. Random Struct. Algorithms 51(4): 607-630 (2017) - Martin Dolezal, Jan Hladký, András Máthé:
Cliques in dense inhomogeneous random graphs. Random Struct. Algorithms 51(2): 275-314 (2017) - Michael Drmota, Lander Ramos, Juanjo Rué:
Subgraph statistics in subcritical graph classes. Random Struct. Algorithms 51(4): 631-673 (2017) - Chaim Even-Zohar:
The writhe of permutations and random framed knots. Random Struct. Algorithms 51(1): 121-142 (2017) - Alan M. Frieze, Wesley Pegden:
Separating subadditive euclidean functionals. Random Struct. Algorithms 51(3): 375-403 (2017) - Maurits de Graaf, Bodo Manthey:
Probabilistic analysis of power assignments. Random Struct. Algorithms 51(3): 483-505 (2017) - Karen Gunderson, Sebastian Koch, Michal Przykucki:
The time of graph bootstrap percolation. Random Struct. Algorithms 51(1): 143-168 (2017) - Yasuaki Hiraoka, Tomoyuki Shirai:
Minimum spanning acycle and lifetime of persistent homology in the Linial-Meshulam process. Random Struct. Algorithms 51(2): 315-340 (2017) - Antti Knowles, Ron Rosenthal:
Eigenvalue confinement and spectral gap for random simplicial complexes. Random Struct. Algorithms 51(3): 506-537 (2017) - Dániel Korándi, Benny Sudakov:
Saturation in random graphs. Random Struct. Algorithms 51(1): 169-181 (2017) - Can M. Le, Elizaveta Levina, Roman Vershynin:
Concentration and regularization of random graphs. Random Struct. Algorithms 51(3): 538-561 (2017) - Jaroslav Nesetril, Patrice Ossona de Mendez:
Cluster analysis of local convergent sequences of structures. Random Struct. Algorithms 51(4): 674-728 (2017) - Tuan-Minh Nguyen, Stanislav Volkov:
A universal result for consecutive random subdivision of polygons. Random Struct. Algorithms 51(2): 341-371 (2017) - Yuting Wen:
The Brownian plane with minimal neck baby universe. Random Struct. Algorithms 51(4): 729-752 (2017)
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-05-04 14:21 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