{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T08:00:48Z","timestamp":1781078448902,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T00:00:00Z","timestamp":1466294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897528","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:04:07Z","timestamp":1465563847000},"page":"670-683","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Explicit two-source extractors and resilient functions"],"prefix":"10.1145","author":[{"given":"Eshan","family":"Chattopadhyay","sequence":"first","affiliation":[{"name":"University of Texas at Austin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Zuckerman","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01303199"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009824"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00359-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222030"},{"key":"e_1_3_2_1_5_1","volume-title":"The Probabilistic Method","author":"Alon N.","year":"1992","unstructured":"N. Alon and J. Spencer . The Probabilistic Method . John Wiley , 1992 . N. Alon and J. Spencer. The Probabilistic Method. John Wiley, 1992."},{"key":"e_1_3_2_1_6_1","volume-title":"Citeseer","author":"Barak B.","year":"2006","unstructured":"B. Barak . A Simple Explicit Construction of an n \u02dc O(log n) -Ramsey Graph. Technical report , Citeseer , 2006 . B. Barak. A Simple Explicit Construction of an n \u02dc O(log n) -Ramsey Graph. Technical report, Citeseer, 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102148"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447141"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734213.1734214"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2012.176.3.3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.15"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0409004"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90022-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793042105000108"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754401"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897547"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897643"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217015"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.55"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.57"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897530"},{"key":"e_1_3_2_1_22_1","volume-title":"Fault-tolerant leader election and collective coin-flipping in the full information model","author":"Dodis Y.","year":"2006","unstructured":"Y. Dodis . Fault-tolerant leader election and collective coin-flipping in the full information model , 2006 . Y. Dodis. Fault-tolerant leader election and collective coin-flipping in the full information model, 2006."},{"key":"e_1_3_2_1_23_1","first-page":"263","volume-title":"RANDOM","author":"Dodis Y.","year":"2003","unstructured":"Y. Dodis and R. Oliveira . On extracting private randomness over a public channel . In RANDOM , pages 252\u2013 263 , 2003 . Y. Dodis and R. Oliveira. On extracting private randomness over a public channel. In RANDOM, pages 252\u2013263, 2003."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536496"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.40"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796481"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579457"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447049"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_22"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-2367-1"},{"key":"e_1_3_2_1_31_1","first-page":"7","article-title":"Low rank co-diagonal matrices and Ramsey graphs","author":"Grolmusz V.","year":"2000","unstructured":"V. Grolmusz . Low rank co-diagonal matrices and Ramsey graphs . Electr. J. Comb. , 7 , 2000 . V. Grolmusz. Low rank co-diagonal matrices and Ramsey graphs. Electr. J. Comb., 7, 2000.","journal-title":"Electr. J. Comb."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"issue":"2","key":"e_1_3_2_1_33_1","first-page":"221","article-title":"Poisson approximation for large deviations. Random Structures &","volume":"1","author":"Janson S.","year":"1990","unstructured":"S. Janson . Poisson approximation for large deviations. Random Structures & Algorithms , 1 ( 2 ): 221 \u2013 229 , 1990 . S. Janson. Poisson approximation for large deviations. Random Structures & Algorithms, 1(2):221\u2013229, 1990.","journal-title":"Algorithms"},{"key":"e_1_3_2_1_34_1","volume-title":"The Intel random number generator","author":"Jun B.","year":"1999","unstructured":"B. Jun and P. Kocher . The Intel random number generator . Cryptography Research Inc . white paper, 1999 . B. Jun and P. Kocher. The Intel random number generator. Cryptography Research Inc. white paper, 1999."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21923"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1747597.1748077"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.73"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446846"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.26"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214052"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.26"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.19"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488708"},{"key":"e_1_3_2_1_44_1","volume-title":"ECCC","author":"Li X.","year":"2015","unstructured":"X. Li . Extractors for affine sources with polylogarithmic entropy. Technical Report TR15-121 , ECCC , 2015 . X. Li. Extractors for affine sources with polylogarithmic entropy. Technical Report TR15-121, ECCC, 2015."},{"key":"e_1_3_2_1_45_1","volume-title":"ECCC","author":"Li X.","year":"2015","unstructured":"X. Li . Improved constructions of two-source extractors . ECCC , 2015 . X. Li. Improved constructions of two-source extractors. ECCC, 2015."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.58"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780630"},{"key":"e_1_3_2_1_48_1","volume-title":"ECCC","author":"Meka R.","year":"2015","unstructured":"R. Meka . Explicit resilient functions matching Ajtai-Linial. Technical Report TR15-144 , ECCC , 2015 . R. Meka. Explicit resilient functions matching Ajtai-Linial. Technical Report TR15-144, ECCC, 2015."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0004"},{"key":"e_1_3_2_1_50_1","volume-title":"Pseudorandom sets and explicit constructions of Ramsey graphs","author":"Pudlak P.","year":"2004","unstructured":"P. Pudlak and V. Rodl . Pseudorandom sets and explicit constructions of Ramsey graphs , 2004 . P. Pudlak and V. Rodl. Pseudorandom sets and explicit constructions of Ramsey graphs, 2004."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/060671218"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.36"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_44"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060593"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1824"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376007"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1776"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402020"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90044-9"},{"key":"e_1_3_2_1_60_1","first-page":"67","article-title":"Recent developments in explicit constructions of extractors","volume":"77","author":"Shaltiel R.","year":"2002","unstructured":"R. Shaltiel . Recent developments in explicit constructions of extractors . Bulletin of the EATCS , 77 : 67 \u2013 95 , 2002 . R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the EATCS, 77:67\u201395, 2002.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_61_1","first-page":"174","article-title":"Tight bounds on the Fourier spectrum of AC 0","volume":"21","author":"Tal A.","year":"2014","unstructured":"A. Tal . Tight bounds on the Fourier spectrum of AC 0 . ECCC , 21 : 174 , 2014 . A. Tal. Tight bounds on the Fourier spectrum of AC 0. ECCC, 21:174, 2014.","journal-title":"ECCC"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502099"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085983X"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199712)11:4%3C345::AID-RSA4%3E3.0.CO;2-Z"}],"event":{"name":"STOC '16: Symposium on Theory of Computing","location":"Cambridge MA USA","acronym":"STOC '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897528","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:02Z","timestamp":1750221542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":64,"alternative-id":["10.1145\/2897518.2897528","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897528","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}