Остановите войну!
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 27 matches
- 2014
- Emmanuel Abbe, Andrea Montanari:
On the concentration of the number of solutions of random satisfiability formulas. Random Struct. Algorithms 45(3): 362-382 (2014) - Itai Benjamini, Gady Kozma, Nicholas C. Wormald:
The mixing time of the giant component of a random graph. Random Struct. Algorithms 45(3): 383-407 (2014) - Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller, Milos Stojakovic:
Maker-breaker games on random geometric graphs. Random Struct. Algorithms 45(4): 553-607 (2014) - Michael Borokhovich, Chen Avin, Zvi Lotker:
Bounds for algebraic gossip on graphs. Random Struct. Algorithms 45(2): 185-217 (2014) - Demetres Christofides, Klas Markström:
The thresholds for diameter 2 in random Cayley graphs. Random Struct. Algorithms 45(2): 218-235 (2014) - David Conlon, Jacob Fox, Benny Sudakov:
Cycle packing. Random Struct. Algorithms 45(4): 608-626 (2014) - Colin Cooper, Alan M. Frieze, Eyal Lubetzky:
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. Random Struct. Algorithms 45(4): 627-674 (2014) - Colin Cooper, Alan M. Frieze, Ryuhei Uehara:
The height of random k-trees and related branching processes. Random Struct. Algorithms 45(4): 675-702 (2014) - Nicolas Curien, Igor Kortchemski:
Random non-crossing plane configurations: A conditioned Galton-Watson tree approach. Random Struct. Algorithms 45(2): 236-260 (2014) - Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding cycles and trees in sublinear time. Random Struct. Algorithms 45(2): 139-184 (2014) - Luc Devroye, Nicolas Fraiman:
Connectivity of inhomogeneous random graphs. Random Struct. Algorithms 45(3): 408-420 (2014) - Amalia Duch, Rosa M. Jiménez, Conrado Martínez:
Selection by rank in K-dimensional binary search trees. Random Struct. Algorithms 45(1): 14-37 (2014) - Mirko Ebbers, Holger Knöpfel, Matthias Löwe, Franck Vermet:
Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model. Random Struct. Algorithms 45(1): 38-77 (2014) - Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger:
Stochastic service systems, random interval graphs and search algorithms. Random Struct. Algorithms 45(3): 421-442 (2014) - Thomas Feierl:
Asymptotics for the number of walks in a Weyl chamber of type B. Random Struct. Algorithms 45(2): 261-305 (2014) - Alan M. Frieze:
On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three. Random Struct. Algorithms 45(3): 443-497 (2014) - Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Algorithms 45(1): 78-110 (2014) - Eyal Heiman, Gideon Schechtman, Adi Shraibman:
Deterministic algorithms for matrix completion. Random Struct. Algorithms 45(2): 306-317 (2014) - Mark Holmes, Thomas S. Salisbury:
Degenerate random environments. Random Struct. Algorithms 45(1): 111-137 (2014) - Svante Janson, Malwina J. Luczak, Peter Windridge:
Law of large numbers for the SIR epidemic on a random graph with given degrees. Random Struct. Algorithms 45(4): 726-763 (2014) - Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott:
For most graphs H, most H-free graphs have a linear homogeneous set. Random Struct. Algorithms 45(3): 343-361 (2014) - Lionel Levine, Yuval Peres:
The looping constant of ℤd. Random Struct. Algorithms 45(1): 1-13 (2014) - Michael Molloy:
Sets that are connected in two random graphs. Random Struct. Algorithms 45(3): 498-512 (2014) - Tobias Müller, Milos Stojakovic:
A threshold for the Maker-Breaker clique game. Random Struct. Algorithms 45(2): 318-341 (2014) - Michael E. Picollelli:
The diamond-free process. Random Struct. Algorithms 45(3): 513-551 (2014) - Oliver Riordan:
Long cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 45(4): 764-767 (2014) - Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung:
On longest paths and diameter in random apollonian network. Random Struct. Algorithms 45(4): 703-725 (2014)
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-31 07:45 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