Commuting Cellular Automata. - Cristopher Moore; Timothy Boykett (Complex Syst., 1997)

Construction of Ferrero Pairs of All Possible Orders. - Tim Boykett (SIAM J. Discret. Math., 2001)

Efficient exhaustive listings of reversible one dimensional cellular automata. - Tim Boykett (Theor. Comput. Sci., 2004)

Conservation Laws in Rectangular CA. - Tim Boykett; Jarkko Kari; Siamak Taati (J. Cell. Autom., 2008)

Rectangular groupoids and related structures. - Tim Boykett (Discret. Math., 2013)

J2 Radical in Automata Nearrings. - Tim Boykett; Gerhard Wendt (CoRR, 2014)

ℐ2 radical in Automata nearrings. - Tim Boykett; Gerhard Wendt (Int. J. Found. Comput. Sci., 2014)

Strongly Universal Reversible Gate Sets. - Tim Boykett; Jarkko Kari; Ville Salo (RC, 2016)

Finite generating sets for reversible gate sets under general conservation laws. - Tim Boykett; Jarkko Kari; Ville Salo (Theor. Comput. Sci., 2017)

Closed Systems of Invertible Maps. - Tim Boykett (J. Multiple Valued Log. Soft Comput., 2019)

Maximality of Reversible Gate Sets. - Tim Boykett (RC, 2020)

Notes on the maximality of reversible gate sets under borrow and ancilla closure. - Tim Boykett (Sci. Comput. Program., 2021)

Permutation clones that preserve relations. - Tim Boykett (CoRR, 2024)

Intersection Numbers of Certain 2-Designs from Finite Fields. - Tim Boykett; Po-Yi Huang; Wen-Fong Ke; Hubert Kiechle; Günter F. Pilz (Graphs Comb., 2025)