Distributed Garbage Collection Using Reference Counting. - David I. Bevan (PARLE (2), 1987)

Overview of a Parallel Reduction Machine Project. - David I. Bevan; Geoffrey Livingston Burn; R. J. Karia (PARLE (1), 1987)

Principles For the Design of a Distributed Memory Architecture for Parallel Graph Reduction. - David I. Bevan; Geoffrey Livingston Burn; R. J. Karia; J. D. Robson (Comput. J., 1989)

An efficient reference counting solution to the distributed garbage collection problem. - David I. Bevan (Parallel Comput., 1989)

Sets of Points Determining Only Acute Angles and Some Related Colouring Problems. - David I. Bevan (Electron. J. Comb., 2006)

Growth Rates of Geometric Grid Classes of Permutations. - David I. Bevan (Electron. J. Comb., 2014)

Permutations avoiding 1324 and patterns in Łukasiewicz paths. - David I. Bevan (J. Lond. Math. Soc., 2015)

The permutation classes Av(1234, 2341) and Av(1243, 2314). - David I. Bevan (Australas. J Comb., 2016)

The permutation class Av(4213, 2143). - David I. Bevan (Discret. Math. Theor. Comput. Sci., 2016)

Pattern avoidance in forests of binary shrubs. - David I. Bevan; Derek Levin; Peter Nugent; Jay Pantone; Lara Pudwell; Manda Riehl; M. L. Tlachac (Discret. Math. Theor. Comput. Sci., 2016)

Large circulant graphs of fixed diameter and arbitrary degree. - David I. Bevan; Grahame Erskine; Robert Lewis (Ars Math. Contemp., 2017)

Large butterfly Cayley graphs and digraphs. - David I. Bevan (Discret. Math., 2017)

Staircases, dominoes, and the growth rate of 1324-avoiders. - David I. Bevan; Robert Brignall; Andrew Elvey Price; Jay Pantone (Electron. Notes Discret. Math., 2017)

Intervals of Permutation Class Growth Rates. - David I. Bevan (Comb., 2018)

Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451). - Michael Albert 001; David I. Bevan; Miklós Bóna; István Miklós (Dagstuhl Reports, 2018)

Prolific permutations and permuted packings: Downsets containing many large patterns. - David I. Bevan; Cheyne Homberger; Bridget Eileen Tenner (J. Comb. Theory A, 2018)

Bijections between Directed Animals, Multisets and Grand-Dyck Paths. - Jean-Luc Baril; David I. Bevan; Sergey Kirgizov (Electron. J. Comb., 2020)

A structural characterisation of Av(1324) and new bounds on its growth rate. - David I. Bevan; Robert Brignall; Andrew Elvey Price; Jay Pantone (Eur. J. Comb., 2020)

Independence of permutation limits at infinitely many scales. - David I. Bevan (J. Comb. Theory A, 2022)

Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121). - David I. Bevan; Miklós Bóna; István Miklós (Dagstuhl Reports, 2023)

Thresholds for Patterns in Random Permutations with a Given Number of Inversions. - David I. Bevan; Dan Threlfall (Electron. J. Comb., 2024)

On the Evolution of Random Integer Compositions. - David I. Bevan; Dan Threlfall (Electron. J. Comb., 2025)

On naturally labelled posets and permutations avoiding 12-34. - David I. Bevan; Gi-Sang Cheon; Sergey Kitaev (Eur. J. Comb., 2025)