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 45 matches
- 1998
- David J. Aldous:
On the Critical Value for 'Percolation' of Minimum-Weight Trees in the Mean-Field Distance Model. Comb. Probab. Comput. 7(1): 1-10 (1998) - Sven Erick Alm:
A Note on a Problem by Welsh in First-Passage Percolation. Comb. Probab. Comput. 7(1): 11-15 (1998) - M. D. Atkinson:
Generalized Stack Permutations. Comb. Probab. Comput. 7(3): 239-246 (1998) - Jørgen Bang-Jensen, Tibor Jordán:
Adding and Reversing Arcs in Semicomplete Digraphs. Comb. Probab. Comput. 7(1): 17-25 (1998) - Malgorzata Bednarska:
On Biased Positional Games. Comb. Probab. Comput. 7(4): 339-351 (1998) - Gunnar Brinkmann:
All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8. Comb. Probab. Comput. 7(2): 129-140 (1998) - Neil J. Calkin, Peter J. Cameron:
Almost Odd Random Sum-Free Sets. Comb. Probab. Comput. 7(1): 27-32 (1998) - Tuhao Chen, Eugene Seneta:
Lower Bounds for the Probability of Intersection of Several Unions of Events. Comb. Probab. Comput. 7(4): 353-364 (1998) - Fan R. K. Chung, Prasad Tetali:
Isoperimetric Inequalities for Cartesian Products of Graphs. Comb. Probab. Comput. 7(2): 141-148 (1998) - Vlado Dancík:
Common Subsequences and Supersequences and their Expected Length. Comb. Probab. Comput. 7(4): 365-373 (1998) - Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Endomorphisms of Partially Ordered Sets. Comb. Probab. Comput. 7(1): 33-46 (1998) - A. W. F. Edwards:
Seven-Set Venn Diagrams with Rotational and Polar Symmetry. Comb. Probab. Comput. 7(2): 149-152 (1998) - Hugh Edwards, Robert M. Hierons, Bill Jackson:
The Zero-Free Intervals for Characteristic Polynomials of Matroids. Comb. Probab. Comput. 7(2): 153-165 (1998) - Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter:
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth. Comb. Probab. Comput. 7(4): 375-386 (1998) - Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Uniform Intersecting Families with Covering Number Restrictions. Comb. Probab. Comput. 7(1): 47-56 (1998) - Peter Frankl, Norihide Tokushige:
Some Inequalities Concerning Cross-Intersecting Families. Comb. Probab. Comput. 7(3): 247-260 (1998) - Weidong Gao, Yahya Ould Hamidoune:
Zero Sums in Abelian Groups. Comb. Probab. Comput. 7(3): 261-263 (1998) - David A. Grable:
A Large Deviation Inequality for Functions of Independent, Multi-Way Choices. Comb. Probab. Comput. 7(1): 57-63 (1998) - David S. Gunderson, Vojtech Rödl:
Extremal Problems for Affine Cubes of Integers. Comb. Probab. Comput. 7(1): 65-79 (1998) - Petros Hadjicostas:
The Asymptotic Proportion of Subdivisions of a 2×2 Table that Result in Simpson's Paradox. Comb. Probab. Comput. 7(4): 387-396 (1998) - Olle Häggström:
On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs. Comb. Probab. Comput. 7(4): 397-401 (1998) - Yahya Ould Hamidoune:
Adding Distinct Congruence Classes. Comb. Probab. Comput. 7(1): 81-87 (1998) - Yahya Ould Hamidoune, Oscar Ordaz, Asdrubal Ortuño:
On a Combinatorial Theorem of Erdös, Ginzburg and Ziv. Comb. Probab. Comput. 7(4): 403-412 (1998) - Neil Hindman, Dona Strauss:
An Algebraic Proof of Deuber's Theorem. Comb. Probab. Comput. 7(2): 167-180 (1998) - Hsien-Kuei Hwang:
A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures. Comb. Probab. Comput. 7(1): 89-110 (1998) - Chris Jagger:
Distant Vertex Partitions of Graphs. Comb. Probab. Comput. 7(4): 413-422 (1998) - Johan Jonasson:
On the Cover Time for Random Walks on Random Graphs. Comb. Probab. Comput. 7(3): 265-279 (1998) - Martin Juvan, Bojan Mohar, Riste Skrekovski:
List Total Colourings of Graphs. Comb. Probab. Comput. 7(2): 181-188 (1998) - Peter Kirschenhofer, Helmut Prodinger:
Comparisons in Hoare's Find Algorithm. Comb. Probab. Comput. 7(1): 111-120 (1998) - László Lovász, Peter Winkler:
Reversal of Markov Chains and the Forget Time. Comb. Probab. Comput. 7(2): 189-204 (1998)
skipping 15 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 2025-01-03 07:05 CET 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