{"id":"https://openalex.org/W2084567084","doi":"https://doi.org/10.1145/1132516.1132589","title":"Extractors for a constant number of polynomially small min-entropy independent sources","display_name":"Extractors for a constant number of polynomially small min-entropy independent sources","publication_year":2006,"publication_date":"2006-05-21","ids":{"openalex":"https://openalex.org/W2084567084","doi":"https://doi.org/10.1145/1132516.1132589","mag":"2084567084"},"language":"en","primary_location":{"id":"doi:10.1145/1132516.1132589","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132589","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM 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/A5035012558","display_name":"Anup Rao","orcid":"https://orcid.org/0000-0002-6449-9547"},"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":true,"raw_author_name":"Anup Rao","raw_affiliation_strings":["University of Texas at Austin","University of Texas at Austin#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035012558"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":8.1314,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.97342632,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"497","last_page":"506"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9941999912261963,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9941999912261963,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.989300012588501,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/disperser","display_name":"Disperser","score":0.8858992457389832},{"id":"https://openalex.org/keywords/extractor","display_name":"Extractor","score":0.7292104959487915},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.7039662003517151},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6804041266441345},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.6255109310150146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5896291136741638},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5274603366851807},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4476909041404724},{"id":"https://openalex.org/keywords/pseudorandomness","display_name":"Pseudorandomness","score":0.4401167333126068},{"id":"https://openalex.org/keywords/coin-flipping","display_name":"Coin flipping","score":0.4356820583343506},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42364779114723206},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4177038073539734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.308777779340744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28080934286117554},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.2444366216659546},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17456743121147156},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10508275032043457},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07951509952545166}],"concepts":[{"id":"https://openalex.org/C2775964210","wikidata":"https://www.wikidata.org/wiki/Q5282575","display_name":"Disperser","level":2,"score":0.8858992457389832},{"id":"https://openalex.org/C117978034","wikidata":"https://www.wikidata.org/wiki/Q5422192","display_name":"Extractor","level":2,"score":0.7292104959487915},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.7039662003517151},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6804041266441345},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.6255109310150146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5896291136741638},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5274603366851807},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4476909041404724},{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.4401167333126068},{"id":"https://openalex.org/C97399411","wikidata":"https://www.wikidata.org/wiki/Q825367","display_name":"Coin flipping","level":2,"score":0.4356820583343506},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42364779114723206},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4177038073539734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.308777779340744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28080934286117554},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.2444366216659546},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17456743121147156},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10508275032043457},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07951509952545166},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1132516.1132589","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132589","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM 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":35,"referenced_works":["https://openalex.org/W202464134","https://openalex.org/W229023051","https://openalex.org/W349036774","https://openalex.org/W1627910468","https://openalex.org/W1797136128","https://openalex.org/W1967175855","https://openalex.org/W1976815826","https://openalex.org/W1976907131","https://openalex.org/W1977568210","https://openalex.org/W1978343783","https://openalex.org/W1990524943","https://openalex.org/W1992499648","https://openalex.org/W2049182037","https://openalex.org/W2064561122","https://openalex.org/W2069788171","https://openalex.org/W2099498229","https://openalex.org/W2102906040","https://openalex.org/W2110218640","https://openalex.org/W2114702110","https://openalex.org/W2119913278","https://openalex.org/W2120164218","https://openalex.org/W2135963330","https://openalex.org/W2143486311","https://openalex.org/W2148180254","https://openalex.org/W2151303208","https://openalex.org/W2153543917","https://openalex.org/W2156487206","https://openalex.org/W2157843680","https://openalex.org/W2158226503","https://openalex.org/W2162685042","https://openalex.org/W2165058514","https://openalex.org/W2611055803","https://openalex.org/W3037575845","https://openalex.org/W3138266838","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3018450952","https://openalex.org/W1998608784","https://openalex.org/W2392286329","https://openalex.org/W1988599890","https://openalex.org/W2035532007","https://openalex.org/W2099601775","https://openalex.org/W2574077284","https://openalex.org/W2080556744","https://openalex.org/W1540485574","https://openalex.org/W2022435843"],"abstract_inverted_index":{"We":[0,10,52,132],"consider":[1],"the":[2,90,125,138,151],"problem":[3,88],"of":[4,21,24,28,145,155,175,189,202],"randomness":[5],"extraction":[6],"from":[7,17,76,100],"independent":[8,22,59,70,118,200],"sources.":[9,71],"construct":[11],"an":[12,34],"extractor":[13,42,105,115,154],"that":[14,92,196],"can":[15],"extract":[16],"a":[18,54,65,108,113,187],"constant":[19,37,180],"number":[20,102],"sources":[23,61],"length":[25,168],"n,":[26],"each":[27],"which":[29,62],"have":[30],"min-entropy":[31,126,144],"n\u03b3":[32],"for":[33,86,116,142,178],"arbitrarily":[35],"small":[36,129,163],"\u03b3":[38,182],">":[39],"0.":[40],"Our":[41,72],"is":[43,127],"obtained":[44],"by":[45],"composing":[46],"seeded":[47],"extractors":[48],"in":[49,79,89],"simple":[50],"ways.":[51],"introduce":[53],"new":[55,114],"technique":[56],"to":[57,68,136,158],"condense":[58],"somewhere-random":[60],"looks":[63],"like":[64],"useful":[66],"way":[67],"manipulate":[69],"techniques":[73],"are":[74],"different":[75],"those":[77],"used":[78],"recent":[80],"work":[81],"[1,":[82],"2,":[83],"16,":[84],"5]":[85],"this":[87],"sense":[91],"they":[93],"do":[94],"not":[95],"rely":[96],"on":[97,193],"any":[98],"results":[99],"additive":[101],"theory.Using":[103],"Bourgain's":[104],"[5]":[106],"as":[107,128,130],"black":[109],"box,":[110],"we":[111],"obtain":[112],"2":[117,139],"block-sources":[119],"with":[120,161],"few":[121],"blocks,":[122],"even":[123],"when":[124],"polylog(n).":[131],"also":[133],"show":[134],"how":[135],"modify":[137],"source":[140,153],"disperser":[141],"linear":[143,166],"Barak":[146],"et":[147],"al.":[148],"[2]":[149],"and":[150,165,199],"3":[152],"Raz":[156],"[16]":[157],"get":[159],"dispersers/extractors":[160],"exponentially":[162],"error":[164],"output":[167],"where":[169],"previously":[170],"both":[171],"were":[172],"constant.In":[173],"terms":[174],"Ramsey":[176],"Hypergraphs,":[177],"every":[179],"1>":[181],">0":[183],"our":[184],"construction":[185],"gives":[186],"family":[188],"explicit":[190],"O(1/\u03b3)-uniform":[191],"hypergraphs":[192],"N":[194],"vertices":[195],"avoid":[197],"cliques":[198],"sets":[201],"size":[203],"2(log":[204],"N)\u03b3.":[205]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}