{"id":"https://openalex.org/W2397754814","doi":"https://doi.org/10.1145/2897518.2897528","title":"Explicit two-source extractors and resilient functions","display_name":"Explicit two-source extractors and resilient functions","publication_year":2016,"publication_date":"2016-06-10","ids":{"openalex":"https://openalex.org/W2397754814","doi":"https://doi.org/10.1145/2897518.2897528","mag":"2397754814"},"language":"en","primary_location":{"id":"doi:10.1145/2897518.2897528","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2897518.2897528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045073799","display_name":"Eshan Chattopadhyay","orcid":"https://orcid.org/0000-0001-9140-3160"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]},{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eshan Chattopadhyay","raw_affiliation_strings":["University of Texas at Austin, USA","[Department of Computer Science, Cornell University, Ithaca, NY]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"[Department of Computer Science, Cornell University, Ithaca, NY]","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052332525","display_name":"David Zuckerman","orcid":"https://orcid.org/0000-0002-4749-3223"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Zuckerman","raw_affiliation_strings":["University of Texas at Austin, USA","Dept. of Computer Science, Univ. of Texas at Austin, Austin, TX#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Computer Science, Univ. of Texas at Austin, Austin, TX#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1028,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.92473724,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"189","issue":"3","first_page":"670","last_page":"683"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/extractor","display_name":"Extractor","score":0.7953770160675049},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.7206449508666992},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6439710855484009},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6385258436203003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5988687872886658},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5132927298545837},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4665059447288513},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.43818995356559753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3109428286552429}],"concepts":[{"id":"https://openalex.org/C117978034","wikidata":"https://www.wikidata.org/wiki/Q5422192","display_name":"Extractor","level":2,"score":0.7953770160675049},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.7206449508666992},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6439710855484009},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6385258436203003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5988687872886658},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5132927298545837},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4665059447288513},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.43818995356559753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3109428286552429},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C21880701","wikidata":"https://www.wikidata.org/wiki/Q2144042","display_name":"Process engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2897518.2897528","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2897518.2897528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"doi:10.4007/annals.2019.189.3.1","is_oa":false,"landing_page_url":"https://doi.org/10.4007/annals.2019.189.3.1","pdf_url":null,"source":{"id":"https://openalex.org/S45918994","display_name":"Annals of Mathematics","issn_l":"0003-486X","issn":["0003-486X","1939-8980"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316273","host_organization_name":"Princeton University","host_organization_lineage":["https://openalex.org/P4310316273"],"host_organization_lineage_names":["Princeton University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Mathematics","raw_type":"journal-article"},{"id":"mag:2397754814","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/report/2015/119","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W789266596","https://openalex.org/W1516938786","https://openalex.org/W1542433520","https://openalex.org/W1797136128","https://openalex.org/W1886850845","https://openalex.org/W1964153304","https://openalex.org/W1967175855","https://openalex.org/W1976815826","https://openalex.org/W1977568210","https://openalex.org/W1980688410","https://openalex.org/W1980985945","https://openalex.org/W1985442923","https://openalex.org/W1989129498","https://openalex.org/W1994423049","https://openalex.org/W1994659270","https://openalex.org/W1996712932","https://openalex.org/W2004578660","https://openalex.org/W2019121884","https://openalex.org/W2022435843","https://openalex.org/W2030052209","https://openalex.org/W2036447017","https://openalex.org/W2047541256","https://openalex.org/W2060474153","https://openalex.org/W2064197162","https://openalex.org/W2068196730","https://openalex.org/W2069354451","https://openalex.org/W2069788171","https://openalex.org/W2080556744","https://openalex.org/W2090418561","https://openalex.org/W2095594956","https://openalex.org/W2103749128","https://openalex.org/W2108240973","https://openalex.org/W2111393415","https://openalex.org/W2115000186","https://openalex.org/W2118635051","https://openalex.org/W2120164218","https://openalex.org/W2123702065","https://openalex.org/W2127367297","https://openalex.org/W2128726521","https://openalex.org/W2134254678","https://openalex.org/W2140805804","https://openalex.org/W2143460704","https://openalex.org/W2151303208","https://openalex.org/W2154781247","https://openalex.org/W2156238967","https://openalex.org/W2158226503","https://openalex.org/W2160212276","https://openalex.org/W2217040139","https://openalex.org/W2240280858","https://openalex.org/W2414609184","https://openalex.org/W2963473071","https://openalex.org/W3138266838","https://openalex.org/W6696942897","https://openalex.org/W6714022791","https://openalex.org/W6723629830","https://openalex.org/W6764581850"],"related_works":["https://openalex.org/W2945571052","https://openalex.org/W2158226503","https://openalex.org/W2151303208","https://openalex.org/W2140805804","https://openalex.org/W2090418561","https://openalex.org/W1976815826","https://openalex.org/W2160212276","https://openalex.org/W2060474153","https://openalex.org/W2143460704","https://openalex.org/W2084567084","https://openalex.org/W2963473071","https://openalex.org/W2134254678","https://openalex.org/W2128726521","https://openalex.org/W2127367297","https://openalex.org/W2108347494","https://openalex.org/W2068196730","https://openalex.org/W1487376352","https://openalex.org/W2949495340","https://openalex.org/W2133462158","https://openalex.org/W2414609184"],"abstract_inverted_index":{"We":[0],"explicitly":[1],"construct":[2],"an":[3,55,88,119,122,143,164],"extractor":[4,26,90,140],"for":[5,19,75,91],"two":[6],"independent":[7,165],"sources":[8,97],"on":[9,64,98],"n":[10,99],"bits,":[11,100],"each":[12,41],"with":[13],"min-entropy":[14,45],"at":[15],"least":[16],"$\\mathrm{log}^C":[17],"n$":[18],"a":[20,59,92,147],"large":[21],"enough":[22],"constant":[23],"$C$.":[24],"Our":[25,137],"outputs":[27],"one":[28],"bit":[29],"and":[30,111,162],"has":[31],"error":[32],"$n^{-\\Omega(1)}$.":[33],"The":[34,129],"best":[35,130],"previous":[36,131],"extractor,":[37],"by":[38,118,133,158,167],"Bourgain,":[39],"required":[40],"source":[42],"to":[43,70],"have":[44],"$.499n$.":[46],"M":[47],"A":[48],"key":[49],"ingredient":[50],"in":[51,84],"our":[52,80],"construction":[53,57,81,145],"is":[54,68,82],"explicit":[56,89,138,144],"of":[58,72,94,125,146],"monotone,":[60],"almost-balanced":[61],"Boolean":[62],"function":[63,124],"$n$":[65],"bits":[66,105,115],"that":[67,85],"resilient":[69],"coalitions":[71],"size":[73],"$n^{1-\\delta}$":[74],"any":[76],"$\\delta>0$.":[77],"In":[78],"fact,":[79],"stronger":[83],"it":[86],"gives":[87],"generalization":[93],"non-oblivious":[95],"bit-fixing":[96],"where":[101],"some":[102],"unknown":[103],"$n-q$":[104,127],"are":[106,116],"chosen":[107,117],"almost":[108],"$\\mathrm{polylog}(n)$-wise":[109],"independently,":[110],"the":[112,126],"remaining":[113],"$q=n^{1-\\delta}$":[114],"adversary":[120],"as":[121],"arbitrary":[123],"bits.":[128],"construction,":[132],"Viola,":[134],"achieved":[135],"$q=n^{1/2-\\delta}$.":[136],"two-source":[139],"directly":[141],"implies":[142],"$2^{(\\mathrm{log}\\":[148],"\\mathrm{log}\\":[149],"N)^{O(1)}}$-Ramsey":[150],"graph":[151],"over":[152],"$N$":[153],"vertices,":[154],"improving":[155],"bounds":[156],"obtained":[157],"Barak":[159],"et":[160],"al.":[161],"matching":[163],"work":[166],"Cohen.":[168]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}