Остановите войну!
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 53 matches
- 2014
- Louigi Addario-Berry, Laura Eslava:
Hitting Time Theorems for Random Matrices. Comb. Probab. Comput. 23(5): 635-669 (2014) - Louigi Addario-Berry, Svante Janson, Colin McDiarmid:
On the Spread of Random Graphs. Comb. Probab. Comput. 23(4): 477-504 (2014) - Daniel Ahlberg:
Partially Observed Boolean Sequences and Noise Sensitivity. Comb. Probab. Comput. 23(3): 317-330 (2014) - Margaret Archibald, Arnold Knopfmacher:
The Largest Missing Value in a Sample of Geometric Random Variables. Comb. Probab. Comput. 23(5): 670-685 (2014) - Mahshid Atapour, Neal Madras:
Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations. Comb. Probab. Comput. 23(2): 161-200 (2014) - Tatjana Bakshajeva, Eugenijus Manstavicius:
On Statistics of Permutations Chosen From the Ewens Distribution. Comb. Probab. Comput. 23(6): 889-913 (2014) - Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs. Comb. Probab. Comput. 23(3): 331-366 (2014) - Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
The Asymptotic Number of Connected d-Uniform Hypergraphs. Comb. Probab. Comput. 23(3): 367-385 (2014) - Edward A. Bender, Zhicheng Gao:
Part Sizes of Smooth Supercritical Compositional Structures. Comb. Probab. Comput. 23(5): 686-716 (2014) - Olivier Bernardi, Rosena R. X. Du, Alejandro H. Morales, Richard P. Stanley:
Separation Probabilities for Products of Permutations. Comb. Probab. Comput. 23(2): 201-222 (2014) - Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang:
Bounded-Size Rules: The Barely Subcritical Regime. Comb. Probab. Comput. 23(4): 505-538 (2014) - Eric Blais, Amit Weinstein, Yuichi Yoshida:
Semi-Strong Colouring of Intersecting Hypergraphs. Comb. Probab. Comput. 23(1): 1-7 (2014) - Miklós Bóna:
A New Upper Bound for 1324-Avoiding Permutations. Comb. Probab. Comput. 23(5): 717-724 (2014) - Mireille Bousquet-Mélou:
On the Importance Sampling of Self-Avoiding Walks. Comb. Probab. Comput. 23(5): 725-748 (2014) - Mireille Bousquet-Mélou, Kerstin Weller:
Asymptotic Properties of Some Minor-Closed Classes of Graphs. Comb. Probab. Comput. 23(5): 749-795 (2014) - J. Bouttier, Emmanuel Guitter:
On Irreducible Maps and Slices. Comb. Probab. Comput. 23(6): 914-972 (2014) - Eden Chlamtac, Ishay Haviv:
Linear Index Coding via Semidefinite Programming. Comb. Probab. Comput. 23(2): 223-247 (2014) - Francis Comets, François Delarue, René Schott:
Information Transmission under Random Emission Constraints. Comb. Probab. Comput. 23(6): 973-1009 (2014) - David Conlon, Jacob Fox, Benny Sudakov:
Short Proofs of Some Extremal Results. Comb. Probab. Comput. 23(1): 8-28 (2014) - Jeff Cooper, Kunal Dutta, Dhruv Mubayi:
Counting Independent Sets in Hypergraphs. Comb. Probab. Comput. 23(4): 539-550 (2014) - Iulia Dahmer, Götz Kersting, Anton Wakolbinger:
The Total External Branch Length of Beta-Coalescents. Comb. Probab. Comput. 23(6): 1010-1027 (2014) - Yael Dekel, Ori Gurel-Gurevich, Yuval Peres:
Finding Hidden Cliques in Linear Time with High Probability. Comb. Probab. Comput. 23(1): 29-49 (2014) - Steffen Dereich, Marcel Ortgiese:
Robust Analysis of Preferential Attachment Models with Fitness. Comb. Probab. Comput. 23(3): 386-411 (2014) - Luc Devroye, Nicolas Fraiman:
The Random Connection Model on the Torus. Comb. Probab. Comput. 23(5): 796-804 (2014) - Michael Drmota, Anna S. Lladó:
Almost Every Tree With m Edges Decomposes K 2m, 2m . Comb. Probab. Comput. 23(1): 50-65 (2014) - Louis Esperet, Gwenaël Joret:
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components. Comb. Probab. Comput. 23(4): 551-570 (2014) - James Allen Fill, Jason Matterer:
QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find. Comb. Probab. Comput. 23(5): 805-828 (2014) - Jacob Fox, János Pach:
Applications of a New Separator Theorem for String Graphs. Comb. Probab. Comput. 23(1): 66-74 (2014) - Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs. Comb. Probab. Comput. 23(6): 1028-1056 (2014) - Pu Gao:
The First k-Regular Subgraph is Large. Comb. Probab. Comput. 23(3): 412-433 (2014)
skipping 23 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-15 01:44 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