Остановите войну!
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 23 matches
- 1999
- Rudolf Ahlswede, Ning Cai:
A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem. Comb. Probab. Comput. 8(4): 301-305 (1999) - Sven Erick Alm, John C. Wierman:
Inequalities For Means Of Restricted First-Passage Times In Percolation Theory. Comb. Probab. Comput. 8(4): 307-315 (1999) - Helmut Alt, Ulrich Fuchs, Klaus Kriegel:
On The Number Of Simple Cycles In Planar Graphs. Comb. Probab. Comput. 8(5): 397-405 (1999) - Richard Arratia, Andrew D. Barbour, Simon Tavaré:
The Poisson-Dirichlet Distribution And The Scale-Invariant Poisson Process. Comb. Probab. Comput. 8(5): 407-416 (1999) - Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
Sparse 0-1-Matrices And Forbidden Hypergraphs. Comb. Probab. Comput. 8(5): 417-427 (1999) - Isa Cakir, Ourania Chryssaphinou, Marianne Månsson:
On A Conjecture By Eriksson Concerning Overlap In Strings. Comb. Probab. Comput. 8(5): 429-440 (1999) - Éva Czabarka:
Intersecting Chains In Finite Vector Spaces. Comb. Probab. Comput. 8(6): 509-528 (1999) - Tristan Denley, Talmage James Reid:
On The Number Of Elements In Matroids With Small Circuits Or Cocircuits. Comb. Probab. Comput. 8(6): 529-537 (1999) - Robert P. Dobrow, James Allen Fill:
Total Path Length For Random Recursive Trees. Comb. Probab. Comput. 8(4): 317-333 (1999) - Peter Eichelsbacher, Malgorzata Roos:
Compound Poisson Approximation For Dissociated Random Variables Via Stein's Method. Comb. Probab. Comput. 8(4): 335-346 (1999) - Stephen Guattery, Frank Thomson Leighton, Gary L. Miller:
The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian. Comb. Probab. Comput. 8(5): 441-460 (1999) - Petros Hadjicostas:
The Asymptotic Proportion Of Subdivisions Of A 2 × 2 Table That Result In Simpson's Paradox. Comb. Probab. Comput. 8(6): 599 (1999) - Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On Sets With A Small Subset Sum. Comb. Probab. Comput. 8(5): 461-466 (1999) - Jochen Harant, Anja Pruchnewski, Margit Voigt:
On Dominating Sets And Independent Sets Of Graphs. Comb. Probab. Comput. 8(6): 547-553 (1999) - Svante Janson:
One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights. Comb. Probab. Comput. 8(4): 347-361 (1999) - Alexandr V. Kostochka, Jaroslav Nesetril:
Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. Comb. Probab. Comput. 8(5): 467-472 (1999) - Michael Mitzenmacher:
Studying Balanced Allocations With Differential Equations. Comb. Probab. Comput. 8(5): 473-482 (1999) - Oleg Pikhurko:
The Minimum Size Of Saturated Hypergraphs. Comb. Probab. Comput. 8(5): 483-492 (1999) - Vojtech Rödl, Andrzej Rucinski, Anusch Taraz:
Hypergraph Packing And Graph Embedding. Comb. Probab. Comput. 8(4): 363-376 (1999) - Riste Skrekovski:
A Grötzsch-Type Theorem For List Colourings With Impropriety One. Comb. Probab. Comput. 8(5): 493-507 (1999) - Alan Stacey:
Searches On A Binary Tree With Random Edge-Weights. Comb. Probab. Comput. 8(6): 555-565 (1999) - Dudley Stark:
Total Variation Asymptotics For Refined Poisson Process Approximations Of Random Logarithmic Assemblies. Comb. Probab. Comput. 8(6): 567-598 (1999) - Angelika Steger, Nicholas C. Wormald:
Generating Random Regular Graphs Quickly. Comb. Probab. Comput. 8(4): 377-396 (1999)
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 15:47 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