{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:11:18Z","timestamp":1773774678420,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,23]]},"DOI":"10.1145\/1146381.1146401","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"113-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":90,"title":["Computing separable functions via gossip"],"prefix":"10.1145","author":[{"given":"Damon","family":"Mosk-Aoyama","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Devavrat","family":"Shah","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054199000216"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646978.711822"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070475"},{"key":"e_1_3_2_1_4_1","volume-title":"Prentice Hall","author":"Bertsekas D. P.","year":"1989"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498447"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978068"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. Springer second edition 1998.  A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. Springer second edition 1998.","DOI":"10.1007\/978-1-4612-5320-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498374"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946317"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652161"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380796"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007438"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"E. Modiano D. Shah and G. Zussman. Maximizing throughput in wireless networks via gossip. Submitted 2005.  E. Modiano D. Shah and G. Zussman. Maximizing throughput in wireless networks via gossip. Submitted 2005.","DOI":"10.1145\/1140277.1140283"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031525"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0147013"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365693"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796583"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/140552"},{"key":"e_1_3_2_1_22_1","volume-title":"Massachusetts Institute of Technology","author":"Tsitsiklis J. N.","year":"1984"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"}],"event":{"name":"PODC06: ACM Symposium on Principles of Distributed Computing 2006","location":"Denver Colorado USA","acronym":"PODC06","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1146381.1146401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T23:59:56Z","timestamp":1673481596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1146381.1146401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,23]]},"references-count":23,"alternative-id":["10.1145\/1146381.1146401","10.1145\/1146381"],"URL":"https:\/\/doi.org\/10.1145\/1146381.1146401","relation":{},"subject":[],"published":{"date-parts":[[2006,7,23]]},"assertion":[{"value":"2006-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}