{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:59:30Z","timestamp":1725483570990},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_5","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:58:07Z","timestamp":1178197087000},"page":"10-11","source":"Crossref","is-referenced-by-count":1,"title":["Order in Pseudorandomness"],"prefix":"10.1007","author":[{"given":"Salil P.","family":"Vadhan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. Modern Cryptography, Probabilistic Proofs, and Pseudo-randomness. Number 17 in Algorithms and Combinatorics. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-662-12521-2"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Russell Impagliazzo, Ronen Shaltiel, and Avi Wigderson. Extractors and pseudo-random generators with optimal seed length. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pages 1\u201310, Portland, Oregan, 21\u201323 May 2000.","DOI":"10.1145\/335305.335306"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Noam Nisan. Extracting randomness: How and why: A survey. In Proceedings, Eleventh Annual IEEE Conference on Computational Complexity, pages 44\u201358, Philadelphia, Pennsylvania, 24\u201327 May 1996. IEEE Computer Society Press.","DOI":"10.1109\/CCC.1996.507667"},{"issue":"1","key":"5_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"Noam Nisan","year":"1996","unstructured":"Noam Nisan and David Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43\u201352, February 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ran Raz, Omer Reingold, and Salil Vadhan. Extracting all the randomness and reducing the error in Trevisan\u2019s extractors. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 149\u2013158, Atlanta, Georgia, 1\u20134 May 1999.","DOI":"10.1145\/301250.301292"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Omer Reingold, Ronen Shaltiel, and Avi Wigderson. Extracting randomness via repeated condensing. In 41st Annual Symposium on Foundations of Computer Science, pages 22\u201331, Redondo Beach, C A, 17\u201319 October 2000. IEEE.","DOI":"10.1109\/SFCS.2000.892008"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Omer Reingold, Salil Vadhan, and Avi Wigderson. Entropy waves, the zigzag graph product, and new constant-degree expanders and extractors. In 41st Annual Symposium on Foundations of Computer Science, pages 3\u201313, Redondo Beach, C A, 17\u201319 October 2000. IEEE.","DOI":"10.1109\/SFCS.2000.892006"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Amnon Ta-Shma, Christopher Umans, and David Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, Crete, Greece, 6\u20138 July 2001.","DOI":"10.1145\/380752.380790"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Amnon Ta-Shma and David Zuckerman. Extractor codes. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, Crete, Greece, 6\u20138 July 2001.","DOI":"10.1145\/380752.380800"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Amnon Ta-Shma, David Zuckerman, and Shmuel Safra. Extractors from Reed-Muller codes. Technical Report TR01-036, Electronic Colloquium on Computational Complexity, May 2001.","DOI":"10.1109\/SFCS.2001.959940"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Luca Trevisan. Construction of extractors using pseudo-random generators. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 141\u2013148, Atlanta, Georgia, 1\u20134 May 1999.","DOI":"10.1145\/301250.301289"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s004930050049","volume":"19","author":"A. Wigderson","year":"1999","unstructured":"Avi Wigderson and David Zuckerman. Expanders that beat the eigenvalue bound: explicit construction and applications. Combinatorica, 19(1):125\u2013138, 1999.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T13:26:30Z","timestamp":1556371590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}