{"id":"https://openalex.org/W2625372793","doi":"https://doi.org/10.1145/3055399.3055429","title":"Towards optimal two-source extractors and Ramsey graphs","display_name":"Towards optimal two-source extractors and Ramsey graphs","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2625372793","doi":"https://doi.org/10.1145/3055399.3055429","mag":"2625372793"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055429","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","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/A5018113933","display_name":"Gil Cohen","orcid":"https://orcid.org/0000-0002-1173-0338"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gil Cohen","raw_affiliation_strings":["Princeton University, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018113933"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":1.3627,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.82618325,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1157","last_page":"1170"},"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.9986000061035156,"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.9986000061035156,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9908999800682068,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/extractor","display_name":"Extractor","score":0.8792036771774292},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6741769909858704},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6365863084793091},{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.5581699013710022},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5103828310966492},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5040003657341003},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4794865548610687},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4575996696949005},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35052213072776794},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08829206228256226}],"concepts":[{"id":"https://openalex.org/C117978034","wikidata":"https://www.wikidata.org/wiki/Q5422192","display_name":"Extractor","level":2,"score":0.8792036771774292},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6741769909858704},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6365863084793091},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.5581699013710022},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5103828310966492},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5040003657341003},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4794865548610687},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4575996696949005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35052213072776794},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08829206228256226},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3055399.3055429","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W45825654","https://openalex.org/W789266596","https://openalex.org/W1487872891","https://openalex.org/W1557415002","https://openalex.org/W1964153304","https://openalex.org/W1968711647","https://openalex.org/W1970282795","https://openalex.org/W1976815826","https://openalex.org/W1980688410","https://openalex.org/W1990285340","https://openalex.org/W1995766578","https://openalex.org/W2010905814","https://openalex.org/W2019807548","https://openalex.org/W2030052209","https://openalex.org/W2045472305","https://openalex.org/W2064197162","https://openalex.org/W2068196730","https://openalex.org/W2069367490","https://openalex.org/W2083992035","https://openalex.org/W2090418561","https://openalex.org/W2095689360","https://openalex.org/W2111393415","https://openalex.org/W2114137349","https://openalex.org/W2116926584","https://openalex.org/W2120164218","https://openalex.org/W2123702065","https://openalex.org/W2128726521","https://openalex.org/W2130140688","https://openalex.org/W2134254678","https://openalex.org/W2136698279","https://openalex.org/W2140805804","https://openalex.org/W2143460704","https://openalex.org/W2151303208","https://openalex.org/W2154781247","https://openalex.org/W2158226503","https://openalex.org/W2160212276","https://openalex.org/W2163137752","https://openalex.org/W2178550656","https://openalex.org/W2217040139","https://openalex.org/W2417650483","https://openalex.org/W2471375024","https://openalex.org/W2474003672","https://openalex.org/W2563438591","https://openalex.org/W2565116040","https://openalex.org/W2573341658","https://openalex.org/W2574582822","https://openalex.org/W2610183793","https://openalex.org/W2953099588","https://openalex.org/W2963473071","https://openalex.org/W2964292782","https://openalex.org/W4302311909","https://openalex.org/W6674035967"],"related_works":["https://openalex.org/W2963272825","https://openalex.org/W2036810061","https://openalex.org/W3082848404","https://openalex.org/W1979583797","https://openalex.org/W2149859310","https://openalex.org/W2891286913","https://openalex.org/W1966595665","https://openalex.org/W2582950667","https://openalex.org/W190077873","https://openalex.org/W4226451695"],"abstract_inverted_index":{"The":[0],"main":[1],"contribution":[2],"of":[3,9],"this":[4],"work":[5],"is":[6,29,46],"a":[7,10,56],"construction":[8],"two-source":[11,41,52],"extractor":[12,19,53],"for":[13,20,39,43,47],"quasi-logarithmic":[14],"min-entropy.":[15],"That":[16],"is,":[17],"an":[18],"two":[21],"independent":[22],"n-bit":[23],"sources":[24],"with":[25],"min-entropy":[26],"\u039f(logn),":[27],"which":[28],"optimal":[30],"up":[31],"to":[32],"the":[33],"poly(loglogn)":[34],"factor.":[35],"A":[36],"strong":[37],"motivation":[38],"constructing":[40],"extractors":[42],"low":[44],"entropy":[45],"Ramsey":[48],"graphs":[49],"constructions.":[50],"Our":[51],"readily":[54],"yields":[55],"(logn)(logloglogn)\u039f(1)-Ramsey":[57],"graph":[58],"on":[59],"n":[60],"vertices.":[61]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}