![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.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 33 matches
- 2019
- Daniel Ahlberg, Simon Griffiths, Svante Janson, Robert Morris:
Competition in growth and urns. Random Struct. Algorithms 54(2): 211-227 (2019) - Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Hypergraph coloring up to condensation. Random Struct. Algorithms 54(4): 615-652 (2019) - Jacob D. Baron, Jeff Kahn:
On the cycle space of a random graph. Random Struct. Algorithms 54(1): 39-68 (2019) - Huck Bennett, Daniel Reichman, Igor Shinkar:
On percolation and -hardness. Random Struct. Algorithms 54(2): 228-257 (2019) - Piotr Berman, Meiram Murzabulatov
, Sofya Raskhodnikova:
Testing convexity of figures under the uniform distribution. Random Struct. Algorithms 54(3): 413-443 (2019) - Anton Bernshteyn:
The Johansson-Molloy theorem for DP-coloring. Random Struct. Algorithms 54(4): 653-664 (2019) - Omer Bobrowski
, Gonçalo Oliveira
:
Random Čech complexes on Riemannian manifolds. Random Struct. Algorithms 54(3): 373-412 (2019) - Matija Bucic
, Shoham Letzter
, Benny Sudakov:
Monochromatic paths in random tournaments. Random Struct. Algorithms 54(1): 69-81 (2019) - Francesco Caravenna, Alessandro Garavaglia, Remco van der Hofstad
:
Diameter in ultra-small scale-free random graphs. Random Struct. Algorithms 54(3): 444-498 (2019) - Esther Ezra, Shachar Lovett:
On the Beck-Fiala conjecture for random set systems. Random Struct. Algorithms 54(4): 665-675 (2019) - Victor Falgas-Ravry
, Kelly O'Connell, Andrew J. Uzzell:
Multicolor containers, extremal entropy, and counting. Random Struct. Algorithms 54(4): 676-720 (2019) - Asaf Ferber, Eoin Long:
Packing and counting arbitrary Hamilton cycles in random digraphs. Random Struct. Algorithms 54(3): 499-514 (2019) - Asaf Ferber, Daniel Montealegre, Van Vu:
Law of the iterated logarithm for random graphs. Random Struct. Algorithms 54(1): 3-38 (2019) - Alan M. Frieze, Tony Johansson:
On the insertion time of random walk cuckoo hashing. Random Struct. Algorithms 54(4): 721-729 (2019) - Alan M. Frieze, Xavier Pérez-Giménez
, Pawel Pralat, Benjamin Reiniger:
Perfect matchings and Hamiltonian cycles in the preferential attachment model. Random Struct. Algorithms 54(2): 258-288 (2019) - Andreas Galanis, Daniel Stefankovic
, Eric Vigoda:
Swendsen-Wang algorithm on the mean-field Potts model. Random Struct. Algorithms 54(1): 82-147 (2019) - Olle Häggström, Timo Hirscher:
Water transport on infinite graphs. Random Struct. Algorithms 54(3): 515-527 (2019) - Prahladh Harsha
, Srikanth Srinivasan
:
On polynomial approximations to AC. Random Struct. Algorithms 54(2): 289-303 (2019) - Jonathan Hermon, Allan Sly, Yumeng Zhang:
Rapid mixing of hypergraph independent sets. Random Struct. Algorithms 54(4): 730-767 (2019) - Yoshiharu Kohayakawa
, Troy Retter, Vojtech Rödl:
The size Ramsey number of short subdivisions of bounded degree graphs. Random Struct. Algorithms 54(2): 304-339 (2019) - Jakub Kwasny
, Jakub Przybylo
:
Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number. Random Struct. Algorithms 54(4): 768-778 (2019) - Kevin Leckey
:
On densities for solutions to stochastic fixed point equations. Random Struct. Algorithms 54(3): 528-558 (2019) - Jean-François Marckert, Minmin Wang:
A new combinatorial representation of the additive coalescent. Random Struct. Algorithms 54(2): 340-370 (2019) - Anders Martinsson:
Most edge-orderings of Kn have maximal altitude. Random Struct. Algorithms 54(3): 559-585 (2019) - Colin McDiarmid, Dieter Mitsche, Pawel Pralat:
Clique coloring of binomial random graphs. Random Struct. Algorithms 54(4): 589-614 (2019) - Colin McDiarmid, Nikola Yolov:
Random perfect graphs. Random Struct. Algorithms 54(1): 148-186 (2019) - Richard Montgomery:
Fractional clique decompositions of dense graphs. Random Struct. Algorithms 54(4): 779-796 (2019) - Rajko Nenadov
, Nemanja Skoric:
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 54(1): 187-208 (2019) - Rajko Nenadov
, Angelika Steger, Milos Trujic
:
Resilience of perfect matchings and Hamiltonicity in random graph processes. Random Struct. Algorithms 54(4): 797-819 (2019) - Issue information. Random Struct. Algorithms 54(1): 1-2 (2019)
skipping 3 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-07-06 20:16 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