{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:30:10Z","timestamp":1725507010312},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_57","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T08:38:35Z","timestamp":1207211915000},"page":"664-675","source":"Crossref","is-referenced-by-count":0,"title":["Simpler Constant-Seed Condensers"],"prefix":"10.1007","author":[{"given":"Domingos","family":"Dellamonica","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Umans, C., Zuckerman, D.: Loss-less condensers, unbalanced expanders, and extractors. In: STOC: ACM Symposium on Theory of Computing (STOC) (2001)","DOI":"10.1145\/380752.380790"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: Electronic Colloquium on Computational Complexity (ECCC), vol.\u00a04(099) (2004)","DOI":"10.1145\/1060590.1060593"},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1060590.1060592","volume-title":"STOC 2005: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","author":"B. Barak","year":"2005","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: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pp. 1\u201310. ACM Press, New York (2005)"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Electronic Colloquium on Computational Complexity (ECCC) (2005)","DOI":"10.1145\/1132516.1132612"},{"issue":"5","key":"57_CR5","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1137\/S0097539703431032","volume":"35","author":"O. Reingold","year":"2006","unstructured":"Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. SIAM J. Comput.\u00a035(5), 1185\u20131209 (2006)","journal-title":"SIAM J. Comput."},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Umans, C.: Better lossless condensers through derandomized curve samplers (2006)","DOI":"10.1109\/FOCS.2006.18"},{"key":"57_CR7","unstructured":"Guruswami, V., Umans, C., Vadhan, S.: Extractors and condensers from univariate polynomials. In: Electronic Colloquium on Computational Complexity (ECCC), vol.\u00a06(134) (2006)"},{"key":"57_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00039-004-0451-1","volume":"14","author":"J. Bourgain","year":"2004","unstructured":"Bourgain, J., Katz, N., Tao, T.: A sum-product estimate in finite fields, and applications. Geometric And Functional Analysis\u00a014, 27\u201357 (2004)","journal-title":"Geometric And Functional Analysis"},{"key":"57_CR9","unstructured":"Hart, D., Iosevich, A., Solymosi, J.: Sum-product estimates in finite fields (2006)"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Vu, V.: Sum-product estimates via directed expanders (2007)","DOI":"10.4310\/MRL.2008.v15.n2.a14"},{"key":"57_CR11","unstructured":"Zuckerman: General weak random sources. In: FOCS: IEEE Symposium on Foundations of Computer Science (FOCS) (1990)"},{"key":"57_CR12","doi-asserted-by":"crossref","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: FOCS, pp. 384\u2013393 (2004)","DOI":"10.1109\/FOCS.2004.29"},{"key":"57_CR13","first-page":"323","volume":"258","author":"I. Ruzsa","year":"1999","unstructured":"Ruzsa, I.: An analog of Freiman\u2019s theorem in groups, Structure theory of set adition. Ast\u00e9risque\u00a0258, 323\u2013326 (1999)","journal-title":"Ast\u00e9risque"},{"key":"57_CR14","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3845-2","volume-title":"Additive Number Theory: Inverse Problems and the Geometry of Sumsets","author":"M.B. Nathanson","year":"1996","unstructured":"Nathanson, M.B.: Additive Number Theory: Inverse Problems and the Geometry of Sumsets. Graduate Texts in Mathematics, vol.\u00a0165. Springer, New York (1996)"},{"issue":"3","key":"57_CR15","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s000390050065","volume":"8","author":"W.T. Gowers","year":"1998","unstructured":"Gowers, W.T.: A new proof of Szemer\u00e9di\u2019s theorem for arithmetic progressions of length four. Geom. Funct. Anal.\u00a08(3), 529\u2013551 (1998)","journal-title":"Geom. Funct. Anal."},{"key":"57_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1215\/S0012-7094-04-12915-X","volume":"129","author":"B. Sudakov","year":"2005","unstructured":"Sudakov, B., Szemer\u00e9di, E., Vu, V.H.: On a question of Erd\u0151s and Moser. Duke Math. J.\u00a0129, 129\u2013155 (2005)","journal-title":"Duke Math. J."},{"key":"57_CR17","unstructured":"Konyagin, S.V.: A sum-product estimate in fields of prime order (2003)"},{"key":"57_CR18","unstructured":"Dvir, Z., Raz, R.: Analyzing linear mergers. In: Electronic Colloquium on Computational Complexity (ECCC) (2005)"},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Tao, T., Vu, V.H.: Additive Combinatorics. In: Cambridge Studies in Advanced Mathematics (2006)","DOI":"10.1017\/CBO9780511755149"},{"key":"57_CR20","unstructured":"Garaev, M.Z.: An explicit sum-product estimate in $\\mathbb{F}_p$ . In: ArXiv Mathematics e-prints (February 2007)"},{"key":"57_CR21","unstructured":"Hawk Katz, N., Shen, C.Y.: Garaev\u2019s Inequality in finite fields not of prime order. In: ArXiv Mathematics e-prints (March 2007)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T12:03:55Z","timestamp":1684325035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_57","relation":{},"subject":[]}}