{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:04:20Z","timestamp":1775282660147,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229343","type":"print"},{"value":"9783642229350","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_41","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T05:20:39Z","timestamp":1313126439000},"page":"483-494","source":"Crossref","is-referenced-by-count":5,"title":["Extractors and Lower Bounds for Locally Samplable Sources"],"prefix":"10.1007","author":[{"given":"Anindya","family":"De","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Watson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"41_CR1","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1137\/S0097539705447141","volume":"36","author":"B. Barak","year":"2006","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. SIAM Journal on Computing\u00a036(4), 1095\u20131118 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR2","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. Journal of the ACM\u00a057(4) (2010)","DOI":"10.1145\/1734213.1734214"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Rao, A., Shaltiel, R., Wigderson, A.: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 671\u2013680 (2006)","DOI":"10.1145\/1132516.1132611"},{"key":"41_CR4","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\u201332 (2005)","journal-title":"International Journal of Number Theory"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00039-007-0593-z","volume":"1","author":"J. Bourgain","year":"2007","unstructured":"Bourgain, J.: On the construction of affine-source extractors. Geometric and Functional Analysis\u00a01, 33\u201357 (2007)","journal-title":"Geometric and Functional Analysis"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Friedman, J., Goldreich, O., H\u00e5stad, J., Rudich, S., Smolensky, R.: The bit extraction problem or t-resilient functions. In: Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pp. 396\u2013407 (1985)","DOI":"10.1109\/SFCS.1985.55"},{"issue":"2","key":"41_CR7","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 Journal on Computing\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"DeVos, M., Gabizon, A.: Simple affine extractors using dimension expansion. In: Proceedings of the 25th IEEE Conference on Computational Complexity, pp. 50\u201357 (2010)","DOI":"10.1109\/CCC.2010.14"},{"key":"41_CR9","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":"41_CR10","doi-asserted-by":"crossref","unstructured":"Dvir, Z.: Extractors for varieties. In: Proceedings of the 24th IEEE Conference on Computational Complexity, pp. 102\u2013113 (2009)","DOI":"10.1109\/CCC.2009.7"},{"issue":"1","key":"41_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-009-0258-4","volume":"18","author":"Z. Dvir","year":"2009","unstructured":"Dvir, Z., Gabizon, A., Wigderson, A.: Extractors and rank extractors for polynomial sources. Computational Complexity\u00a018(1), 1\u201358 (2009)","journal-title":"Computational Complexity"},{"issue":"4","key":"41_CR12","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00493-008-2259-3","volume":"28","author":"A. Gabizon","year":"2008","unstructured":"Gabizon, A., Raz, R.: Deterministic extractors for affine sources over large fields. Combinatorica\u00a028(4), 415\u2013440 (2008)","journal-title":"Combinatorica"},{"issue":"4","key":"41_CR13","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1137\/S0097539705447049","volume":"36","author":"A. Gabizon","year":"2006","unstructured":"Gabizon, A., Raz, R., Shaltiel, R.: Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM Journal on Computing\u00a036(4), 1072\u20131094 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. Journal of the ACM\u00a056(4) (2009)","DOI":"10.1145\/1538902.1538904"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"H\u00e5stad., J.: Almost optimal lower bounds for small depth circuits. In: Proceedings of the 18th ACM Symposium on Theory of Computing, pp. 6\u201320 (1986)","DOI":"10.1145\/12130.12132"},{"issue":"1","key":"41_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.jcss.2010.06.014","volume":"77","author":"J. Kamp","year":"2011","unstructured":"Kamp, J., Rao, A., Vadhan, S., Zuckerman, D.: Deterministic extractors for small-space sources. Journal of Computer and System Sciences\u00a077(1), 191\u2013220 (2011)","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"41_CR17","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1137\/S0097539705446846","volume":"36","author":"J. Kamp","year":"2007","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM Journal on Computing\u00a036(5), 1231\u20131247 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved constructions of three source extractors. In: Proceedings of the 26th IEEE Conference on Computational Complexity, pp. 126\u2013136 (2011)","DOI":"10.1109\/CCC.2011.26"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Li, X.: A new approach to affine extractors and dispersers. In: Proceedings of the 26th IEEE Conference on Computational Complexity, pp. 137\u2013147 (2011)","DOI":"10.1109\/CCC.2011.27"},{"issue":"1","key":"41_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. Journal of Computer and System Sciences\u00a052(1), 43\u201352 (1996)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"41_CR21","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/060671218","volume":"39","author":"A. Rao","year":"2009","unstructured":"Rao, A.: Extractors for a constant number of polynomially small min-entropy independent sources. SIAM Journal on Computing\u00a039(1), 168\u2013194 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR22","doi-asserted-by":"crossref","unstructured":"Rao, A.: Extractors for low-weight affine sources. In: Proceedings of the 24th IEEE Conference on Computational Complexity, pp. 95\u2013101 (2009)","DOI":"10.1109\/CCC.2009.36"},{"key":"41_CR23","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 11\u201320 (2005)","DOI":"10.1145\/1060590.1060593"},{"key":"41_CR24","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 32\u201342 (2000)","DOI":"10.1109\/SFCS.2000.892063"},{"issue":"1","key":"41_CR25","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. Journal of Cryptology\u00a017(1), 43\u201377 (2004)","journal-title":"Journal of Cryptology"},{"key":"41_CR26","doi-asserted-by":"crossref","unstructured":"Viola, E.: The complexity of distributions. In: Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, pp. 202\u2013211 (2010)","DOI":"10.1109\/FOCS.2010.27"},{"key":"41_CR27","doi-asserted-by":"crossref","unstructured":"Viola, E.: Extractors for circuit sources. Technical Report TR11-056, Electronic Colloquium on Computational Complexity (2011)","DOI":"10.1109\/FOCS.2011.20"},{"key":"41_CR28","doi-asserted-by":"crossref","unstructured":"Yehudayoff, A.: Affine extractors over prime fields (2010) (manuscript)","DOI":"10.1007\/s00493-011-2604-9"}],"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\/978-3-642-22935-0_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T21:03:02Z","timestamp":1560459782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}