{"id":"https://openalex.org/W2109498389","doi":"https://doi.org/10.4086/toc.2010.v006a006","title":"","display_name":"","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2109498389","doi":"https://doi.org/10.4086/toc.2010.v006a006","mag":"2109498389"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2010.v006a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2010.v006a006","pdf_url":"https://theoryofcomputing.org/articles/v006a006/v006a006.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v006a006/v006a006.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029531416","display_name":"Navin Goyal","orcid":"https://orcid.org/0000-0002-8521-0108"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Navin Goyal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030610930","display_name":"Michael Saks","orcid":"https://orcid.org/0000-0003-1659-7190"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Saks","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.14020138,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"6","issue":"1","first_page":"113","last_page":"134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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/computer-science","display_name":"Computer science","score":0.6115561723709106},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5301376581192017},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5157806873321533},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4927211105823517},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46536019444465637},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42737245559692383},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40104278922080994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3390452265739441},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3309594392776489},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26851189136505127}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6115561723709106},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5301376581192017},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5157806873321533},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4927211105823517},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46536019444465637},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42737245559692383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40104278922080994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3390452265739441},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3309594392776489},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26851189136505127},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2010.v006a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2010.v006a006","pdf_url":"https://theoryofcomputing.org/articles/v006a006/v006a006.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2010.v006a006","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2010.v006a006","pdf_url":"https://theoryofcomputing.org/articles/v006a006/v006a006.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G3697502473","display_name":"Collaborative Research:  Understanding, Coping with, and Benefiting from, Intractability","funder_award_id":"0832787","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4639114463","display_name":null,"funder_award_id":"CCF-0832787","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6917361329","display_name":"Further Studies in Complexity and Algorithms","funder_award_id":"9988526","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6981514787","display_name":"Investigations in Concrete Complexity and Truthful Mechanism Design","funder_award_id":"0515201","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2109498389.pdf","grobid_xml":"https://content.openalex.org/works/W2109498389.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1836810876","https://openalex.org/W1963494112","https://openalex.org/W1994504402","https://openalex.org/W2023146810","https://openalex.org/W2033191517","https://openalex.org/W2035902142","https://openalex.org/W2038435918","https://openalex.org/W2071488636","https://openalex.org/W2072783164","https://openalex.org/W2087489294","https://openalex.org/W2089062581","https://openalex.org/W2128020755","https://openalex.org/W2144590858","https://openalex.org/W4238838679"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W4292947165","https://openalex.org/W3045121788","https://openalex.org/W3201655533","https://openalex.org/W3134442314","https://openalex.org/W3127082728","https://openalex.org/W2067936666"],"abstract_inverted_index":{"We":[0,35,47],"show":[1],"that":[2],"a":[3,24,50],"noisy":[4,58],"parallel":[5],"decision":[6],"tree":[7,60],"making":[8],"O(n)":[9],"queries":[10,44],"needs":[11],"(log":[12],"*":[13],"n)":[14],"rounds":[15],"to":[16],"compute":[17],"OR":[18],"of":[19,26,43],"n":[20],"bits.":[21],"This":[22],"answers":[23],"question":[25,52],"Newman":[27],"[IEEE":[28],"Conference":[29],"on":[30],"Computational":[31],"Complexity,":[32],"2004,":[33],"113-124].":[34],"prove":[36],"more":[37],"general":[38],"tradeoffs":[39],"between":[40],"the":[41,57,69],"number":[42],"and":[45],"rounds.":[46],"also":[48],"settle":[49],"similar":[51],"for":[53],"computing":[54],"MAX":[55],"in":[56],"comparison":[59],"model;":[61],"these":[62],"results":[63],"bring":[64],"out":[65],"interesting":[66],"differences":[67],"among":[68],"noise":[70],"models.":[71]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-12-17T22:08:43.090829","created_date":"2016-06-24T00:00:00"}