David I. Bevan

Orcid: 0000-0001-7179-2285

Affiliations:

University of Strathclyde, Department of Mathematics and Statistics, Glasgow, UK
GEC Hirst Research Centre, Wembley, UK (former)

According to our database¹, David I. Bevan authored at least 21 papers between 1987 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Thresholds for Patterns in Random Permutations with a Given Number of Inversions.

[BibT_eX]

[DOI]

David I. Bevan

Dan Threlfall

Electron. J. Comb., 2024

2023

Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121).

[BibT_eX]

[DOI]

David I. Bevan

Miklós Bóna

István Miklós

Dagstuhl Reports, March, 2023

2022

Independence of permutation limits at infinitely many scales.

[BibT_eX]

[DOI]

David I. Bevan

J. Comb. Theory A, 2022

2020

A structural characterisation of Av(1324) and new bounds on its growth rate.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Bijections between Directed Animals, Multisets and Grand-Dyck Paths.

[BibT_eX]

[DOI]

Jean-Luc Baril

David I. Bevan

Sergey Kirgizov

Electron. J. Comb., 2020

2018

Prolific permutations and permuted packings: Downsets containing many large patterns.

[BibT_eX]

[DOI]

David I. Bevan

Cheyne Homberger

Bridget Eileen Tenner

J. Comb. Theory A, 2018

Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

Intervals of Permutation Class Growth Rates.

[BibT_eX]

[DOI]

David I. Bevan

Comb., 2018

2017

Staircases, dominoes, and the growth rate of 1324-avoiders.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Large butterfly Cayley graphs and digraphs.

[BibT_eX]

[DOI]

David I. Bevan

Discret. Math., 2017

Large circulant graphs of fixed diameter and arbitrary degree.

[BibT_eX]

[DOI]

David I. Bevan

Grahame Erskine

Robert Lewis

Ars Math. Contemp., 2017

2016

Pattern avoidance in forests of binary shrubs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

The permutation class Av(4213, 2143).

[BibT_eX]

[DOI]

David I. Bevan

Discret. Math. Theor. Comput. Sci., 2016

The permutation classes Av(1234, 2341) and Av(1243, 2314).

[BibT_eX]

[DOI]

David I. Bevan

Australas. J Comb., 2016

2015

Permutations avoiding 1324 and patterns in Łukasiewicz paths.

[BibT_eX]

[DOI]

David I. Bevan

J. Lond. Math. Soc., 2015

2014

Growth Rates of Geometric Grid Classes of Permutations.

[BibT_eX]

[DOI]

David I. Bevan

Electron. J. Comb., 2014

2006

Sets of Points Determining Only Acute Angles and Some Related Colouring Problems.

[BibT_eX]

[DOI]

David I. Bevan

Electron. J. Comb., 2006

1989

An efficient reference counting solution to the distributed garbage collection problem.

[BibT_eX]

[DOI]

David I. Bevan

Parallel Comput., 1989

Principles For the Design of a Distributed Memory Architecture for Parallel Graph Reduction.

[BibT_eX]

[DOI]

David I. Bevan

Geoffrey Livingston Burn

R. J. Karia

J. D. Robson

Comput. J., 1989

1987

Overview of a Parallel Reduction Machine Project.

[BibT_eX]

[DOI]

David I. Bevan

Geoffrey Livingston Burn

R. J. Karia

Proceedings of the PARLE, 1987

Distributed Garbage Collection Using Reference Counting.

[BibT_eX]

[DOI]

David I. Bevan

Proceedings of the PARLE, 1987

David I. Bevan

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...