Cooper, Martin C.; Herzig, Andreas; Maffre, Faustine; Maris, Frédéric; Perrotin, Elise; Régnier, Pierre A lightweight epistemic logic and its application to planning. (English) Zbl 07418669 Artif. Intell. 298, Article ID 103437, 32 p. (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{M. C. Cooper} et al., Artif. Intell. 298, Article ID 103437, 32 p. (2021; Zbl 07418669) Full Text: DOI HAL OpenURL
Ramezanian, Rahim; Ramezanian, Rasoul; van Ditmarsch, Hans; Gattinger, Malvin Everyone knows that everyone knows. (English) Zbl 1498.03067 Mojtahedi, Mojtaba (ed.) et al., Mathematics, logic, and their philosophies. Essays in honour of Mohammad Ardeshir. Cham: Springer. Log. Epistemol. Unity Sci. 49, 117-133 (2021). MSC: 03B80 03B70 03B42 68M12 68T27 91D30 PDF BibTeX XML Cite \textit{R. Ramezanian} et al., Log. Epistemol. Unity Sci. 49, 117--133 (2021; Zbl 1498.03067) Full Text: DOI arXiv OpenURL
Baumann, Hervé; Fraigniaud, Pierre; Harutyunyan, Hovhannes A.; de Verclos, Rémi The worst case behavior of randomized gossip protocols. (English) Zbl 1303.68030 Theor. Comput. Sci. 560, Part 2, 108-120 (2014). MSC: 68M12 68Q25 90B18 PDF BibTeX XML Cite \textit{H. Baumann} et al., Theor. Comput. Sci. 560, Part 2, 108--120 (2014; Zbl 1303.68030) Full Text: DOI OpenURL
Sacha, Jan; Montresor, Alberto Identifying frequent items in distributed data sets. (English) Zbl 1314.68388 Computing 95, No. 4, 289-307 (2013). MSC: 68W15 68M14 68Q25 68W25 PDF BibTeX XML Cite \textit{J. Sacha} and \textit{A. Montresor}, Computing 95, No. 4, 289--307 (2013; Zbl 1314.68388) Full Text: DOI OpenURL
Chen, Jen-Yeu; Pandurangan, Gopal Almost-optimal gossip-based aggregate computation. (English) Zbl 1247.68027 SIAM J. Comput. 41, No. 3, 455-483 (2012). MSC: 68M14 68M11 68M12 68Q25 68W40 68W15 68W20 68P20 PDF BibTeX XML Cite \textit{J.-Y. Chen} and \textit{G. Pandurangan}, SIAM J. Comput. 41, No. 3, 455--483 (2012; Zbl 1247.68027) Full Text: DOI Link OpenURL
Haeupler, Bernhard; Karger, David Faster information dissemination in dynamic networks via network coding. (English) Zbl 1321.68467 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC ’11, San Jose, CA, USA, June 06–08, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0719-2). 381-390 (2011). MSC: 68W15 68M10 68M14 68Q25 68R10 90B18 PDF BibTeX XML Cite \textit{B. Haeupler} and \textit{D. Karger}, in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC '11, San Jose, CA, USA, June 06--08, 2011. New York, NY: Association for Computing Machinery (ACM). 381--390 (2011; Zbl 1321.68467) Full Text: DOI OpenURL
Haeupler, Bernhard Analyzing network coding gossip made easy. (English) Zbl 1288.68021 Proceedings of the 43rd annual ACM symposium on theory of computing, STOC ’11. San Jose, CA, USA, June 6–8, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0691-1). 293-302 (2011). MSC: 68M12 68M10 68Q25 PDF BibTeX XML Cite \textit{B. Haeupler}, in: Proceedings of the 43rd annual ACM symposium on theory of computing, STOC '11. San Jose, CA, USA, June 6--8, 2011. New York, NY: Association for Computing Machinery (ACM). 293--302 (2011; Zbl 1288.68021) Full Text: DOI arXiv OpenURL
Kowalski, Dariusz R.; Strojnowski, Michał Gossiping by processors prone to omission failures. (English) Zbl 1191.68089 Inf. Process. Lett. 109, No. 6, 308-314 (2009). MSC: 68M15 68M14 68W05 PDF BibTeX XML Cite \textit{D. R. Kowalski} and \textit{M. Strojnowski}, Inf. Process. Lett. 109, No. 6, 308--314 (2009; Zbl 1191.68089) Full Text: DOI OpenURL
Georgiou, Chryssis; Gilbert, Seth; Guerraoui, Rachid; Kowalski, Dariusz R. On the complexity of asynchronous gossip. (English) Zbl 1301.68160 Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC ’08, Toronto, Canada, August 18–21, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-989-0). 135-144 (2008). MSC: 68Q25 68M12 68M14 68M15 68Q17 68Q87 68W15 PDF BibTeX XML Cite \textit{C. Georgiou} et al., in: Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC '08, Toronto, Canada, August 18--21, 2008. New York, NY: Association for Computing Machinery (ACM). 135--144 (2008; Zbl 1301.68160) Full Text: DOI Link OpenURL
Terpstra, Wesley W.; Leng, Christof; Buchmann, Alejandro P. Practical summation via gossip. (English) Zbl 1283.68103 Proceedings of the 26th annual ACM symposium on principles of distributed computing, PODC ’07, Portland, OR, USA, August 12–15, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-616-5). 390-391 (2007). MSC: 68M14 68W15 68M20 68Q25 PDF BibTeX XML Cite \textit{W. W. Terpstra} et al., in: Proceedings of the 26th annual ACM symposium on principles of distributed computing, PODC '07, Portland, OR, USA, August 12--15, 2007. New York, NY: Association for Computing Machinery (ACM). 390--391 (2007; Zbl 1283.68103) Full Text: DOI OpenURL
Khuller, Samir; Kim, Yoo-Ah; Wan, Yung-Chun Algorithms for data migration with cloning. (English) Zbl 1101.68984 SIAM J. Comput. 33, No. 2, 448-461 (2004). MSC: 68W25 68Q25 05C15 PDF BibTeX XML Cite \textit{S. Khuller} et al., SIAM J. Comput. 33, No. 2, 448--461 (2004; Zbl 1101.68984) Full Text: DOI OpenURL
Liben-Nowell, David Gossip is synteny: Incomplete gossip and the syntenic distance between genomes. (English) Zbl 1005.68050 J. Algorithms 43, No. 2, 264-283 (2002). MSC: 68P10 68W05 PDF BibTeX XML Cite \textit{D. Liben-Nowell}, J. Algorithms 43, No. 2, 264--283 (2002; Zbl 1005.68050) Full Text: DOI OpenURL
Liben-Nowell, David Gossip is synteny: Incomplete gossip and an exact algorithm for syntenic distance. (English) Zbl 1006.92023 Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 177-185 (2001). MSC: 92D10 92-08 92C40 68R05 PDF BibTeX XML Cite \textit{D. Liben-Nowell}, in: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, SODA 2001, Washington, DC, USA, January 7--9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics; New York, NY: ACM, Association for Computing Machinery. 177--185 (2001; Zbl 1006.92023) OpenURL
Hromkovič, Juraj; Jeschke, Claus-Dieter; Monien, Burkhard Note on optimal gossiping in some weak-connected graphs. (English) Zbl 0824.68010 Theor. Comput. Sci. 127, No. 2, 395-402 (1994). MSC: 68M10 68R10 PDF BibTeX XML Cite \textit{J. Hromkovič} et al., Theor. Comput. Sci. 127, No. 2, 395--402 (1994; Zbl 0824.68010) Full Text: DOI OpenURL
Labahn, Roger Information flows on hypergraphs. (English) Zbl 0771.05075 Discrete Math. 113, No. 1-3, 71-97 (1993). MSC: 05C65 05A99 05C35 PDF BibTeX XML Cite \textit{R. Labahn}, Discrete Math. 113, No. 1--3, 71--97 (1993; Zbl 0771.05075) Full Text: DOI OpenURL
Loshkaryova, Svetlana Some characteristics of the graph information exchange systems. (English) Zbl 0769.05058 J. Inf. Process. Cybern. 29, No. 2, 87-100 (1993). MSC: 05C38 94A05 05C05 05C99 PDF BibTeX XML Cite \textit{S. Loshkaryova}, J. Inf. Process. Cybern. 29, No. 2, 87--100 (1993; Zbl 0769.05058) OpenURL
Diks, Krzysztof; Pelc, Andrzej Almost safe gossiping in bounded degree networks. (English) Zbl 0768.05060 SIAM J. Discrete Math. 5, No. 3, 338-344 (1992). MSC: 05C38 94C15 PDF BibTeX XML Cite \textit{K. Diks} and \textit{A. Pelc}, SIAM J. Discrete Math. 5, No. 3, 338--344 (1992; Zbl 0768.05060) Full Text: DOI OpenURL
Labahn, R. Mixed telephone problems. (English) Zbl 0706.05053 J. Comb. Math. Comb. Comput. 7, 33-51 (1990). MSC: 05C99 94A05 PDF BibTeX XML Cite \textit{R. Labahn}, J. Comb. Math. Comb. Comput. 7, 33--51 (1990; Zbl 0706.05053) OpenURL
Labahn, R.; Warnke, I. Quick gossiping by multi-telegraphs. (English) Zbl 0749.05061 Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, 451-458 (1990). Reviewer: K.R.Parthasarathy (Madras) MSC: 05C99 68R10 94A05 90B18 91D30 93A99 PDF BibTeX XML Cite \textit{R. Labahn} and \textit{I. Warnke}, in: Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel. Heidelberg: Physica-Verlag. 451--458 (1990; Zbl 0749.05061) OpenURL
Seress, Ákos Quick gossiping without duplicate transmissions. (English) Zbl 0722.05059 Combinatorial mathematics, Proc. 3rd Int. Conf., New York/ NY (USA) 1985, Ann. N. Y. Acad. Sci. 555, 375-382 (1989). Reviewer: K.R.Parthasarathy (Madras) MSC: 05C99 05C38 94A05 68M10 90B18 91D30 93A99 PDF BibTeX XML OpenURL
Seress, Akos Quick gossiping by conference calls. (English) Zbl 0691.05033 SIAM J. Discrete Math. 1, No. 1, 109-120 (1988). Reviewer: D.J.Kleitman MSC: 05C65 PDF BibTeX XML Cite \textit{A. Seress}, SIAM J. Discrete Math. 1, No. 1, 109--120 (1988; Zbl 0691.05033) Full Text: DOI OpenURL
Haddad, Ramsey W.; Roy, Shaibal; Schäffer, Alejandro A. On gossiping with faulty telephone lines. (English) Zbl 0626.05033 SIAM J. Algebraic Discrete Methods 8, 439-445 (1987). MSC: 05C38 94C15 PDF BibTeX XML Cite \textit{R. W. Haddad} et al., SIAM J. Algebraic Discrete Methods 8, 439--445 (1987; Zbl 0626.05033) Full Text: DOI OpenURL
Labahn, Roger The telephone problem for trees. (English) Zbl 0606.05022 Elektron. Informationsverarbeitung Kybernetik 22, 475-485 (1986). Reviewer: V.Peteanu MSC: 05C05 PDF BibTeX XML Cite \textit{R. Labahn}, Elektron. Informationsverarbeitung Kybernetik 22, 475--485 (1986; Zbl 0606.05022) OpenURL
Seress, Ákos Quick gossiping without duplicate transmissions. (English) Zbl 0601.05029 Graphs Comb. 2, 363-381 (1986). MSC: 05C38 94A05 05C99 PDF BibTeX XML Cite \textit{Á. Seress}, Graphs Comb. 2, 363--381 (1986; Zbl 0601.05029) Full Text: DOI OpenURL
West, Douglas B. Gossiping without duplicate transmissions. (English) Zbl 0497.05039 SIAM J. Algebraic Discrete Methods 3, 418-419 (1982). MSC: 05C38 94A05 05C99 PDF BibTeX XML Cite \textit{D. B. West}, SIAM J. Algebraic Discrete Methods 3, 418--419 (1982; Zbl 0497.05039) Full Text: DOI OpenURL
West, Douglas B. A class of solutions to the gossip problem. II. (English) Zbl 0497.05038 Discrete Math. 40, 87-113 (1982). MSC: 05C38 94A05 05C99 05C70 PDF BibTeX XML Cite \textit{D. B. West}, Discrete Math. 40, 87--113 (1982; Zbl 0497.05038) Full Text: DOI OpenURL
West, Douglas B. A class of solutions to the gossip problem. I. (English) Zbl 0497.05037 Discrete Math. 39, 307-326 (1982). MSC: 05C38 94A05 05C99 05C75 05C70 PDF BibTeX XML Cite \textit{D. B. West}, Discrete Math. 39, 307--326 (1982; Zbl 0497.05037) Full Text: DOI OpenURL
Bumby, Richard T. A problem with telephones. (English) Zbl 0499.05034 SIAM J. Algebraic Discrete Methods 2, 13-18 (1981). MSC: 05C35 05C38 05C40 PDF BibTeX XML Cite \textit{R. T. Bumby}, SIAM J. Algebraic Discrete Methods 2, 13--18 (1981; Zbl 0499.05034) Full Text: DOI OpenURL
Entringer, Roger C.; Slater, Peter J. Gossips and telegraphs. (English) Zbl 0408.05051 J. Franklin Inst. 307, 353-360 (1979). MSC: 05C99 PDF BibTeX XML Cite \textit{R. C. Entringer} and \textit{P. J. Slater}, J. Franklin Inst. 307, 353--360 (1979; Zbl 0408.05051) Full Text: DOI OpenURL
Bermond, J.-C. Le problème des ”ouvroirs” (hypergraph gossip problem). (French) Zbl 0413.05047 Problèmes combinatoires et théorie des graphes, Orsay 1976, Colloq. int. CNRS No. 260, 31-34 (1978). MSC: 05C65 PDF BibTeX XML OpenURL