{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:25:43Z","timestamp":1742973943854,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_28","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"343-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Zero-Fixing Extractors for Sub-Logarithmic Entropy"],"prefix":"10.1007","author":[{"given":"Gil","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Igor","family":"Shinkar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., Brassard,G., Robert, J.M.: How to reduce your enemys information. In: Advances in Cryptology (CRYPTO), vol. 218, pp. 468\u2013476. Springer (1985)","DOI":"10.1007\/3-540-39799-X_37"},{"issue":"4","key":"28_CR2","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 36(4), 1095\u20131118 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR3","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: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM (2005)","DOI":"10.1145\/1060590.1060592"},{"issue":"1","key":"28_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 1(1), 1\u201332 (2005)","journal-title":"International Journal of Number Theory"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00039-007-0593-z","volume":"17","author":"J Bourgain","year":"2007","unstructured":"Bourgain, J.: On the construction of affine extractors. GAFA Geometric And Functional Analysis 17(1), 33\u201357 (2007)","journal-title":"GAFA Geometric And Functional Analysis"},{"issue":"2","key":"28_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 Journal on Computing 17(2), 230\u2013261 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., H\u00e5stad, J., Freidmann, J., Rudich, S., Smolensky, R.: The bit extraction problem or t-resilient functions. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pp. 396\u2013407. IEEE (1985)","DOI":"10.1109\/SFCS.1985.55"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Chen, R., Kabanets, V., Kolokolova, A., Shaltiel, R., Zuckerman, D.: Mining circuit lower bound proofs for meta-algorithms. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 20, pp. 57 (2013)","DOI":"10.1109\/CCC.2014.34"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Dvir, Z., Kopparty, S., Saraf, S., Sudan, M.: Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 181\u2013190. IEEE (2009)","DOI":"10.1109\/FOCS.2009.40"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Friedman, J.: On the bit extraction problem. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 314\u2013319. IEEE (1992)","DOI":"10.1109\/SFCS.1992.267760"},{"issue":"4","key":"28_CR11","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 36(4), 1072\u20131094 (2006)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"28_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1538902.1538904","volume":"56","author":"V Guruswami","year":"2009","unstructured":"Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. Journal of the ACM 56(4), 20 (2009)","journal-title":"Journal of the ACM"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Komargodski, I., Raz, R., Tal, A.: Improved average-case lower bounds for DeMorgan formula size. In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 588\u2013597. IEEE (2013)","DOI":"10.1109\/FOCS.2013.69"},{"issue":"5","key":"28_CR14","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1137\/S0097539705446846","volume":"36","author":"J Kamp","year":"2006","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM Journal on Computing 36(5), 1231\u20131247 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved constructions of three source extractors. In: Proceedings of the 26th IEEE Annual Conference on Computational Complexity (CCC), pp. 126\u2013136. IEEE (2011)","DOI":"10.1109\/CCC.2011.26"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Li, X.: A new approach to affine extractors and dispersers. In: Proceedings of the 26th IEEE Annual Conference on Computational Complexity (CCC), pp. 137\u2013147. IEEE (2011)","DOI":"10.1109\/CCC.2011.27"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Li, X.: Extractors for a constant number of independent sources with polylogarithmic min-entropy. In: Proceedings of the 54th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 100\u2013109. IEEE (2013)","DOI":"10.1109\/FOCS.2013.19"},{"issue":"1","key":"28_CR18","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 52(1), 43\u201352 (1996)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"28_CR19","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 39(1), 168\u2013194 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Rao, A.: Extractors for low-weight affine sources. In: Proceedings of 24th Annual IEEE Conference on Computational Complexity, (CCC 2009), pp. 95\u2013101. IEEE (2009)","DOI":"10.1109\/CCC.2009.36"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 11\u201320. ACM (2005)","DOI":"10.1145\/1060590.1060593"},{"issue":"3","key":"28_CR22","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1002\/rsa.20424","volume":"42","author":"Y Reshef","year":"2013","unstructured":"Reshef, Y., Vadhan, S.: On extractors and exposure-resilient functions for sublogarithmic entropy. Random Structures & Algorithms 42(3), 386\u2013401 (2013)","journal-title":"Random Structures & Algorithms"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-22012-8_2","volume-title":"Automata, Languages and Programming","author":"R Shaltiel","year":"2011","unstructured":"Shaltiel, R.: An introduction to randomness extractors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 21\u201341. Springer, Heidelberg (2011)"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Vazirani, V.U.: Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp. 366\u2013378. ACM (1985)","DOI":"10.1145\/22145.22186"},{"issue":"2","key":"28_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00493-011-2604-9","volume":"31","author":"A Yehudayoff","year":"2011","unstructured":"Yehudayoff, A.: Affine extractors over prime fields. Combinatorica 31(2), 245\u2013256 (2011)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:23:53Z","timestamp":1674228233000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}