![](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 26 matches
- 2012
- Louigi Addario-Berry:
Tail bounds for the height and width of a random tree with a given degree sequence. Random Struct. Algorithms 41(2): 253-261 (2012) - József Balogh, Béla Bollobás, Robert Morris:
Graph bootstrap percolation. Random Struct. Algorithms 41(4): 413-440 (2012) - Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz
, Michael Krivelevich:
Hitting time results for Maker-Breaker games. Random Struct. Algorithms 41(1): 23-46 (2012) - Tom Bohman
, Michael E. Picollelli:
SIR epidemics on random graphs with a fixed degree sequence. Random Struct. Algorithms 41(2): 179-214 (2012) - Béla Bollobás, Oliver Riordan:
Asymptotic normality of the size of the giant component in a random hypergraph. Random Struct. Algorithms 41(4): 441-450 (2012) - Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger:
Extremal subgraphs of random graphs. Random Struct. Algorithms 41(2): 147-178 (2012) - Nicolas Broutin, Philippe Flajolet:
The distribution of height and diameter in random non-plane binary trees. Random Struct. Algorithms 41(2): 215-252 (2012) - Demetres Christofides
, Klas Markström:
Random Latin square graphs. Random Struct. Algorithms 41(1): 47-65 (2012) - Bobby DeMarco, Jeff Kahn:
Tight upper tail bounds for cliques. Random Struct. Algorithms 41(4): 469-487 (2012) - Luc Devroye, Omar Fawzi
, Nicolas Fraiman
:
Depth Properties of scaled attachment random recursive trees. Random Struct. Algorithms 41(1): 66-98 (2012) - Nikolaos Fountoulakis
, Konstantinos Panagiotou:
Sharp load thresholds for cuckoo hashing. Random Struct. Algorithms 41(3): 306-333 (2012) - Alan M. Frieze
, Michael Krivelevich:
Packing hamilton cycles in random and pseudo-random hypergraphs. Random Struct. Algorithms 41(1): 1-22 (2012) - Alan M. Frieze
, Páll Melsted
:
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables. Random Struct. Algorithms 41(3): 334-364 (2012) - Fan Chung Graham, Stephen J. Young
, Wenbo Zhao:
Braess's paradox in expanders. Random Struct. Algorithms 41(4): 451-468 (2012) - Luca Gugelmann, Yury Person
, Angelika Steger, Henning Thomas:
A randomized version of Ramsey's theorem. Random Struct. Algorithms 41(4): 488-505 (2012) - Hamed Hatami, Michael Molloy:
The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms 41(1): 99-123 (2012) - Dan Hefetz
, Michael Krivelevich, Tibor Szabó:
Sharp threshold for the appearance of certain spanning trees in random graphs. Random Struct. Algorithms 41(4): 391-412 (2012) - Hao Huang, Choongbum Lee:
Quasi-randomness of graph balanced cut properties. Random Struct. Algorithms 41(1): 124-145 (2012) - Jeff Kahn, M. Neiman:
Conditional negative association for competing urns. Random Struct. Algorithms 41(2): 262-281 (2012) - Frantisek Kardos, Daniel Král'
, Jan Volec
:
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. Random Struct. Algorithms 41(4): 506-520 (2012) - Tomás Kulich:
The diameter of a random subgraph of the hypercube. Random Struct. Algorithms 41(2): 282-291 (2012) - Choongbum Lee, Benny Sudakov:
Dirac's theorem for random graphs. Random Struct. Algorithms 41(3): 293-305 (2012) - Linyuan Lu, Xing Peng:
Loose laplacian spectra of random hypergraphs. Random Struct. Algorithms 41(4): 521-545 (2012) - Wesley Pegden
:
The lefthanded local lemma characterizes chordal dependency graphs. Random Struct. Algorithms 41(4): 546-556 (2012) - Balázs Ráth:
Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics. Random Struct. Algorithms 41(3): 365-390 (2012) - Vojtech Rödl, Mathias Schacht
:
Complete Partite subgraphs in dense hypergraphs. Random Struct. Algorithms 41(4): 557-573 (2012)
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-26 06:45 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