{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T14:40:06Z","timestamp":1736520006871,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_9","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"84-95","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Extractors for Independent-Symbol Sources"],"prefix":"10.1007","author":[{"given":"Chia-Jung","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Jen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Chun","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Goldreich, O.: Simple constructions of almost k-wise independent random variables. In: FOCS 1990, pp. 544\u2013553 (1990)","DOI":"10.1109\/FSCS.1990.89575"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms\u00a07(4), 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: FOCS 2004, pp. 384\u2013393 (2004)","DOI":"10.1109\/FOCS.2004.29"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating Independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In: STOC 2005, pp. 1\u201310 (2005)","DOI":"10.1145\/1060590.1060592"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793042105000108","volume":"1","author":"J. Bourgain","year":"2005","unstructured":"Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory\u00a01(1), 1\u201332 (2005)","journal-title":"International Journal of Number Theory"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput.\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM J. Comput."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., H\u00e5stad, J., Friedman, J., Rudich, S., Smolensky, R.: The bit extraction problem of t-resilient functions. In: FOCS 1985, pp. 396\u2013407 (1985)","DOI":"10.1109\/SFCS.1985.55"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-27821-4_30","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Y. Dodis","year":"2004","unstructured":"Dodis, Y., Elbaz, A., Oliveira, R., Raz, R.: Improved randomness extraction from two independent sources. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 334\u2013344. Springer, Heidelberg (2004)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Gabizon, A., Raz, R., Shaltiel, R.: Deterministic extractors for bit-fixing sources by obtaining an independent seed. FOCS 2004, 394\u2013403 (2004)","DOI":"10.1109\/FOCS.2004.21"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Shaltiel, R., Wigderson, A.: Extractors and pseudo-random generators with optimal seed length. In: STOC 2000, pp. 1\u201310 (2000)","DOI":"10.1145\/335305.335306"},{"key":"9_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics. Springer, Heidelberg (2001)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Kamp, J., Rao, A., Vahan, S., Zuckerman, D.: Deterministic extractors for small-space sources. In: STOC 2006 (2006)","DOI":"10.1145\/1132516.1132613"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In: FOCS 2003, pp. 92\u2013101 (2003)","DOI":"10.1109\/SFCS.2003.1238184"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, R., Maurer, U.: Generalized strong extractors and deterministic privacy amplification. In: Proc. Cryptography and Coding, pp. 322\u2013339 (2005)","DOI":"10.1007\/11586821_22"},{"issue":"6","key":"9_CR15","doi-asserted-by":"publisher","first-page":"2224","DOI":"10.1109\/TIT.2005.847746","volume":"51","author":"C.-J. Lee","year":"2005","unstructured":"Lee, C.-J., Lu, C.-J., Tsai, S.-C., Tzeng, W.-G.: Extracting randomness from multiple independent sources. IEEE Transactions on Information Theory\u00a051(6), 2224\u20132227 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-003-0217-1","volume":"17","author":"C.-J. Lu","year":"2004","unstructured":"Lu, C.-J.: Encryption against storage-bounded adversaries from on-line strong extractors. J. Cryptology\u00a017(1), 27\u201342 (2004)","journal-title":"J. Cryptology"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Lu, C.-J., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: Optimal up to constant factors. In: STOC 2003, pp. 602\u2013611 (2003)","DOI":"10.1145\/780627.780630"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput.\u00a022(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1006\/jcss.1997.1546","volume":"58","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ta-Shma, A.: Extracting randomness: A survey and new constructions. J. Comput. Syst. Sci.\u00a058(1), 148\u2013173 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci.\u00a052(1), 43\u201352 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: STOC 2005, pp. 11\u201320 (2005)","DOI":"10.1145\/1060590.1060593"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in Trevisan\u2019s extractors. In: STOC 1999, pp. 149\u2013158 (1999)","DOI":"10.1145\/301250.301292"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math.\u00a013(1), 2\u201324 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"9_CR24","unstructured":"Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. In: FOCS 2000, pp. 12\u201314 (2000)"},{"key":"9_CR25","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudo-random generator. In: FOCS 2001, pp. 648\u2013657 (2001)","DOI":"10.1109\/SFCS.2001.959941"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Umans, C., Zuckerman, D.: Loss-less condensers, unbalanced expanders, and extractors. In: STOC 2001, pp. 143\u2013152 (2001)","DOI":"10.1145\/380752.380790"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Zuckerman, D.: Extractor codes. STOC 2001, pp. 193\u2013199 (2001)","DOI":"10.1145\/380752.380800"},{"issue":"4","key":"9_CR29","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1145\/502090.502099","volume":"48","author":"L. Trevisan","year":"2001","unstructured":"Trevisan, L.: Extractors and pseudorandom generators. JACM\u00a048(4), 860\u2013879 (2001)","journal-title":"JACM"},{"issue":"1","key":"9_CR30","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00145-003-0237-x","volume":"17","author":"S. Vadhan","year":"2004","unstructured":"Vadhan, S.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Cryptology\u00a017(1), 43\u201377 (2004)","journal-title":"J. Cryptology"},{"issue":"1","key":"9_CR31","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s004930050049","volume":"19","author":"A. Wigderson","year":"1999","unstructured":"Wigderson, A., Zuckerman, D.: Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica\u00a019(1), 125\u2013138 (1999)","journal-title":"Combinatorica"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: General weak random sources. In: FOCS 1990, pp. 534\u2013543 (1990)","DOI":"10.1109\/FSCS.1990.89574"},{"issue":"4\/5","key":"9_CR33","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01940870","volume":"16","author":"D. Zuckerman","year":"1996","unstructured":"Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica\u00a016(4\/5), 367\u2013391 (1996)","journal-title":"Algorithmica"},{"key":"9_CR34","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<345::AID-RSA4>3.0.CO;2-Z","volume":"11","author":"D. Zuckerman","year":"1997","unstructured":"Zuckerman, D.: Randomness-optimal oblivious sampling. Random Structures and Algorithms\u00a011, 345\u2013367 (1997)","journal-title":"Random Structures and Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T16:15:18Z","timestamp":1736439318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11786986_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}