![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 41 matches
- 2010
- Louigi Addario-Berry, Nicolas Broutin, Gábor Lugosi
:
The Longest Minimum-Weight Path in a Complete Graph. Comb. Probab. Comput. 19(1): 1-19 (2010) - Noga Alon, Béla Bollobás:
Introduction. Comb. Probab. Comput. 19(5-6): 641 (2010) - Noga Alon, Dan Hefetz
, Michael Krivelevich:
Playing to Retain the Advantage. Comb. Probab. Comput. 19(4): 481-491 (2010) - Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. Comb. Probab. Comput. 19(2): 161-182 (2010) - Jan Arpe, Elchanan Mossel
:
Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles. Comb. Probab. Comput. 19(2): 183-199 (2010) - Paul Balister
, Steve Kalikow, Amites Sarkar:
The Linus Sequence. Comb. Probab. Comput. 19(1): 21-46 (2010) - József Balogh, Béla Bollobás, Robert Morris:
Bootstrap Percolation in High Dimensions. Comb. Probab. Comput. 19(5-6): 643-692 (2010) - Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
:
Online Conflict-Free Colouring for Hypergraphs. Comb. Probab. Comput. 19(4): 493-516 (2010) - Alexander I. Barvinok:
What Does a Random Contingency Table Look Like? Comb. Probab. Comput. 19(4): 517-539 (2010) - Andrew Beveridge, László Lovász:
Exit Frequency Matrices for Finite Markov Chains. Comb. Probab. Comput. 19(4): 541-560 (2010) - Olivier Bodini, Éric Fusy, Carine Pivoteau:
Random Sampling of Plane Partitions. Comb. Probab. Comput. 19(2): 201-226 (2010) - Henning Bruhn, Maya Jakobine Stein
:
Duality of Ends. Comb. Probab. Comput. 19(1): 47-60 (2010) - Amin Coja-Oghlan:
Graph Partitioning via Adaptive Spectral Techniques. Comb. Probab. Comput. 19(2): 227-284 (2010) - Kevin P. Costello
, Van H. Vu:
On the Rank of Random Sparse Matrices. Comb. Probab. Comput. 19(3): 321-342 (2010) - Artur Czumaj, Christian Sohler
:
Testing Expansion in Bounded-Degree Graphs. Comb. Probab. Comput. 19(5-6): 693-709 (2010) - Florian Dennert, Rudolf Grübel:
On the Subtree Size Profile of Binary Search trees. Comb. Probab. Comput. 19(4): 561-578 (2010) - Yuanan Diao
, Gábor Hetyei:
Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory. Comb. Probab. Comput. 19(3): 343-369 (2010) - Martin Dietzfelbinger
, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Tight Bounds for Blind Search on the Integers and the Reals. Comb. Probab. Comput. 19(5-6): 711-728 (2010) - Guoli Ding, Stan Dziobiak:
Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs. Comb. Probab. Comput. 19(4): 579-591 (2010) - Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres:
Diameters in Supercritical Random Graphs Via First Passage Percolation. Comb. Probab. Comput. 19(5-6): 729-751 (2010) - Jacob Fox, Peter Keevash, Benny Sudakov:
Directed Graphs Without Short Cycles. Comb. Probab. Comput. 19(2): 285-301 (2010) - Jacob Fox, János Pach:
A Separator Theorem for String Graphs and its Applications. Comb. Probab. Comput. 19(3): 371-390 (2010) - Jacob Fox, Benny Sudakov:
Decompositions into Subgraphs of Small Diameter. Comb. Probab. Comput. 19(5-6): 753-774 (2010) - David Gamarnik, David A. Goldberg:
Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections. Comb. Probab. Comput. 19(1): 61-85 (2010) - Andreas Goerdt:
On Random Betweenness Constraints. Comb. Probab. Comput. 19(5-6): 775-790 (2010) - Catherine S. Greenhill, Svante Janson, Andrzej Rucinski
:
On the Number of Perfect Matchings in Random Lifts. Comb. Probab. Comput. 19(5-6): 791-817 (2010) - Cecilia Holmgren:
Random Records and Cuttings in Binary Search Trees. Comb. Probab. Comput. 19(3): 391-424 (2010) - Ross J. Kang
, Colin McDiarmid:
The t-Improper Chromatic Number of Random Graphs. Comb. Probab. Comput. 19(1): 87-98 (2010) - Markus Kuba, Stephan G. Wagner:
Deterministic Edge Weights in Increasing Tree Families. Comb. Probab. Comput. 19(1): 99-119 (2010) - Tomasz Luczak
, Andrew Thomason:
Vicarious Graphs. Comb. Probab. Comput. 19(5-6): 819-827 (2010)
skipping 11 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-10 03:06 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