{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T22:40:18Z","timestamp":1736635218973,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540446248"},{"type":"electronic","value":"9783540446279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864219_39","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T05:25:39Z","timestamp":1159939539000},"page":"540-542","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Convergence Analysis of Scalable Gossip Protocols"],"prefix":"10.1007","author":[{"given":"Stacy","family":"Patterson","sequence":"first","affiliation":[]},{"given":"Bassam","family":"Bamieh","sequence":"additional","affiliation":[]},{"given":"Amr","family":"El Abbadi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Salapaka, S., Peirce, A., Dahleh, M.: Analysis of a circulant based preconditioner for a class of lower rank extracted systems. In: Numerical Linear Algebra with Applications, vol.\u00a012, pp. 9\u201332 (2005)","DOI":"10.1002\/nla.390"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Patterson, S., Bamieh, B., El Abbadi, A.: Convergence analysis of scalable gossip protocols. Technical Report 2006-09, Department of Computer Science, University of California, Santa Barbara (2006)","DOI":"10.1007\/11864219_39"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: IEEE Symposium on Foundations of Computer Science, p. 482 (2003)","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: Design, analysis and applications. In: INFOCOM, vol.\u00a03, pp. 1653\u20131664 (2005)","DOI":"10.1109\/INFCOM.2005.1498447"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Xiao, L., Boyd, S.: Fast linear iterations for distributed averaging. In: Systems and Control Letters, vol.\u00a053, pp. 65\u201378 (2005)","DOI":"10.1016\/j.sysconle.2004.02.022"},{"issue":"2","key":"39_CR6","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1994.1086","volume":"114","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., van den Berg, J.: Computing boolean functions on anonymous networks. Information and Computation\u00a0114(2), 214\u2013236 (1994)","journal-title":"Information and Computation"},{"key":"39_CR7","unstructured":"Barooah, P., Hespanha, J.: Graph effective resistances and distributed control: Part ii \u2013 electrical analogy and scalability. In: 45th IEEE Conference on Decision and Control (February 2006) (submitted, 2006)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864219_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T03:23:13Z","timestamp":1736565793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864219_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540446248","9783540446279"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11864219_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}