![](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
- 1995
- Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald:
Largest 4-Connected Components of 3-Connected Planar Triangulations. Random Struct. Algorithms 7(4): 273-286 (1995) - Jin-yi Cai, Suresh Chari:
On the Impossibility of Amplifying the Independence of Random Variables. Random Struct. Algorithms 7(4): 301-310 (1995) - Luc Devroye, Jiang Lu:
The Strong Convergence of Maximal Degrees in Uniform Random Recursive Trees and Dags. Random Struct. Algorithms 7(1): 1-14 (1995) - Dwight Duffus, Mark Ginn, Vojtech Rödl:
On the Computational Complexity of Ordered Subgraph Recognition. Random Struct. Algorithms 7(3): 223-268 (1995) - Philippe Flajolet, Gilbert Labelle, Louise Laforest, Bruno Salvy
:
Hypergeometrics and the Cost Structure of Quadtrees. Random Struct. Algorithms 7(2): 117-144 (1995) - Alan M. Frieze
, Svante Janson:
Perfect Matchings in Random s-Uniform Hypergraphs. Random Struct. Algorithms 7(1): 41-58 (1995) - Svante Janson:
The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph. Random Struct. Algorithms 7(4): 337-356 (1995) - Mark Jerrum:
A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph. Random Struct. Algorithms 7(2): 157-166 (1995) - Anil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis:
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. Random Struct. Algorithms 7(1): 59-80 (1995) - Richard M. Karp, Yanjun Zhang:
Bounded Branching Process AND/OR Tree Evaluation. Random Struct. Algorithms 7(2): 97-116 (1995) - Jeong Han Kim:
The Ramsey Number R(3, t) Has Order of Magnitude t2/log t. Random Struct. Algorithms 7(3): 173-208 (1995) - Jan Krajícek, Pavel Pudlák, Alan R. Woods:
An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle. Random Struct. Algorithms 7(1): 15-40 (1995) - Michael Krivelevich:
Bounding Ramsey Numbers through Large Deviation Inequalities. Random Struct. Algorithms 7(2): 145-156 (1995) - Catherine C. McGeoch, J. D. Tygar:
Optimal Sampling Strategies for Quicksort. Random Struct. Algorithms 7(4): 287-300 (1995) - Michael Molloy, Bruce A. Reed:
The Dominating Number of Random Cubic Graph. Random Struct. Algorithms 7(3): 209-222 (1995) - Werner Schachinger:
The Variance of Partial Match Retrieval in a Multidimensional Symmetric Trie. Random Struct. Algorithms 7(1): 81-96 (1995) - James B. Shearer:
On the Independence Number of Sparse Graphs. Random Struct. Algorithms 7(3): 269-272 (1995) - Joel Spencer:
Asymptotic Packing via a Branching Process. Random Struct. Algorithms 7(2): 167-172 (1995)
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-07-08 20:49 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