Roy S. Rubinstein

According to our database, Roy S. Rubinstein authored at least 7 papers between 1988 and 1995.

Collaborative distances:

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

1995

Self-Modifying Finite Automata: An Introduction.

Roy S. Rubinstein, John N. Shutt

Inf. Process. Lett., 1995

Computer science projects with music.

Roy S. Rubinstein

Proceedings of the 26th SIGCSE Technical Symposium on Computer Science Education, 1995

1994

Self-Modifying Finite Automata.

Roy S. Rubinstein, John N. Shutt

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1992

Separating Complexity Classes With Tally Oracles.

Lane A. Hemachandra, Roy S. Rubinstein

Theor. Comput. Sci., 1992

1991

Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set.

Roy S. Rubinstein

SIAM J. Comput., 1991

1990

A Note on Relativizing Complexity Classes with Tally Oracles.

Lane A. Hemachandra, Roy S. Rubinstein

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1988

P-Printable Sets.

Eric Allender, Roy S. Rubinstein

SIAM J. Comput., 1988