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 1,705 matches
- 2024
- Asaf Cohen Antonir:
The upper tail problem for induced 4-cycles in sparse random graphs. Random Struct. Algorithms 64(2): 401-459 (2024) - Lucas Aragão, Maurício Collares Neto, João Pedro Marciano, Taísa Martins, Robert Morris:
A lower bound for set-coloring Ramsey numbers. Random Struct. Algorithms 64(2): 157-169 (2024) - Pedro Araújo, Jan Hladký, Eng Keat Hng, Matas Sileikis:
Prominent examples of flip processes. Random Struct. Algorithms 64(3): 692-740 (2024) - Paul Balister, Béla Bollobás, Robert Morris, Paul Smith:
Subcritical monotone cellular automata. Random Struct. Algorithms 64(1): 38-61 (2024) - Sem C. Borst, Frank Den Hollander, Francesca R. Nardi, Matteo Sfragara:
Wireless random-access networks with bipartite interference graphs. Random Struct. Algorithms 64(4): 814-855 (2024) - Matthew S. Brennan, Guy Bresler, Brice Huang:
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs. Random Struct. Algorithms 64(1): 125-137 (2024) - Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang:
Packing list-colorings. Random Struct. Algorithms 64(1): 62-93 (2024) - Marcelo Campos, Maurício Collares Neto, Guilherme Oliveira Mota:
Counting orientations of random graphs with no directed k-cycles. Random Struct. Algorithms 64(3): 676-691 (2024) - Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, Jaehyeon Seo:
On a rainbow extremal problem for color-critical graphs. Random Struct. Algorithms 64(2): 460-489 (2024) - Wei-Kuo Chen, Wai-Kit Lam:
Universality of superconcentration in the Sherrington-Kirkpatrick model. Random Struct. Algorithms 64(2): 267-286 (2024) - Sergey Dovgal, Élie de Panafieu, Dimbinaina Ralaivaosaona, Vonjy Rasendrahasina, Stephan G. Wagner:
The birth of the strong components. Random Struct. Algorithms 64(2): 170-266 (2024) - Sean Eberhard:
Dixon's asymptotic without the classification of finite simple groups. Random Struct. Algorithms 64(4): 1016-1019 (2024) - Jacob Fox, Zoe M. Himwich, Nitya Mani:
Extremal results on feedback arc sets in digraphs. Random Struct. Algorithms 64(2): 287-308 (2024) - Jacob Fox, Sammy Luo, Huy Tuan Pham:
On random irregular subgraphs. Random Struct. Algorithms 64(4): 899-917 (2024) - Alan M. Frieze, Xavier Pérez-Giménez:
Rainbow Hamilton cycles in random geometric graphs. Random Struct. Algorithms 64(4): 878-898 (2024) - Michael Fuchs, Hexuan Liu, Tsan-Cheng Yu:
Limit theorems for patterns in ranked tree-child networks. Random Struct. Algorithms 64(1): 15-37 (2024) - Reza Gheissari, Alistair Sinclair:
Spatial mixing and the random-cluster dynamics on lattices. Random Struct. Algorithms 64(2): 490-534 (2024) - António Girão, Freddie Illingworth, Alex D. Scott, David R. Wood:
Defective coloring of hypergraphs. Random Struct. Algorithms 64(3): 663-675 (2024) - Bertille Granet, Felix Joos:
Random perfect matchings in regular graphs. Random Struct. Algorithms 64(1): 3-14 (2024) - Jie Han, Patrick Morris, Guanghui Wang, Donglei Yang:
A Ramsey-Turán theory for tilings in graphs. Random Struct. Algorithms 64(1): 94-124 (2024) - Svante Janson:
The number of descendants in a random directed acyclic graph. Random Struct. Algorithms 64(3): 768-803 (2024) - Tao Jiang, Shoham Letzter, Abhishek Methuku, Liana Yepremyan:
Rainbow subdivisions of cliques. Random Struct. Algorithms 64(3): 625-644 (2024) - Mohamed Slim Kammoun, Mylène Maïda:
Small cycle structure for words in conjugation invariant random permutations. Random Struct. Algorithms 64(4): 918-939 (2024) - Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman:
Greedy maximal independent sets via local limits. Random Struct. Algorithms 64(4): 986-1015 (2024) - Brett Leroux, Luis Rademacher:
Expansion of random 0/1 polytopes. Random Struct. Algorithms 64(2): 309-319 (2024) - Guanwu Liu, Jie Ma, Chunlei Zu:
Optimal bisections of directed graphs. Random Struct. Algorithms 64(1): 138-153 (2024) - Calum MacRury, Erlang Surya:
Sharp thresholds in adaptive random graph processes. Random Struct. Algorithms 64(3): 741-767 (2024) - Colin McDiarmid, Sophia Saller:
Random graphs embeddable in order-dependent surfaces. Random Struct. Algorithms 64(4): 940-985 (2024) - M. Moharrami, V. Subramanian, M. Liu, R. Sundaresan:
The Erlang weighted tree, a new branching process. Random Struct. Algorithms 64(3): 537-624 (2024) - Will Perkins, Changji Xu:
Frozen 1-RSB structure of the symmetric Ising perceptron. Random Struct. Algorithms 64(4): 856-877 (2024)
skipping 1,675 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-10-14 21:30 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