Остановите войну!
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 33 matches
- 2023
- Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich:
Cycle lengths in randomly perturbed graphs. Random Struct. Algorithms 63(4): 867-884 (2023) - Ahmed El Alaoui, Andrea Montanari, Mark Sellke:
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree. Random Struct. Algorithms 63(3): 689-715 (2023) - Richard Arratia, Stephen Desalvo:
On the largest part size of low-rank combinatorial assemblies. Random Struct. Algorithms 63(1): 3-26 (2023) - Alexander I. Barvinok:
Smoothed counting of 0-1 points in polyhedra. Random Struct. Algorithms 63(1): 27-60 (2023) - Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and flooding in dynamic random networks with node churn. Random Struct. Algorithms 63(1): 61-101 (2023) - Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The impact of heterogeneity and geometry on the proof complexity of random satisfiability. Random Struct. Algorithms 63(4): 885-941 (2023) - Mindaugas Bloznelis, Lasse Leskelä:
Clustering and percolation on superpositions of Bernoulli random graphs. Random Struct. Algorithms 63(2): 283-342 (2023) - Miklós Bóna, Boris G. Pittel:
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves. Random Struct. Algorithms 63(1): 102-129 (2023) - Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali:
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures. Random Struct. Algorithms 63(1): 130-170 (2023) - Jane Breen, Nolan Faught, Cory Glover, Mark Kempton, Adam Knudson, Alice Oveson:
Kemeny's constant for nonbacktracking random walks. Random Struct. Algorithms 63(2): 343-363 (2023) - Alessandra Caraceni, Alexandre Stauffer:
Growing uniform planar maps face by face. Random Struct. Algorithms 63(4): 942-967 (2023) - Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, Tuan Tran:
Majority dynamics on sparse random graphs. Random Struct. Algorithms 63(1): 171-191 (2023) - Yulin Chang, Jie Han, Lubos Thoma:
On powers of tight Hamilton cycles in randomly perturbed hypergraphs. Random Struct. Algorithms 63(3): 591-609 (2023) - David Conlon, Jacob Fox, Xiaoyu He, Dhruv Mubayi, Andrew Suk, Jacques Verstraëte:
Hypergraph Ramsey numbers of cliques versus stars. Random Struct. Algorithms 63(3): 610-623 (2023) - Leonardo Nagami Coregliano, Alexander A. Razborov:
Natural quasirandomness properties. Random Struct. Algorithms 63(3): 624-688 (2023) - Sayan Das, Zoe M. Himwich, Nitya Mani:
A fourth-moment phenomenon for asymptotic normality of monochromatic subgraphs. Random Struct. Algorithms 63(4): 968-996 (2023) - Colin Desmarais, Cecilia Holmgren, Stephan Wagner:
Broadcasting-induced colorings of preferential attachment trees. Random Struct. Algorithms 63(2): 364-405 (2023) - Sahar Diskin, Michael Krivelevich:
Site percolation on pseudo-random graphs. Random Struct. Algorithms 63(2): 406-441 (2023) - Pandelis Dodos, Konstantinos Tyros, Petros Valettas:
Concentration estimates for functions of finite high-dimensional random arrays. Random Struct. Algorithms 63(4): 997-1053 (2023) - Asaf Ferber, Liam Hardiman, Michael Krivelevich:
On subgraphs with degrees of prescribed residues in the random graph. Random Struct. Algorithms 63(1): 192-214 (2023) - Benjamin Gunby, Xiaoyu He, Bhargav Narayanan:
Down-set thresholds. Random Struct. Algorithms 63(2): 442-456 (2023) - David G. Harris:
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel. Random Struct. Algorithms 63(3): 716-752 (2023) - Jimmy He, Tobias Müller, Teun W. Verstraaten:
Cycles in Mallows random permutations. Random Struct. Algorithms 63(4): 1054-1099 (2023) - Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms 63(1): 215-241 (2023) - Matthew Kahle, Minghao Tian, Yusu Wang:
On the clique number of noisy random geometric graphs. Random Struct. Algorithms 63(1): 242-279 (2023) - Günter Last, Giovanni Peccati, D. Yogeshwaran:
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees. Random Struct. Algorithms 63(2): 457-511 (2023) - Claire Mathieu, Hang Zhou:
A simple algorithm for graph reconstruction. Random Struct. Algorithms 63(2): 512-532 (2023) - András Mészáros:
Matchings on trees and the adjacency matrix: A determinantal viewpoint. Random Struct. Algorithms 63(3): 753-778 (2023) - Joe Neeman, Charles Radin, Lorenzo Sadun:
Moderate deviations in cycle count. Random Struct. Algorithms 63(3): 779-820 (2023) - Vojtech Rödl, Marcelo Tadeu Sales, Yi Zhao:
Independence number of hypergraphs under degree conditions. Random Struct. Algorithms 63(3): 821-863 (2023)
skipping 3 more matches
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-04 21: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