Number of the records: 1  

Distributed exploration of dynamic rings

  1. TitleDistributed exploration of dynamic rings
    Author Di Luna G.
    Co-authors Dobrev Stefan 1970 SAVMATEM - Matematický ústav SAV

    Flocchini Paola

    Santoro Nicola

    Source document Distributed Computing. Vol. 33, no. 1 (2020), p. 41-67
    Languageeng - English
    Document kindrozpis článkov z periodík (rbx)
    CitationsGOTOH, Tsuyoshi - SUDO, Yuichi - OOSHITA, Fukuhito - MASUZAWA, Toshimitsu. Exploration of Dynamic Ring Networks by a Single Agent with the H-hops and S-time Steps View. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ISSN 03029743, 2019-01-01, 11914 LNCS, p. 165-177.
    ILCINKAS, David - WADE, Ahmed M. Exploration of carrier-based time-varying networks: The power of waiting. In THEORETICAL COMPUTER SCIENCE. ISSN 0304-3975, 2020, vol. 841, p. 50-61.
    GOTOH, Tsuyoshi - SUDO, Yuichi - OOSHITA, Fukuhito - MASUZAWA, Toshimitsu. Dynamic Ring Exploration with (H, S) View. In ALGORITHMS, 2020, vol. 13, no. 6.
    SHIBATA, Masahiro - SUDO, Yuichi - NAKAMURA, Junya - KIM, Yonghwan. Uniform Deployment of Mobile Agents in Dynamic Rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ISSN 03029743, 2020-01-01, 12514 LNCS, p. 248-263.
    CASTEIGTS, Arnaud - PETERS, Joseph G. - SCHOETERS, Jason. Temporal cliques admit sparse spanners. In JOURNAL OF COMPUTER AND SYSTEM SCIENCES. ISSN 0022-0000, 2021, vol. 121, p. 1-17. Dostupné na: https://doi.org/10.1016/j.jcss.2021.04.004.
    ILCINKAS, David - WADE, Ahmed M. Exploration of Dynamic Cactuses with Sub-logarithmic Overhead. In THEORY OF COMPUTING SYSTEMS. ISSN 1432-4350, 2021, vol. 65, no. 2, pp. 257-273. Dostupné na: https://doi.org/10.1007/s00224-020-10001-0.
    DAS, Archak - BOSE, Kaustav - SAU, Buddhadeb. Exploring a Dynamic Ring Without Landmark. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ISSN 03029743, 2021-01-01, 13046 LNCS, pp. 320-334. Dostupné na: https://doi.org/10.1007/978-3-030-91081-5_21.
    SHIBATA, Masahiro - SUDO, Yuichi - NAKAMURA, Junya - KIM, Yonghwan. Partial Gathering of Mobile Agents in Dynamic Rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ISSN 03029743, 2021-01-01, 13046 LNCS, pp. 440-455. Dostupné na: https://doi.org/10.1007/978-3-030-91081-5_29.
    CASTEIGTS, A. - CORSINI, T. - SARKAR, W. Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs. In STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS (SSS 2022). ISSN 0302-9743, 2022, vol. 13751, p. 3-18. Dostupné na: https://doi.org/10.1007/978-3-031-21017-4_1.
    DAS, A. - BOSE, K. - SAU, B. Exploring a dynamic ring without landmark. In THEORETICAL COMPUTER SCIENCE. ISSN 0304-3975, SEP 11 2022, vol. 929, p. 191-205. Dostupné na: https://doi.org/10.1016/j.tcs.2022.07.005.
    MANDAL, Subhrangsu - MOLLA, Anisur Rahaman - MOSES, William K. Efficient live exploration of a dynamic ring with mobile robots. In THEORETICAL COMPUTER SCIENCE, 2023, vol. 980, no., art. no. 114201. ISSN 0304-3975. Dostupné na: https://doi.org/10.1016/j.tcs.2023.114201.
    CategoryADCA - Scientific papers in foreign journals registered in Current Contents Connect with IF (impacted)
    Category of document (from 2022)V3 - Vedecký výstup publikačnej činnosti z časopisu
    Type of documentčlánok
    Year2020
    Registered inWOS
    Registered inSCOPUS
    Registered inCCC
    DOI 10.1007/s00446-018-0339-1
    article

    article

    File nameAccessSizeDownloadedTypeLicense
    Distributed exploration of dynamic rings.pdfNeprístupný/archív1.2 MB0Publisher's version
    rokCCIFIF Q (best)JCR Av Jour IF PercSJRSJR Q (best)CiteScore
    A
    rok vydaniarok metrikyIFIF Q (best)SJRSJR Q (best)
    202020190.894Q30.729Q1
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.