![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 25 matches
- 2009
- Noga Alon, Alexandr V. Kostochka:
Induced subgraphs with distinct sizes. Random Struct. Algorithms 34(1): 45-53 (2009) - József Balogh, Béla Bollobás, Miklós Simonovits:
The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms 34(3): 305-318 (2009) - Jacob van den Berg, Bernardo N. B. de Lima:
Linear lower bounds for deltac(p) for a class of 2D self-destructive percolation models. Random Struct. Algorithms 34(4): 520-526 (2009) - Christian Borgs
, Jennifer T. Chayes, Stephan Mertens, Chandra Nair:
Proof of the local REM conjecture for number partitioning. I: Constant energy scales. Random Struct. Algorithms 34(2): 217-240 (2009) - Christian Borgs
, Jennifer T. Chayes, Stephan Mertens, Chandra Nair:
Proof of the local REM conjecture for number partitioning. II. Growing energy scales. Random Struct. Algorithms 34(2): 241-284 (2009) - Vivek S. Borkar, Vladimir Ejov
, Jerzy A. Filar
:
On the Hamiltonicity Gap and doubly stochastic matrices. Random Struct. Algorithms 34(4): 502-519 (2009) - Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos
:
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. Random Struct. Algorithms 34(1): 11-23 (2009) - Colin Cooper, Alan M. Frieze
:
Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439. Random Struct. Algorithms 34(2): 300-304 (2009) - Codina Cotar, Alexander E. Holroyd, David Revelle:
A percolating hard sphere model. Random Struct. Algorithms 34(2): 285-299 (2009) - Luc Devroye, Gábor Lugosi
, GaHyun Park, Wojciech Szpankowski:
Multiple choice tries and distributed hash tables. Random Struct. Algorithms 34(3): 337-367 (2009) - Michael Drmota, Alexander Iksanov
, Martin Möhle
, Uwe Roesler:
A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. Random Struct. Algorithms 34(3): 319-336 (2009) - Pu Gao, Nicholas C. Wormald:
Short cycle distribution in random regular graphs recursively generated by pegging. Random Struct. Algorithms 34(1): 54-86 (2009) - Jennie C. Hansen, Jerzy Jaworski:
A random mapping with preferential attachment. Random Struct. Algorithms 34(1): 87-111 (2009) - Dan Hefetz
, Michael Krivelevich, Milos Stojakovic
, Tibor Szabó:
A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Struct. Algorithms 34(1): 112-122 (2009) - Svante Janson, Malwina J. Luczak
:
A new approach to the giant component problem. Random Struct. Algorithms 34(2): 197-216 (2009) - Peter Keevash:
A hypergraph regularity method for generalized Turán problems. Random Struct. Algorithms 34(1): 123-164 (2009) - Michael Krivelevich, Po-Shen Loh
, Benny Sudakov:
Avoiding small subgraphs in Achlioptas processes. Random Struct. Algorithms 34(1): 165-195 (2009) - Nati Linial, Adi Shraibman:
Lower bounds in communication complexity based on factorization norms. Random Struct. Algorithms 34(3): 368-394 (2009) - Martin Marciniszyn, Jozef Skokan
, Reto Spöhel, Angelika Steger:
Asymmetric Ramsey properties of random graphs involving cliques. Random Struct. Algorithms 34(4): 419-453 (2009) - Roy Meshulam, N. Wallach:
Homological connectivity of random k-dimensional complexes. Random Struct. Algorithms 34(3): 408-417 (2009) - Ravi Montenegro:
The simple random walk and max-degree walk on a directed graph. Random Struct. Algorithms 34(3): 395-407 (2009) - Ilan Newman:
Computing in fault tolerant broadcast networks and noisy decision trees. Random Struct. Algorithms 34(4): 478-501 (2009) - Roberto Imbuzeiro Oliveira
:
The onset of dominance in balls-in-bins processes with feedback. Random Struct. Algorithms 34(4): 454-477 (2009) - Ronitt Rubinfeld, Rocco A. Servedio:
Testing monotone high-dimensional distributions. Random Struct. Algorithms 34(1): 24-44 (2009) - Imre Z. Ruzsa:
Sumsets and entropy. Random Struct. Algorithms 34(1): 1-10 (2009)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-09-03 20:43 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