{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:47Z","timestamp":1740098927909,"version":"3.37.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319691305"},{"type":"electronic","value":"9783319691312"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69131-2_6","type":"book-chapter","created":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T09:32:49Z","timestamp":1507109569000},"page":"93-109","source":"Crossref","is-referenced-by-count":9,"title":["Reachability and Expectation in Gossiping"],"prefix":"10.1007","author":[{"given":"Hans","family":"van Ditmarsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Kokkinis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Stockmarr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,5]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Grossi, D., van der Hoek, W.: Epistemic protocols for distributed gossiping. In: Proceedings of 15th TARK (2015)","DOI":"10.4204\/EPTCS.215.5"},{"key":"6_CR2","unstructured":"Attamah, M., van Ditmarsch, H., Grossi, D., van der Hoek, W.: Knowledge and gossip. In: Proceedings of the 21st ECAI, pp. 21\u201326. IOS Press (2014)"},{"key":"6_CR3","series-title":"Outstanding Contributions to Logic","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-47843-2_9","volume-title":"Rohit Parikh on Logic, Language and Society","author":"M Attamah","year":"2017","unstructured":"Attamah, M., van Ditmarsch, H., Grossi, D., van der Hoek, W.: The pleasure of gossip. In: Ba\u015fkent, C., Moss, L.S., Ramanujam, R. (eds.) Rohit Parikh on Logic, Language and Society. OCL, vol. 11, pp. 145\u2013163. Springer, Cham (2017). doi: 10.1007\/978-3-319-47843-2_9"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1017\/S002190020010779X","volume":"16","author":"DW Boyd","year":"1979","unstructured":"Boyd, D.W., Steele, J.M.: Random exchanges of information. J. Appl. Probab. 16, 657\u2013661 (1979)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"6_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0602002","volume":"2","author":"RT Bumby","year":"1981","unstructured":"Bumby, R.T.: A problem with telephones. SIAM J. Algebr. Discrete Methods 2(1), 13\u201318 (1981)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jal.2016.12.001","volume":"20","author":"H Ditmarsch van","year":"2017","unstructured":"van Ditmarsch, H., van Eijck, J., Pardo, P., Ramezanian, R., Schwarzentruber, F.: Epistemic protocols for dynamic gossip. J. Appl. Log. 20, 1\u201331 (2017)","journal-title":"J. Appl. Log."},{"issue":"2","key":"6_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2650185","volume":"11","author":"B Doerr","year":"2014","unstructured":"Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading. ACM Trans. Algorithms 11(2), 1\u201335 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. (Debrecen) 6, 290\u2013297 (1959)","journal-title":"Publ. Math. (Debrecen)"},{"issue":"5","key":"6_CR9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/MC.2004.1297243","volume":"37","author":"PT Eugster","year":"2004","unstructured":"Eugster, P.T., Guerraoui, R., Kermarrec, A., Massouli\u00e9, L.: Epidemic information dissemination in distributed systems. IEEE Comput. 37(5), 60\u201367 (2004)","journal-title":"IEEE Comput."},{"issue":"1","key":"6_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(91)90068-D","volume":"87","author":"F G\u00f6bel","year":"1991","unstructured":"G\u00f6bel, F., Cerdeira, J.O., Veldman, H.J.: Label-connected graphs and the gossip problem. Discrete Math. 87(1), 29\u201340 (1991)","journal-title":"Discrete Math."},{"issue":"6","key":"6_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2767126","volume":"62","author":"B Haeupler","year":"2015","unstructured":"Haeupler, B.: Simple, fast and deterministic gossip and rumor spreading. J. ACM 62(6), 47 (2015)","journal-title":"J. ACM"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1017\/S0021900200098557","volume":"18","author":"J Haigh","year":"1981","unstructured":"Haigh, J.: Random exchanges of information. J. Appl. Probab. 18, 743\u2013746 (1981)","journal-title":"J. Appl. Probab."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S Hedetniemi","year":"1988","unstructured":"Hedetniemi, S., Hedetniemi, S., Liestman, A.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319\u2013349 (1988)","journal-title":"Networks"},{"issue":"1","key":"6_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/AIC-170723","volume":"30","author":"A Herzig","year":"2017","unstructured":"Herzig, A., Maffre, F.: How to share knowledge by gossiping. AI Commun. 30(1), 1\u201317 (2017)","journal-title":"AI Commun."},{"issue":"2","key":"6_CR15","first-page":"208","volume":"5\/1","author":"C Hurkens","year":"2000","unstructured":"Hurkens, C.: Spreading gossip efficiently. Nieuw Archief voor Wiskunde 5\/1(2), 208\u2013210 (2000)","journal-title":"Nieuw Archief voor Wiskunde"},{"issue":"5","key":"6_CR16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1317379.1317381","volume":"41","author":"AM Kermarrec","year":"2007","unstructured":"Kermarrec, A.M., van Steen, M.: Gossiping in distributed systems. SIGOPS Oper. Syst. Rev. 41(5), 2\u20137 (2007)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","volume":"13","author":"W Kn\u00f6del","year":"1975","unstructured":"Kn\u00f6del, W.: New gossips and telephones. Discrete Math. 13, 95 (1975)","journal-title":"Discrete Math."},{"issue":"3","key":"6_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02478413","volume":"16","author":"H Landau","year":"1954","unstructured":"Landau, H.: The distribution of completion times for random communication in a task-oriented group. Bull. Math. Biophys. 16(3), 187\u2013201 (1954)","journal-title":"Bull. Math. Biophys."},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"6_CR20","first-page":"246","volume":"20","author":"J Moon","year":"1972","unstructured":"Moon, J.: Random exchanges of information. Nieuw Archief voor Wiskunde 20, 246\u2013249 (1972)","journal-title":"Nieuw Archief voor Wiskunde"},{"key":"6_CR21","volume-title":"Markov Chains","author":"JR Norris","year":"1998","unstructured":"Norris, J.R.: Markov Chains. Cambridge University Press, Cambridge (1998)"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02252679","volume":"6","author":"P Panangaden","year":"1992","unstructured":"Panangaden, P., Taylor, K.: Concurrent common knowledge: defining agreement for asynchronous systems. Distrib. Comput. 6, 73\u201393 (1992)","journal-title":"Distrib. Comput."},{"issue":"19","key":"6_CR23","first-page":"188","volume":"3","author":"R Tijdeman","year":"1971","unstructured":"Tijdeman, R.: On a telephone problem. Nieuw Archief voor Wiskunde 3(19), 188\u2013192 (1971)","journal-title":"Nieuw Archief voor Wiskunde"},{"issue":"3","key":"6_CR24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(82)90153-4","volume":"39","author":"DB West","year":"1982","unstructured":"West, D.B.: A class of solutions to the gossip problem, part I. Discrete Math. 39(3), 307\u2013326 (1982)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","PRIMA 2017: Principles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69131-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T19:02:57Z","timestamp":1693076577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69131-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319691305","9783319691312"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69131-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}