![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 24 matches
- 2010
- David J. Aldous, Shankar Bhamidi
:
Edge flows in the complete random-lengths network. Random Struct. Algorithms 37(3): 271-311 (2010) - Yuri Bakhtin:
Thermodynamic limit for large random trees. Random Struct. Algorithms 37(3): 312-331 (2010) - Alexander I. Barvinok, Zur Luria, Alex Samorodnitsky, Alexander Yong:
An approximation algorithm for counting contingency tables. Random Struct. Algorithms 37(1): 25-66 (2010) - Shankar Bhamidi
, Ram Rajagopal, Sébastien Roch:
Network delay inference from additive metrics. Random Struct. Algorithms 37(2): 176-203 (2010) - Charles Bordenave, Marc Lelarge:
Resolvent of large random graphs. Random Struct. Algorithms 37(3): 332-352 (2010) - Christian Borgs
, Jennifer T. Chayes, Ayalvadi Ganesh
, Amin Saberi:
How to distribute antidote to control epidemics. Random Struct. Algorithms 37(2): 204-222 (2010) - Michael R. Capalbo:
Explicit sparse almost-universal graphs for G(n, k/n). Random Struct. Algorithms 37(4): 437-454 (2010) - Javier Cilleruelo, Sándor Z. Kiss, Imre Z. Ruzsa, Carlos Vinuesa:
Generalization of a theorem of Erdos and Rényi on Sidon sequences. Random Struct. Algorithms 37(4): 455-464 (2010) - Joshua N. Cooper
, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic random walks on regular trees. Random Struct. Algorithms 37(3): 353-366 (2010) - Clément Dombry, Christian Mazza
:
Some remarks on Betti numbers of random polygon spaces. Random Struct. Algorithms 37(1): 67-84 (2010) - Gábor Elek:
Parameter testing in bounded degree graphs of subexponential growth. Random Struct. Algorithms 37(2): 248-270 (2010) - Kevin Fleming, Nicholas Pippenger:
Large deviations and moments for the Euler characteristic of a random surface. Random Struct. Algorithms 37(4): 465-476 (2010) - Ehud Friedgut, Vojtech Rödl, Mathias Schacht
:
Ramsey properties of random discrete structures. Random Struct. Algorithms 37(4): 407-436 (2010) - Geoffrey R. Grimmett, Svante Janson:
Random graphs with forbidden vertex degrees. Random Struct. Algorithms 37(2): 137-175 (2010) - Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Richthammer:
Percolation of arbitrary words in one dimension. Random Struct. Algorithms 37(1): 85-99 (2010) - Toshiya Itoh, Osamu Watanabe:
Weighted random popular matchings. Random Struct. Algorithms 37(4): 477-494 (2010) - Jeff Kahn, M. Neiman:
Negative correlation and log-concavity. Random Struct. Algorithms 37(3): 367-388 (2010) - Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Hamiltonicity thresholds in Achlioptas processes. Random Struct. Algorithms 37(1): 1-24 (2010) - Elia Liitiäinen, Amaury Lendasse
, Francesco Corona
:
A boundary corrected expansion of the moments of nearest neighbor distributions. Random Struct. Algorithms 37(2): 223-247 (2010) - Nati Linial, Doron Puder:
Word maps and spectra of random graph lifts. Random Struct. Algorithms 37(1): 100-135 (2010) - Tomasz Luczak
, Pawel Pralat:
Chasing robbers on random graphs: Zigzag theorem. Random Struct. Algorithms 37(4): 516-524 (2010) - Fedor Petrov
, Anatoly M. Vershik:
Uncountable graphs and invariant measures on the set of universal countable graphs. Random Struct. Algorithms 37(3): 389-406 (2010) - Terence Tao, Van H. Vu:
A sharp inverse Littlewood-Offord theorem. Random Struct. Algorithms 37(4): 525-539 (2010) - Gregory Valiant, Tim Roughgarden:
Braess's Paradox in large random graphs. Random Struct. Algorithms 37(4): 495-515 (2010)
loading more results
failed to load more results, please try again later
![](https://dblp1.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-08-22 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