![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 18 matches
- 2003
- Tom Bohman
, Alan M. Frieze
, Ryan R. Martin
:
How many random edges make a dense graph hamiltonian? Random Struct. Algorithms 22(1): 33-42 (2003) - Béla Bollobás, Graham R. Brightwell:
The number of k-SAT functions. Random Struct. Algorithms 22(3): 227-247 (2003) - Anna Carlsund:
Notes on the variance of the number of maxima in three dimensions. Random Struct. Algorithms 22(4): 440-447 (2003) - Colin Cooper, Alan M. Frieze
:
A general model of web graphs. Random Struct. Algorithms 22(3): 311-335 (2003) - Sanjoy Dasgupta, Anupam Gupta
:
An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1): 60-65 (2003) - Johan Håstad
, Avi Wigderson:
Simple analysis of graph tests for linearity and PCP. Random Struct. Algorithms 22(2): 139-160 (2003) - Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
Integer and fractional packings in dense 3-uniform hypergraphs. Random Struct. Algorithms 22(3): 248-310 (2003) - Mark Huber:
A bounding chain for Swendsen-Wang. Random Struct. Algorithms 22(1): 43-59 (2003) - Svante Janson:
The Wiener Index of simply generated random trees. Random Struct. Algorithms 22(4): 337-358 (2003) - Yoshiharu Kohayakawa
, Vojtech Rödl:
Regular pairs in sparse random graphs I. Random Struct. Algorithms 22(4): 359-434 (2003) - Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald:
On the probability of independent sets in random graphs. Random Struct. Algorithms 22(1): 1-14 (2003) - Daniela Kühn, Deryk Osthus:
Minors in graphs of large girth. Random Struct. Algorithms 22(2): 213-225 (2003) - Neal Madras, Zhongrong Zheng:
On the swapping algorithm. Random Struct. Algorithms 22(1): 66-97 (2003) - Colin McDiarmid:
Random channel assignment in the plane. Random Struct. Algorithms 22(2): 187-212 (2003) - Michal Parnas, Dana Ron
, Ronitt Rubinfeld:
Testing membership in parenthesis languages. Random Struct. Algorithms 22(1): 98-138 (2003) - Nicholas Pippenger:
The shortest disjunctive normal form of a random Boolean function. Random Struct. Algorithms 22(2): 161-186 (2003) - Jaikumar Radhakrishnan:
A note on scrambling permutations. Random Struct. Algorithms 22(4): 435-439 (2003) - Kyle Siegrist:
Renewal processes on partially ordered sets. Random Struct. Algorithms 22(1): 15-32 (2003)
loading more results
failed to load more results, please try again later
![](https://dblp.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-08-22 04:46 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