SAYAKA KAMEI

Last Updated :2026/06/22

Affiliations, Positions
Graduate School of Advanced Science and Engineering, Professor
Web Site
https://home.hiroshima-u.ac.jp/s10kamei/index.html
E-mail
s10kameihiroshima-u.ac.jp
Self-introduction
Sayaka Kamei received the B.E., M.E., and D.E. degrees in Computer Science from Hiroshima University, Japan, in 2001, 2003, and 2006, respectively. She served as an Assistant Professor at Tottori University of Environmental Studies from 2006 to 2008 and at Hiroshima University from 2008 to 2012. She was an Associate Professor at Hiroshima University from 2012 to 2026. She is currently a Professor with the Graduate School of Engineering, Hiroshima University. Her research interests include distributed algorithms. She is a member of the IEEE, IEEE Computer Society, ACM, IEICE, and IPSJ.

Basic Information

Educational Backgrounds

  • Hiroshima University, Japan, 2003/04, 2006/03
  • Hiroshima University, Japan, 2001/04, 2003/03
  • Hiroshima University, Japan, 1997/04, 2001/03

Academic Degrees

  • Doctor of Engineering, Hiroshima University
  • Master of Engineering, Hiroshima University

Educational Activity

  • [Bachelor Degree Program] School of Informatics and Data Science : Department of Informatics and Data Science : Data Science Program
  • [Master's Program] Graduate School of Advanced Science and Engineering : Division of Advanced Science and Engineering : Informatics and Data Science Program
  • [Doctoral Program] Graduate School of Advanced Science and Engineering : Division of Advanced Science and Engineering : Informatics and Data Science Program

Research Fields

  • Informatics;Principles of Informatics;Theory of informatics

Research Keywords

  • Distributed Algorithms

Affiliated Academic Societies

Educational Activity

Course in Charge

  1. 2026, Undergraduate Education, First Semester, Programming I
  2. 2026, Undergraduate Education, Second Semester, Programming IV
  3. 2026, Undergraduate Education, 1Term, Informatics and Data Science Exercise I
  4. 2026, Undergraduate Education, 1Term, Data Science Seminar I
  5. 2026, Undergraduate Education, 2Term, Data Science Seminar II
  6. 2026, Undergraduate Education, Second Semester, Graduation Thesis
  7. 2026, Graduate Education (Master's Program) , 1Term, Special Exercises on Informatics and Data Science A
  8. 2026, Graduate Education (Master's Program) , 2Term, Special Exercises on Informatics and Data Science A
  9. 2026, Graduate Education (Master's Program) , 3Term, Special Exercises on Informatics and Data Science B
  10. 2026, Graduate Education (Master's Program) , 4Term, Special Exercises on Informatics and Data Science B
  11. 2026, Graduate Education (Master's Program) , Year, Special Study on Informatics and Data Science
  12. 2026, Graduate Education (Master's Program) , 2Term, Information retrieval
  13. 2026, Graduate Education (Doctoral Program) , Year, Special Study on Informatics and Data Science

Research Activities

Academic Papers

  1. Multi-Interest Sequential Recommendation Based on Prompt-Oriented BERT, 2025 Thirteenth International Symposium on Computing and Networking (CANDAR), 20251125
  2. Image Captioning via Masked Conditional Diffusion, Advanced Data Mining and Applications. ADMA 2025. Lecture Notes in Computer Science, 20251019
  3. InstGAN: Instant Actor-Critic-Driven GAN for De Novo Molecule Generation and Property Optimization, IJCAI '25: Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 20250816
  4. Crash-tolerant perpetual exploration of myopic luminous robots with fewer colors on rings, 2025 Thirteenth International Symposium on Computing and Networking Workshops (CANDARW), 20251125
  5. A self-stabilizing algorithm for the dynamic total domination problem, 2025 Thirteenth International Symposium on Computing and Networking (CANDAR), 20251125
  6. Pattern formation of mobile agents in dynamic grids", Networked Systems. NETYS 2025. Lecture Notes in Computer Science, 15736, 20251001
  7. A Visibility vs. Memory Trade-off for Stand-Up Indulgent Gathering on Lines, Structural Information and Communication Complexity. SIROCCO 2025. Lecture Notes in Computer Science, 15671, 20250522
  8. Self-stabilizing Graph Exploration by a Single Agent, Structural Information and Communication Complexity. SIROCCO 2025. Lecture Notes in Computer Science, 15671, 20250522
  9. Gathering on Rings for Myopic Asynchronous Robots with Lights, Theory of Computing Systems, 69(1), 20250124
  10. BERT Pre-Training for Cooking Time Prediction from Japanese Cooking Recipes, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E109D(4), 531-540, 202604
    Link to Paper Search Results by DOI
  11. Gathering on Rings for Myopic Asynchronous Robots with Lights, Theory of Computing Systems, 69(1), 20250301
  12. Gathering on Rings for Myopic Asynchronous Robots with Lights, Theory of Computing Systems, 69(1), 20250301
  13. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324, 20250108
  14. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324, 20250108
  15. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319, 20241024
  16. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319, 20241024
  17. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983, 20240201
  18. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983, 20240201
  19. CaT: A Category-oriented Transformer for Text and Sentiment Analysis in Japanese Hotel Overall Ratings Prediction, Proceedings - 2024 12th International Symposium on Computing and Networking, CANDAR 2024, 162-168, 20240101
  20. CaT: A Category-oriented Transformer for Text and Sentiment Analysis in Japanese Hotel Overall Ratings Prediction, Proceedings - 2024 12th International Symposium on Computing and Networking, CANDAR 2024, 162-168, 20240101
  21. BERT Pre-Training for Cooking Time Prediction from Cooking Recipes, Proceedings - 2024 12th International Symposium on Computing and Networking Workshops, CANDARW 2024, 157-162, 20240101
  22. BERT Pre-Training for Cooking Time Prediction from Cooking Recipes, Proceedings - 2024 12th International Symposium on Computing and Networking Workshops, CANDARW 2024, 157-162, 20240101
  23. A self-stabilizing algorithm for the local (1,|Ni|)-Critical section problem with safe convergence, Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019, 609-618, 20190501
  24. A self-stabilizing algorithm for the local (1,|Ni|)-Critical section problem with safe convergence, Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019, 609-618, 20190501
  25. Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets, Proceedings - 2018 6th International Symposium on Computing and Networking Workshops, CANDARW 2018, 278-284, 20181226
  26. Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets, Proceedings - 2018 6th International Symposium on Computing and Networking Workshops, CANDARW 2018, 278-284, 20181226
  27. A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence, Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, 2018-December, 365-372, 20180702
  28. A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence, Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, 2018-December, 365-372, 20180702
  29. An Asynchronous Message-Passing Distributed Algorithm for the Global Critical Section Problem, Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017, 2018-January, 414-419, 20170702
  30. An Asynchronous Message-Passing Distributed Algorithm for the Global Critical Section Problem, Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017, 2018-January, 414-419, 20170702
  31. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10(2), 20170601
  32. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10(2), 20170601
  33. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, 203-207, 20161217
  34. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, 203-207, 20161217
  35. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0(0), 46-49, 20141230
  36. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0(0), 46-49, 20141230
  37. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Journal of Combinatorial Optimization, 25(3), 430-459, 20130401
  38. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Journal of Combinatorial Optimization, 25(3), 430-459, 20130401
  39. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24(4), 716-723, 20130319
  40. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24(4), 716-723, 20130319
  41. Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E96-A(6), 1072-1080, 20130101
  42. Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E96-A(6), 1072-1080, 20130101
  43. A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Theoretical Computer Science, 428, 80-90, 20120413
  44. A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Theoretical Computer Science, 428, 80-90, 20120413
  45. Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6796 LNCS, 150-161, 20110810
  46. Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6796 LNCS, 150-161, 20110810
  47. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412(33), 4336-4349, 20110729
  48. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412(33), 4336-4349, 20110729
  49. A token-based distributed algorithm for the generalized resource allocation problem, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6490 LNCS, 411-426, 20101201
  50. A token-based distributed algorithm for the generalized resource allocation problem, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6490 LNCS, 411-426, 20101201
  51. Mobile robots gathering algorithm with local weak multiplicity in rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6058 LNCS, 101-113, 20100714
  52. Mobile robots gathering algorithm with local weak multiplicity in rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6058 LNCS, 101-113, 20100714
  53. A Self-stabilizing distributed approximation algorithm for the minimum connected dominating set, International Journal of Foundations of Computer Science, 21(3), 459-476, 20100601
  54. A Self-stabilizing distributed approximation algorithm for the minimum connected dominating set, International Journal of Foundations of Computer Science, 21(3), 459-476, 20100601
  55. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180(10), 1802-1816, 20100515
  56. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180(10), 1802-1816, 20100515
  57. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6196 LNCS, 80-89, 20100101
  58. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6196 LNCS, 80-89, 20100101
  59. Randomized gathering of mobile robots with local-multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5873 LNCS, 384-398, 20091201
  60. Randomized gathering of mobile robots with local-multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5873 LNCS, 384-398, 20091201
  61. Cached sensornet transformation of non-silent self-stabilizing algorithms with unreliable links, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5873 LNCS, 428-442, 20091201
  62. Cached sensornet transformation of non-silent self-stabilizing algorithms with unreliable links, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5873 LNCS, 428-442, 20091201
  63. Hierarchical composition of self-stabilizing protocols preserving the fault-containment property, IEICE Transactions on Information and Systems, E92-D(3), 451-459, 20090101
  64. Hierarchical composition of self-stabilizing protocols preserving the fault-containment property, IEICE Transactions on Information and Systems, E92-D(3), 451-459, 20090101
  65. A self-stabilizing approximation for the minimum connected dominating set with safe convergence, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5401 LNCS, 496-511, 20081201
  66. A self-stabilizing approximation for the minimum connected dominating set with safe convergence, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5401 LNCS, 496-511, 20081201
  67. Timer-based composition of fault-containing self-stabilizing protocols, Studies in Computational Intelligence, 162, 217-226, 20080922
  68. Timer-based composition of fault-containing self-stabilizing protocols, Studies in Computational Intelligence, 162, 217-226, 20080922
  69. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19(9), 1153-1166, 20080819
  70. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19(9), 1153-1166, 20080819
  71. A self-stabilizing distributed approximation algorithm for the minimum connected dominating set, Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM, 20070924
  72. A self-stabilizing distributed approximation algorithm for the minimum connected dominating set, Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM, 20070924
  73. Composition of fault-containing protocols based on recovery waiting fault-containing composition framework, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4280 LNCS, 516-532, 20060101
  74. Composition of fault-containing protocols based on recovery waiting fault-containing composition framework, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4280 LNCS, 516-532, 20060101
  75. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics Lipics, 324, 20250108
  76. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics Lipics, 324, 20250108
  77. Tailored Federated Learning: Leveraging Direction Regulation and Knowledge Distillation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 15388 LNAI, 270-284, 20250101
  78. Tailored Federated Learning: Leveraging Direction Regulation and Knowledge Distillation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 15388 LNAI, 270-284, 20250101
  79. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation Practice and Experience, 36(26), 20241130
  80. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation Practice and Experience, 36(26), 20241130
  81. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics Lipics, 319, 20241024
  82. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics Lipics, 319, 20241024
  83. Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Acta Informatica, 61(1), 83-100, 20240301
  84. Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Acta Informatica, 61(1), 83-100, 20240301
  85. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983, 20240201
  86. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983, 20240201
  87. A self-stabilizing distributed algorithm for the bounded lattice domination problems under the distance-2 model, Concurrency and Computation Practice and Experience, 36(3), 20240201
  88. A self-stabilizing distributed algorithm for the bounded lattice domination problems under the distance-2 model, Concurrency and Computation Practice and Experience, 36(3), 20240201
  89. MacGAN: A Moment-Actor-Critic Reinforcement Learning-Based Generative Adversarial Network for Molecular Generation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14331 LNCS, 127-141, 20240101
  90. MacGAN: A Moment-Actor-Critic Reinforcement Learning-Based Generative Adversarial Network for Molecular Generation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14331 LNCS, 127-141, 20240101
  91. BERT Pre-Training for Cooking Time Prediction from Cooking Recipes, Proceedings 2024 12th International Symposium on Computing and Networking Workshops Candarw 2024, 157-162, 20240101
  92. BERT Pre-Training for Cooking Time Prediction from Cooking Recipes, Proceedings 2024 12th International Symposium on Computing and Networking Workshops Candarw 2024, 157-162, 20240101
  93. Stand-Up Indulgent Gathering on Rings, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14662 LNCS, 119-137, 20240101
  94. Stand-Up Indulgent Gathering on Rings, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14662 LNCS, 119-137, 20240101
  95. CaT: A Category-oriented Transformer for Text and Sentiment Analysis in Japanese Hotel Overall Ratings Prediction, Proceedings 2024 12th International Symposium on Computing and Networking Candar 2024, 162-168, 20240101
  96. CaT: A Category-oriented Transformer for Text and Sentiment Analysis in Japanese Hotel Overall Ratings Prediction, Proceedings 2024 12th International Symposium on Computing and Networking Candar 2024, 162-168, 20240101
  97. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200, 110-121, 20240101
  98. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200, 110-121, 20240101
  99. Evacuation from various types of finite two-dimensional square grid fields by a metamorphic robotic system, Concurrency and Computation Practice and Experience, 35(14), 20230625
  100. Evacuation from various types of finite two-dimensional square grid fields by a metamorphic robotic system, Concurrency and Computation Practice and Experience, 35(14), 20230625
  101. Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots, Concurrency and Computation Practice and Experience, 35(11), 20230515
  102. Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots, Concurrency and Computation Practice and Experience, 35(11), 20230515
  103. Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14310 LNCS, 451-465, 20230101
  104. Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14310 LNCS, 451-465, 20230101
  105. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Proceedings 2023 11th International Symposium on Computing and Networking Workshops Candarw 2023, 100-106, 20230101
  106. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Proceedings 2023 11th International Symposium on Computing and Networking Workshops Candarw 2023, 100-106, 20230101
  107. A Visual Interpretation-Based Self-improved Classification System Using Virtual Adversarial Training, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14179 LNAI, 548-562, 20230101
  108. A Visual Interpretation-Based Self-improved Classification System Using Virtual Adversarial Training, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14179 LNAI, 548-562, 20230101
  109. Asynchronous Gathering in a Torus, Leibniz International Proceedings in Informatics Lipics, 217, 20220201
  110. Asynchronous Gathering in a Torus, Leibniz International Proceedings in Informatics Lipics, 217, 20220201
  111. Location Data Anonymization Retaining Data Mining Utilization, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 13726 LNAI, 407-418, 20220101
  112. Location Data Anonymization Retaining Data Mining Utilization, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 13726 LNAI, 407-418, 20220101
  113. A linear-time self-stabilizing distributed algorithm for the minimal minus (L, K, Z) -domination problem under the distance-2 model, Proceedings 2022 10th International Symposium on Computing and Networking Workshops Candarw 2022, 168-173, 20220101
  114. A linear-time self-stabilizing distributed algorithm for the minimal minus (L, K, Z) -domination problem under the distance-2 model, Proceedings 2022 10th International Symposium on Computing and Networking Workshops Candarw 2022, 168-173, 20220101
  115. Overall Rating Prediction from Review Texts using Category-oriented Japanese Sentiment Polarity Dictionary, Proceedings 2022 10th International Symposium on Computing and Networking Candar 2022, 124-129, 20220101
  116. Overall Rating Prediction from Review Texts using Category-oriented Japanese Sentiment Polarity Dictionary, Proceedings 2022 10th International Symposium on Computing and Networking Candar 2022, 124-129, 20220101
  117. A self-stabilizing 2-minimal dominating set algorithm based on loop composition in networks of girth at least 7, Proceedings 2022 IEEE 36th International Parallel and Distributed Processing Symposium IPDPS 2022, 1140-1150, 20220101
  118. A self-stabilizing 2-minimal dominating set algorithm based on loop composition in networks of girth at least 7, Proceedings 2022 IEEE 36th International Parallel and Distributed Processing Symposium IPDPS 2022, 1140-1150, 20220101
  119. A self-stabilizing distributed algorithm for the local (1,|Ni|)-critical section problem, Concurrency and Computation Practice and Experience, 33(12), 20210625
  120. A self-stabilizing distributed algorithm for the local (1,|Ni|)-critical section problem, Concurrency and Computation Practice and Experience, 33(12), 20210625
  121. A self-stabilizing token circulation with graceful handover on bidirectional ring networks, 2021 IEEE International Parallel and Distributed Processing Symposium Workshops Ipdpsw 2021 in Conjunction with IEEE IPDPS 2021, 596-604, 20210601
  122. A self-stabilizing token circulation with graceful handover on bidirectional ring networks, 2021 IEEE International Parallel and Distributed Processing Symposium Workshops Ipdpsw 2021 in Conjunction with IEEE IPDPS 2021, 596-604, 20210601
  123. A Distributed Multi-group Mutual Exclusion Algorithm for Intersection Traffic Control, Proceedings 2021 9th International Symposium on Computing and Networking Workshops Candarw 2021, 265-291, 20210101
  124. A Distributed Multi-group Mutual Exclusion Algorithm for Intersection Traffic Control, Proceedings 2021 9th International Symposium on Computing and Networking Workshops Candarw 2021, 265-291, 20210101
  125. Location Functions for Self-stabilizing Byzantine Tolerant Swarms, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 13046 LNCS, 229-242, 20210101
  126. Location Functions for Self-stabilizing Byzantine Tolerant Swarms, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 13046 LNCS, 229-242, 20210101
  127. Category-oriented Sentiment Polarity Dictionary for Rating Prediction of Japanese Hotels, Proceedings 2020 8th International Symposium on Computing and Networking Workshops Candarw 2020, 440-444, 20201101
  128. Category-oriented Sentiment Polarity Dictionary for Rating Prediction of Japanese Hotels, Proceedings 2020 8th International Symposium on Computing and Networking Workshops Candarw 2020, 440-444, 20201101
  129. Topic and Sentiment Analysis Matrix Factorization on Rating Prediction for Recommendation, Proceedings 2020 8th International Symposium on Computing and Networking Workshops Candarw 2020, 137-143, 20201101
  130. Topic and Sentiment Analysis Matrix Factorization on Rating Prediction for Recommendation, Proceedings 2020 8th International Symposium on Computing and Networking Workshops Candarw 2020, 137-143, 20201101
  131. Evacuation from a finite 2D square grid field by a metamorphic robotic system, Proceedings 2020 8th International Symposium on Computing and Networking Candar 2020, 69-78, 20201101
  132. Evacuation from a finite 2D square grid field by a metamorphic robotic system, Proceedings 2020 8th International Symposium on Computing and Networking Candar 2020, 69-78, 20201101
  133. Gathering on rings for myopic asynchronous robots with lights, Leibniz International Proceedings in Informatics Lipics, 153, 20200201
  134. Gathering on rings for myopic asynchronous robots with lights, Leibniz International Proceedings in Informatics Lipics, 153, 20200201
  135. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, Proceedings 2019 7th International Symposium on Computing and Networking Candar 2019, 218-224, 20191101
  136. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, Proceedings 2019 7th International Symposium on Computing and Networking Candar 2019, 218-224, 20191101
  137. Forgive & Forget: Self-stabilizing swarms in spite of byzantine robots, Proceedings 2019 7th International Symposium on Computing and Networking Workshops Candarw 2019, 188-194, 20191101
  138. Forgive & Forget: Self-stabilizing swarms in spite of byzantine robots, Proceedings 2019 7th International Symposium on Computing and Networking Workshops Candarw 2019, 188-194, 20191101
  139. Brief announcement: Neighborhood mutual remainder and its self-stabilizing implementation of look-compute-move robots, Leibniz International Proceedings in Informatics Lipics, 146, 20191001
  140. Brief announcement: Neighborhood mutual remainder and its self-stabilizing implementation of look-compute-move robots, Leibniz International Proceedings in Informatics Lipics, 146, 20191001
  141. A self-stabilizing algorithm for the local (1,|Ni|)-Critical section problem with safe convergence, Proceedings 2019 IEEE 33rd International Parallel and Distributed Processing Symposium Workshops Ipdpsw 2019, 609-618, 20190501
  142. A self-stabilizing algorithm for the local (1,|Ni|)-Critical section problem with safe convergence, Proceedings 2019 IEEE 33rd International Parallel and Distributed Processing Symposium Workshops Ipdpsw 2019, 609-618, 20190501
  143. And: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 11914 LNCS, 127-132, 20190101
  144. And: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 11914 LNCS, 127-132, 20190101
  145. And Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 11914 LNCS, 16-21, 20190101
  146. And Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 11914 LNCS, 16-21, 20190101
  147. Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets, Proceedings 2018 6th International Symposium on Computing and Networking Workshops Candarw 2018, 278-284, 20181226
  148. Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets, Proceedings 2018 6th International Symposium on Computing and Networking Workshops Candarw 2018, 278-284, 20181226
  149. A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence, Proceedings of the International Conference on Parallel and Distributed Systems ICPADS, 2018-December, 365-372, 20180702
  150. A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence, Proceedings of the International Conference on Parallel and Distributed Systems ICPADS, 2018-December, 365-372, 20180702
  151. Collaborative P2P Painting on a Shared Canvas, Proceedings 19th IEEE International Conference on Computational Science and Engineering 14th IEEE International Conference on Embedded and Ubiquitous Computing and 15th International Symposium on Distributed Computing and Applications to Business Engineering and Science Cse Euc Dcabes 2016, 221-224, 20170714
  152. Collaborative P2P Painting on a Shared Canvas, Proceedings 19th IEEE International Conference on Computational Science and Engineering 14th IEEE International Conference on Embedded and Ubiquitous Computing and 15th International Symposium on Distributed Computing and Applications to Business Engineering and Science Cse Euc Dcabes 2016, 221-224, 20170714
  153. An Asynchronous Message-Passing Distributed Algorithm for the Global Critical Section Problem, Proceedings 2017 5th International Symposium on Computing and Networking Candar 2017, 2018-January, 414-419, 20170702
  154. An Asynchronous Message-Passing Distributed Algorithm for the Global Critical Section Problem, Proceedings 2017 5th International Symposium on Computing and Networking Candar 2017, 2018-January, 414-419, 20170702
  155. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10(2), 20170601
  156. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10(2), 20170601
  157. Automatic generation of temporal feature vectors with application to tourism recommender systems, Proceedings 2016 4th International Symposium on Computing and Networking Candar 2016, 676-680, 20170113
  158. Automatic generation of temporal feature vectors with application to tourism recommender systems, Proceedings 2016 4th International Symposium on Computing and Networking Candar 2016, 676-680, 20170113
  159. A hotel recommendation system based on reviews: What do you attach importance to?, Proceedings 2016 4th International Symposium on Computing and Networking Candar 2016, 710-712, 20170113
  160. A hotel recommendation system based on reviews: What do you attach importance to?, Proceedings 2016 4th International Symposium on Computing and Networking Candar 2016, 710-712, 20170113
  161. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, 203-207, 20161217
  162. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, 203-207, 20161217
  163. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615, 102-119, 20160215
  164. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615, 102-119, 20160215
  165. Approximation algorithms for the set cover formation by oblivious mobile robots, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 8878, 233-247, 20140101
  166. Approximation algorithms for the set cover formation by oblivious mobile robots, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 8878, 233-247, 20140101
  167. An asynchronous self-stabilizing approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 8255 LNCS, 251-265, 20131201
  168. An asynchronous self-stabilizing approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 8255 LNCS, 251-265, 20131201
  169. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Journal of Combinatorial Optimization, 25(3), 430-459, 20130401
  170. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Journal of Combinatorial Optimization, 25(3), 430-459, 20130401
  171. Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E96-A(6), 1072-1080, 20130101
  172. Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E96-A(6), 1072-1080, 20130101
  173. Empirical analysis of periodically bookmarked web pages in social bookmarking systems, Proceedings of the 2012 3rd International Conference on Networking and Computing Icnc 2012, 85-93, 20121201
  174. Empirical analysis of periodically bookmarked web pages in social bookmarking systems, Proceedings of the 2012 3rd International Conference on Networking and Computing Icnc 2012, 85-93, 20121201
  175. Brief announcement: Mobile agent rendezvous on edge evolving rings, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 7596 LNCS, 92-94, 20121107
  176. Brief announcement: Mobile agent rendezvous on edge evolving rings, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 7596 LNCS, 92-94, 20121107
  177. Gathering an even number of robots in an odd ring without global multiplicity detection, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 7464 LNCS, 542-553, 20120820
  178. Gathering an even number of robots in an odd ring without global multiplicity detection, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 7464 LNCS, 542-553, 20120820
  179. Mobile agent rendezvous on a probabilistic edge evolving ring, Proceedings of the 2012 3rd International Conference on Networking and Computing Icnc 2012, 103-112, 20120101
  180. Mobile agent rendezvous on a probabilistic edge evolving ring, Proceedings of the 2012 3rd International Conference on Networking and Computing Icnc 2012, 103-112, 20120101
  181. Fast and reliable route maintenance protocols for WSN with crash and intermittent failures, Proceedings 2011 2nd International Conference on Networking and Computing Icnc 2011, 40-49, 20111201
  182. Fast and reliable route maintenance protocols for WSN with crash and intermittent failures, Proceedings 2011 2nd International Conference on Networking and Computing Icnc 2011, 40-49, 20111201
  183. Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 6796 LNCS, 150-161, 20110810
  184. Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 6796 LNCS, 150-161, 20110810
  185. A token-based distributed algorithm for the generalized resource allocation problem, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 6490 LNCS, 411-426, 20101201
  186. A token-based distributed algorithm for the generalized resource allocation problem, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 6490 LNCS, 411-426, 20101201
  187. Mobile robots gathering algorithm with local weak multiplicity in rings, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 6058 LNCS, 101-113, 20100714
  188. Mobile robots gathering algorithm with local weak multiplicity in rings, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 6058 LNCS, 101-113, 20100714
  189. A Self-stabilizing distributed approximation algorithm for the minimum connected dominating set, International Journal of Foundations of Computer Science, 21(3), 459-476, 20100601
  190. A Self-stabilizing distributed approximation algorithm for the minimum connected dominating set, International Journal of Foundations of Computer Science, 21(3), 459-476, 20100601
  191. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 6196 LNCS, 80-89, 20100101
  192. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 6196 LNCS, 80-89, 20100101
  193. A heuristic routing scheme for wireless sensor networks based on a local search method, I Span 2009 the 10th International Symposium on Pervasive Systems Algorithms and Networks, 46-51, 20091201
  194. A heuristic routing scheme for wireless sensor networks based on a local search method, I Span 2009 the 10th International Symposium on Pervasive Systems Algorithms and Networks, 46-51, 20091201
  195. Randomized gathering of mobile robots with local-multiplicity detection, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 5873 LNCS, 384-398, 20091201
  196. Randomized gathering of mobile robots with local-multiplicity detection, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 5873 LNCS, 384-398, 20091201
  197. Cached sensornet transformation of non-silent self-stabilizing algorithms with unreliable links, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 5873 LNCS, 428-442, 20091201
  198. Cached sensornet transformation of non-silent self-stabilizing algorithms with unreliable links, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 5873 LNCS, 428-442, 20091201
  199. A shape recognition scheme for wireless sensor networks based on a distance field method, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 5574 LNCS, 350-361, 20090921
  200. A shape recognition scheme for wireless sensor networks based on a distance field method, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 5574 LNCS, 350-361, 20090921
  201. A self-stabilizing approximation for the minimum connected dominating set with safe convergence, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 5401 LNCS, 496-511, 20081201
  202. A self-stabilizing approximation for the minimum connected dominating set with safe convergence, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 5401 LNCS, 496-511, 20081201
  203. A self-stabilizing distributed approximation algorithm for the minimum connected dominating set, Proceedings 21st International Parallel and Distributed Processing Symposium IPDPS 2007 Abstracts and Cd Rom, 20070924
  204. A self-stabilizing distributed approximation algorithm for the minimum connected dominating set, Proceedings 21st International Parallel and Distributed Processing Symposium IPDPS 2007 Abstracts and Cd Rom, 20070924
  205. Composition of fault-containing protocols based on recovery waiting fault-containing composition framework, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 4280 LNCS, 516-532, 20060101
  206. Composition of fault-containing protocols based on recovery waiting fault-containing composition framework, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 4280 LNCS, 516-532, 20060101
  207. A self-stabilizing approximation algorithm for the distributed minimum k-domination, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E88-A(5), 1109-1115, 20050101
  208. A self-stabilizing approximation algorithm for the distributed minimum k-domination, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E88-A(5), 1109-1115, 20050101
  209. A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks, Parallel and Distributed Computing Applications and Technologies PDCAT Proceedings, 720-724, 20031201
  210. A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks, Parallel and Distributed Computing Applications and Technologies PDCAT Proceedings, 720-724, 20031201
  211. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing Applications and Technologies PDCAT Proceedings, 742-746, 20031201
  212. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing Applications and Technologies PDCAT Proceedings, 742-746, 20031201
  213. Privacy-Aware Table Data Generation by Adversarial Gradient Boosting Decision Tree, MATHEMATICS, 13(15), 20250804
    Link to Paper Search Results by DOI
  214. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324, 20250108
  215. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324, 20250108
  216. Tailored Federated Learning: Leveraging Direction Regulation and Knowledge Distillation, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 15388 LNAI, 270-284, 20250101
  217. Tailored Federated Learning: Leveraging Direction Regulation and Knowledge Distillation, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 15388 LNAI, 270-284, 20250101
  218. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation: Practice and Experience, 36(26), 20241130
  219. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation: Practice and Experience, 36(26), 20241130
  220. Stand-up indulgent gathering on lines, Theoretical Computer Science, 1016, 20241112
  221. Stand-up indulgent gathering on lines, Theoretical Computer Science, 1016, 20241112
  222. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319, 20241024
  223. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319, 20241024
  224. MacGAN: A Moment-Actor-Critic Reinforcement Learning-Based Generative Adversarial Network for Molecular Generation, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14331 LNCS, 127-141, 20240101
  225. MacGAN: A Moment-Actor-Critic Reinforcement Learning-Based Generative Adversarial Network for Molecular Generation, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14331 LNCS, 127-141, 20240101
  226. Stand-Up Indulgent Gathering on Rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14662 LNCS, 119-137, 20240101
  227. Stand-Up Indulgent Gathering on Rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14662 LNCS, 119-137, 20240101
  228. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200, 110-121, 20240101
  229. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200, 110-121, 20240101
  230. Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14310 LNCS, 451-465, 20230101
  231. Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14310 LNCS, 451-465, 20230101
  232. Gathering on Rings for Myopic Asynchronous Robots with Lights, THEORY OF COMPUTING SYSTEMS, 69(1), 202503
    Link to Paper Search Results by DOI
  233. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 36(26), 20241130
    Link to Paper Search Results by DOI
  234. MacGAN: A Moment-actor-critic Reinforcement Learning-based Generative Adversarial Network for Molecular Generation, Web and Big Data. APWeb-WAIM 2023, 20240529
  235. Stand-up indulgent gathering on lines, THEORETICAL COMPUTER SCIENCE, 1016, 20241112
    Link to Paper Search Results by DOI
  236. Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Acta Informatica, 61(1), 83-100, 20231218
  237. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983, 20240201
  238. A self-stabilizing distributed algorithm for the bounded lattice domination problems under the distance-2 model, Concurrency and Computation: Practice and Experience, 36(3), 20231101
  239. An Asynchronous Maximum Independent Set Algorithm By Myopic Luminous Robots On Grids, Computer Journal, 67(1), 57-77, 20240101
  240. Stand-Up Indulgent Gathering on Rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14662 LNCS, 119-137, 20240523
  241. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200, 110-121, 20240410
  242. EarlGAN: An enhanced actor–critic reinforcement learning agent-driven GAN for de novo drug design, Pattern Recognition Letters, 175, 45-51, 20231101
  243. Evacuation from various types of finite two-dimensional square grid fields by a metamorphic robotic system, Concurrency and Computation: Practice and Experience, 35(14), 20230625
  244. Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots, Concurrency and Computation: Practice and Experience, 35(11), 20230515
  245. Location functions for self-stabilizing byzantine tolerant swarms, THEORETICAL COMPUTER SCIENCE, 954, 20230418
    Link to Paper Search Results by DOI
  246. Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14310 LNCS, 451-465, 20230930
  247. A Visual Interpretation-Based Self-improved Classification System Using Virtual Adversarial Training, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14179 LNAI, 548-562, 20231105
  248. Data Augmentation Methods for Enhancing Robustness in Text Classification Tasks, Algorithms, 16(1), 20230116
  249. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Proceedings - 2023 11th International Symposium on Computing and Networking Workshops, CANDARW 2023, 100-106, 20231127
  250. A self-stabilizing token circulation with graceful handover on bidirectional ring networks, International Journal of Networking and Computing, 12(1), 103-130, 20220610
  251. Asynchronous Gathering in a Torus, Leibniz International Proceedings in Informatics, LIPIcs, 217, 20220201
  252. Overall Rating Prediction from Review Texts using Category-oriented Japanese Sentiment Polarity Dictionary, Proceedings - 2022 10th International Symposium on Computing and Networking, CANDAR 2022, 124-129, 20220101
  253. Location Data Anonymization Retaining Data Mining Utilization, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13726 LNAI, 407-418, 20220101
  254. A linear-time self-stabilizing distributed algorithm for the minimal minus (L, K, Z) -domination problem under the distance-2 model, Proceedings - 2022 10th International Symposium on Computing and Networking Workshops, CANDARW 2022, 168-173, 20220101
  255. A self-stabilizing 2-minimal dominating set algorithm based on loop composition in networks of girth at least 7, Proceedings - 2022 IEEE 36th International Parallel and Distributed Processing Symposium, IPDPS 2022, 1140-1150, 20220101
  256. Matrix Factorization with Topic and Sentiment Analysis for Rating Prediction, International Journal of Networking and Computing, 11(2), 198-214, 20210701
  257. A self-stabilizing distributed algorithm for the local (1,|Ni|)-critical section problem, Concurrency and Computation: Practice and Experience, 33(12), 20210625
  258. A self-stabilizing token circulation with graceful handover on bidirectional ring networks, 2021 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2021 - In conjunction with IEEE IPDPS 2021, 596-604, 20210601
  259. A Distributed Multi-group Mutual Exclusion Algorithm for Intersection Traffic Control, Proceedings - 2021 9th International Symposium on Computing and Networking Workshops, CANDARW 2021, 265-291, 20210101
  260. Location Functions for Self-stabilizing Byzantine Tolerant Swarms, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13046 LNCS, 229-242, 20210101
  261. Category-oriented Sentiment Polarity Dictionary for Rating Prediction of Japanese Hotels, Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020, 440-444, 20201101
  262. Topic and Sentiment Analysis Matrix Factorization on Rating Prediction for Recommendation, Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020, 137-143, 20201101
  263. Evacuation from a finite 2D square grid field by a metamorphic robotic system, Proceedings - 2020 8th International Symposium on Computing and Networking, CANDAR 2020, 69-78, 20201101
  264. Gathering on rings for myopic asynchronous robots with lights, Leibniz International Proceedings in Informatics, LIPIcs, 153, 20200201
  265. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, Proceedings - 2019 7th International Symposium on Computing and Networking, CANDAR 2019, 218-224, 20191101
  266. Forgive & Forget: Self-stabilizing swarms in spite of byzantine robots, Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019, 188-194, 20191101
  267. Brief announcement: Neighborhood mutual remainder and its self-stabilizing implementation of look-compute-move robots, Leibniz International Proceedings in Informatics, LIPIcs, 146, 20191001
  268. A self-stabilizing algorithm for the local (1,|Ni|)-Critical section problem with safe convergence, Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019, 609-618, 20190501
  269. And: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11914 LNCS, 127-132, 20190101
  270. And Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11914 LNCS, 16-21, 20190101
  271. Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets, Proceedings - 2018 6th International Symposium on Computing and Networking Workshops, CANDARW 2018, 278-284, 20181226
  272. A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence, Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, 2018-December, 365-372, 20180702
  273. Collaborative P2P Painting on a Shared Canvas, Proceedings - 19th IEEE International Conference on Computational Science and Engineering, 14th IEEE International Conference on Embedded and Ubiquitous Computing and 15th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, CSE-EUC-DCABES 2016, 221-224, 20170714
  274. An Asynchronous Message-Passing Distributed Algorithm for the Global Critical Section Problem, Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017, 2018-January, 414-419, 20170702
  275. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10(2), 20170601
  276. A hotel recommendation system based on reviews: What do you attach importance to?, Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016, 710-712, 20170113
  277. Automatic generation of temporal feature vectors with application to tourism recommender systems, Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016, 676-680, 20170113
  278. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, 203-207, 20161217
  279. Personalized web page recommendation based on preference footprint to browsed pages, IEICE Transactions on Information and Systems, E99D(11), 2705-2715, 20161101
  280. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615, 102-119, 20160215
  281. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0(0), 46-49, 20141230
  282. Credibility Judgment Support System for Review, IPSJ Journal, 55(11), 2461-2475, 20141115
  283. Approximation algorithms for the set cover formation by oblivious mobile robots, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8878, 233-247, 20140101
  284. An asynchronous self-stabilizing approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8255 LNCS, 251-265, 20131201
  285. A boosting method considering tolerance against noisy data by weighting each data according to the distance between incidents, 113(286), 15-21, 20131105
  286. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Journal of Combinatorial Optimization, 25(3), 430-459, 20130401
  287. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24(4), 716-723, 20130319
  288. Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E96-A(6), 1072-1080, 20130101
  289. Empirical analysis of periodically bookmarked web pages in social bookmarking systems, Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012, 85-93, 20121201
  290. Brief announcement: Mobile agent rendezvous on edge evolving rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7596 LNCS, 92-94, 20121107
  291. Brief announcement: Mobile agent rendezvous on edge evolving rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7596 LNCS, 92-94, 20121107
  292. Gathering an even number of robots in an odd ring without global multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7464 LNCS, 542-553, 20120820
  293. How to Reduce the Number of Access Points in WMNs without Increasing the Communication Latancy, Technical report of IEICE. CQ, 112(119), 71-76, 20120705
  294. A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Theoretical Computer Science, 428, 80-90, 20120413
  295. Mobile agent rendezvous on a probabilistic edge evolving ring, Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012, 103-112, 20120101
  296. Autonomous multi-source multi-sink routing in wireless sensor networks, Journal of Information Processing, 20(1), 319-326, 20120101
  297. Fast and reliable route maintenance protocols for WSN with crash and intermittent failures, Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011, 40-49, 20111201
  298. Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6796 LNCS, 150-161, 20110810
  299. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412(33), 4336-4349, 20110729
  300. A Robust and Fast Routing Mechanism in Wireless Sensor Networks, IEICE technical report, 110(378), 73-78, 20110113
  301. A token-based distributed algorithm for the generalized resource allocation problem, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6490 LNCS, 411-426, 20101201
  302. Mobile robots gathering algorithm with local weak multiplicity in rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6058 LNCS, 101-113, 20100714
  303. A Self-stabilizing distributed approximation algorithm for the minimum connected dominating set, International Journal of Foundations of Computer Science, 21(3), 459-476, 20100601
  304. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180(10), 1802-1816, 20100515
  305. Biased Index Distribution Technique and its Application for P2P File Search, IEICE technical report. Information networks, 109(362), 1-6, 20100107
  306. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6196 LNCS, 80-89, 20100101
  307. A heuristic routing scheme for wireless sensor networks based on a local search method, I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 46-51, 20091201
  308. Randomized gathering of mobile robots with local-multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5873 LNCS, 384-398, 20091201
  309. Cached sensornet transformation of non-silent self-stabilizing algorithms with unreliable links, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5873 LNCS, 428-442, 20091201
  310. A shape recognition scheme for wireless sensor networks based on a distance field method, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5574 LNCS, 350-361, 20090921
  311. A self-stabilizing approximation for the minimum connected dominating set with safe convergence, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5401 LNCS, 496-511, 20081201
  312. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19(9), 1153-1166, 20080819
  313. An improvement of the interest mining method based on a network reconfiguration, IEICE technical report. Information networks, 108(136), 7-12, 20080710
  314. On effective index caching technique for P2P file-sharing systems, IEICE technical report. Information networks, 108(136), 1-6, 20080710
  315. Timer-based composition technique for self-stabilizing protocols preserving the fault-containment property, IPSJ SIG Notes, 2008(49), 1-8, 20080520
  316. A self-stabilizing distributed approximation algorithm for the minimum connected dominating set, Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM, 20070924
  317. A Time-based Appraising Method in Cached Peer-to-Peer Networks, Technical report of IEICE. CST, 105(573), 69-74, 20060120
  318. A Coterie Construction Algorithm in Dynamic Environment, Technical report of IEICE. CST, 105(573), 63-68, 20060120
  319. Composition of fault-containing protocols based on recovery waiting fault-containing composition framework, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4280 LNCS, 516-532, 20060101
  320. A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination(Discrete Mathematics and Its Applications), IEICE transactions on fundamentals of electronics, communications and computer sciences, 88(5), 1109-1116, 20050501
  321. A self-stabilizing approximation algorithm for the distributed minimum k-domination, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A(5), 1109-1115, 20050101
  322. A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem, IEICE Transactions on Information and Systems, E87-D(2), 299-307, 20040101
  323. A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 720-724, 20031201
  324. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 742-746, 20031201
  325. A Self-Stabilizing Algorithm for the Steiner Tree Problem, IPSJ SIG Notes, 2003(92), 43-50, 20030919
  326. A self-stabilizing algorithm for the Steiner tree problem, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 396-401, 20021217
  327. Drastic Fluctuation Prediction of the Number of Comments on Social Media by Attributes of Comments, INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING, 15(01), 1-21, 202103
    Link to Paper Search Results by DOI
  328. Brief announcement: Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots, Proc. 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, 201910
  329. A self-stabilizing algorithm for two disjoint minimal dominating sets with safe convergence, 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS), 201812
  330. Rating Prediction with Topic Gradient Descent Method for Matrix Factorization in Recommendation, INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 8(12), 469-476, 201712
  331. A Japanese Tourism Recommender System with Automatic Generation of Seasonal Feature Vectors, INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 8(6), 347-354, 201706
  332. A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 21(3), 459-476, 201006
    Link to Paper Search Results by DOI
  333. Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E92D(3), 451-459, 200903
    Link to Paper Search Results by DOI
  334. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, International Journal of Networking and Computing, 10(2), 111-126, 2020
  335. Asynchronous message-passing distributed algorithm for the global critical section problem, International Journal of Networking and Computing, 9(2), 2019
  336. Brief Announcement: Neighborhood Mutual Remainder and its Self-Stabilizing Implementation of Look-Compute-Move Robots, Proc. 33rd International Symposium on Distributed Computing, 2019
  337. Course Recommendation System using Doc2Vec, 2019
  338. An asynchronous message-passing distributed algorithm for the global critical section problem, Proc. the 9th International Workshop on Parallel and Distributed Algorithms and Applications, in conjunction with CANDAR 2017, 2017
  339. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, The Fifth International Conference on Network, Communication and Computing (ICNCC), Proceedings, 2016
  340. Ring Gathering by Robots with Limited Vision, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  341. Set Cover Formation Algorithms by Mobile Robots, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  342. An Asynchronous Self-Stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence in Unit Disk Graphs, The 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS2013),, 251-265, 2013
  343. Special Issue on Selected Papers from the First International Conference Networking and Computing, IJNC, 1(2), 131-131, 2011
  344. Self-stabilizing graph exploration by a single agent, Theoretical Computer Science, 1082, 20260902
  345. Self-stabilizing graph exploration by a single agent, Theoretical Computer Science, 1082, 20260902
  346. BERT Pre-Training for Cooking Time Prediction from Japanese Cooking Recipes, IEICE Transactions on Information and Systems, E109.D(4), 531-540, 20260401
  347. BERT Pre-Training for Cooking Time Prediction from Japanese Cooking Recipes, IEICE Transactions on Information and Systems, E109.D(4), 531-540, 20260401
  348. Message from the Doctoral Symposium Chairs, Icdcn 2026 Companion Proceedings of the International Conference on Distributed Computing and Networking 2026, 20260104
  349. Message from the Doctoral Symposium Chairs, Icdcn 2026 Companion Proceedings of the International Conference on Distributed Computing and Networking 2026, 20260104
  350. Pattern Formation of Mobile Agents in Dynamic Grids, Lecture Notes in Computer Science, 15736 LNCS, 114-128, 20260101
  351. Pattern Formation of Mobile Agents in Dynamic Grids, Lecture Notes in Computer Science, 15736 LNCS, 114-128, 20260101
  352. Image Captioning via Masked Conditional Diffusion, Lecture Notes in Computer Science, 16199 LNCS, 482-495, 20260101
  353. Image Captioning via Masked Conditional Diffusion, Lecture Notes in Computer Science, 16199 LNCS, 482-495, 20260101
  354. Extending the Writing Distance: the R(dr)W(dw) Communication Model for Self-stabilizing Distributed Algorithms, Lecture Notes in Computer Science, 16488 LNCS, 411-429, 20260101
  355. Extending the Writing Distance: the R(dr)W(dw) Communication Model for Self-stabilizing Distributed Algorithms, Lecture Notes in Computer Science, 16488 LNCS, 411-429, 20260101
  356. Uniform Deployment of Myopic Luminous Robots in Rings, Lecture Notes in Computer Science, 16488 LNCS, 509-526, 20260101
  357. Uniform Deployment of Myopic Luminous Robots in Rings, Lecture Notes in Computer Science, 16488 LNCS, 509-526, 20260101
  358. Privacy-Aware Table Data Generation by Adversarial Gradient Boosting Decision Tree, Mathematics, 13(15), 20250801
  359. Privacy-Aware Table Data Generation by Adversarial Gradient Boosting Decision Tree, Mathematics, 13(15), 20250801
  360. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics Lipics, 324, 20250108
  361. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics Lipics, 324, 20250108
  362. Self-stabilizing Graph Exploration by a Single Agent, Lecture Notes in Computer Science, 15671 LNCS, 384-400, 20250101
  363. Self-stabilizing Graph Exploration by a Single Agent, Lecture Notes in Computer Science, 15671 LNCS, 384-400, 20250101
  364. A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science, 15671 LNCS, 159-175, 20250101
  365. A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science, 15671 LNCS, 159-175, 20250101
  366. Crash-Tolerant perpetual exploration of myopic luminous robots with fewer colors on rings, International Symposium on Computing and Networking Workshops Candarw, 166-172, 20250101
  367. Crash-Tolerant perpetual exploration of myopic luminous robots with fewer colors on rings, International Symposium on Computing and Networking Workshops Candarw, 166-172, 20250101
  368. Multi-Interest Sequential Recommendation Based on Prompt-Oriented BERT, Proceedings 2025 13th International Symposium on Computing and Networking Candar 2025, 167-173, 20250101
  369. Multi-Interest Sequential Recommendation Based on Prompt-Oriented BERT, Proceedings 2025 13th International Symposium on Computing and Networking Candar 2025, 167-173, 20250101
  370. A self-stabilizing algorithm for the dynamic total domination problem, Proceedings 2025 13th International Symposium on Computing and Networking Candar 2025, 58-65, 20250101
  371. A self-stabilizing algorithm for the dynamic total domination problem, Proceedings 2025 13th International Symposium on Computing and Networking Candar 2025, 58-65, 20250101
  372. InstGAN: Instant Actor-Critic-Driven GAN for De Novo Molecule Generation and Property Optimization, Ijcai International Joint Conference on Artificial Intelligence, 6236-6244, 20250101
  373. InstGAN: Instant Actor-Critic-Driven GAN for De Novo Molecule Generation and Property Optimization, Ijcai International Joint Conference on Artificial Intelligence, 6236-6244, 20250101
  374. Tailored Federated Learning: Leveraging Direction Regulation and Knowledge Distillation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 15388 LNAI, 270-284, 20250101
  375. Tailored Federated Learning: Leveraging Direction Regulation and Knowledge Distillation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 15388 LNAI, 270-284, 20250101
  376. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation Practice and Experience, 36(26), 20241130
  377. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation Practice and Experience, 36(26), 20241130
  378. MacGAN: A Moment-Actor-Critic Reinforcement Learning-Based Generative Adversarial Network for Molecular Generation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14331 LNCS, 127-141, 20240101
  379. MacGAN: A Moment-Actor-Critic Reinforcement Learning-Based Generative Adversarial Network for Molecular Generation, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14331 LNCS, 127-141, 20240101
  380. EarlGAN: An enhanced actor–critic reinforcement learning agent-driven GAN for de novo drug design, Pattern Recognition Letters, 175, 45-51, 20231101
  381. EarlGAN: An enhanced actor–critic reinforcement learning agent-driven GAN for de novo drug design, Pattern Recognition Letters, 175, 45-51, 20231101
  382. A Visual Interpretation-Based Self-improved Classification System Using Virtual Adversarial Training, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14179 LNAI, 548-562, 20230101
  383. A Visual Interpretation-Based Self-improved Classification System Using Virtual Adversarial Training, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 14179 LNAI, 548-562, 20230101

Invited Lecture, Oral Presentation, Poster Presentation

  1. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Quentin Bramas, Hirotsugu Kakugawa, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, and Sebastien Tixeuil, The 38th International Conference on Advanced Information Networking and Applications (AINA-2024), 2024/04/17, Without Invitation, English, published
  2. Stand-Up Indulgent Gathering on Lines, Quentin Bramas, Anissa Lamani, and Sebastien Tixeuil,, 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2023/10/02, Without Invitation, English, Institute for Future Technologies (NJIT-BGU Partnership), 101 Hudson Street, Jersey City, New Jersey, USA, published
    Related URL
  3. An asynchronous maximum independent set algorithm by myopic luminous robots on grids, SAYAKA KAMEI, SÉBASTIEN TIXEUIL, Research Meeting and School on Distributed Computing by Mobile Robots, 2022/09/19, With Invitation, English, Pisa, Italia
    Related URL
  4. Autonomous Distributed Systems of Myopic Mobile Robots with Lights, Sayaka Kamei, 22nd International Conference on Distributed Computing and Networking, 2021/01/07, With Invitation, English
    Related URL
  5. Asynchronous Ring Gathering by Oblivious Robots with Limited Vision, Anissa Lamani, Fukuhito Ooshita, IEEE Symposium on Reliable Distributed Systems, 2014/10/06, Without Invitation, English, IEEE, Nara
  6. Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots, Sayaka Kamei, Tomoko Izumi, Yukiko Yamauchi, The 18th International Conference on Principles of Distributed Systems, 2014/12/19, Without Invitation, English
  7. How to Extract Seasonal Features of Sightseeing Spots from Twitter and Wikipedia (Preliminary Version), Guanshen Fang, Satoshi Fujita, International Workshop on Networking, Computing, Systems, and Software, 2014/12/10, Without Invitation, English
  8. Ring Gathering by Robots with Limited Vision, Anissa Lamani, Anissa Lamani, Fukuhito Ooshita, The 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015),, 2015/05, Without Invitation, English
  9. Set Cover Formation Algorithms by Mobile Robots, Sayaka Kamei, Tomoko Izumi, Yukiko Yamauchi, The 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015/05, Without Invitation, English
  10. A Method of Temporal Feature Characterization with Application to Tourism Recommender Systems, 2016/03, Without Invitation, Japanese
  11. A Survey on Self-stabilizing Distributed Approximation Algorithms, Sayaka Kamei, Workshop on Advanced Distributed Algorithms, 2016/11/23, With Invitation, English, Higashi-hiroshima
  12. An asynchronous message-passing distributed algorithm for the global critical section problem, Sayaka Kamei, Hirotsugu Kakugawa, The 9th International Workshop on Parallel and Distributed Algorithms and Applications, in conjunction with CANDAR 2017, 2017/11/20, Without Invitation, English
  13. Drastic Fluctuation Prediction of the Number of Comments on Social Media by Feature Comments, Yuan Wang, Sayaka Kamei, Satoshi Fujita, 2018/10/20, Without Invitation, English, Hiroshima

Awards

  1. 2025/11/28, PDAA Best Paper Award, The Thirteenth International Symposium on Computing and Networking, Crash-Tolerant Perpetual Exploration of Myopic Luminous Robots with Fewer Colors on Rings
  2. 2020/11/29, CANDAR Outstanding Paper Award, CANDAR, Evacuation from a Finite 2D Square Grid Field by a Metamorphic Robotic System
  3. 2018/11/29, Best Paper Award The 10th International Workshop on Parallel and Distributed Algorithms and Applications, The 10th International Workshop on Parallel and Distributed Algorithms and Applications, Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets
  4. 2017/11/20, Best Paper Award The 9th International Workshop on Parallel and Distributed Algorithms and Applications
  5. 2017/11/20, CANDAR/Workshop Best/Outstanding Paper Award, An asynchronous message-passing distributed algorithm for the global critical section problem
  6. 2016/11/23, Best Paper Award The 7th International Workshop on Advances in Networking and Computing (WANC), WANC Organizing Committee

External Funds

Acceptance Results of Competitive Funds

  1. KAKENHI, 2014, 2018
    Permalink
  2. KAKENHI, A study of fault-tolerant distributed approximation algorithms for dynamic wireless networks, 2010, 2013
    Permalink
  3. KAKENHI, Research on self-* distributed algorithms in dynamic netwroks, 2008, 2011
    Permalink
  4. KAKENHI, 2023, 2026
    Permalink
  5. KAKENHI, A Study of fault-tolerant distributed approximation algorithms for MANET, 2007, 2009
    Permalink
  6. KAKENHI(Grant-in-Aid for Scientific Research (C)), 2019, 2023
  7. Strategic International Collaborative Research Program, 2018/06/01, 2022/03/31

Social Activities

History as Committee Members

  1. Guest Editor, 2020/12, 2021/06, Concurrency and Computation: Practice and Experience
  2. guest editor, 2020/09, 2021/03, Concurrency and Computation: Practice and Experience
  3. Guest Editor, 2019/12, 2020/06, Concurrency and Computation: Practice and Experience
  4. editor, 2019/05, 2023/05, IEICE
  5. Guest Editor, 2018/11, 2019/11, Concurrency and Computation: Practice and Experience
  6. Guest Editor, 2021/12, 2022/06, Concurrency and Computation: Practice and Experience
  7. Guest Editor, 2022/12, 2023/06, Concurrency and Computation: Practice and Experience
  8. Guest Editor, 2023/12, 2024/06, Concurrency and Computation: Practice and Experience

Organizing Academic Conferences, etc.

  1. SSS2025, Steering Committee, 2025/01, 2025/10
    Permalink
  2. Program vice-chairs (Track-chairs), 2025/04, 2025/11
    Permalink
  3. 2023/09, 2024/03
  4. ALGOWIN 2024, program committee, 2024/04, 2024/09
    Permalink
  5. ICDCIT-2024, program committee, 2023/06, 2024/01
    Permalink
  6. ICDCIT-2025, program committee, 2024/06, 2025/01
    Permalink
  7. Euro-Par'2023 (Euro-Par'2023: 29th International European Conference on Parallel and Distributed Computing (Euro-Par'2023)), PC member, 2023/02, 2023/09
  8. ICDCN2023, Program Comittee, 2022/01, 2023/01
  9. SSS, Program Comitee, 2022/01, 2022/11
  10. OPODIS, Program Comitee, 2021/05, 2021/12
  11. PDAA, Workshop co-chair, 2021/11, 2021/11
  12. CANDAR, Program Committee, 2021/04, 2021/11
  13. WDALFR, WORKSHOP co-organizer, 2020/20, 2021/01
    Permalink
  14. CANDAR, Program Committee, 2020/07, 2020/11
    Permalink
  15. ICDCN, Program comittee, 2020/06, 2021/01
    Permalink
  16. SSS2020, Track chair, 2020/03, 2020/11
    Permalink
  17. PDAA, Workshop co-chair, 2020/03, 2020/11
    Permalink
  18. ICDCN, Technical Program Committee, 2020/01, 2020/01
  19. CANDAR, Program Committee, 2019/11, 2019/11
  20. PDAA, Workshop co-chair, 2019/11, 2019/11
  21. Workshop on Distributed Algorithms for Low-Functional Robots, Organizers, 2019/11, 2019/11
  22. The 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), PC (Track C: Theoretical and Practical Aspects of Stabilizing Systems), 2019/10, 2019/10
  23. PDAA, Workshop co-chair, 2018/11, 2018/11
  24. CANDAR, PC member, 2018/11, 2018/11
  25. SSS, PC member (Stabilizing Systems: Theory and Practice), 2017/11, 2017/11
  26. CANDAR, PC member (Track 1: Algorithms and Applications), 2017/11, 2017/11
  27. PDAA, PC member (PDAA: International Workshop on Parallel and Distributed Algorithms and Applications), 2017/11, 2017/11
  28. 2016/03, 2016/11
  29. 2016/, 2016/
  30. ICDCN 2017, program committee, 2016/, 2016/
  31. PDAA2016, Program comittee, 2016/, 2016/
  32. CANDAR 2016, program committee, 2016/, 2016/
  33. APDCM 2016, Program Committee, 2016/, 2016/
  34. APDCM2015, program committee, 2015/05, 2015/05
  35. DISC2015, Local Arrangement Team, 2015/04, 2015/10
    Permalink
  36. WSSR, committee member, 2014/12, 2014/12
  37. SSS, track program committee, 2014/09, 2014/10
  38. LA symposium, 2014/04, 2015/05
  39. SIROCCO2014, organization committee, 2013/09, 2014/08
  40. CANDAR, Program Committee, 2023/04, 2023/11
    Permalink
  41. CANDAR2024, Program Committee, 2024/04, 2024/11
    Permalink
  42. PDAA2023, Workshop co-chair, 2023/11, 2023/11
    Permalink
  43. PDAA2024, Workshop co-chair, 2024/11, 2024/11
    Permalink
  44. PDAA, Workshop co-chair, 2022/11, 2022/11
  45. OPODIS, Program Comitee, 2023/05, 2023/12
  46. SSS2024, Track A, Co-Chair, 2024/01, 2024/11
    Permalink
  47. SSS, Program Comitee, 2023/01, 2023/11