{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:33:01Z","timestamp":1767007981650},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7502,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1016\/0304-3975(93)90258-u","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:31:49Z","timestamp":1027639909000},"page":"135-144","source":"Crossref","is-referenced-by-count":22,"title":["On read once vs. multiple access to randomness in logspace"],"prefix":"10.1016","volume":"107","author":[{"given":"Noam","family":"Nisan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90258-U_BIB1","series-title":"Proc. 19th Ann. Symp. on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0304-3975(93)90258-U_BIB2","series-title":"Proc. 21st Ann. ACM Symp. on Theory of Computing","first-page":"1","article-title":"Multiparty protocols and logspace-hard pseudorandom sequences","author":"Babai","year":"1989"},{"key":"10.1016\/0304-3975(93)90258-U_BIB3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle, a, pa \u2260 co \u2212 npa with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90258-U_BIB4","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1137\/0218038","article-title":"Two applications of inductive counting for complementation problems","volume":"18","author":"Borodin","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90258-U_BIB5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0019-9958(83)80060-6","article-title":"Parallel computation for well-endowed rings and space-bounded probabilistic machines","volume":"58","author":"Borodin","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90258-U_BIB6","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90258-U_BIB7","series-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science","first-page":"348","article-title":"On similarity and duality of computation","author":"Hong","year":"1980"},{"key":"10.1016\/0304-3975(93)90258-U_BIB8","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comp."},{"key":"10.1016\/0304-3975(93)90258-U_BIB9","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0019-9958(85)80032-2","article-title":"There is no polynomial deterministic space simulation of probabilistic space with two-way random-tape generator","volume":"67","author":"Karpinski","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90258-U_BIB10","series-title":"Proc. 22nd Ann. ACM Symp. on Theory of Computing","first-page":"204","article-title":"Pseudorandom generators for space-bounded computation","author":"Nisan","year":"1990"},{"key":"10.1016\/0304-3975(93)90258-U_BIB11","series-title":"Proc. 29th Ann. Symp. on Foundations of Computer Science","first-page":"2","article-title":"Hardness vs. randomness","author":"Nisan","year":"1988"},{"key":"10.1016\/0304-3975(93)90258-U_BIB12","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0022-0000(84)90066-7","article-title":"Space-bounded hierarchies and probabilistic computation","volume":"28","author":"Ruzzo","year":"1984","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390258U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390258U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:51:41Z","timestamp":1555141901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390258U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["030439759390258U"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90258-u","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}