{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:17:05Z","timestamp":1742386625651},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233060"},{"type":"electronic","value":"9783540301868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30186-8_20","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T19:48:23Z","timestamp":1285184903000},"page":"275-289","source":"Crossref","is-referenced-by-count":15,"title":["A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion"],"prefix":"10.1007","author":[{"given":"Yitzhak","family":"Birk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liran","family":"Liss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Assaf","family":"Schuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comp.\u00a021, 193\u2013201 (1992)","journal-title":"SIAM J. Comp."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive network routing. In: Proc. 21st ACM STOC (1989)","DOI":"10.1145\/73007.73053"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Kutten, S., Peleg, D.: Fault-local distributed mending. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (1995)","DOI":"10.1145\/224964.224967"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Kutten, S., Patt-Shamir, B.: Time-adaptive self-stabilization. In: Proc. of the 16th Annual ACM Symp. on Principles of Distributed Computing, pp. 149\u2013158 (1997)","DOI":"10.1145\/259380.259435"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Birk, Y., Liss, L., Schuster, A., Wolff, R.: A local algorithm for ad hoc majority voting via charge fusion. Technical Report EE1445 (CCIT497), Technion (2004)","DOI":"10.1007\/978-3-540-30186-8_20"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Wolff, R., Schuster, A.: Association rule mining in peer-to-peer systems. In: Proc. of the IEEE Conference on Data Mining, ICDM (2003)","DOI":"10.1109\/ICDM.2003.1250941"},{"key":"20_CR7","volume-title":"Flows in Networks","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Jaffe, J., Moss, F.: A responsive routing algorithm for computer networks. IEEE Transactions on Communications, 1758\u20131762 (1982)","DOI":"10.1109\/TCOM.1982.1095632"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Garcia-Luna-Aceves, J.: A distributed, loop-free, shortest-path routing algorithm. In: Proceedings of IEEE INFOCOM, pp. 1125\u20131137 (1988)","DOI":"10.1109\/INFCOM.1988.13032"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b11823","volume-title":"Peer-to-Peer Systems II","author":"F. Kaashoek","year":"2003","unstructured":"Kaashoek, F., Karger, D.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Intanagonwiwat, C., Estrin, R.G., Directed, D.: diffusion: A scalable and robust communication paradigm for sensor networks. In: Proceedings of the Sixth Annual Intl. Conf. on Mobile Computing and Networking (2000)","DOI":"10.1145\/345910.345920"},{"key":"20_CR12","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Computing aggregate information using gossip. In: Proceedings of Foundations of Computer Science, FOCS (2003)"},{"key":"20_CR13","unstructured":"Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical report, Stanford University, DB group (2003)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30186-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:46:15Z","timestamp":1605761175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30186-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233060","9783540301868"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30186-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}