Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid I. Bevan
Person information
- affiliation: University of Strathclyde, Department of Mathematics and Statistics, Glasgow, UK
- affiliation (former): GEC Hirst Research Centre, Wembley, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j16]David I. Bevan
:
Independence of permutation limits at infinitely many scales. J. Comb. Theory, Ser. A 186: 105557 (2022)- 2020
- [j15]Jean-Luc Baril, David I. Bevan, Sergey Kirgizov:
Bijections between Directed Animals, Multisets and Grand-Dyck Paths. Electron. J. Comb. 27(2): 2 (2020) - [j14]David I. Bevan, Robert Brignall, Andrew Elvey Price, Jay Pantone:
A structural characterisation of Av(1324) and new bounds on its growth rate. Eur. J. Comb. 88: 103115 (2020) - 2018
- [j13]David I. Bevan:
Intervals of Permutation Class Growth Rates. Comb. 38(2): 279-303 (2018) - [j12]David I. Bevan, Cheyne Homberger, Bridget Eileen Tenner:
Prolific permutations and permuted packings: Downsets containing many large patterns. J. Comb. Theory, Ser. A 153: 98-121 (2018) - 2017
- [j11]David I. Bevan, Grahame Erskine, Robert Lewis:
Large circulant graphs of fixed diameter and arbitrary degree. Ars Math. Contemp. 13(2): 275-291 (2017) - [j10]David I. Bevan:
Large butterfly Cayley graphs and digraphs. Discret. Math. 340(10): 2432-2436 (2017) - [j9]David I. Bevan, Robert Brignall, Andrew Elvey Price, Jay Pantone:
Staircases, dominoes, and the growth rate of 1324-avoiders. Electron. Notes Discret. Math. 61: 123-129 (2017) - 2016
- [j8]David I. Bevan:
The permutation classes Av(1234, 2341) and Av(1243, 2314). Australas. J Comb. 64: 3-20 (2016) - [j7]David I. Bevan:
The permutation class Av(4213, 2143). Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [j6]David I. Bevan, Derek Levin, Peter Nugent, Jay Pantone, Lara Pudwell, Manda Riehl, M. L. Tlachac:
Pattern avoidance in forests of binary shrubs. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - 2015
- [j5]David I. Bevan:
Permutations avoiding 1324 and patterns in Łukasiewicz paths. J. Lond. Math. Soc. 92(1): 105-122 (2015) - 2014
- [j4]David I. Bevan:
Growth Rates of Geometric Grid Classes of Permutations. Electron. J. Comb. 21(4): 4 (2014) - 2006
- [j3]David I. Bevan:
Sets of Points Determining Only Acute Angles and Some Related Colouring Problems. Electron. J. Comb. 13(1) (2006) - 1989
- [j2]David I. Bevan, Geoffrey Livingston Burn, R. J. Karia, J. D. Robson:
Principles For the Design of a Distributed Memory Architecture for Parallel Graph Reduction. Comput. J. 32(5): 461-469 (1989) - [j1]David I. Bevan:
An efficient reference counting solution to the distributed garbage collection problem. Parallel Comput. 9(2): 179-192 (1989)
Conference and Workshop Papers
- 1987
- [c2]David I. Bevan:
Distributed Garbage Collection Using Reference Counting. PARLE (2) 1987: 176-187 - [c1]David I. Bevan, Geoffrey Livingston Burn, R. J. Karia:
Overview of a Parallel Reduction Machine Project. PARLE (1) 1987: 394-413
Informal and Other Publications
- 2023
- [i2]David I. Bevan, Miklós Bóna, István Miklós:
Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121). Dagstuhl Reports 13(3): 49-73 (2023) - 2018
- [i1]Michael Albert, David I. Bevan, Miklós Bóna, István Miklós:
Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451). Dagstuhl Reports 8(11): 1-20 (2018)
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-04-25 02:48 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:
