P-Printable Sets. - Eric Allender; Roy S. Rubinstein (SIAM J. Comput., 1988)

A Note on Relativizing Complexity Classes with Tally Oracles. - Lane A. Hemachandra; Roy S. Rubinstein (SCT, 1990)

Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set. - Roy S. Rubinstein (SIAM J. Comput., 1991)

Separating Complexity Classes With Tally Oracles. - Lane A. Hemachandra; Roy S. Rubinstein (Theor. Comput. Sci., 1992)

Self-Modifying Finite Automata. - Roy S. Rubinstein; John N. Shutt (IFIP Congress (1), 1994)

Computer science projects with music. - Roy S. Rubinstein (SIGCSE, 1995)

Self-Modifying Finite Automata: An Introduction. - Roy S. Rubinstein; John N. Shutt (Inf. Process. Lett., 1995)