Остановите войну!
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 25 matches
- 2021
- Luisa Andreis, Wolfgang König, Robert I. A. Patterson:
A large-deviations principle for all the cluster sizes of a sparse Erdős-Rényi graph. Random Struct. Algorithms 59(4): 522-553 (2021) - Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast uniform generation of random graphs with given degree sequences. Random Struct. Algorithms 59(3): 291-314 (2021) - Erik Bates, Moumanti Podder:
Avoidance couplings on non-complete graphs. Random Struct. Algorithms 59(1): 25-52 (2021) - Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the probabilistic degree of OR over the reals. Random Struct. Algorithms 59(1): 53-67 (2021) - Sohom Bhattacharya, Amir Dembo:
Upper tail for homomorphism counts in constrained sparse random graphs. Random Struct. Algorithms 59(3): 315-338 (2021) - François Bienvenu, Jean-Jil Duchamps, Félix Foutel-Rodier:
The Moran forest. Random Struct. Algorithms 59(2): 155-188 (2021) - Jacopo Borga:
Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one-dimensional labels. Random Struct. Algorithms 59(3): 339-375 (2021) - Pietro Caputo, Matteo Quattropani:
Mixing time of PageRank surfers on sparse random digraphs. Random Struct. Algorithms 59(3): 376-406 (2021) - Michael Damron, Hanbaek Lyu, David Sivakoff:
Stretched exponential decay for subcritical parking times on. Random Struct. Algorithms 59(2): 143-154 (2021) - Nemanja Draganic, Michael Krivelevich, Rajko Nenadov:
The size-Ramsey number of short subdivisions. Random Struct. Algorithms 59(1): 68-78 (2021) - Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms 59(2): 204-237 (2021) - Jacob Fox, Lisa Sauermann, Fan Wei:
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices. Random Struct. Algorithms 59(4): 554-615 (2021) - Annika Heckel:
Random triangles in random graphs. Random Struct. Algorithms 59(4): 616-621 (2021) - Alexander E. Holroyd, James B. Martin:
Galton-Watson games. Random Struct. Algorithms 59(4): 495-521 (2021) - Joel Larsson, Klas Markström:
Biased random k-SAT. Random Struct. Algorithms 59(2): 238-266 (2021) - Michal Lason:
Optimal stopping for many connected components in a graph. Random Struct. Algorithms 59(2): 267-287 (2021) - Colin McDiarmid, Alex Scott, Paul Withers:
The component structure of dense random subgraphs of the hypercube. Random Struct. Algorithms 59(1): 3-24 (2021) - Jiaxi Nie, Jacques Verstraëte:
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth. Random Struct. Algorithms 59(1): 79-95 (2021) - Soumik Pal, Yizhe Zhu:
Community detection in the sparse hypergraph stochastic block model. Random Struct. Algorithms 59(3): 407-463 (2021) - Ross G. Pinsky:
The infinite limit of separable permutations. Random Struct. Algorithms 59(4): 622-639 (2021) - Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures versus errors in local decoding and property testing. Random Struct. Algorithms 59(4): 640-670 (2021) - Emilio De Santis:
Ranking graphs through hitting times of Markov chains. Random Struct. Algorithms 59(2): 189-203 (2021) - Nobutaka Shimizu, Takeharu Shiraga:
Phase transitions of Best-of-two and Best-of-three on stochastic block models. Random Struct. Algorithms 59(1): 96-140 (2021) - Benedikt Stufler:
Graphon convergence of random cographs. Random Struct. Algorithms 59(3): 464-491 (2021) - Corrigendum to "Online purchasing under uncertainty". Random Struct. Algorithms 59(2): 288 (2021)
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-06-14 17:03 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