Every Binary (2m-2, 22m-2-m, 3) Code Can Be Lengthened to Form a Perfect Code of Length 2m-1. - Tim Blackmore (IEEE Trans. Inf. Theory, 1999)

Matrix-Product Codes over Fq. - Tim Blackmore; Graham H. Norton (Appl. Algebra Eng. Commun. Comput., 2001)

Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound. - Tim Blackmore; Graham H. Norton (SIAM J. Discret. Math., 2001)

On a family of Abelian codes and their state complexities. - Tim Blackmore; Graham H. Norton (IEEE Trans. Inf. Theory, 2001)

A comparison of three verification techniques: directed testing, pseudo-random testing and property checking. - Mike Bartley; Darren Galpin; Tim Blackmore (DAC, 2002)

Lower Bounds on the State Complexity of Geometric Goppa Codes. - Tim Blackmore; Graham H. Norton (Des. Codes Cryptogr., 2002)

Analysing and Closing Simulation Coverage by Automatic Generation and Verification of Formal Properties from Coverage Reports. - Tim Blackmore; David Halliwell; Philip Barker; Kerstin Eder; Naresh Ramaram (IFM, 2012)

Supervised Learning for Coverage-Directed Test Selection in Simulation-Based Verification. - Nyasha Masamba; Kerstin Eder; Tim Blackmore (AITest, 2022)

Hybrid Intelligent Testing in Simulation-Based Verification. - Nyasha Masamba; Kerstin Eder; Tim Blackmore (AITest, 2022)

Using Neural Networks for Novelty-based Test Selection to Accelerate Functional Coverage Closure. - Xuan Zheng; Kerstin Eder; Tim Blackmore (AITest, 2023)

Detecting Stimuli with Novel Temporal Patterns to Accelerate Functional Coverage Closure. - Xuan Zheng; Tim Blackmore; James Buckingham; Kerstin Eder (ITC-Asia, 2024)