Tim Boykett

According to our database, Tim Boykett authored at least 13 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Permutation clones that preserve relations.

Tim Boykett

CoRR, 2024

2021

Notes on the maximality of reversible gate sets under borrow and ancilla closure.

Tim Boykett

Sci. Comput. Program., 2021

2020

Maximality of Reversible Gate Sets.

Tim Boykett

Proceedings of the Reversible Computation - 12th International Conference, 2020

2019

Closed Systems of Invertible Maps.

Tim Boykett

J. Multiple Valued Log. Soft Comput., 2019

2017

Finite generating sets for reversible gate sets under general conservation laws.

Tim Boykett, Jarkko Kari, Ville Salo

Theor. Comput. Sci., 2017

2016

Strongly Universal Reversible Gate Sets.

Tim Boykett, Jarkko Kari, Ville Salo

Proceedings of the Reversible Computation - 8th International Conference, 2016

2014

ℐ₂ radical in Automata nearrings.

Tim Boykett, Gerhard Wendt

Int. J. Found. Comput. Sci., 2014

J2 Radical in Automata Nearrings.

Tim Boykett, Gerhard Wendt

CoRR, 2014

2013

Rectangular groupoids and related structures.

Tim Boykett

Discret. Math., 2013

2008

Conservation Laws in Rectangular CA.

Tim Boykett, Jarkko Kari, Siamak Taati

J. Cell. Autom., 2008

2004

Efficient exhaustive listings of reversible one dimensional cellular automata.

Tim Boykett

Theor. Comput. Sci., 2004

2001

Construction of Ferrero Pairs of All Possible Orders.

Tim Boykett

SIAM J. Discret. Math., 2001

1997

Commuting Cellular Automata.

Cristopher Moore, Timothy Boykett

Complex Syst., 1997