Gąsieniec, Leszek; Jurdziński, Tomasz; Klasing, Ralf; Levcopoulos, Christos; Lingas, Andrzej; Min, Jie; Radzik, Tomasz Perpetual maintenance of machines with different urgency requirements. (English) Zbl 07753726 J. Comput. Syst. Sci. 139, Article ID 103476, 20 p. (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{L. Gąsieniec} et al., J. Comput. Syst. Sci. 139, Article ID 103476, 20 p. (2024; Zbl 07753726) Full Text: DOI
Berenbrink, Petra; Elsässer, Robert; Friedetzky, Tom; Kaaser, Dominik; Kling, Peter; Radzik, Tomasz Time-space trade-offs in population protocols for the majority problem. (English) Zbl 1510.68011 Distrib. Comput. 34, No. 2, 91-111 (2021). MSC: 68M14 68Q10 PDFBibTeX XMLCite \textit{P. Berenbrink} et al., Distrib. Comput. 34, No. 2, 91--111 (2021; Zbl 1510.68011) Full Text: DOI arXiv
Berenbrink, Petra; Elsässer, Robert; Friedetzky, Tom; Kaaser, Dominik; Kling, Peter; Radzik, Tomasz A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states. (English) Zbl 1497.68034 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 10, 18 p. (2018). MSC: 68M14 68M12 68W20 PDFBibTeX XMLCite \textit{P. Berenbrink} et al., LIPIcs -- Leibniz Int. Proc. Inform. 121, Article 10, 18 p. (2018; Zbl 1497.68034) Full Text: DOI
Pagourtzis, Aris; Radzik, Tomasz Tight bounds for deterministic \(h\)-shot broadcast in ad-hoc directed radio networks. (English) Zbl 1512.68021 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 80, 13 p. (2018). MSC: 68M10 68M12 68R10 68W15 PDFBibTeX XMLCite \textit{A. Pagourtzis} and \textit{T. Radzik}, LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 80, 13 p. (2018; Zbl 1512.68021) Full Text: DOI
Bampas, Evangelos; Gąsieniec, Leszek; Hanusse, Nicolas; Ilcinkas, David; Klasing, Ralf; Kosowski, Adrian; Radzik, Tomasz Robustness of the rotor-router mechanism. (English) Zbl 1372.68199 Algorithmica 78, No. 3, 869-895 (2017). MSC: 68R10 68Q25 91A43 91A80 PDFBibTeX XMLCite \textit{E. Bampas} et al., Algorithmica 78, No. 3, 869--895 (2017; Zbl 1372.68199) Full Text: DOI
Gąsieniec, Leszek; Klasing, Ralf; Levcopoulos, Christos; Lingas, Andrzej; Min, Jie; Radzik, Tomasz Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors). (English) Zbl 1444.90053 Steffen, Bernhard (ed.) et al., SOFSEM 2017: theory and practice of computer science. 43rd international conference on current trends in theory and practice of computer science, Limerick, Ireland, January 16–20, 2017, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10139, 229-240 (2017). MSC: 90B35 68T40 68W25 PDFBibTeX XMLCite \textit{L. Gąsieniec} et al., Lect. Notes Comput. Sci. 10139, 229--240 (2017; Zbl 1444.90053) Full Text: DOI arXiv
Cooper, Colin; Radzik, Tomasz; Siantos, Yiannis Fast low-cost estimation of network properties using random walks. (English) Zbl 1465.05169 Internet Math. 12, No. 4, 221-238 (2016). MSC: 05C82 05C81 PDFBibTeX XMLCite \textit{C. Cooper} et al., Internet Math. 12, No. 4, 221--238 (2016; Zbl 1465.05169) Full Text: DOI
Cooper, Colin; Klasing, Ralf; Radzik, Tomasz Locating and repairing faults in a network with mobile agents. (English) Zbl 1191.68722 Theor. Comput. Sci. 411, No. 14-15, 1638-1647 (2010). MSC: 68T42 68R10 68M14 PDFBibTeX XMLCite \textit{C. Cooper} et al., Theor. Comput. Sci. 411, No. 14--15, 1638--1647 (2010; Zbl 1191.68722) Full Text: DOI
Peleg, David; Radzik, Tomasz Time-efficient broadcast in radio networks. (English) Zbl 1187.68047 Koster, Arie M. C. A. (ed.) et al., Graphs and algorithms in communication networks. Studies in broadband, optical, wireless and ad hoc networks. Berlin: Springer (ISBN 978-3-642-02249-4/hbk; 978-3-642-02250-0/ebook). Texts in Theoretical Computer Science. An EATCS Series, 311-334 (2010). MSC: 68M10 68W05 PDFBibTeX XMLCite \textit{D. Peleg} and \textit{T. Radzik}, in: Graphs and algorithms in communication networks. Studies in broadband, optical, wireless and ad hoc networks. Berlin: Springer. 311--334 (2010; Zbl 1187.68047) Full Text: DOI
Klasing, Ralf; Markou, Euripides; Radzik, Tomasz; Sarracco, Fabiano Approximation bounds for black hole search problems. (English) Zbl 1157.68073 Networks 52, No. 4, 216-226 (2008). MSC: 68W25 68M10 68R10 PDFBibTeX XMLCite \textit{R. Klasing} et al., Networks 52, No. 4, 216--226 (2008; Zbl 1157.68073) Full Text: DOI
Cooper, Colin; Klasing, Ralf; Radzik, Tomasz Locating and repairing faults in a network with mobile agents. (English) Zbl 1143.68336 Shvartsman, Alexander A. (ed.) et al., Structural information and communication complexity. 15th international colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69326-0/pbk). Lecture Notes in Computer Science 5058, 20-32 (2008). MSC: 68M14 68M15 68R10 68T20 PDFBibTeX XMLCite \textit{C. Cooper} et al., Lect. Notes Comput. Sci. 5058, 20--32 (2008; Zbl 1143.68336) Full Text: DOI
Klasing, Ralf; Markou, Euripides; Radzik, Tomasz; Sarracco, Fabiano Hardness and approximation results for black hole search in arbitrary networks. (English) Zbl 1125.68139 Theor. Comput. Sci. 384, No. 2-3, 201-221 (2007). MSC: 68W25 68Q17 68R10 68T20 PDFBibTeX XMLCite \textit{R. Klasing} et al., Theor. Comput. Sci. 384, No. 2--3, 201--221 (2007; Zbl 1125.68139) Full Text: DOI Link