Остановите войну!
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
- 1993
- Noga Alon, Oded Goldreich, Johan Håstad, René Peralta:
Addendum to "Simple Construction of Almost k-wise Independent Random Variables". Random Struct. Algorithms 4(1): 119-120 (1993) - Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski:
A Probabilistic Analysis of a Pattern Matching Problem. Random Struct. Algorithms 4(2): 191-214 (1993) - Graham R. Brightwell, Yoshiharu Kohayakawa:
Ramsey Properties of Orientations of Graphs. Random Struct. Algorithms 4(4): 413-428 (1993) - Robert M. Burton, Ronald W. J. Meester:
Long Range Percolation in Stationary Point Processes. Random Struct. Algorithms 4(2): 177-190 (1993) - Colin Cooper:
A Note on the Connectivity of 2-Regular Digraphs. Random Struct. Algorithms 4(4): 469-472 (1993) - Peter Dolan, James F. Lynch:
The Logic of Ordered Random Structures. Random Struct. Algorithms 4(4): 429-447 (1993) - The Giant Component 1960-1993. Random Struct. Algorithms 4(3): 231-232 (1993)
- Vladimir Estivill-Castro, Derick Wood:
Randomized Adative Sorting. Random Struct. Algorithms 4(1): 37-58 (1993) - Peter J. Grabner:
Searching for Losers. Random Struct. Algorithms 4(1): 99-110 (1993) - Walter J. Gutjahr:
Expectation Transfer between Branching Processes and Random Trees. Random Struct. Algorithms 4(4): 447-468 (1993) - Russell Impagliazzo, Noam Nisan:
The Effect of Random Restrictions on Formula Size. Random Struct. Algorithms 4(2): 121-134 (1993) - Svante Janson:
Multicyclic Components in a Random Graph Process. Random Struct. Algorithms 4(1): 71-84 (1993) - Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris G. Pittel:
The Birth of the Giant Component. Random Struct. Algorithms 4(3): 233-359 (1993) - Samuel Karlin, Bo Lindqvist, Yi-Ching Yao:
Markoc Chains on Hypercubes: Spectral Representations and Several Mahorization Relations. Random Struct. Algorithms 4(1): 1-36 (1993) - Xin Ke:
The Size Ramsey Number of Trees with Bounded Degree. Random Struct. Algorithms 4(1): 85-98 (1993) - Alexandr V. Kostochka, Alexander A. Sapozhenko, K. Weber:
Radius and Diameter of Random Subgraphs of the Hypercube. Random Struct. Algorithms 4(2): 215-230 (1993) - László Lovász, Miklós Simonovits:
Random Walks in a Convex Body and an Improved Volume Algorithm. Random Struct. Algorithms 4(4): 359-412 (1993) - Hosam M. Mahmoud, Robert T. Smythe, Jerzy Szymanski:
On the Structure of Random Plane-oriented Recursive Trees and Their Branches. Random Struct. Algorithms 4(2): 151-176 (1993) - Tamás F. Móri:
How Much Homogeneous Can the Appearing Pattern Be? Random Struct. Algorithms 4(1): 59-70 (1993) - Mike Paterson, Uri Zwick:
Shrinkage of de Morgan Formulae under Restriction. Random Struct. Algorithms 4(2): 135-150 (1993) - Dana Randall:
Efficient Generation of Random Nonsingular Matrices. Random Struct. Algorithms 4(1): 111-118 (1993)
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-04-24 04:41 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