Остановите войну!
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 28 matches
- 2017
- Tonci Antunovic, Yael Dekel, Elchanan Mossel, Yuval Peres:
Competing first passage percolation on random regular graphs. Random Struct. Algorithms 50(4): 534-583 (2017) - Imre Bárány, Daniel Hug, Matthias Reitzner, Rolf Schneider:
Random points in halfspheres. Random Struct. Algorithms 50(1): 3-22 (2017) - Béla Bollobás, Oliver Riordan:
Exploring hypergraphs with martingales. Random Struct. Algorithms 50(3): 325-352 (2017) - Sébastien Bubeck, Luc Devroye, Gábor Lugosi:
Finding Adam in random growing trees. Random Struct. Algorithms 50(2): 158-172 (2017) - Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts:
Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms 50(4): 511-533 (2017) - Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Dependence and phase changes in random m-ary search trees. Random Struct. Algorithms 50(3): 353-379 (2017) - David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Skoric:
Almost-spanning universality in random graphs. Random Struct. Algorithms 50(3): 380-393 (2017) - Nicholas A. Cook:
Discrepancy properties for random regular digraphs. Random Struct. Algorithms 50(1): 23-58 (2017) - Ronen Eldan, Miklós Z. Rácz, Tselil Schramm:
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors. Random Struct. Algorithms 50(4): 584-611 (2017) - Genghua Fan, Jianfeng Hou:
Bounds for pairs in judicious partitioning of graphs. Random Struct. Algorithms 50(1): 59-70 (2017) - Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50(1): 71-85 (2017) - Alan M. Frieze, Tony Johansson:
On random k-out subgraphs of large graphs. Random Struct. Algorithms 50(2): 143-157 (2017) - Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma:
First order limits of sparse graphs: Plane trees and path-width. Random Struct. Algorithms 50(4): 612-635 (2017) - Robert Graf:
Self-destructive percolation as a limit of forest-fire models on regular rooted trees. Random Struct. Algorithms 50(1): 86-113 (2017) - Christopher Hoffman, Douglas Rizzolo, Erik Slivken:
Pattern-avoiding permutations and Brownian excursion part I: Shapes and fluctuations. Random Struct. Algorithms 50(3): 394-419 (2017) - Mark Huber:
A Bernoulli mean estimate with known relative error distribution. Random Struct. Algorithms 50(2): 173-182 (2017) - Christof Külske, Utkir A. Rozikov:
Fuzzy transformations and extremality of Gibbs measures for the potts model on a Cayley tree. Random Struct. Algorithms 50(4): 636-678 (2017) - Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing near spanning trees with few local inspections. Random Struct. Algorithms 50(2): 183-200 (2017) - Eyal Lubetzky, Yufei Zhao:
On the variational problem for upper tails in sparse random graphs. Random Struct. Algorithms 50(3): 420-436 (2017) - Colin McDiarmid, Alex Scott, Paul Withers:
Uniform multicommodity flows in the hypercube with random edge-capacities. Random Struct. Algorithms 50(3): 437-463 (2017) - Abbas Mehrabian:
Justifying the small-world phenomenon via random recursive trees. Random Struct. Algorithms 50(2): 201-224 (2017) - Tobias Müller:
The critical probability for confetti percolation equals 1/2. Random Struct. Algorithms 50(4): 679-697 (2017) - Andreas Noever:
Online Ramsey games for more than two colors. Random Struct. Algorithms 50(3): 464-492 (2017) - Ori Parzanchevski, Ron Rosenthal:
Simplicial complexes: Spectrum, homology and random walks. Random Struct. Algorithms 50(2): 225-261 (2017) - Matthias Schulte, Christoph Thäle:
Central limit theorems for the radial spanning tree. Random Struct. Algorithms 50(2): 262-286 (2017) - Aaron Smith:
The cutoff phenomenon for random birth and death chains. Random Struct. Algorithms 50(2): 287-321 (2017) - Henning Sulzbach:
On martingale tail sums for the path length in random trees. Random Struct. Algorithms 50(3): 493-508 (2017) - Henry Towsner:
σ-algebras for quasirandom hypergraphs. Random Struct. Algorithms 50(1): 114-139 (2017)
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-30 09:48 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