Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Nisan:1993:ROV, author = "N. Nisan", title = "On read-once vs. multiple access to randomness in logspace", journal = j-THEOR-COMP-SCI, volume = "107", number = "1", pages = "135--144", day = "04", month = jan, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:15:15 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity classes; computational complexity; logspace; multiple access; random coin; randomized logspace machines; randomized space-bounded computation; randomness; stochastic automata; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }