Остановите войну!
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 54 matches
- 2004
- Noga Alon, Uri Stav:
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. Comb. Probab. Comput. 13(6): 795-807 (2004) - Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis. Comb. Probab. Comput. 13(4-5): 419-449 (2004) - Boris Aronov, János Pach, Micha Sharir, Gábor Tardos:
Distinct Distances in Three and Higher Dimensions. Comb. Probab. Comput. 13(3): 283-293 (2004) - Geoffrey Atkinson, Alan M. Frieze:
On the b-Independence Number of Sparse Random Graphs. Comb. Probab. Comput. 13(3): 295-309 (2004) - Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. 13(3): 311-317 (2004) - Imre Bárány:
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry, by J Matousek, Springer, 2003, 196 pp. Comb. Probab. Comput. 13(2): 280-282 (2004) - Yonatan Bilu, Nathan Linial:
Ramanujan Signing of Regular Graphs. Comb. Probab. Comput. 13(6): 911-912 (2004) - Béla Bollobás:
How Sharp is the Concentration of the Chromatic Number? Comb. Probab. Comput. 13(1): 115-117 (2004) - Béla Bollobás, Imre Leader:
Isoperimetric Problems for r-sets. Comb. Probab. Comput. 13(2): 277-279 (2004) - Béla Bollobás, Alex D. Scott:
Max Cut for Random Graphs with a Planted Partition. Comb. Probab. Comput. 13(4-5): 451-474 (2004) - Magnus Bordewich:
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs. Comb. Probab. Comput. 13(1): 1-16 (2004) - Anton Bovier:
Spin Glasses: A Challenge for Mathematicians - Cavity and Mean Field Models, cby Michel Talagrand. Comb. Probab. Comput. 13(6): 913-915 (2004) - Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger:
And/Or Trees Revisited. Comb. Probab. Comput. 13(4-5): 475-497 (2004) - Colin Cooper, Alan M. Frieze:
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. Comb. Probab. Comput. 13(3): 319-337 (2004) - Benoit Daireaux, Brigitte Vallée:
Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm. Comb. Probab. Comput. 13(4-5): 499-536 (2004) - Anders Dessmark, Andrzej Pelc:
Distributed Colouring and Communication in Rings with Local Knowledge. Comb. Probab. Comput. 13(2): 123-136 (2004) - Feng Ming Dong, Khee Meng Koh:
Two Results on Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. 13(6): 809-813 (2004) - Michael Drmota, Wojciech Szpankowski:
Special Issue on Analysis of Algorithms. Comb. Probab. Comput. 13(4-5): 415-417 (2004) - Olivier Dubois, Guy Louchard, Jacques Mandler:
Additive Decompositions, Random Allocations, and Threshold Phenomena. Comb. Probab. Comput. 13(4-5): 537-575 (2004) - Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer:
Boltzmann Samplers for the Random Generation of Combinatorial Structures. Comb. Probab. Comput. 13(4-5): 577-625 (2004) - Steven N. Evans:
Embedding a Markov Chain into a Random Walk on a Permutation Group. Comb. Probab. Comput. 13(3): 339-351 (2004) - Ehud Friedgut:
Influences in Product Spaces: KKL and BKKKL Revisited. Comb. Probab. Comput. 13(1): 17-29 (2004) - Péter Gács:
Compatible Sequences and a Slow Winkler Percolation. Comb. Probab. Comput. 13(6): 815-856 (2004) - David J. Galvin, Jeff Kahn:
On Phase Transition in the Hard-Core Model on Math. Comb. Probab. Comput. 13(2): 137-164 (2004) - Hans Garmo, Svante Janson, Michal Karonski:
On Generalized Random Railways. Comb. Probab. Comput. 13(1): 31-35 (2004) - Stefanie Gerke, Colin McDiarmid:
On the Number of Edges in Random Planar Graphs. Comb. Probab. Comput. 13(2): 165-183 (2004) - Alexander V. Gnedin:
Three Sampling Formulas. Comb. Probab. Comput. 13(2): 185-193 (2004) - Penny E. Haxell:
On the Strong Chromatic Number. Comb. Probab. Comput. 13(6): 857-865 (2004) - Lars Holst:
Logarithmic Combinatorial Structures: A Probabilistic Approach, by RichardcArratia, A. D. Barbour and Simon Tavaré. Comb. Probab. Comput. 13(6): 916-917 (2004) - Don R. Hush, Clint Scovel:
Fat-Shattering of Affine Functions. Comb. Probab. Comput. 13(3): 353-360 (2004)
skipping 24 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-05-29 07:21 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