{"id":"https://openalex.org/W2610229967","doi":"https://doi.org/10.4086/toc.2016.v012a010","title":"","display_name":"","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2610229967","doi":"https://doi.org/10.4086/toc.2016.v012a010","mag":"2610229967"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2016.v012a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a010","pdf_url":"http://www.theoryofcomputing.org/articles/v012a010/v012a010.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":"http://www.theoryofcomputing.org/articles/v012a010/v012a010.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084208266","display_name":"Amit Chakrabarti","orcid":"https://orcid.org/0000-0003-3633-9180"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amit Chakrabarti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031896681","display_name":"Graham Cormode","orcid":"https://orcid.org/0000-0002-0698-0922"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Graham Cormode","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101979548","display_name":"Andrew McGregor","orcid":"https://orcid.org/0000-0002-2124-160X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrew McGregor","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.19839183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"35"},"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.9993000030517578,"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.9993000030517578,"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/T10237","display_name":"Cryptography and Data Security","score":0.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6286278367042542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6163731217384338},{"id":"https://openalex.org/keywords/quantile","display_name":"Quantile","score":0.5262265205383301},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.48743370175361633},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4713843762874603},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.4547317922115326},{"id":"https://openalex.org/keywords/data-stream","display_name":"Data stream","score":0.43388426303863525},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36952370405197144},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3476772904396057},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1502230167388916}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6286278367042542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6163731217384338},{"id":"https://openalex.org/C118671147","wikidata":"https://www.wikidata.org/wiki/Q578714","display_name":"Quantile","level":2,"score":0.5262265205383301},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.48743370175361633},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4713843762874603},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4547317922115326},{"id":"https://openalex.org/C2778484313","wikidata":"https://www.wikidata.org/wiki/Q1172540","display_name":"Data stream","level":2,"score":0.43388426303863525},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36952370405197144},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3476772904396057},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1502230167388916},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2016.v012a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a010","pdf_url":"http://www.theoryofcomputing.org/articles/v012a010/v012a010.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.2016.v012a010","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a010","pdf_url":"http://www.theoryofcomputing.org/articles/v012a010/v012a010.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":[],"awards":[{"id":"https://openalex.org/G2377001993","display_name":null,"funder_award_id":"CCF-1320719","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2426521137","display_name":"CAREER:    Information Theoretic Methods in Communication and Computational Complexity","funder_award_id":"0448277","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2844836911","display_name":"AF: Small: Massive Graph Analysis via Linear Measurements: Towards a Theory of Homomorphic Co","funder_award_id":"1320719","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5122434187","display_name":null,"funder_award_id":"CCF-0953754","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5263689317","display_name":"DC: Small: Data Streaming through a Complexity-Theoretic Lens","funder_award_id":"0916565","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6029386486","display_name":"CAREER: New Directions for Sketching and Stream Computation","funder_award_id":"0953754","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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2610229967.pdf","grobid_xml":"https://content.openalex.org/works/W2610229967.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W605043455","https://openalex.org/W1484190527","https://openalex.org/W1557064786","https://openalex.org/W1675727887","https://openalex.org/W1761167196","https://openalex.org/W1785933978","https://openalex.org/W1983266860","https://openalex.org/W1985526537","https://openalex.org/W2002501531","https://openalex.org/W2021016639","https://openalex.org/W2025051251","https://openalex.org/W2027214648","https://openalex.org/W2038255135","https://openalex.org/W2042518617","https://openalex.org/W2043160138","https://openalex.org/W2060972166","https://openalex.org/W2069414131","https://openalex.org/W2070053775","https://openalex.org/W2080745194","https://openalex.org/W2089066317","https://openalex.org/W2091567345","https://openalex.org/W2104635635","https://openalex.org/W2107917944","https://openalex.org/W2112452856","https://openalex.org/W2114203129","https://openalex.org/W2114607430","https://openalex.org/W2122058331","https://openalex.org/W2129978406","https://openalex.org/W2131587307","https://openalex.org/W2132822431","https://openalex.org/W2132943362","https://openalex.org/W2148137544","https://openalex.org/W2152489475","https://openalex.org/W2162317237","https://openalex.org/W2163964823","https://openalex.org/W2165461157","https://openalex.org/W2170168647","https://openalex.org/W2174130830","https://openalex.org/W2478708596","https://openalex.org/W4211003473","https://openalex.org/W4226347946","https://openalex.org/W4248270945"],"related_works":["https://openalex.org/W1488761988","https://openalex.org/W2044551864","https://openalex.org/W2047938026","https://openalex.org/W1572557500","https://openalex.org/W4390690393","https://openalex.org/W3124946120","https://openalex.org/W2585269888","https://openalex.org/W3132003399","https://openalex.org/W2909697207","https://openalex.org/W2005776175"],"abstract_inverted_index":{"We":[0,45],"study":[1],"the":[2,9,39,50,62],"communication":[3,54],"complexity":[4],"of":[5,52,61],"evaluating":[6],"functions":[7],"when":[8],"input":[10],"data":[11],"is":[12],"randomly":[13],"allocated":[14],"(according":[15],"to":[16,47,66],"some":[17],"known":[18],"distribution)":[19],"amongst":[20],"two":[21],"or":[22],"more":[23],"players,":[24],"possibly":[25],"with":[26],"information":[27],"overlap.":[28],"This":[29],"naturally":[30],"extends":[31],"previously":[32],"studied":[33],"variable":[34],"partition":[35,43],"models":[36],"such":[37],"as":[38,64],"best-case":[40],"and":[41],"worst-case":[42],"models.":[44],"aim":[46],"understand":[48],"whether":[49],"hardness":[51],"a":[53,71],"problem":[55],"holds":[56],"for":[57,68],"almost":[58],"every":[59],"allocation":[60],"input,":[63],"opposed":[65],"holding":[67],"perhaps":[69],"just":[70],"few":[72],"atypical":[73],"partitions.":[74]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-12-17T22:08:43.090829","created_date":"2017-05-12T00:00:00"}