| |
| 1995 | ||
|---|---|---|
| 7 | EE | Roy S. Rubinstein: Computer science projects with music. SIGCSE 1995: 287-291 |
| 6 | EE | Roy S. Rubinstein, John N. Shutt: Self-Modifying Finite Automata: An Introduction. Inf. Process. Lett. 56(4): 185-190 (1995) |
| 1994 | ||
| 5 | Roy S. Rubinstein, John N. Shutt: Self-Modifying Finite Automata. IFIP Congress (1) 1994: 493-498 | |
| 1992 | ||
| 4 | Lane A. Hemachandra, Roy S. Rubinstein: Separating Complexity Classes With Tally Oracles. Theor. Comput. Sci. 92(2): 309-318 (1992) | |
| 1991 | ||
| 3 | Roy S. Rubinstein: Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set. SIAM J. Comput. 20(6): 1021-1033 (1991) | |
| 1990 | ||
| 2 | Lane A. Hemachandra, Roy S. Rubinstein: A Note on Relativizing Complexity Classes with Tally Oracles. Structure in Complexity Theory Conference 1990: 287-294 | |
| 1988 | ||
| 1 | Eric Allender, Roy S. Rubinstein: P-Printable Sets. SIAM J. Comput. 17(6): 1193-1202 (1988) | |
| 1 | Eric Allender | [1] |
| 2 | Lane A. Hemaspaandra (Lane A. Hemachandra) | [2] [4] |
| 3 | John N. Shutt | [5] [6] |