{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:27Z","timestamp":1725512127713},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729181"},{"type":"electronic","value":"9783540729518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72951-8_13","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T20:03:25Z","timestamp":1183320205000},"page":"151-165","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Moves for Gossiping Among Mobile Agents"],"prefix":"10.1007","author":[{"given":"Tomoko","family":"Suzuki","sequence":"first","affiliation":[]},{"given":"Taisuke","family":"Izumi","sequence":"additional","affiliation":[]},{"given":"Fukuhito","family":"Ooshita","sequence":"additional","affiliation":[]},{"given":"Hirotsugu","family":"Kakugawa","sequence":"additional","affiliation":[]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Barriere, L., et al.: Can we elect if we cannot compare. In: Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2003), June 2003, pp. 324\u2013332 (2003)","DOI":"10.1145\/777412.777469"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00224-005-1223-5","volume":"40","author":"L. Barriere","year":"2007","unstructured":"Barriere, L., et al.: Rendezvous and election of mobile agents: Impact of sense of direction. Theory of Computing Systems\u00a040(2), 143\u2013162 (2007)","journal-title":"Theory of Computing Systems"},{"issue":"11","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/71.642949","volume":"8","author":"J. Bruck","year":"1997","unstructured":"Bruck, J., et al.: Efficient algorithms for all-to-all communications in multiport message-passing systems. IEEE Transactions on Parallel and Distributed Systems\u00a08(11), 1143\u20131156 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/11940128_73","volume-title":"Algorithms and Computation","author":"S. Das","year":"2006","unstructured":"Das, S., et al.: Effective elections for anonymous mobile agents. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 732\u2013743. Springer, Heidelberg (2006)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Deugo, D.: Mobile agents for electing a leader. In: Proceedings of the 4th International Symposium on Autonomous Decentralized Systems (ISADS 1999), March 1999, pp. 324\u2013327 (1999)","DOI":"10.1109\/ISADS.1999.838454"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0895480199365397","volume":"14","author":"M. Flammini","year":"2001","unstructured":"Flammini, M., Perennes, S.: On the optimality of general lower bounds for broadcasting and gossiping. SIAM Journal on Discrete Mathematics\u00a014(2), 267\u2013282 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/7531.7919","volume":"31","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson, G.N., Lynch, N.: Electing a leader in a synchronous ring. Journal of the ACM\u00a031(1), 98\u2013115 (1987)","journal-title":"Journal of the ACM"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning tree. ACM Transactions on Programming Languages and Systems\u00a05(1), 66\u201377 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"11","key":"13_CR9","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"D.S. Hirschberg","year":"1980","unstructured":"Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema-finding in circular configurations of processors. Communications of the ACM\u00a023(11), 627\u2013628 (1980)","journal-title":"Communications of the ACM"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(89)90103-5","volume":"64","author":"E. Korach","year":"1989","unstructured":"Korach, E., Moran, S., Zaks, S.: Optimal lower bounds for some distributed algorithms for a complete network of processors. Theoretical Computer Science\u00a064(1), 125\u2013132 (1989)","journal-title":"Theoretical Computer Science"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11780823_1","volume-title":"Structural Information and Communication Complexity","author":"E. Kranakis","year":"2006","unstructured":"Kranakis, E., Krizanc, D., Rajsbaum, S.: Mobile Agent Rendezvous: A Survey. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 1\u20139. Springer, Heidelberg (2006)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Kranakis, E., et al.: Mobile agent rendezvous in a ring. In: Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), May 2003, pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(86)90025-6","volume":"22","author":"M.C. Loui","year":"1986","unstructured":"Loui, M.C., Matsushita, T.A., West, D.B.: Election in complete networks with sense of direction. Information Processing Letters\u00a022(4), 185\u2013187 (1986)","journal-title":"Information Processing Letters"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G.D. Marco","year":"2006","unstructured":"Marco, G.D., et al.: Asynchronous deterministic rendezvous in graphs. Theoretical Computer Science\u00a0355(3), 315\u2013326 (2006)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72951-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:08:48Z","timestamp":1605744528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72951-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729181","9783540729518"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72951-8_13","relation":{},"subject":[]}}