{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:09:46Z","timestamp":1775282986572,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030017125","type":"print"},{"value":"9783030017132","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01713-2_10","type":"book-chapter","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T14:22:06Z","timestamp":1542982926000},"page":"131-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Expected Duration of Sequential Gossiping"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4526-8687","authenticated-orcid":false,"given":"Hans","family":"van Ditmarsch","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7521-0553","authenticated-orcid":false,"given":"Ioannis","family":"Kokkinis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,14]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Wojtczak, D.: Decidability of fair termination of gossip protocols. In: Proceedings of the IWIL Workshop and LPAR Short Presentations, pp. 73\u201385. Kalpa Publications (2017)","DOI":"10.29007\/62s4"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Wojtczak, D.: On the computational complexity of gossip protocols. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017 , pp. 765\u2013771 (2017)","DOI":"10.24963\/ijcai.2017\/106"},{"key":"10_CR3","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":"10_CR4","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). https:\/\/doi.org\/10.1007\/978-3-319-47843-2_9"},{"key":"10_CR5","unstructured":"Attamah, M., Van Ditmarsch, H., Grossi, D., van der Hoek, W.: Knowledge and gossip. In: Proceedings of the Twenty-first European Conference on Artificial Intelligence, pp. 21\u201326. IOS Press (2014)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-22993-0_10","volume-title":"Mathematical Foundations of Computer Science 2011","author":"P Berenbrink","year":"2011","unstructured":"Berenbrink, P., Els\u00e4sser, R., Friedetzky, T., Nagel, L., Sauerwald, T.: Faster coupon collecting via replication with applications in gossiping. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 72\u201383. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22993-0_10"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"657","DOI":"10.2307\/3213094","volume":"16","author":"DW Boyd","year":"1979","unstructured":"Boyd, D.W., Steele, J.M.: Random exchanges of information. J. Appl. Prob. 16, 657\u2013661 (1979)","journal-title":"J. Appl. Prob."},{"issue":"6","key":"10_CR8","doi-asserted-by":"publisher","first-page":"2486","DOI":"10.1109\/TIT.2006.874532","volume":"52","author":"S Deb","year":"2006","unstructured":"Deb, S., M\u00e9dard, M., Choute, C.: Algebraic gossip: a network coding approach to optimal multiple rumor mongering. IEEE Trans. Inf. Theory 52(6), 2486\u20132507 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR9","doi-asserted-by":"publisher","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."},{"key":"10_CR10","unstructured":"van Ditmarsch, H., van Eijck, J., Pardo, P., Ramezanian, R., Schwarzentruber, F.: Dynamic gossip. CoRR abs\/1511.00867 (2015)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-69131-2_6","volume-title":"PRIMA 2017: Principles and Practice of Multi-Agent Systems","author":"H Ditmarsch van","year":"2017","unstructured":"van Ditmarsch, H., Kokkinis, I., Stockmarr, A.: Reachability and expectation in gossiping. In: An, B., Bazzan, A., Leite, J., Villata, S., van der Torre, L. (eds.) PRIMA 2017. LNCS (LNAI), vol. 10621, pp. 93\u2013109. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69131-2_6"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","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":"10_CR13","unstructured":"Ferrante, M., Saltalamacchia, M.: The coupon collector\u2019s problem. Materials Matem\u00e1tics 2014(2), 35 (2014), www.mat.uab.cat\/matmat"},{"key":"10_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"A Frieze","year":"2015","unstructured":"Frieze, A., Karo\u0144ski, M.: Introduction to Random Graphs. Cambridge University Press, Cambridge (2015)"},{"issue":"6","key":"10_CR15","doi-asserted-by":"publisher","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":"10_CR16","doi-asserted-by":"publisher","first-page":"743","DOI":"10.2307\/3213330","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":"10_CR17","doi-asserted-by":"publisher","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"},{"key":"10_CR18","first-page":"208","volume":"1","author":"CA Hurkens","year":"2000","unstructured":"Hurkens, C.A.: Spreading gossip efficiently. Nieuw Archief voor Wiskunde 1, 208\u2013210 (2000)","journal-title":"Nieuw Archief voor Wiskunde"},{"key":"10_CR19","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"},{"issue":"19","key":"10_CR20","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"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems and Agreement Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01713-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:30:18Z","timestamp":1775280618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01713-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030017125","9783030017132"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01713-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}