Остановите войну!
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 23 matches
- 2012
- Wojciech Banaszczyk:
On series of signed vectors and their rearrangements. Random Struct. Algorithms 40(3): 301-316 (2012) - Jacob van den Berg, Bernardo N. B. de Lima, Pierre Nolin:
A percolation process on the square lattice where large finite clusters are frozen. Random Struct. Algorithms 40(2): 220-226 (2012) - Julia Böttcher, Yoshiharu Kohayakawa, Aldo Procacci:
Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Struct. Algorithms 40(4): 425-436 (2012) - Elisabetta Candellero, Lorenz A. Gilch:
Phase transitions for random walk asymptotics on free products of groups. Random Struct. Algorithms 40(2): 150-181 (2012) - Sourav Chatterjee:
The missing log in large deviations for triangle counts. Random Struct. Algorithms 40(4): 437-451 (2012) - Lincoln Chayes, S. Alex Smith:
Large deviation analysis for layered percolation problems on the complete graph. Random Struct. Algorithms 40(4): 460-492 (2012) - Fan Chung Graham:
Quasi-random hypergraphs revisited. Random Struct. Algorithms 40(1): 39-48 (2012) - David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms 40(1): 1-38 (2012) - Bobby DeMarco, Jeff Kahn:
Upper tails for triangles. Random Struct. Algorithms 40(4): 452-459 (2012) - Domingos Dellamonica Jr.:
The size-Ramsey number of trees. Random Struct. Algorithms 40(1): 49-73 (2012) - Andrzej Dudek, Reshma Ramadurai, Vojtech Rödl:
On induced Folkman numbers. Random Struct. Algorithms 40(4): 493-500 (2012) - Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger:
The fraction of large random trees representing a given Boolean function in implicational logic. Random Struct. Algorithms 40(3): 317-349 (2012) - Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms 40(3): 269-300 (2012) - Ariel Gabizon, Ronen Shaltiel:
Increasing the output length of zero-error dispersers. Random Struct. Algorithms 40(1): 74-104 (2012) - André Galligo, Laurent Miclo:
On the cut-off phenomenon for the transitivity of randomly generated subgroups. Random Struct. Algorithms 40(2): 182-219 (2012) - Ilan Gronau, Shlomo Moran, Sagi Snir:
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. Random Struct. Algorithms 40(3): 350-384 (2012) - Paul Horn, Mary Radcliffe:
Giant components in Kronecker graphs. Random Struct. Algorithms 40(3): 385-397 (2012) - Markus Jalsenius:
Sampling colourings of the triangular lattice. Random Struct. Algorithms 40(4): 501-533 (2012) - Fiachra Knox, Daniela Kühn, Deryk Osthus:
Approximate Hamilton decompositions of random graphs. Random Struct. Algorithms 40(2): 133-149 (2012) - Mokshay M. Madiman, Adam W. Marcus, Prasad Tetali:
Entropy and set cardinality inequalities for partition-determined functions. Random Struct. Algorithms 40(4): 399-424 (2012) - Dmitry A. Shabanov:
Random coloring method in the combinatorial problem of Erdős and Lovász. Random Struct. Algorithms 40(2): 227-253 (2012) - Asaf Shapira, Raphael Yuster:
The quasi-randomness of hypergraph cut properties. Random Struct. Algorithms 40(1): 105-131 (2012) - Guy Wolfovitz:
A concentration result with application to subgraph count. Random Struct. Algorithms 40(2): 254-267 (2012)
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-01 06:14 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