Chen, Xudong; Belabbas, Mohamed-Ali; Liu, Ji Gossip over holonomic graphs. (English) Zbl 1480.93018 Automatica 136, Article ID 110088, 9 p. (2022). MSC: 93A16 93D50 93E03 15B51 PDF BibTeX XML Cite \textit{X. Chen} et al., Automatica 136, Article ID 110088, 9 p. (2022; Zbl 1480.93018) Full Text: DOI arXiv OpenURL
Erlebach, Thomas; Hoffmann, Michael; Kammer, Frank On temporal graph exploration. (English) Zbl 1477.68222 J. Comput. Syst. Sci. 119, 1-18 (2021). MSC: 68R10 68Q17 68Q25 68W15 90C27 PDF BibTeX XML Cite \textit{T. Erlebach} et al., J. Comput. Syst. Sci. 119, 1--18 (2021; Zbl 1477.68222) Full Text: DOI arXiv OpenURL
Czyzowicz, Jurek; Dereniowski, Dariusz; Ostrowski, Robert; Rytter, Wojciech Gossiping by energy-constrained mobile agents in tree networks. (English) Zbl 1497.68027 Theor. Comput. Sci. 861, 45-65 (2021). MSC: 68M10 68R10 PDF BibTeX XML Cite \textit{J. Czyzowicz} et al., Theor. Comput. Sci. 861, 45--65 (2021; Zbl 1497.68027) Full Text: DOI OpenURL
Daum, Sebastian; Kuhn, Fabian; Maus, Yannic Rumor spreading with bounded in-degree. (English) Zbl 1432.68017 Theor. Comput. Sci. 810, 43-57 (2020). MSC: 68M12 68M10 68R10 PDF BibTeX XML Cite \textit{S. Daum} et al., Theor. Comput. Sci. 810, 43--57 (2020; Zbl 1432.68017) Full Text: DOI arXiv OpenURL
Ghaffari, Mohsen; Kuhn, Fabian Distributed MST and broadcast with fewer messages, and faster gossiping. (English) Zbl 1497.68564 Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 30, 12 p. (2018). MSC: 68W15 68R10 PDF BibTeX XML Cite \textit{M. Ghaffari} and \textit{F. Kuhn}, LIPIcs -- Leibniz Int. Proc. Inform. 121, Article 30, 12 p. (2018; Zbl 1497.68564) Full Text: DOI OpenURL
Fertin, Guillaume; Peters, Joseph G. Optimal odd gossiping. (English) Zbl 1423.68047 Discrete Appl. Math. 247, 53-69 (2018). MSC: 68M10 90B18 94A05 PDF BibTeX XML Cite \textit{G. Fertin} and \textit{J. G. Peters}, Discrete Appl. Math. 247, 53--69 (2018; Zbl 1423.68047) Full Text: DOI OpenURL
Chrobak, Marek; Costello, Kevin P.; Gasieniec, Leszek; Kowalski, Dariusz R. Information gathering in ad-hoc radio networks with tree topology. (English) Zbl 1382.68025 Inf. Comput. 258, 1-27 (2018). MSC: 68M12 PDF BibTeX XML Cite \textit{M. Chrobak} et al., Inf. Comput. 258, 1--27 (2018; Zbl 1382.68025) Full Text: DOI arXiv OpenURL
Hollander Shabtai, R.; Roditty, Y. Gossiping and set-to-set broadcasting in weighted graphs. (English) Zbl 1367.05096 J. Comb. Math. Comb. Comput. 100, 9-25 (2017). MSC: 05C22 05C40 05C85 PDF BibTeX XML Cite \textit{R. Hollander Shabtai} and \textit{Y. Roditty}, J. Comb. Math. Comb. Comput. 100, 9--25 (2017; Zbl 1367.05096) OpenURL
Fertin, Guillaume; Peters, Joseph G.; Raabe, Lynette; Xu, Charlie Odd gossiping. (English) Zbl 1372.68028 Discrete Appl. Math. 216, Part 3, 550-561 (2017). MSC: 68M10 90B18 94A05 PDF BibTeX XML Cite \textit{G. Fertin} et al., Discrete Appl. Math. 216, Part 3, 550--561 (2017; Zbl 1372.68028) Full Text: DOI OpenURL
He, F.; Mou, S.; Liu, J.; Morse, A. S. Convergence rate on periodic gossiping. (English) Zbl 1427.68026 Inf. Sci. 364-365, 111-125 (2016). MSC: 68M14 68M10 68M12 PDF BibTeX XML Cite \textit{F. He} et al., Inf. Sci. 364--365, 111--125 (2016; Zbl 1427.68026) Full Text: DOI OpenURL
Czumaj, Artur; Davies, Peter Communicating with beeps. (English) Zbl 1380.68017 Anceaume, Emmanuelle (ed.) et al., 19th international conference on principles of distributed systems, OPODIS 2015, Rennes, France, December 14–17, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-98-9). LIPIcs – Leibniz International Proceedings in Informatics 46, Article 30, 16 p. (2016). MSC: 68M10 PDF BibTeX XML Cite \textit{A. Czumaj} and \textit{P. Davies}, LIPIcs -- Leibniz Int. Proc. Inform. 46, Article 30, 16 p. (2016; Zbl 1380.68017) Full Text: DOI arXiv OpenURL
Daum, Sebastian; Kuhn, Fabian; Maus, Yannic Rumor spreading with bounded in-degree. (English) Zbl 1437.68017 Suomela, Jukka (ed.), Structural information and communication complexity. 23rd international colloquium, SIROCCO 2016, Helsinki, Finland, July 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9988, 323-339 (2016). MSC: 68M12 68M10 68R10 PDF BibTeX XML Cite \textit{S. Daum} et al., Lect. Notes Comput. Sci. 9988, 323--339 (2016; Zbl 1437.68017) Full Text: DOI arXiv OpenURL
Czyzowicz, Jurek; Kranakis, Evangelos; Pacheco, Eduardo; Pająk, Dominik Information spreading by mobile particles on a line. (English) Zbl 1471.68094 Scheideler, Christian (ed.), Structural information and communication complexity. 22nd international colloquium, SIROCCO 2015, Montserrat, Spain, July 14–16, 2015. Post-proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9439, 285-298 (2015). MSC: 68Q11 68U05 70F35 PDF BibTeX XML Cite \textit{J. Czyzowicz} et al., Lect. Notes Comput. Sci. 9439, 285--298 (2015; Zbl 1471.68094) Full Text: DOI OpenURL
Dieudonné, Yoann; Pelc, Andrzej; Villain, Vincent How to meet asynchronously at polynomial cost. (English) Zbl 1325.68252 SIAM J. Comput. 44, No. 3, 844-867 (2015). MSC: 68W15 68Q25 PDF BibTeX XML Cite \textit{Y. Dieudonné} et al., SIAM J. Comput. 44, No. 3, 844--867 (2015; Zbl 1325.68252) Full Text: DOI arXiv OpenURL
Mans, Bernard; Shparlinski, Igor Random walks, bisections and gossiping in circulant graphs. (English) Zbl 1306.05227 Algorithmica 70, No. 2, 301-325 (2014). MSC: 05C81 05C80 05C85 05C25 PDF BibTeX XML Cite \textit{B. Mans} and \textit{I. Shparlinski}, Algorithmica 70, No. 2, 301--325 (2014; Zbl 1306.05227) Full Text: DOI OpenURL
Thomson, Alison; Zhou, Sanming Rotational circulant graphs. (English) Zbl 1300.05125 Discrete Appl. Math. 162, 296-305 (2014). MSC: 05C25 05C40 05C60 PDF BibTeX XML Cite \textit{A. Thomson} and \textit{S. Zhou}, Discrete Appl. Math. 162, 296--305 (2014; Zbl 1300.05125) Full Text: DOI arXiv OpenURL
Xin, Qin; Manne, Fredrik; Yao, Xiaolan Latency-optimal communication in wireless mesh networks. (English) Zbl 1282.68081 Theor. Comput. Sci. 528, 79-84 (2014). MSC: 68M10 68M20 68W25 PDF BibTeX XML Cite \textit{Q. Xin} et al., Theor. Comput. Sci. 528, 79--84 (2014; Zbl 1282.68081) Full Text: DOI OpenURL
Vaya, Shailesh Information dissemination in unknown radio networks with large labels. (English) Zbl 1358.68027 Theor. Comput. Sci. 520, 11-26 (2014). MSC: 68M10 68M12 PDF BibTeX XML Cite \textit{S. Vaya}, Theor. Comput. Sci. 520, 11--26 (2014; Zbl 1358.68027) Full Text: DOI arXiv OpenURL
Dieudonné, Yoann; Pelc, Andrzej; Villain, Vincent How to meet asynchronously at polynomial cost. (English) Zbl 1323.68553 Proceedings of the 2013 ACM symposium on principles of distributed computing, PODC ’13, Montreal, QC, Canada, July 22–24, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2065-8). 92-99 (2013). MSC: 68W15 05C85 68M12 68M14 68Q17 68R10 PDF BibTeX XML Cite \textit{Y. Dieudonné} et al., in: Proceedings of the 32nd ACM symposium on principles of distributed computing, PODC '13, Montreal, QC, Canada, July 22--24, 2013. New York, NY: Association for Computing Machinery (ACM). 92--99 (2013; Zbl 1323.68553) Full Text: DOI arXiv OpenURL
Vaya, Shailesh Round complexity of leader election and gossiping in bidirectional radio networks. (English) Zbl 1287.68013 Inf. Process. Lett. 113, No. 9, 307-312 (2013). MSC: 68M10 68M12 68Q25 PDF BibTeX XML Cite \textit{S. Vaya}, Inf. Process. Lett. 113, No. 9, 307--312 (2013; Zbl 1287.68013) Full Text: DOI OpenURL
Farach-Colton, Martín; Anta, Antonio Fernández; Mosteiro, Miguel A. Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound). (English) Zbl 1259.68016 Theor. Comput. Sci. 472, 60-80 (2013). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{M. Farach-Colton} et al., Theor. Comput. Sci. 472, 60--80 (2013; Zbl 1259.68016) Full Text: DOI OpenURL
Xin, Qin; Manne, Fredrik; Zhang, Yan; Wang, Xin Almost optimal distributed M2M multicasting in wireless mesh networks. (English) Zbl 1247.68030 Theor. Comput. Sci. 439, 69-82 (2012). MSC: 68M14 68M10 68W15 68R10 PDF BibTeX XML Cite \textit{Q. Xin} et al., Theor. Comput. Sci. 439, 69--82 (2012; Zbl 1247.68030) Full Text: DOI OpenURL
Clementi, Andrea; Monti, Angelo; Pasquale, Francesco; Silvestri, Riccardo Optimal gossiping in geometric radio networks in the presence of dynamical faults. (English) Zbl 1242.68011 Networks 59, No. 3, 289-298 (2012). MSC: 68M12 68M10 68M15 PDF BibTeX XML Cite \textit{A. Clementi} et al., Networks 59, No. 3, 289--298 (2012; Zbl 1242.68011) Full Text: DOI OpenURL
Monakhova, È. A. Structural and communicative properties of circulant networks. (Russian. English summary) Zbl 07310081 Prikl. Diskretn. Mat. 2011, No. 3(13), 92-115 (2011). MSC: 05-XX 68-XX PDF BibTeX XML Cite \textit{È. A. Monakhova}, Prikl. Diskretn. Mat. 2011, No. 3(13), 92--115 (2011; Zbl 07310081) Full Text: MNR OpenURL
Gong, Zheng; Tang, Qiang; Law, Yee Wei; Chen, Hongyang Kalwen+: practical key management schemes for gossip-based wireless medical sensor networks. (English) Zbl 1295.94073 Lai, Xuejia (ed.) et al., Information security and cryptology. 6th international conference, Inscrypt 2010, Shanghai, China, October 20–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-21517-9/pbk). Lecture Notes in Computer Science 6584, 268-283 (2011). MSC: 94A60 PDF BibTeX XML Cite \textit{Z. Gong} et al., Lect. Notes Comput. Sci. 6584, 268--283 (2011; Zbl 1295.94073) Full Text: DOI Link OpenURL
Chlebus, Bogdan S.; Kowalski, Dariusz R.; Pelc, Andrzej; Rokicki, Mariusz A. Efficient distributed communication in ad-hoc radio networks. (English) Zbl 1333.68029 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 613-624 (2011). MSC: 68M10 68W15 PDF BibTeX XML Cite \textit{B. S. Chlebus} et al., Lect. Notes Comput. Sci. 6756, 613--624 (2011; Zbl 1333.68029) Full Text: DOI OpenURL
Thomson, Alison; Zhou, Sanming Gossiping and routing in undirected triple-loop networks. (English) Zbl 1202.90045 Networks 55, No. 4, 341-349 (2010). MSC: 90B10 05C82 68M10 PDF BibTeX XML Cite \textit{A. Thomson} and \textit{S. Zhou}, Networks 55, No. 4, 341--349 (2010; Zbl 1202.90045) Full Text: DOI OpenURL
Anderson, Brian D. O.; Yu, Changbin; Morse, A. Stephen Convergence of periodic gossiping algorithms. (English) Zbl 1195.94103 Willems, Jan C. (ed.) et al., Perspectives in mathematical system theory, control, and signal processing. A Festschrift in honor of Yutaka Yamamoto on the occasion of his 60th birthday. Invited papers of the symposium, Kyoto, Japan, March 29–31, 2010. Berlin: Springer (ISBN 978-3-540-93917-7/pbk; 978-3-540-93918-4/ebook). Lecture Notes in Control and Information Sciences 398, 127-138 (2010). MSC: 94C15 PDF BibTeX XML Cite \textit{B. D. O. Anderson} et al., Lect. Notes Control Inf. Sci. 398, 127--138 (2010; Zbl 1195.94103) Full Text: DOI OpenURL
Ogston, Elth; Jarvis, Stephen A. Peer-to-peer aggregation techniques dissected. (English) Zbl 1191.68085 Int. J. Parallel Emergent Distrib. Syst. 25, No. 1, 51-71 (2010). MSC: 68M14 PDF BibTeX XML Cite \textit{E. Ogston} and \textit{S. A. Jarvis}, Int. J. Parallel Emergent Distrib. Syst. 25, No. 1, 51--71 (2010; Zbl 1191.68085) Full Text: DOI OpenURL
Masuzawa, Toshimitsu; Tixeuil, Sébastien Quiescence of self-stabilizing gossiping among mobile agents in graphs. (English) Zbl 1191.68730 Theor. Comput. Sci. 411, No. 14-15, 1567-1582 (2010). MSC: 68T42 68W15 68R10 PDF BibTeX XML Cite \textit{T. Masuzawa} and \textit{S. Tixeuil}, Theor. Comput. Sci. 411, No. 14--15, 1567--1582 (2010; Zbl 1191.68730) Full Text: DOI Link OpenURL
Huber, Anna; Fountoulakis, Nikolaos Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting. (English) Zbl 1273.05204 Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 553-559 (2009). MSC: 05C80 05C78 94A05 68M12 PDF BibTeX XML Cite \textit{A. Huber} and \textit{N. Fountoulakis}, Electron. Notes Discrete Math. 34, 553--559 (2009; Zbl 1273.05204) Full Text: DOI OpenURL
Doerr, Benjamin; Fouz, Mahmoud A time-randomness tradeoff for quasi-random rumour spreading. (English) Zbl 1273.05199 Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 335-339 (2009). MSC: 05C80 05C90 90B10 94A05 68M12 PDF BibTeX XML Cite \textit{B. Doerr} and \textit{M. Fouz}, Electron. Notes Discrete Math. 34, 335--339 (2009; Zbl 1273.05199) Full Text: DOI OpenURL
Doerr, Benjamin; Friedrich, Tobias; Sauerwald, Thomas Quasirandom rumor spreading on expanders. (English) Zbl 1273.05200 Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 243-247 (2009). MSC: 05C80 05C90 90B10 94A05 68M12 PDF BibTeX XML Cite \textit{B. Doerr} et al., Electron. Notes Discrete Math. 34, 243--247 (2009; Zbl 1273.05200) Full Text: DOI OpenURL
Zhou, Sanming A class of arc-transitive Cayley graphs as models for interconnection networks. (English) Zbl 1191.05056 SIAM J. Discrete Math. 23, No. 2, 694-714 (2009). MSC: 05C25 68M10 68R10 90B18 PDF BibTeX XML Cite \textit{S. Zhou}, SIAM J. Discrete Math. 23, No. 2, 694--714 (2009; Zbl 1191.05056) Full Text: DOI OpenURL
Li, Wenjia; Parker, James; Joshi, Anupam Security through collaboration in manets. (English) Zbl 1184.68041 Bertino, Elisa (ed.) et al., Collaborative computing: networking, applications and worksharing. 4th international ICST conference, CollaborateCom 2008, Orlando, FL, USA, November 13–16, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-642-03353-7/pbk; 978-3-642-03354-4/ebook). Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering 10, 696-714 (2009). MSC: 68M10 PDF BibTeX XML Cite \textit{W. Li} et al., in: Collaborative computing: networking, applications and worksharing. 4th international ICST conference, CollaborateCom 2008, Orlando, FL, USA, November 13--16, 2008. Revised selected papers. Berlin: Springer. 696--714 (2009; Zbl 1184.68041) Full Text: DOI OpenURL
Scholtes, Ingo; Botev, Jean; Esch, Markus; Schloss, Hermann; Sturm, Peter Using epidemic hoarding to minimize load delays in P2P distributed virtual environments. (English) Zbl 1184.68051 Bertino, Elisa (ed.) et al., Collaborative computing: networking, applications and worksharing. 4th international ICST conference, CollaborateCom 2008, Orlando, FL, USA, November 13–16, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-642-03353-7/pbk; 978-3-642-03354-4/ebook). Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering 10, 578-593 (2009). MSC: 68M10 PDF BibTeX XML Cite \textit{I. Scholtes} et al., in: Collaborative computing: networking, applications and worksharing. 4th international ICST conference, CollaborateCom 2008, Orlando, FL, USA, November 13--16, 2008. Revised selected papers. Berlin: Springer. 578--593 (2009; Zbl 1184.68051) Full Text: DOI OpenURL
Ozkasap, Oznur; Caglar, Mine; Cem, Emrah; Ahi, Emrah; Iskender, Emre Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination. (English) Zbl 1191.68054 Comput. Netw. 53, No. 13, 2259-2274 (2009). MSC: 68M10 68M20 PDF BibTeX XML Cite \textit{O. Ozkasap} et al., Comput. Netw. 53, No. 13, 2259--2274 (2009; Zbl 1191.68054) Full Text: DOI OpenURL
Hou, Zhe; Shigeno, Maiko New bounds on the minimum number of calls in failure-tolerant gossiping. (English) Zbl 1192.68039 Networks 53, No. 1, 35-38 (2009). MSC: 68M10 90B18 PDF BibTeX XML Cite \textit{Z. Hou} and \textit{M. Shigeno}, Networks 53, No. 1, 35--38 (2009; Zbl 1192.68039) Full Text: DOI OpenURL
Berenbrink, Petra; Cooper, Colin; Hu, Zengjian Energy efficient randomised communication in unknown AdHoc networks. (English) Zbl 1172.68002 Theor. Comput. Sci. 410, No. 27-29, 2549-2561 (2009). MSC: 68M10 68W20 PDF BibTeX XML Cite \textit{P. Berenbrink} et al., Theor. Comput. Sci. 410, No. 27--29, 2549--2561 (2009; Zbl 1172.68002) Full Text: DOI OpenURL
Cicalese, Ferdinando; Manne, Fredrik; Xin, Qin Faster deterministic communication in radio networks. (English) Zbl 1165.90005 Algorithmica 54, No. 2, 226-242 (2009). MSC: 90B18 PDF BibTeX XML Cite \textit{F. Cicalese} et al., Algorithmica 54, No. 2, 226--242 (2009; Zbl 1165.90005) Full Text: DOI OpenURL
Chlebus, Bogdan S.; Kowalski, Dariusz R.; Radzik, Tomasz Many-to-many communication in radio networks. (English) Zbl 1188.68016 Algorithmica 54, No. 1, 118-139 (2009). MSC: 68M10 68M12 PDF BibTeX XML Cite \textit{B. S. Chlebus} et al., Algorithmica 54, No. 1, 118--139 (2009; Zbl 1188.68016) Full Text: DOI OpenURL
Sinha, Koushik; Ghose, Suranjan; Srimani, Pradip K. Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks. (English) Zbl 1243.68031 J. Parallel Distrib. Comput. 68, No. 7, 922-938 (2008). MSC: 68M10 68R10 PDF BibTeX XML Cite \textit{K. Sinha} et al., J. Parallel Distrib. Comput. 68, No. 7, 922--938 (2008; Zbl 1243.68031) Full Text: DOI OpenURL
Lei, Xiaoqiang Information dissemination in weighted trees. (English) Zbl 1199.05042 J. Yunnan Nation. Univ., Nat. Sci. 17, No. 2, 109-110 (2008). MSC: 05C05 94A15 68R10 PDF BibTeX XML Cite \textit{X. Lei}, J. Yunnan Nation. Univ., Nat. Sci. 17, No. 2, 109--110 (2008; Zbl 1199.05042) OpenURL
Thomson, Alison; Zhou, Sanming Frobenius circulant graphs of valency four. (English) Zbl 1167.05036 J. Aust. Math. Soc. 85, No. 2, 269-282 (2008). MSC: 05C25 68M10 90B18 PDF BibTeX XML Cite \textit{A. Thomson} and \textit{S. Zhou}, J. Aust. Math. Soc. 85, No. 2, 269--282 (2008; Zbl 1167.05036) Full Text: DOI OpenURL
Gąsieniec, Leszek; Peleg, David; Xin, Qin Faster communication in known topology radio networks. (English) Zbl 1266.68026 Distrib. Comput. 19, No. 4, 289-300 (2007). MSC: 68M10 05C85 68W20 68M20 05C10 PDF BibTeX XML Cite \textit{L. Gąsieniec} et al., Distrib. Comput. 19, No. 4, 289--300 (2007; Zbl 1266.68026) Full Text: DOI OpenURL
Dubhashi, Devdatt; Häggström, Olle; Orecchia, Lorenzo; Panconesi, Alessandro; Petrioli, Chiara; Vitaletti, Andrea Localized techniques for broadcasting in wireless sensor networks. (English) Zbl 1153.68317 Algorithmica 49, No. 4, 412-446 (2007). MSC: 68M10 68M12 PDF BibTeX XML Cite \textit{D. Dubhashi} et al., Algorithmica 49, No. 4, 412--446 (2007; Zbl 1153.68317) Full Text: DOI OpenURL
Chrobak, Marek; Gąsieniec, Leszek; Kowalski, Dariusz R. The wake-up problem in multihop radio networks. (English) Zbl 1124.68005 SIAM J. Comput. 36, No. 5, 1453-1471 (2007). MSC: 68M10 68M12 68M14 68Q25 PDF BibTeX XML Cite \textit{M. Chrobak} et al., SIAM J. Comput. 36, No. 5, 1453--1471 (2007; Zbl 1124.68005) Full Text: DOI OpenURL
Wang, Rui; Lau, Francis C. M. Optimal gossiping in square 2D meshes. (English) Zbl 1125.68008 Theor. Comput. Sci. 384, No. 2-3, 263-286 (2007). MSC: 68M10 68M20 PDF BibTeX XML Cite \textit{R. Wang} and \textit{F. C. M. Lau}, Theor. Comput. Sci. 384, No. 2--3, 263--286 (2007; Zbl 1125.68008) Full Text: DOI OpenURL
Gąsieniec, Leszek; Potapov, Igor; Xin, Qin Time efficient centralized gossiping in radio networks. (English) Zbl 1124.68008 Theor. Comput. Sci. 383, No. 1, 45-58 (2007). MSC: 68M10 90B18 PDF BibTeX XML Cite \textit{L. Gąsieniec} et al., Theor. Comput. Sci. 383, No. 1, 45--58 (2007; Zbl 1124.68008) Full Text: DOI OpenURL
Uchida, Jiro; Chen, Wei; Wada, Koichi Acknowledged broadcasting and gossiping in ad hoc radio networks. (English) Zbl 1118.68022 Theor. Comput. Sci. 377, No. 1-3, 43-54 (2007). MSC: 68M10 68R10 90B18 PDF BibTeX XML Cite \textit{J. Uchida} et al., Theor. Comput. Sci. 377, No. 1--3, 43--54 (2007; Zbl 1118.68022) Full Text: DOI OpenURL
Cicalese, Ferdinando; Manne, Fredrik; Xin, Qin Faster centralized communication in radio networks. (English) Zbl 1135.90313 Asano, Tetsuo (ed.), Algorithms and computation. 17th international symposium, ISAAC 2006, Kolkata, India, December 18–20, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49694-6/pbk). Lecture Notes in Computer Science 4288, 339-348 (2006). MSC: 90B18 PDF BibTeX XML Cite \textit{F. Cicalese} et al., Lect. Notes Comput. Sci. 4288, 339--348 (2006; Zbl 1135.90313) Full Text: DOI OpenURL
Manne, Fredrik; Xin, Qin Optimal gossiping with unit size messages in known topology radio networks. (English) Zbl 1137.68321 Erlebach, Thomas (ed.), Combinatorial and algorithmic aspects of networking. Third workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-48822-4/pbk). Lecture Notes in Computer Science 4235, 125-134 (2006). MSC: 68M10 68M20 PDF BibTeX XML Cite \textit{F. Manne} and \textit{Q. Xin}, Lect. Notes Comput. Sci. 4235, 125--134 (2006; Zbl 1137.68321) Full Text: DOI OpenURL
Shi, Zhengnan; Srimani, Pradip K. An online distributed gossiping protocol for mobile networks. (English) Zbl 1132.90314 J. Comb. Optim. 11, No. 1, 87-97 (2006). MSC: 90B18 PDF BibTeX XML Cite \textit{Z. Shi} and \textit{P. K. Srimani}, J. Comb. Optim. 11, No. 1, 87--97 (2006; Zbl 1132.90314) Full Text: DOI OpenURL
Chlebus, Bogdan S.; Kowalski, Dariusz R. Robust gossiping with an application to consensus. (English) Zbl 1119.68222 J. Comput. Syst. Sci. 72, No. 8, 1262-1281 (2006). MSC: 68W15 68M14 PDF BibTeX XML Cite \textit{B. S. Chlebus} and \textit{D. R. Kowalski}, J. Comput. Syst. Sci. 72, No. 8, 1262--1281 (2006; Zbl 1119.68222) Full Text: DOI OpenURL
Gasieniec, Leszek; Peleg, David; Xin, Qin Faster communication in known topology radio networks. (English) Zbl 1314.68155 Proceedings of the 24th annual ACM symposium on principles of distributed computing, PODC ’05, Las Vegas, NV, USA, July 17–20, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-994-2). 129-137 (2005). MSC: 68Q25 05C85 68M10 68Q17 68R10 68W20 68W25 PDF BibTeX XML Cite \textit{L. Gasieniec} et al., in: Proceedings of the 24th annual ACM symposium on principles of distributed computing, PODC '05, Las Vegas, NV, USA, July 17--20, 2005. New York, NY: Association for Computing Machinery (ACM). 129--137 (2005; Zbl 1314.68155) Full Text: DOI OpenURL
Wang, Rui; Lau, Francis C. M. Optimal gossiping in square meshes in all-port mode and with short packets. (English) Zbl 1085.68523 Pelc, Andrzej (ed.) et al., Structural information and communication complexity. 12th international colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24–26, 2005. Proceedings. Berlin: Springer (ISBN 3-540-26052-8/pbk). Lecture Notes in Computer Science 3499, 292-306 (2005). MSC: 68M10 PDF BibTeX XML Cite \textit{R. Wang} and \textit{F. C. M. Lau}, Lect. Notes Comput. Sci. 3499, 292--306 (2005; Zbl 1085.68523) Full Text: DOI OpenURL
Kim, Jae-Hoon; Lee, Jae-Ha; Chwa, Kyung-Yong Improved gossipings by short messages in 2-dimensional meshes. (English) Zbl 1071.68505 J. Parallel Distrib. Comput. 65, No. 7, 793-800 (2005). MSC: 68M10 68W10 PDF BibTeX XML Cite \textit{J.-H. Kim} et al., J. Parallel Distrib. Comput. 65, No. 7, 793--800 (2005; Zbl 1071.68505) Full Text: DOI OpenURL
Sibeyn, Jop F. Faster gossiping on butterfly networks. (English) Zbl 1079.68008 Theor. Comput. Sci. 331, No. 1, 53-72 (2005). MSC: 68M10 68W05 PDF BibTeX XML Cite \textit{J. F. Sibeyn}, Theor. Comput. Sci. 331, No. 1, 53--72 (2005; Zbl 1079.68008) Full Text: DOI OpenURL
Flammini, Michele; Pérennés, Stéphane Lower bounds on systolic gossip. (English) Zbl 1105.68006 Inf. Comput. 196, No. 2, 71-94 (2005). MSC: 68M14 68M12 PDF BibTeX XML Cite \textit{M. Flammini} and \textit{S. Pérennés}, Inf. Comput. 196, No. 2, 71--94 (2005; Zbl 1105.68006) Full Text: DOI OpenURL
Uchida, Jiro; Chen, Wei; Wada, Koichi Acknowledged broadcasting and gossiping in ad hoc radio networks. (English) Zbl 1078.68579 Papatriantafilou, Marina (ed.) et al., Principle of distributed systems. 7th international conference, OPODIS 2003, La Martinique, French West Indies, December 10–13, 2003. Revised selected papers. Berlin: Springer (ISBN 3-540-22667-2/pbk). Lecture Notes in Computer Science 3144, 223-234 (2004). MSC: 68M14 68M10 68R10 90B18 PDF BibTeX XML Cite \textit{J. Uchida} et al., Lect. Notes Comput. Sci. 3144, 223--234 (2004; Zbl 1078.68579) Full Text: DOI OpenURL
Sinha, Koushik; Srimani, Pradip K. Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal. (English) Zbl 1113.68343 Das, Nabanita (ed.) et al., Distributed computing – IWDC 2004. 6th international workshop, Kolkata, India, December 27–30, 2004. Proceedings. Berlin: Springer (ISBN 3-540-24076-4/pbk). Lecture Notes in Computer Science 3326, 459-470 (2004). MSC: 68M14 PDF BibTeX XML Cite \textit{K. Sinha} and \textit{P. K. Srimani}, Lect. Notes Comput. Sci. 3326, 459--470 (2004; Zbl 1113.68343) Full Text: DOI OpenURL
Flammini, Michele; Pérennès, Stéphane Lower bounds on the broadcasting and gossiping time of restricted protocols. (English) Zbl 1101.68005 SIAM J. Discrete Math. 17, No. 4, 521-540 (2004). MSC: 68M10 68M12 68R05 68R10 PDF BibTeX XML Cite \textit{M. Flammini} and \textit{S. Pérennès}, SIAM J. Discrete Math. 17, No. 4, 521--540 (2004; Zbl 1101.68005) Full Text: DOI OpenURL
Chauve, Cedric; Fertin, Guillaume On maximal instances for the original syntenic distance. (English) Zbl 1071.92502 Theor. Comput. Sci. 326, No. 1-3, 29-43 (2004). MSC: 92D10 92D15 PDF BibTeX XML Cite \textit{C. Chauve} and \textit{G. Fertin}, Theor. Comput. Sci. 326, No. 1--3, 29--43 (2004; Zbl 1071.92502) Full Text: DOI OpenURL
Salerni, Giulio On optimal fast solutions to the problem of gossiping by letters. (English) Zbl 1056.94004 Util. Math. 65, 159-162 (2004). MSC: 94A15 PDF BibTeX XML Cite \textit{G. Salerni}, Util. Math. 65, 159--162 (2004; Zbl 1056.94004) OpenURL
Chrobak, Marek; Gąsieniec, Leszek; Rytter, Wojciech A randomized algorithm for gossiping in radio networks. (English) Zbl 1069.68654 Networks 43, No. 2, 119-124 (2004). MSC: 68W20 68M10 90B18 PDF BibTeX XML Cite \textit{M. Chrobak} et al., Networks 43, No. 2, 119--124 (2004; Zbl 1069.68654) Full Text: DOI Link OpenURL
Fertin, Guillaume; Raspaud, André A survey on Knödel graphs. (English) Zbl 1062.68086 Discrete Appl. Math. 137, No. 2, 173-195 (2004). MSC: 68R10 68M10 PDF BibTeX XML Cite \textit{G. Fertin} and \textit{A. Raspaud}, Discrete Appl. Math. 137, No. 2, 173--195 (2004; Zbl 1062.68086) Full Text: DOI OpenURL
Lau, Francis C. M.; Zhang, S. H. Optimal gossiping in paths and cycles. (English) Zbl 1077.68120 J. Discrete Algorithms 1, No. 5-6, 461-475 (2003). MSC: 68W40 68M10 PDF BibTeX XML Cite \textit{F. C. M. Lau} and \textit{S. H. Zhang}, J. Discrete Algorithms 1, No. 5--6, 461--475 (2003; Zbl 1077.68120) Full Text: DOI OpenURL
Xu, Ying An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks. (English) Zbl 1045.68026 Algorithmica 36, No. 1, 93-96 (2003). MSC: 68M14 68M10 PDF BibTeX XML Cite \textit{Y. Xu}, Algorithmica 36, No. 1, 93--96 (2003; Zbl 1045.68026) Full Text: DOI OpenURL
Gąsieniec, Leszek; Lingas, Andrzej On adaptive deterministic gossiping in ad hoc radio networks. (English) Zbl 1093.68618 Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 689-690 (2002). MSC: 68R10 68M99 PDF BibTeX XML Cite \textit{L. Gąsieniec} and \textit{A. Lingas}, in: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2002, San Francisco, CA, USA, January 6--8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 689--690 (2002; Zbl 1093.68618) OpenURL
Gąsieniec, Leszek; Lingas, Andrzej On adaptive deterministic gossiping in ad hoc radio networks. (English) Zbl 1051.68077 Inf. Process. Lett. 83, No. 2, 89-93 (2002). MSC: 68Q25 PDF BibTeX XML Cite \textit{L. Gąsieniec} and \textit{A. Lingas}, Inf. Process. Lett. 83, No. 2, 89--93 (2002; Zbl 1051.68077) Full Text: DOI OpenURL
Berman, Kenneth A.; Paul, Jerome L. Verifiable broadcasting and gossiping in communication networks. (English) Zbl 1016.68004 Discrete Appl. Math. 118, No. 3, 293-298 (2002). MSC: 68M10 PDF BibTeX XML Cite \textit{K. A. Berman} and \textit{J. L. Paul}, Discrete Appl. Math. 118, No. 3, 293--298 (2002; Zbl 1016.68004) Full Text: DOI OpenURL
Meyer, Ulrich; Sibeyn, Jop F. Oblivious gossiping on tori. (English) Zbl 0990.68011 J. Algorithms 42, No. 1, 1-19 (2002). MSC: 68M10 PDF BibTeX XML Cite \textit{U. Meyer} and \textit{J. F. Sibeyn}, J. Algorithms 42, No. 1, 1--19 (2002; Zbl 0990.68011) Full Text: DOI Link OpenURL
Fraigniaud, Pierre Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode. (English) Zbl 1006.68959 Meyer auf der Heide, Friedhelm (ed.), Algorithms - ESA 2001. 9th annual European symposium, Århus, Denmark, August 28-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2161, 440-451 (2001). MSC: 68W25 68R10 PDF BibTeX XML Cite \textit{P. Fraigniaud}, Lect. Notes Comput. Sci. 2161, 440--451 (2001; Zbl 1006.68959) Full Text: Link OpenURL
Gargano, Luisa; Hell, Pavol; Perennes, Stephane Coloring all directed paths in a symmetric tree, with an application to optical networks. (English) Zbl 0996.05055 J. Graph Theory 38, No. 4, 183-196 (2001). MSC: 05C15 05C05 05C90 PDF BibTeX XML Cite \textit{L. Gargano} et al., J. Graph Theory 38, No. 4, 183--196 (2001; Zbl 0996.05055) Full Text: DOI OpenURL
Salerni, Giulio On optimal solutions to the problem of gossiping in minimum time. (English) Zbl 0985.94022 J. Comb. Math. Comb. Comput. 38, 73-79 (2001). Reviewer: Van Bang Le (Rostock) MSC: 94A15 68R10 94C15 05C85 PDF BibTeX XML Cite \textit{G. Salerni}, J. Comb. Math. Comb. Comput. 38, 73--79 (2001; Zbl 0985.94022) OpenURL
Amar, D.; Raspaud, A.; Togni, O. All-to-all wavelength-routing in all-optical compound networks. (English) Zbl 0977.05132 Discrete Math. 235, No. 1-3, 353-363 (2001). MSC: 05C90 90B18 68R10 PDF BibTeX XML Cite \textit{D. Amar} et al., Discrete Math. 235, No. 1--3, 353--363 (2001; Zbl 0977.05132) Full Text: DOI OpenURL
Flammini, Michele; Pérennès, Stéphane On the optimality of general lower bounds for broadcasting and gossiping. (English) Zbl 0968.68003 SIAM J. Discrete Math. 14, No. 2, 267-282 (2001). MSC: 68M10 68R10 68R05 05C80 PDF BibTeX XML Cite \textit{M. Flammini} and \textit{S. Pérennès}, SIAM J. Discrete Math. 14, No. 2, 267--282 (2001; Zbl 0968.68003) Full Text: DOI OpenURL
Fertin, Guillaume; Labahn, Roger Compounding of gossip graphs. (English) Zbl 0960.90010 Networks 36, No. 2, 126-137 (2000). MSC: 90B18 90C35 PDF BibTeX XML Cite \textit{G. Fertin} and \textit{R. Labahn}, Networks 36, No. 2, 126--137 (2000; Zbl 0960.90010) Full Text: DOI OpenURL
Bermond, Jean-Claude; Gargano, Luisa; Perennes, Stephan; Rescigno, Adele A.; Vaccaro, Ugo Efficient collective communciation in optical networks. (English) Zbl 0961.90020 Theor. Comput. Sci. 233, No. 1-2, 165-189 (2000). MSC: 90B18 68M10 94A05 PDF BibTeX XML Cite \textit{J.-C. Bermond} et al., Theor. Comput. Sci. 233, No. 1--2, 165--189 (2000; Zbl 0961.90020) Full Text: DOI OpenURL
Fertin, Guillaume A study of minimum gossip graphs. (English) Zbl 0983.94002 Discrete Math. 215, No. 1-3, 33-57 (2000). MSC: 94A05 05C35 PDF BibTeX XML Cite \textit{G. Fertin}, Discrete Math. 215, No. 1--3, 33--57 (2000; Zbl 0983.94002) Full Text: DOI OpenURL
Cohen, Johanne; Fraigniaud, Pierre; Gavoille, Cyril Recognizing bipartite incident-graphs of circulant digraphs. (English) Zbl 0941.05059 Widmayer, Peter (ed.) et al., Graph theoretic concepts in computer science. 25th international workshop, WG ’99, Ascona, Switzerland, June 17-19, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1665, 215-227 (1999). MSC: 05C85 05C20 05C60 PDF BibTeX XML Cite \textit{J. Cohen} et al., Lect. Notes Comput. Sci. 1665, 215--227 (1999; Zbl 0941.05059) OpenURL
Fraigniaud, Pierre Hierarchical broadcast networks. (English) Zbl 1339.90086 Inf. Process. Lett. 68, No. 6, 303-305 (1998). MSC: 90B18 05C90 PDF BibTeX XML Cite \textit{P. Fraigniaud}, Inf. Process. Lett. 68, No. 6, 303--305 (1998; Zbl 1339.90086) Full Text: DOI Link OpenURL
Konig, Jean-Claude; Krumme, David W.; Lazard, Emmanuel Diameter-preserving orientations of the torus. (English) Zbl 0990.05041 Networks 32, No. 1, 1-11 (1998). MSC: 05C12 05C20 PDF BibTeX XML Cite \textit{J.-C. Konig} et al., Networks 32, No. 1, 1--11 (1998; Zbl 0990.05041) Full Text: DOI OpenURL
Fertin, Guillaume; Raspaud, André Families of graphs having broadcasting and gossiping properties. (English) Zbl 0918.68083 Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 24th international workshop, WG ’98, Smolenice Castle, Slovak Republic, June 18–20, 1998. Proceecdings. Berlin: Springer. Lect. Notes Comput. Sci. 1517, 63-77 (1998). MSC: 68R10 PDF BibTeX XML Cite \textit{G. Fertin} and \textit{A. Raspaud}, Lect. Notes Comput. Sci. 1517, 63--77 (1998; Zbl 0918.68083) OpenURL
König, J.-C.; Rao, P. S.; Trystram, D. Analysis of gossiping algorithms with restricted buffers. (English) Zbl 0915.68014 Parallel Algorithms Appl. 13, No. 2, 117-133 (1998). MSC: 68M99 68Q25 68W15 PDF BibTeX XML Cite \textit{J. C. König} et al., Parallel Algorithms Appl. 13, No. 2, 117--133 (1998; Zbl 0915.68014) Full Text: DOI OpenURL
Gargano, Luisa; Rescigno, Adele A. Communication complexity of fault-tolerant information diffusion. (English) Zbl 0912.68028 Theor. Comput. Sci. 209, No. 1-2, 195-211 (1998). MSC: 68P99 PDF BibTeX XML Cite \textit{L. Gargano} and \textit{A. A. Rescigno}, Theor. Comput. Sci. 209, No. 1--2, 195--211 (1998; Zbl 0912.68028) Full Text: DOI OpenURL
Bermond, Jean-Claude; Gargano, Luisa; Perennes, Stephane Optimal sequential gossiping by short messages. (English) Zbl 0910.90132 Discrete Appl. Math. 86, No. 2-3, 145-155 (1998). MSC: 90B18 PDF BibTeX XML Cite \textit{J.-C. Bermond} et al., Discrete Appl. Math. 86, No. 2--3, 145--155 (1998; Zbl 0910.90132) Full Text: DOI Link OpenURL
Czumaj, Artur; Gasieniec, Leszek; Pelc, Andrzej Time and cost trade-offs in gossiping. (English) Zbl 0929.05077 SIAM J. Discrete Math. 11, No. 3, 400-413 (1998). Reviewer: Van Bang Le (Rostock) MSC: 05C85 94C15 68R10 PDF BibTeX XML Cite \textit{A. Czumaj} et al., SIAM J. Discrete Math. 11, No. 3, 400--413 (1998; Zbl 0929.05077) Full Text: DOI OpenURL
Bermond, Jean-Claude; Gargano, Luisa; Rescigno, Adele A.; Vaccaro, Ugo Fast gossiping by short messages. (English) Zbl 0960.94044 SIAM J. Comput. 27, No. 4, 917-941 (1998). MSC: 94C15 68M10 90B18 PDF BibTeX XML Cite \textit{J.-C. Bermond} et al., SIAM J. Comput. 27, No. 4, 917--941 (1998; Zbl 0960.94044) Full Text: DOI OpenURL
Perennes, Stéphane Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks. (English) Zbl 0907.90137 Discrete Appl. Math. 83, No. 1-3, 247-262 (1998). MSC: 90B18 68M10 05C20 PDF BibTeX XML Cite \textit{S. Perennes}, Discrete Appl. Math. 83, No. 1--3, 247--262 (1998; Zbl 0907.90137) Full Text: DOI Link OpenURL
Liestman, A. L. (ed.); Labahn, R. (ed.); Peters, J. G. (ed.) Network communications broadcasting and gossiping. (English) Zbl 0903.00028 Discrete Appl. Math. 83, No. 1-3, 328 p. (1998). MSC: 00B15 94-06 68-06 90-06 94C15 90B18 PDF BibTeX XML Full Text: Link OpenURL
Monakhova, E. A.; Monakhov, O. G. Exchanges in circulant networks: algorithms and lower bounds. (English) Zbl 1074.90513 Bull. Novosib. Comput. Cent., Ser. Comput. Sci. 6, 45-58 (1997). MSC: 90B18 68M10 68R10 68Q25 94C12 PDF BibTeX XML Cite \textit{E. A. Monakhova} and \textit{O. G. Monakhov}, Bull. Novosib. Comput. Cent., Ser. Comput. Sci. 6, 45--58 (1997; Zbl 1074.90513) OpenURL
Rao, P. S.; Mouney, G. Data communication in parallel block predictor–corrector methods for solving ODE’s. (English) Zbl 0903.68092 Parallel Comput. 23, No. 13, 1877-1888 (1997). MSC: 68W15 PDF BibTeX XML Cite \textit{P. S. Rao} and \textit{G. Mouney}, Parallel Comput. 23, No. 13, 1877--1888 (1997; Zbl 0903.68092) Full Text: DOI OpenURL
Gargano, Luisa; Rescigno, Adele A.; Vaccaro, Ugo Communication complexity of gossiping by packets. (English) Zbl 0888.68013 J. Parallel Distrib. Comput. 45, No. 1, 73-81 (1997). MSC: 68M10 PDF BibTeX XML Cite \textit{L. Gargano} et al., J. Parallel Distrib. Comput. 45, No. 1, 73--81 (1997; Zbl 0888.68013) Full Text: DOI OpenURL
Scott, A. D. Better bounds for perpetual gossiping. (English) Zbl 0882.90045 Discrete Appl. Math. 75, No. 2, 189-197 (1997). MSC: 90B18 05C38 05C35 PDF BibTeX XML Cite \textit{A. D. Scott}, Discrete Appl. Math. 75, No. 2, 189--197 (1997; Zbl 0882.90045) Full Text: DOI Link OpenURL
Tsay, Yuh-Jiuan; Chang, Gerard J. The exact gossiping problem. (English) Zbl 0873.68007 Discrete Math. 163, No. 1-3, 165-172 (1997). MSC: 68M10 68R10 90B18 05C05 PDF BibTeX XML Cite \textit{Y.-J. Tsay} and \textit{G. J. Chang}, Discrete Math. 163, No. 1--3, 165--172 (1997; Zbl 0873.68007) Full Text: DOI OpenURL
Pelc, Andrzej Fault-tolerant broadcasting and gossiping in communication networks. (English) Zbl 0865.90058 Networks 28, No. 3, 143-156 (1996). MSC: 90B18 90B25 PDF BibTeX XML Cite \textit{A. Pelc}, Networks 28, No. 3, 143--156 (1996; Zbl 0865.90058) Full Text: DOI OpenURL
Knisely, James A.; Laskar, Renu Cyclic gossiping times for some classes of graphs. (English) Zbl 0865.90055 Networks 28, No. 3, 135-141 (1996). MSC: 90B18 PDF BibTeX XML Cite \textit{J. A. Knisely} and \textit{R. Laskar}, Networks 28, No. 3, 135--141 (1996; Zbl 0865.90055) Full Text: DOI OpenURL
Fujita, Satoshi; Yamashita, Masafumi Optimal group gossiping in hypercubes under a circuit-switching model. (English) Zbl 0860.05052 SIAM J. Comput. 25, No. 5, 1045-1060 (1996). Reviewer: A.Kapralski (Kraków) MSC: 05C38 68W10 68R10 PDF BibTeX XML Cite \textit{S. Fujita} and \textit{M. Yamashita}, SIAM J. Comput. 25, No. 5, 1045--1060 (1996; Zbl 0860.05052) Full Text: DOI OpenURL
Fraigniaud, Pierre; Laforest, Christian Minimum gossip bus networks. (English) Zbl 0851.90038 Networks 27, No. 3, 239-251 (1996). MSC: 90B18 PDF BibTeX XML Cite \textit{P. Fraigniaud} and \textit{C. Laforest}, Networks 27, No. 3, 239--251 (1996; Zbl 0851.90038) Full Text: DOI OpenURL