Остановите войну!
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 27 matches
- 1995
- Joseph E. Bonin:
Automorphisms of Dowling and Related Geometries. Comb. Probab. Comput. 4: 1-9 (1995) - Gunnar Brinkmann, Brendan D. McKay, Carsten Saager:
The Smallest Cubic Graphs of Girth Nine. Comb. Probab. Comput. 4: 317-329 (1995) - Tuhao Chen, Eugene Seneta:
Multivariate Identities, Permutation and Bonferroni Upper Bounds. Comb. Probab. Comput. 4: 331-342 (1995) - Fan R. K. Chung, Shing-Tung Yau:
Eigenvalues of Graphs and Sobolev Inequalities. Comb. Probab. Comput. 4: 11-25 (1995) - Colin Cooper, Alan M. Frieze:
On the Connectivity of Random k-th Nearest Neighbour Graphs. Comb. Probab. Comput. 4: 343-362 (1995) - Colin McDiarmid, Bruce A. Reed:
Almost Every Graph can be Covered by [fracDelta2] Linear Forests. Comb. Probab. Comput. 4: 257-268 (1995) - Reinhard Diestel:
Graph Minors 1: A Short Proof of the Path-width Theorem. Comb. Probab. Comput. 4: 27-30 (1995) - Keith Edwards:
The Harmonious Chromatic Number of Almost All Trees. Comb. Probab. Comput. 4: 31-46 (1995) - Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. Comb. Probab. Comput. 4: 47-66 (1995) - Yahya Ould Hamidoune:
On Weighted Sequence Sums. Comb. Probab. Comput. 4: 363-367 (1995) - Takashi Hara, Gordon Slade:
The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions. Comb. Probab. Comput. 4: 197-215 (1995) - Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
The Induced Size-Ramsey Number of Cycles. Comb. Probab. Comput. 4: 217-239 (1995) - Fair Barbour Hurst, Talmage James Reid:
Some Small Circuit- Cocircuit Ramsey Numbers for Matroids. Comb. Probab. Comput. 4: 67-80 (1995) - Svante Janson:
Random Regular Graphs: Asymptotic Distributions and Contiguity. Comb. Probab. Comput. 4: 369-405 (1995) - Jeong Han Kim:
On Brooks' Theorem for Sparse Graphs. Comb. Probab. Comput. 4: 97-132 (1995) - János Komlós, Gábor N. Sárközy, Endre Szemerédi:
proof of a Packing Conjecture of Bollobás. Comb. Probab. Comput. 4: 241-255 (1995) - Gregory F. Lawler:
Recurrence and Transience for a Card Shuffling Model. Comb. Probab. Comput. 4: 133-142 (1995) - Guy Louchard, Wojciech Szpankowski:
A probabilistic Analysis of a String Editing Problem and its Variations. Comb. Probab. Comput. 4: 143-166 (1995) - Wolfgang Mader:
On Vertices of Degree n in Minimally n-Edge-Connected Graphs. Comb. Probab. Comput. 4: 81-95 (1995) - A. El Maftouhi, Wenceslas Fernandez de la Vega:
On Random 3-sat. Comb. Probab. Comput. 4: 189-195 (1995) - Frantisek Matús:
Conditional Independences among Four Random Variables 2. Comb. Probab. Comput. 4: 407-417 (1995) - Frantisek Matús, Milan Studený:
Conditional Independences among Four Random Variables 1. Comb. Probab. Comput. 4: 269-278 (1995) - Laurent Saloff-Coste:
Isoperimetric Inequalities and Decay of Iterated Kernels for almost-transitive Markov Chains. Comb. Probab. Comput. 4: 419-442 (1995) - Dudley Stark:
First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner. Comb. Probab. Comput. 4: 279-285 (1995) - Mikkel Thorup:
Shortcutting Planar Digraphs. Comb. Probab. Comput. 4: 287-315 (1995) - Oleg Verbitsky:
On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE. Comb. Probab. Comput. 4: 167-180 (1995) - John C. Wierman:
Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model. Comb. Probab. Comput. 4: 181-188 (1995)
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-05-28 19:40 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