Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Morris 0001
Person information
- affiliation: IMPA, Rio de Janeiro, Brazil
- affiliation: The University of Memphis, TN, USA
Other persons with the same name
- Robert Morris — disambiguation page
- Rob L. Morris (aka: Robert Morris 0002) — SPAWAR Systems Center Pacific, San Diego, USA
- Robert Morris 0003 — De Montfort University, Leicester, UK
- Robert A. Morris 0001 (aka: Robert Morris 0004) — NASA Ames Research Center, Mountain View, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j27]Béla Bollobás, Simon Griffiths, Robert Morris, Leonardo T. Rolla
, Paul Smith:
Nucleation and growth in two dimensions. Random Struct. Algorithms 56(1): 63-96 (2020)- [j26]Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota:
Counting restricted orientations of random graphs. Random Struct. Algorithms 56(4): 1016-1030 (2020)
2010 – 2019
- 2019
- [j25]Daniel Ahlberg, Simon Griffiths, Svante Janson, Robert Morris:
Competition in growth and urns. Random Struct. Algorithms 54(2): 211-227 (2019) - 2018
- [j24]Paul Balister, Béla Bollobás, Imre Leader, Robert Morris:
Introduction. Comb. Probab. Comput. 27(4): 441 (2018) - 2017
- [j23]József Balogh, Neal Bushaw, Maurício Collares Neto, Hong Liu, Robert Morris, Maryam Sharifzadeh:
The typical structure of graphs with no large cliques. Comb. 37(4): 617-632 (2017) - [j22]Robert Morris:
Bootstrap percolation, and other automata. Eur. J. Comb. 66: 250-263 (2017) - [j21]Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota:
On the number of r-transitive orientations of G(n, p). Electron. Notes Discret. Math. 61: 255-261 (2017) - [j20]Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris:
Chromatic thresholds in dense random graphs. Random Struct. Algorithms 51(2): 185-214 (2017) - [j19]Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris:
Chromatic thresholds in sparse random graphs. Random Struct. Algorithms 51(2): 215-236 (2017) - 2016
- [j18]Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan:
On the Ramsey number of the triangle and the cube. Comb. 36(1): 71-89 (2016) - [j17]Ben Green, Robert Morris:
Counting sets with small sumset and applications. Comb. 36(2): 129-159 (2016) - [j16]Maurício Collares Neto, Robert Morris:
Maximum-size antichains in random set-systems. Random Struct. Algorithms 49(2): 308-321 (2016) - 2015
- [j15]Neal Bushaw, Maurício Collares Neto, Robert Morris, Paul Smith:
The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups. Comb. Probab. Comput. 24(4): 609-640 (2015) - 2014
- [j14]Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan:
The Ramsey number of the clique and the hypercube. J. Lond. Math. Soc. 89(3): 680-702 (2014) - [c1]Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Simon Griffiths, Robert Morris, Leonardo Sampaio Rocha, Ana Silva:
Connected Greedy Colourings. LATIN 2014: 433-441 - 2013
- [j13]Bryn Garrod, Robert Morris:
The secretary problem on an unknown poset. Random Struct. Algorithms 43(4): 429-451 (2013) - 2012
- [j12]József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan:
Linear algebra and bootstrap percolation. J. Comb. Theory, Ser. A 119(6): 1328-1335 (2012) - [j11]József Balogh, Béla Bollobás, Robert Morris:
Graph bootstrap percolation. Random Struct. Algorithms 41(4): 413-440 (2012) - 2011
- [j10]Noga Alon, József Balogh, Béla Bollobás, Robert Morris:
The structure of almost all graphs in a hereditary property. J. Comb. Theory, Ser. B 101(2): 85-110 (2011) - [j9]Béla Bollobás, Graham R. Brightwell, Robert Morris:
Shadows of ordered graphs. J. Comb. Theory, Ser. A 118(3): 729-747 (2011) - 2010
- [j8]József Balogh, Béla Bollobás, Robert Morris:
Bootstrap Percolation in High Dimensions. Comb. Probab. Comput. 19(5-6): 643-692 (2010)
2000 – 2009
- 2009
- [j7]József Balogh, Béla Bollobás, Robert Morris:
Majority Bootstrap Percolation on the Hypercube. Comb. Probab. Comput. 18(1-2): 17-51 (2009) - [j6]Henry Liu, Robert Morris, Noah Prince:
Highly connected monochromatic subgraphs of multicolored graphs. J. Graph Theory 61(1): 22-44 (2009) - 2008
- [j5]Henry Liu, Robert Morris, Noah Prince:
Highly connected multicoloured subgraphs of multicoloured graphs. Discret. Math. 308(22): 5096-5121 (2008) - 2007
- [j4]József Balogh, Béla Bollobás, Robert Morris:
Hereditary Properties of Tournaments. Electron. J. Comb. 14(1) (2007) - [j3]József Balogh, Béla Bollobás, Robert Morris:
Hereditary properties of combinatorial structures: Posets and oriented graphs. J. Graph Theory 56(4): 311-332 (2007) - 2006
- [j2]Robert Morris:
FC-families and improved bounds for Frankl's conjecture. Eur. J. Comb. 27(2): 269-282 (2006) - [j1]József Balogh, Béla Bollobás, Robert Morris:
Hereditary properties of partitions, ordered graphs and ordered hypergraphs. Eur. J. Comb. 27(8): 1263-1281 (2006)
Coauthor Index
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.
last updated on 2024-01-24 20:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
