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 40 matches
- 1995
- Noga Alon, Alan M. Frieze, Dominic Welsh:
Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Random Struct. Algorithms 6(4): 459-478 (1995) - Noga Alon, Benny Sudakov:
Disjoint Systems. Random Struct. Algorithms 6(1): 13-20 (1995) - Noga Alon, Zsolt Tuza:
The Acyclic Orientation Game on Random Graphs. Random Struct. Algorithms 6(2/3): 261-268 (1995) - Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen:
Randomized Greedy Matching II. Random Struct. Algorithms 6(1): 55-74 (1995) - Ron Blei, Yuval Peres, James H. Schmerl:
Fractional Products of Sets. Random Struct. Algorithms 6(1): 113-120 (1995) - Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak:
Connectivity Properties of Random Subgraphs of the Cube. Random Struct. Algorithms 6(2/3): 221-230 (1995) - Béla Bollobás, Andrew Thomason:
Generalized Chromatic Numbers of Random Graphs. Random Struct. Algorithms 6(2/3): 353-356 (1995) - Graham R. Brightwell:
Random Graph Orders Do Not Satisfy a 0-1 Law. Random Struct. Algorithms 6(2/3): 231-238 (1995) - E. Rodney Canfield, L. H. Harper:
Large Antichains in the Partition Lattice. Random Struct. Algorithms 6(1): 89-104 (1995) - Colin Cooper:
On the 2-Cyclic Property in 2-Regular Digraphs. Random Struct. Algorithms 6(4): 439-448 (1995) - Vlado Dancík, Mike Paterson:
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. Random Struct. Algorithms 6(4): 449-458 (1995) - Michael Drmota:
Correlations on the Strata of a Random Mapping. Random Struct. Algorithms 6(2/3): 357-366 (1995) - Richard A. Duke, Hanno Lefmann, Vojtech Rödl:
On Uncrowded Hypergraphs. Random Struct. Algorithms 6(2/3): 209-212 (1995) - Paul Erdös, Vojtech Rödl:
Covering of r-Graphs by Complete r-Partite Subgraphs. Random Struct. Algorithms 6(2/3): 319-322 (1995) - Paul Erdös, Stephen Suen, Peter Winkler:
On the Size of a Random Maximal Graph. Random Struct. Algorithms 6(2/3): 309-318 (1995) - Uriel Feige:
A Tight Upper Bound on the Cover Time for Random Walks on Graphs. Random Struct. Algorithms 6(1): 51-54 (1995) - Uriel Feige:
A Tight Lower Bound on the Cover Time for Random Walks on Graphs. Random Struct. Algorithms 6(4): 433-438 (1995) - David A. Grable:
The Diameter of a Random Graph with Bounded Diameter. Random Struct. Algorithms 6(2/3): 193-200 (1995) - Penny E. Haxell, Yoshiharu Kohayakawa:
On the Anti-Ramsey Property of Ramanujan Graphs. Random Struct. Algorithms 6(4): 417-432 (1995) - Lars Holst:
The General Birthday Problem. Random Struct. Algorithms 6(2/3): 201-208 (1995) - Svante Janson:
Hamilton Cycles in a Random Tournament. Random Struct. Algorithms 6(2/3): 213-220 (1995) - Svante Janson:
A Graph Fourier Transform and Proportional Graphs. Random Struct. Algorithms 6(2/3): 341-352 (1995) - Rainer Kemp:
On the Inner Structure of Multidimensional Simply Generated Trees. Random Struct. Algorithms 6(2/3): 121-146 (1995) - Valentin F. Kolchin:
On Classification in Presence of Measurement Errors. Random Struct. Algorithms 6(2/3): 147-160 (1995) - Wojciech Kordecki:
Maximal Full Subspaces in Random Projective Spaces- Thresholds and Poisson Approximation. Random Struct. Algorithms 6(2/3): 297-308 (1995) - Alexandr V. Kostochka:
The Number of Spanning Trees in Graphs with Given Degree Sequence. Random Struct. Algorithms 6(2/3): 269-274 (1995) - Tomasz Luczak, Saharon Shelah:
Convergence in Homogeneous Random Graphs. Random Struct. Algorithms 6(4): 371-393 (1995) - James F. Lynch:
On the Threshold of Chaos in Random Boolean Cellular Automata. Random Struct. Algorithms 6(2/3): 239-260 (1995) - Robert S. Maier:
The Shape of Stretched Planar Trees. Random Struct. Algorithms 6(2/3): 331-340 (1995) - Michael Molloy, Bruce A. Reed:
A Critical Point for Random Graphs with a Given Degree Sequence. Random Struct. Algorithms 6(2/3): 161-180 (1995)
skipping 10 more matches
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-10-19 18: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