| |
| 2004 | ||
|---|---|---|
| 2 | EE | Tim Boykett: Efficient exhaustive listings of reversible one dimensional cellular automata. Theor. Comput. Sci. 325(2): 215-247 (2004) |
| 2001 | ||
| 1 | EE | Tim Boykett: Construction of Ferrero Pairs of All Possible Orders. SIAM J. Discrete Math. 14(3): 283-285 (2001) |