default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Griffiths
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Gonzalo Fiz Pontiveros, Simon Griffiths, Matheus Secco, Oriol Serra:
Deviation probabilities for arithmetic progressions and other regular discrete structures. Random Struct. Algorithms 60(3): 367-405 (2022)- 2020
- [j14]Paul A. Wilkinson, Alexandra M. Allen, Simon Tyrrell, Luzie U. Wingen
, Xingdong Bian, Mark O. Winfield, Amanda Burridge, Daniel S. Shaw, Jan Zaucha, Simon Griffiths, Robert P. Davey, Keith J. Edwards, Gary L. A. Barker:
CerealsDB - new tools for the analysis of the wheat genome: update 2020. Database J. Biol. Databases Curation 2020 (2020) - [j13]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)
2010 – 2019
- 2019
- [j12]Daniel Ahlberg, Simon Griffiths, Svante Janson, Robert Morris:
Competition in growth and urns. Random Struct. Algorithms 54(2): 211-227 (2019) - 2017
- [j11]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) - [j10]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
- [j9]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) - 2014
- [j8]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) - [c2]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
- [j7]Éric Balandraud, Benjamin Girard, Simon Griffiths, Yahya Ould Hamidoune:
Subset sums in abelian groups. Eur. J. Comb. 34(8): 1269-1286 (2013) - [j6]Simon Griffiths:
Quasi-Random Oriented Graphs. J. Graph Theory 74(2): 198-209 (2013) - [c1]Katherine Edwards, Simon Griffiths, William Sean Kennedy:
Partial Interval Set Cover - Trade-Offs between Scalability and Optimality. APPROX-RANDOM 2013: 110-125 - 2012
- [j5]Benjamin Girard, Simon Griffiths, Yahya Ould Hamidoune:
k-Sums in Abelian Groups. Comb. Probab. Comput. 21(4): 582-596 (2012) - [j4]Simon Griffiths:
(k+1)-Sums Versus k-Sums. Integers 12: A55 (2012) - 2011
- [j3]Omid Amini, Simon Griffiths, Florian Huc:
Subgraphs of Weakly Quasi-Random Oriented Graphs. SIAM J. Discret. Math. 25(1): 234-259 (2011)
2000 – 2009
- 2008
- [j2]Simon Griffiths:
The Erdös-Ginzberg-Ziv theorem with units. Discret. Math. 308(23): 5473-5484 (2008) - [j1]Omid Amini, Simon Griffiths, Florian Huc:
4-cycles in mixing digraphs. Electron. Notes Discret. Math. 30: 63-68 (2008)
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-10-07 22:21 CEST 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:
