{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:47:08Z","timestamp":1750308428624,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519963","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1584-1597","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Extractors for sum of two sources"],"prefix":"10.1145","author":[{"given":"Eshan","family":"Chattopadhyay","sequence":"first","affiliation":[{"name":"Cornell University, USA"}]},{"given":"Jyun-Jie","family":"Liao","sequence":"additional","affiliation":[{"name":"Cornell University, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00359-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365687"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Avraham Ben-Aroya Dean Doron and Amnon Ta-Shma. 2019. An efficient reduction from two-source to nonmalleable extractors: achieving near-logarithmic min-entropy. SIAM J. Comput. STOC17\u201331.  Avraham Ben-Aroya Dean Doron and Amnon Ta-Shma. 2019. An efficient reduction from two-source to nonmalleable extractors: achieving near-logarithmic min-entropy. SIAM J. Comput. STOC17\u201331.","DOI":"10.1137\/17M1133245"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406678.3406688"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00066"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00067"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1176622"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.25"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897643"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64381-2_21"},{"key":"e_1_3_2_1_11_1","volume-title":"Extractors for Sum of Two Sources. CoRR, abs\/2110.12652","author":"Chattopadhyay Eshan","year":"2021","unstructured":"Eshan Chattopadhyay and Jyun-Jie Liao . 2021. Extractors for Sum of Two Sources. CoRR, abs\/2110.12652 ( 2021 ), arXiv:2110.12652. arxiv:2110.12652 Eshan Chattopadhyay and Jyun-Jie Liao. 2021. Extractors for Sum of Two Sources. CoRR, abs\/2110.12652 (2021), arXiv:2110.12652. arxiv:2110.12652"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2016.7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2019.189.3.1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217015"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.55"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1029837"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.28"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2016.8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055429"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.27"},{"key":"e_1_3_2_1_21_1","volume-title":"A probabilistic technique for finding almost-periods of convolutions. Geometric and functional analysis, 20, 6","author":"Croot Ernie","year":"2010","unstructured":"Ernie Croot and Olof Sisask . 2010. A probabilistic technique for finding almost-periods of convolutions. Geometric and functional analysis, 20, 6 ( 2010 ), 1367\u20131396. Ernie Croot and Olof Sisask. 2010. A probabilistic technique for finding almost-periods of convolutions. Geometric and functional analysis, 20, 6 (2010), 1367\u20131396."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/100783704"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447049"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.014"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446846"},{"key":"e_1_3_2_1_28_1","first-page":"770","article-title":"On a certain arithmetic sum","volume":"199","author":"Karatsuba Anatolii Alekseevich","year":"1971","unstructured":"Anatolii Alekseevich Karatsuba . 1971 . On a certain arithmetic sum . In Doklady Akademii Nauk. 199 , 770 \u2013 772 . Anatolii Alekseevich Karatsuba. 1971. On a certain arithmetic sum. In Doklady Akademii Nauk. 199, 770\u2013772.","journal-title":"Doklady Akademii Nauk."},{"key":"e_1_3_2_1_29_1","first-page":"543","article-title":"Distribution of values of Dirichlet characters on additive sequences","volume":"319","author":"Karatsuba Anatolii Alekseevich","year":"1991","unstructured":"Anatolii Alekseevich Karatsuba . 1991 . Distribution of values of Dirichlet characters on additive sequences . In Doklady Akademii Nauk. 319 , 543 \u2013 545 . Anatolii Alekseevich Karatsuba. 1991. Distribution of values of Dirichlet characters on additive sequences. In Doklady Akademii Nauk. 319, 543\u2013545.","journal-title":"Doklady Akademii Nauk."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.19"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6_21"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.26"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055486"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2019.28"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780630"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052244"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.73"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0004"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.36"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.013"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.2140\/apde.2012.5.627"},{"key":"e_1_3_2_1_42_1","volume-title":"Vu","author":"Tao Terence","year":"2006","unstructured":"Terence Tao and Van H . Vu . 2006 . Additive combinatorics. 105, Cambridge University Press . Terence Tao and Van H. Vu. 2006. Additive combinatorics. 105, Cambridge University Press."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892063"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085983X"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/280032.280035"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"STOC '22"},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519963","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:38Z","timestamp":1750268978000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":45,"alternative-id":["10.1145\/3519935.3519963","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519963","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}