Остановите войну!
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 22 matches
- 2013
- Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet:
Turánnical hypergraphs. Random Struct. Algorithms 42(1): 29-58 (2013) - Alexander I. Barvinok, J. A. Hartigan:
The number of graphs and a random graph with a given degree sequence. Random Struct. Algorithms 42(3): 301-348 (2013) - Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil:
Statistical properties of subgroups of free groups. Random Struct. Algorithms 42(3): 349-373 (2013) - Jose H. Blanchet, Alexandre Stauffer:
Characterizing optimal sampling of binary contingency tables via the configuration model. Random Struct. Algorithms 42(2): 159-184 (2013) - Christian Borgs, Jennifer T. Chayes, Jeff Kahn, László Lovász:
Left and right convergence of graphs with bounded degree. Random Struct. Algorithms 42(1): 1-28 (2013) - Colin Cooper, Alan M. Frieze:
Component structure of the vacant set induced by a random walk on a random graph. Random Struct. Algorithms 42(2): 135-158 (2013) - David Coupier, Viet-Chi Tran:
The 2D-directed spanning forest is almost surely a tree. Random Struct. Algorithms 42(1): 59-72 (2013) - Sandrine Dasse-Hartaut, Pawel Hitczenko:
Greek letters in random staircase tableaux. Random Struct. Algorithms 42(1): 73-96 (2013) - Persi Diaconis, Philip Matchett Wood:
Random doubly stochastic tridiagonal matrices. Random Struct. Algorithms 42(4): 403-437 (2013) - Andrzej Dudek, Alan M. Frieze:
Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms 42(3): 374-385 (2013) - Tobias Friedrich, Lionel Levine:
Fast simulation of large-scale growth models. Random Struct. Algorithms 42(2): 185-213 (2013) - Omer Giménez, Marc Noy, Juan José Rué:
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs. Random Struct. Algorithms 42(4): 438-479 (2013) - Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek:
New approach to nonrepetitive sequences. Random Struct. Algorithms 42(2): 214-225 (2013) - Remco van der Hofstad:
Critical behavior in inhomogeneous random graphs. Random Struct. Algorithms 42(4): 480-508 (2013) - Subhash Khot, Assaf Naor:
Sharp kernel clustering algorithms and their associated Grothendieck inequalities. Random Struct. Algorithms 42(3): 269-300 (2013) - Günter Last, Mathew D. Penrose:
Percolation and limit theory for the poisson lilypond model. Random Struct. Algorithms 42(2): 226-249 (2013) - Shoham Letzter:
The property of having a k -regular subgraph has a sharp threshold. Random Struct. Algorithms 42(4): 509-519 (2013) - Gianluca De Marco, Dariusz R. Kowalski:
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness. Random Struct. Algorithms 42(1): 97-109 (2013) - Will Perkins:
The forgetfulness of balls and bins. Random Struct. Algorithms 42(2): 250-267 (2013) - Yakir Reshef, Salil P. Vadhan:
On extractors and exposure-resilient functions for sublogarithmic entropy. Random Struct. Algorithms 42(3): 386-401 (2013) - Linh V. Tran, Van H. Vu, Ke Wang:
Sparse random graphs: Eigenvalues and eigenvectors. Random Struct. Algorithms 42(1): 110-134 (2013) - Mario Ullrich:
Comparison of Swendsen-Wang and heat-bath dynamics. Random Struct. Algorithms 42(4): 520-535 (2013)
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-06 08:17 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