Roy S. Rubinstein

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

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

Coauthor Index

1	Eric Allender	[j1]
2	Lane A. Hemaspaandra (Lane A. Hemachandra)	[j3] [c1]
3	John N. Shutt	[j4] [c2]

Last update Sun May 26 06:19:37 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page