Currently browsing: Items authored or edited by David Bevan

Barthold, Charles; Bevan, David and Corvellec, Hervé (2022). An ecofeminist position in critical practice: Challenging corporate truth in the Anthropocene. Gender, Work & Organization, 29(6) pp. 1796–1814.

• Download Published Version (PDF / 340kB)

Bevan, David; Brignall, Robert; Elvey Price, Andrew and Pantone, Jay (2020). A structural characterisation of Av(1324) and new bounds on its growth rate. European Journal of Combinatorics, 88, article no. 103115.

• Download Accepted Manuscript (PDF / 627kB)

Bevan, David; Levin, Derek; Nugent, Peter; Pantone, Jay; Pudwell, Lara; Riehl, Manda and Tlachac, ML (2016). Pattern avoidance in forests of binary shrubs. Discrete Mathematics and Theoretical Computer Science, 18(2), article no. 8.

• Download Published Version (PDF / 269kB)

Bevan, David (2016). The permutation classes Av(1234,2341) and Av(1243,2314). Australasian Journal of Combinatorics, 64(1) pp. 3–20.

• Download Published Version (PDF / 151kB)

Bevan, David (2015). Growth rates of permutation grid classes, tours on graphs, and the spectral radius. Transactions of the American Mathematical Society, 367(8) pp. 5863–5889.

• Download Accepted Manuscript (PDF / 489kB)

Bevan, David (2015). Permutations avoiding 1324 and patterns in Łukasiewicz paths. Journal of the London Mathematical Society, 92(1) pp. 105–122.

• Download Accepted Manuscript (PDF / 754kB)

Bevan, David Ian (2015). On The Growth Of Permutation Classes. PhD thesis The Open University.

• Download Final Version (PDF / 1MB)

Bevan, David (2014). Growth rates of geometric grid classes of permutations. Electronic Journal of Combinatorics, 21(4), article no. #P4.51.

• Download Published Version (PDF / 355kB)

Bevan, David (2006). Sets of points determining only acute angles and some related colouring problems. Electronic Journal of Combinatorics, 13(1) R12/1-R12/24.

• Download Published Version (PDF / 231kB)

Woods, W. A.; Bevan, P. J. and Bevan, D. I. (1991). Output and efficiency of the closed-cycle gas turbine. Proceedings of the Institution of Mechanical Engineers, Part A: Journal of Power and Energy, 205(1) pp. 59–66.

Bevan, David I. (1989). An efficient reference counting solution to the distributed garbage collection problem. Parallel Computing, 9(2) 179 - 192.

Bevan, D. I.; Burn, G. L.; Karia, R. J. and Robson, J. D. (1989). Principles for the design of a distributed memory architecture for parallel graph reduction. The Computer Journal, 32(5) pp. 461–469.

Bevan, D. I. (1987). Distributed garbage collection using reference counting. In: PARLE: Parallel Architectures and Languages Europe, 15-19 Jun 1987, Eindhoven, The Netherlands, Springer-Verlag, pp. 176–187.

Bevan, D. I.; Burn, G. L. and Karia, R. J. (1987). Overview of a parallel reduction machine project. In: PARLE Parallel Architectures and Languages Europe. Volume 1, Parallel Architectures, Eindhoven, The Netherlands, June 15-19, 1987; Proceedings (de Bakker, J. W.; Nijman, A. J. and Treleaven, P. C. eds.), Lecture Notes in Computer Science, Springer-Verlag, New York, pp. 394–413.