Остановите войну!
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 21 matches
- 2000
- David J. Aldous, Boris G. Pittel:
On a random graph with immigrating vertices: Emergence of the giant component. Random Struct. Algorithms 17(2): 79-102 (2000) - Itai Benjamini, Gideon Schechtman:
Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into Z. Random Struct. Algorithms 17(1): 20-25 (2000) - Miklós Bóna, Andrew McLennan, Dennis White:
Permutations with roots. Random Struct. Algorithms 17(2): 157-167 (2000) - Hua-Huai Chern, Hsien-Kuei Hwang, Yeong-Nan Yeh:
Distribution of the number of consecutive records. Random Struct. Algorithms 17(3-4): 169-196 (2000) - Colin Cooper:
On the distribution of rank of a random matrix over a finite field. Random Struct. Algorithms 17(3-4): 197-212 (2000) - Artur Czumaj, Miroslaw Kutylowski:
Delayed path coupling and generating random permutations. Random Struct. Algorithms 17(3-4): 238-259 (2000) - Artur Czumaj, Christian Scheideler:
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms 17(3-4): 213-237 (2000) - Martin E. Dyer, Catherine S. Greenhill:
The complexity of counting graph homomorphisms. Random Struct. Algorithms 17(3-4): 260-289 (2000) - James Allen Fill, Motoya Machida, Duncan J. Murdoch, Jeffrey S. Rosenthal:
Extension of Fill's perfect rejection sampling algorithm to general chains. Random Struct. Algorithms 17(3-4): 290-316 (2000) - Ehud Friedgut, Michael Krivelevich:
Sharp thresholds for certain Ramsey properties of random graphs. Random Struct. Algorithms 17(1): 1-19 (2000) - Jennie C. Hansen, Jerzy Jaworski:
Large components of bipartite random mappings. Random Struct. Algorithms 17(3-4): 317-342 (2000) - Svante Janson:
Growth of components in random graphs. Random Struct. Algorithms 17(3-4): 343-356 (2000) - Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari:
Bounding the unsatisfiability threshold of random 3-SAT. Random Struct. Algorithms 17(2): 103-116 (2000) - Jeff Kahn:
Asymptotics of the list-chromatic index for multigraphs. Random Struct. Algorithms 17(2): 117-156 (2000) - Mohammad Mahdian:
The strong chromatic index of C4-free graphs. Random Struct. Algorithms 17(3-4): 357-375 (2000) - Michael Molloy, Bruce A. Reed:
Near-optimal list colorings. Random Struct. Algorithms 17(3-4): 376-402 (2000) - Ralph Neininger:
Asymptotic distributions for partial match queries in K-d trees. Random Struct. Algorithms 17(3-4): 403-427 (2000) - Werner Schachinger:
Limiting distributions for the costs of partial match retrievals in multidimensional tries. Random Struct. Algorithms 17(3-4): 428-459 (2000) - Uwe Schöning:
Construction of expanders and superconcentrators using Kolmogorov complexity. Random Struct. Algorithms 17(1): 64-77 (2000) - Andrew Thomason:
Complete minors in pseudorandom graphs. Random Struct. Algorithms 17(1): 26-28 (2000) - Van H. Vu:
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help. Random Struct. Algorithms 17(1): 29-63 (2000)
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-07 08:51 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