{"id":"https://openalex.org/W2075400537","doi":"https://doi.org/10.1145/1810479.1810504","title":"Optimal gossip-based aggregate computation","display_name":"Optimal gossip-based aggregate computation","publication_year":2010,"publication_date":"2010-06-13","ids":{"openalex":"https://openalex.org/W2075400537","doi":"https://doi.org/10.1145/1810479.1810504","mag":"2075400537"},"language":"en","primary_location":{"id":"doi:10.1145/1810479.1810504","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810479.1810504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures","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/A5047323038","display_name":"Jen\u2010Yeu Chen","orcid":"https://orcid.org/0000-0002-7762-2129"},"institutions":[{"id":"https://openalex.org/I33096239","display_name":"National Dong Hwa University","ror":"https://ror.org/00mng9617","country_code":"TW","type":"education","lineage":["https://openalex.org/I33096239"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Jen-Yeu Chen","raw_affiliation_strings":["National Dong-Hwa University, ShouFeng, Hualien, Taiwan Roc","National Dong-Hwa University, ShouFeng, Hualien, Taiwan Roc#TAB#"],"affiliations":[{"raw_affiliation_string":"National Dong-Hwa University, ShouFeng, Hualien, Taiwan Roc","institution_ids":["https://openalex.org/I33096239"]},{"raw_affiliation_string":"National Dong-Hwa University, ShouFeng, Hualien, Taiwan Roc#TAB#","institution_ids":["https://openalex.org/I33096239"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089574654","display_name":"Gopal Pandurangan","orcid":"https://orcid.org/0000-0001-5833-6592"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Gopal Pandurangan","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore","Nanyang Technological University, Singapore, SINGAPORE#TAB#"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore, SINGAPORE#TAB#","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047323038"],"corresponding_institution_ids":["https://openalex.org/I33096239"],"apc_list":null,"apc_paid":null,"fwci":4.8349,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.95233717,"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":"124","last_page":"133"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9945999979972839,"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/gossip","display_name":"Gossip","score":0.8228799104690552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7200160026550293},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6983469128608704},{"id":"https://openalex.org/keywords/gossip-protocol","display_name":"Gossip protocol","score":0.581377387046814},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5489441156387329},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5179113745689392},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5122746825218201},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48464733362197876},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.4658910036087036},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.4640452265739441},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4430776834487915},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.43688762187957764},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4365542531013489},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.41768988966941833},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41526585817337036},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37479472160339355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37242698669433594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3237738013267517},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.2890852689743042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21266862750053406},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11433002352714539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11376464366912842}],"concepts":[{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.8228799104690552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7200160026550293},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6983469128608704},{"id":"https://openalex.org/C145928361","wikidata":"https://www.wikidata.org/wiki/Q5587504","display_name":"Gossip protocol","level":3,"score":0.581377387046814},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5489441156387329},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5179113745689392},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5122746825218201},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48464733362197876},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.4658910036087036},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4640452265739441},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4430776834487915},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.43688762187957764},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4365542531013489},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.41768988966941833},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41526585817337036},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37479472160339355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37242698669433594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3237738013267517},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.2890852689743042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21266862750053406},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11433002352714539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11376464366912842},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1810479.1810504","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810479.1810504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.753.6284","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.753.6284","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1001.3242.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1568961751","https://openalex.org/W1965765215","https://openalex.org/W1984977694","https://openalex.org/W1987854975","https://openalex.org/W2009179299","https://openalex.org/W2022362911","https://openalex.org/W2026501865","https://openalex.org/W2038562061","https://openalex.org/W2039347386","https://openalex.org/W2069891327","https://openalex.org/W2075400537","https://openalex.org/W2093872623","https://openalex.org/W2110100895","https://openalex.org/W2110173519","https://openalex.org/W2112341171","https://openalex.org/W2117905067","https://openalex.org/W2119098504","https://openalex.org/W2126310747","https://openalex.org/W2135241601","https://openalex.org/W2138368466","https://openalex.org/W2138830906","https://openalex.org/W2154654617","https://openalex.org/W2155530897","https://openalex.org/W2157004711","https://openalex.org/W2158049821","https://openalex.org/W2161118867","https://openalex.org/W2164319686","https://openalex.org/W2167396179","https://openalex.org/W2167898414","https://openalex.org/W2264119918","https://openalex.org/W2899702797","https://openalex.org/W2952038878"],"related_works":["https://openalex.org/W3024820515","https://openalex.org/W2131433923","https://openalex.org/W2010318438","https://openalex.org/W2020760577","https://openalex.org/W1678654634","https://openalex.org/W2149172033","https://openalex.org/W2120550887","https://openalex.org/W2108737453","https://openalex.org/W177242786","https://openalex.org/W2039347386"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"applications":[2],"to":[3,26,172],"modern":[4],"networking":[5],"technologies,":[6],"there":[7],"has":[8],"been":[9],"interest":[10],"in":[11,44,102,177,183],"designing":[12],"efficient":[13],"gossip-based":[14,21,62,174],"protocols":[15,22,38],"for":[16,64],"computing":[17],"aggregate":[18,65,175],"functions.":[19],"While":[20],"provide":[23],"robustness":[24],"due":[25],"their":[27,100],"randomized":[28],"nature,":[29],"reducing":[30],"the":[31,45,58,83,87,118,138],"message":[32],"and":[33,53,72,107],"time":[34,70,106],"complexity":[35],"of":[36,41,47,99,120,140,190],"these":[37],"is":[39,126,153,193],"also":[40],"paramount":[42],"importance":[43],"context":[46],"resource-constrained":[48],"networks":[49],"such":[50,181],"as":[51,91,134,136,182],"sensor":[52],"peer-to-peer":[54,184],"networks.":[55,185],"We":[56],"present":[57],"first":[59],"provably":[60],"almost-optimal":[61],"algorithms":[63,79,168],"computation":[66,176],"that":[67,81,125,145,166],"are":[68],"both":[69],"optimal":[71,103],"message-optimal.":[73],"Given":[74],"a":[75,194],"n-node":[76],"network,":[77],"our":[78,167,191],"guarantee":[80],"all":[82],"nodes":[84],"can":[85,169],"compute":[86],"common":[88],"aggregates":[89],"(such":[90],"Min,":[92],"Max,":[93],"Count,":[94],"Sum,":[95],"Average,":[96],"Rank":[97],"etc.)":[98],"values":[101],"O(log":[104,157],"n)":[105,112,132,150,161],"using":[108],"O(n":[109,130,147],"log":[110,111,131,148,149,159,160],"messages.":[113],"Our":[114],"result":[115],"improves":[116],"on":[117,137],"algorithm":[119,139,192],"Kempe":[121],"et":[122,142],"al.":[123,143],"[9]":[124],"time-optimal,":[127],"but":[128,152],"uses":[129,146],"messages":[133],"well":[135],"Kashyap":[141],"[8]":[144],"messages,":[151],"not":[154],"time-optimal":[155],"(takes":[156],"n":[158],"time).":[162],"Furthermore,":[163],"we":[164],"show":[165],"be":[170],"used":[171],"improve":[173],"sparse":[178],"communication":[179],"networks,":[180],"The":[186],"main":[187],"technical":[188],"ingredient":[189],"technique":[195],"called":[196],"distributed":[197],"random":[198],"ranking":[199]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}