{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:57Z","timestamp":1775282337836,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540651420","type":"print"},{"value":"9783540495437","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_5","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:58:05Z","timestamp":1181185085000},"page":"47-59","source":"Crossref","is-referenced-by-count":6,"title":["On the Derandomization of Space-Bounded Computations"],"prefix":"10.1007","author":[{"given":"Roy","family":"Armoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Roy Armoni, Amnon Ta-Shma, Avi Wigderson, and Shiyu Zhou. SL \u2291 L 4\/3. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC), pages 230\u2013239, 1997.","DOI":"10.1145\/258533.258593"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF01275487","volume":"3","author":"M. Bellare","year":"1993","unstructured":"Mihir Bellare, Oded Goldreich, and Shafi Goldwasser. Randomness in interactive proofs. Computational Complexity, 3(4):319\u2013354, 1993.","journal-title":"Computational Complexity"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Russel Impagliazzo, Noam Nisan, and Avi Wigderson. Pseudorandomness for network algorithms. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC), pages 356\u2013364, Montreal, Qu\u00e9bec, Canada, May 1994.","DOI":"10.1145\/195058.195190"},{"issue":"4","key":"5_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01305237","volume":"12","author":"Noam Nisan","year":"1992","unstructured":"Noam Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449\u2013461, June 1992.","journal-title":"Combinatorica"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Noam Nisan and David Zuckerman. More deterministic simulation in logspace. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC), pages 235\u2013244, San Diego, CA, May 1993.","DOI":"10.1145\/167088.167162"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Michael Saks and Shiyu Zhou. RSPACE(S) \u228fDSPACE(S 3\/2 ). In 36th Annual Symposium on Foundations of Computer Science (FOCS), pages 344\u2013353, Milwaukee, Wisconsin, October 1995. To appear in JCSS.","DOI":"10.1109\/SFCS.1995.492490"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"David Zuckerman. Randomness-optimal sampling, extractors, and constructive leader election. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), pages 286\u2013295, Philadelphia, Pennsylvania, May 1996.","DOI":"10.1145\/237814.237878"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:20:14Z","timestamp":1737076814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}