亀井 清華SAYAKA KAMEI

Last Updated :2026/07/01

所属・職名
大学院先進理工系科学研究科 教授
ホームページ
メールアドレス
s10kameihiroshima-u.ac.jp
自己紹介
分散アルゴリズムの研究を行っております.

基本情報

学歴

  • 広島大学, 大学院工学研究科, 情報工学専攻博士課程, 日本, 2003年04月, 2006年03月
  • 広島大学, 大学院工学研究科, 情報工学専攻博士課程前期, 日本, 2001年04月, 2003年03月
  • 広島大学, 工学部, 第二類(電気・電子・システム・情報系), 日本, 1997年04月, 2001年03月

学位

  • 博士(工学) (広島大学)
  • 修士(工学) (広島大学)

教育担当

  • 【学士課程】 情報科学部 : 情報科学科 : データ科学プログラム
  • 【博士課程前期】 先進理工系科学研究科 : 先進理工系科学専攻 : 情報科学プログラム
  • 【博士課程後期】 先進理工系科学研究科 : 先進理工系科学専攻 : 情報科学プログラム

研究分野

  • 情報学 / 情報学基礎 / 情報学基礎理論

研究キーワード

  • 分散アルゴリズム

所属学会

教育活動

授業担当

  1. 2026年, 学部専門, セメスター(前期), プログラミングI
  2. 2026年, 学部専門, セメスター(後期), プログラミングIV
  3. 2026年, 学部専門, 1ターム, 情報科学演習I
  4. 2026年, 学部専門, 1ターム, データ科学セミナーI
  5. 2026年, 学部専門, 2ターム, データ科学セミナーII
  6. 2026年, 学部専門, セメスター(後期), 卒業論文
  7. 2026年, 修士課程・博士課程前期, 1ターム, 情報科学特別演習A
  8. 2026年, 修士課程・博士課程前期, 2ターム, 情報科学特別演習A
  9. 2026年, 修士課程・博士課程前期, 3ターム, 情報科学特別演習B
  10. 2026年, 修士課程・博士課程前期, 4ターム, 情報科学特別演習B
  11. 2026年, 修士課程・博士課程前期, 年度, 情報科学特別研究
  12. 2026年, 修士課程・博士課程前期, 2ターム, 情報検索概論
  13. 2026年, 博士課程・博士課程後期, 年度, 情報科学特別研究

研究活動

学術論文(★は代表的な論文)

  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号, pp. 531-540, 202604
  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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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, pp. 203-207, 20161217
  34. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, pp. 203-207, 20161217
  35. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0巻, 0号, pp. 46-49, 20141230
  36. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0巻, 0号, pp. 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号, pp. 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号, pp. 430-459, 20130401
  39. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24巻, 4号, pp. 716-723, 20130319
  40. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24巻, 4号, pp. 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号, pp. 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号, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 150-161, 20110810
  47. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412巻, 33号, pp. 4336-4349, 20110729
  48. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412巻, 33号, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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号, pp. 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号, pp. 459-476, 20100601
  55. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180巻, 10号, pp. 1802-1816, 20100515
  56. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180巻, 10号, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 428-442, 20091201
  63. Hierarchical composition of self-stabilizing protocols preserving the fault-containment property, IEICE Transactions on Information and Systems, E92-D巻, 3号, pp. 451-459, 20090101
  64. Hierarchical composition of self-stabilizing protocols preserving the fault-containment property, IEICE Transactions on Information and Systems, E92-D巻, 3号, pp. 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巻, pp. 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巻, pp. 496-511, 20081201
  67. Timer-based composition of fault-containing self-stabilizing protocols, Studies in Computational Intelligence, 162巻, pp. 217-226, 20080922
  68. Timer-based composition of fault-containing self-stabilizing protocols, Studies in Computational Intelligence, 162巻, pp. 217-226, 20080922
  69. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19巻, 9号, pp. 1153-1166, 20080819
  70. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19巻, 9号, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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号, pp. 83-100, 20240301
  84. Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Acta Informatica, 61巻, 1号, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 162-168, 20240101
  97. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 110-121, 20240101
  98. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 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, pp. 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, pp. 710-712, 20170113
  161. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, pp. 203-207, 20161217
  162. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, pp. 203-207, 20161217
  163. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615巻, pp. 102-119, 20160215
  164. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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号, pp. 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号, pp. 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号, pp. 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号, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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号, pp. 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号, pp. 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巻, pp. 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巻, pp. 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, pp. 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, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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号, pp. 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号, pp. 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, pp. 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, pp. 720-724, 20031201
  211. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing Applications and Technologies PDCAT Proceedings, pp. 742-746, 20031201
  212. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing Applications and Technologies PDCAT Proceedings, pp. 742-746, 20031201
  213. Privacy-Aware Table Data Generation by Adversarial Gradient Boosting Decision Tree, MATHEMATICS, 13巻, 15号, 20250804
  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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 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巻, pp. 119-137, 20240101
  228. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 110-121, 20240101
  229. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 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巻, pp. 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巻, pp. 451-465, 20230101
  232. Gathering on Rings for Myopic Asynchronous Robots with Lights, THEORY OF COMPUTING SYSTEMS, 69巻, 1号, 202503
  233. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 36巻, 26号, 20241130
  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
  236. Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Acta Informatica, 61巻, 1号, pp. 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号, pp. 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巻, pp. 119-137, 20240523
  241. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 110-121, 20240410
  242. EarlGAN: An enhanced actor–critic reinforcement learning agent-driven GAN for de novo drug design, Pattern Recognition Letters, 175巻, pp. 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
  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巻, pp. 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巻, pp. 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, pp. 100-106, 20231127
  250. A self-stabilizing token circulation with graceful handover on bidirectional ring networks, International Journal of Networking and Computing, 12巻, 1号, pp. 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, pp. 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巻, pp. 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, pp. 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, pp. 1140-1150, 20220101
  256. ホテルの評価値予測のためのカテゴリ特化型感情極性辞書, 情報処理学会論文誌(TOD), 14巻, 3号, pp. 16-29, 20210713
  257. Matrix Factorization with Topic and Sentiment Analysis for Rating Prediction, International Journal of Networking and Computing, 11巻, 2号, pp. 198-214, 20210701
  258. A self-stabilizing distributed algorithm for the local (1,|Ni|)-critical section problem, Concurrency and Computation: Practice and Experience, 33巻, 12号, 20210625
  259. 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, pp. 596-604, 20210601
  260. A Distributed Multi-group Mutual Exclusion Algorithm for Intersection Traffic Control, Proceedings - 2021 9th International Symposium on Computing and Networking Workshops, CANDARW 2021, pp. 265-291, 20210101
  261. 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巻, pp. 229-242, 20210101
  262. Category-oriented Sentiment Polarity Dictionary for Rating Prediction of Japanese Hotels, Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020, pp. 440-444, 20201101
  263. Topic and Sentiment Analysis Matrix Factorization on Rating Prediction for Recommendation, Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020, pp. 137-143, 20201101
  264. Evacuation from a finite 2D square grid field by a metamorphic robotic system, Proceedings - 2020 8th International Symposium on Computing and Networking, CANDAR 2020, pp. 69-78, 20201101
  265. Gathering on rings for myopic asynchronous robots with lights, Leibniz International Proceedings in Informatics, LIPIcs, 153巻, 20200201
  266. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, Proceedings - 2019 7th International Symposium on Computing and Networking, CANDAR 2019, pp. 218-224, 20191101
  267. Forgive & Forget: Self-stabilizing swarms in spite of byzantine robots, Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019, pp. 188-194, 20191101
  268. Brief announcement: Neighborhood mutual remainder and its self-stabilizing implementation of look-compute-move robots, Leibniz International Proceedings in Informatics, LIPIcs, 146巻, 20191001
  269. 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, pp. 609-618, 20190501
  270. 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巻, pp. 127-132, 20190101
  271. 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巻, pp. 16-21, 20190101
  272. Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets, Proceedings - 2018 6th International Symposium on Computing and Networking Workshops, CANDARW 2018, pp. 278-284, 20181226
  273. 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巻, pp. 365-372, 20180702
  274. 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, pp. 221-224, 20170714
  275. 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巻, pp. 414-419, 20170702
  276. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10巻, 2号, 20170601
  277. A hotel recommendation system based on reviews: What do you attach importance to?, Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016, pp. 710-712, 20170113
  278. Automatic generation of temporal feature vectors with application to tourism recommender systems, Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016, pp. 676-680, 20170113
  279. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, pp. 203-207, 20161217
  280. Personalized web page recommendation based on preference footprint to browsed pages, IEICE Transactions on Information and Systems, E99D巻, 11号, pp. 2705-2715, 20161101
  281. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615巻, pp. 102-119, 20160215
  282. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0巻, 0号, pp. 46-49, 20141230
  283. レビューを対象とした信頼性判断支援システムの提案, 情報処理学会論文誌, 55巻, 11号, pp. 2461-2475, 20141115
  284. レビューに対する信頼性判断支援システムの提案, 第76回全国大会講演論文集, 2014巻, 1号, pp. 633-634, 20140311
  285. 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巻, pp. 233-247, 20140101
  286. 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巻, pp. 251-265, 20131201
  287. 事例間の距離に応じた重要度の付与によるノイズ耐性を考慮したブースティング手法(ポスターセッション,第16回情報論的学習理論ワークショップ), 電子情報通信学会技術研究報告. IBISML, 情報論的学習理論と機械学習, 113巻, 286号, pp. 15-21, 20131105
  288. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Journal of Combinatorial Optimization, 25巻, 3号, pp. 430-459, 20130401
  289. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24巻, 4号, pp. 716-723, 20130319
  290. 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号, pp. 1072-1080, 20130101
  291. Empirical analysis of periodically bookmarked web pages in social bookmarking systems, Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012, pp. 85-93, 20121201
  292. 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巻, pp. 92-94, 20121107
  293. 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巻, pp. 92-94, 20121107
  294. 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巻, pp. 542-553, 20120820
  295. 転送遅延を考慮したWMN上のアクセスポイント削減手法(映像/音声サービスの品質,メディア品質,ネットワークの品質・QoS制御,次世代/新世代ネットワークアーキテクチャ,超臨場感コミュニケーション,信頼性,一般), 電子情報通信学会技術研究報告. CQ, コミュニケーションクオリティ, 112巻, 119号, pp. 71-76, 20120705
  296. A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Theoretical Computer Science, 428巻, pp. 80-90, 20120413
  297. 周波数分析を利用した周期的にブックマークされるwebページの特定, 第74回全国大会講演論文集, 2012巻, 1号, pp. 719-720, 20120306
  298. Mobile agent rendezvous on a probabilistic edge evolving ring, Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012, pp. 103-112, 20120101
  299. Autonomous multi-source multi-sink routing in wireless sensor networks, Journal of Information Processing, 20巻, 1号, pp. 319-326, 20120101
  300. Fast and reliable route maintenance protocols for WSN with crash and intermittent failures, Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011, pp. 40-49, 20111201
  301. 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巻, pp. 150-161, 20110810
  302. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412巻, 33号, pp. 4336-4349, 20110729
  303. 無線センサネットワーク上の低遅延な耐故障ルーティングアルゴリズム(モバイルユビキタス/センサ技術,アドホックネットワーク,RFID,一般及び技術展示), 電子情報通信学会技術研究報告. USN, ユビキタス・センサネットワーク, 110巻, 378号, pp. 73-78, 20110113
  304. 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巻, pp. 411-426, 20101201
  305. 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巻, pp. 101-113, 20100714
  306. A Self-stabilizing distributed approximation algorithm for the minimum connected dominating set, International Journal of Foundations of Computer Science, 21巻, 3号, pp. 459-476, 20100601
  307. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180巻, 10号, pp. 1802-1816, 20100515
  308. 偏りのあるインデックス配布手法とP2Pファイル検索への応用(P2P,コンテンツ配信,コンテンツ配信,コンテキストアウェアネス,IPv6,認証,ID/名前管理及び一般), 電子情報通信学会技術研究報告. IN, 情報ネットワーク, 109巻, 362号, pp. 1-6, 20100107
  309. 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巻, pp. 80-89, 20100101
  310. 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, pp. 46-51, 20091201
  311. 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巻, pp. 384-398, 20091201
  312. 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巻, pp. 428-442, 20091201
  313. 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巻, pp. 350-361, 20090921
  314. 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巻, pp. 496-511, 20081201
  315. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19巻, 9号, pp. 1153-1166, 20080819
  316. ネットワーク再構成を用いたインタレストマイニング法の改良(IPv6,P2P,NGN,VoIP,FMC,コンテンツ配信,IPv6及び一般), 電子情報通信学会技術研究報告. IN, 情報ネットワーク, 108巻, 136号, pp. 7-12, 20080710
  317. P2Pファイル共有システムにおける効率的なインデックスキャッシュ手法(IPv6,P2P,NGN,VoIP,FMC,コンテンツ配信,IPv6及び一般), 電子情報通信学会技術研究報告. IN, 情報ネットワーク, 108巻, 136号, pp. 1-6, 20080710
  318. 故障封じ込め自己安定プロトコルに対するタイマーを利用した合成手法, 情報処理学会研究報告. AL, アルゴリズム研究会報告, 2008巻, 49号, pp. 1-8, 20080520
  319. 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
  320. キャッシュを行うP2Pシステムにおける時間を基にした評価手法(コンカレントシステム, 一般), 電子情報通信学会技術研究報告. CST, コンカレント工学, 105巻, 573号, pp. 69-74, 20060120
  321. 動的環境に於けるコータリ構成アルゴリズム(コンカレントシステム, 一般), 電子情報通信学会技術研究報告. CST, コンカレント工学, 105巻, 573号, pp. 63-68, 20060120
  322. 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巻, pp. 516-532, 20060101
  323. 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号, pp. 1109-1116, 20050501
  324. A self-stabilizing approximation algorithm for the distributed minimum k-domination, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A巻, 5号, pp. 1109-1115, 20050101
  325. A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem, IEICE Transactions on Information and Systems, E87-D巻, 2号, pp. 299-307, 20040101
  326. 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, pp. 720-724, 20031201
  327. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, pp. 742-746, 20031201
  328. スタイナー木問題を解く自己安定分散アルゴリズム, 情報処理学会研究報告. AL, アルゴリズム研究会報告, 2003巻, 92号, pp. 43-50, 20030919
  329. A self-stabilizing algorithm for the Steiner tree problem, Proceedings of the IEEE Symposium on Reliable Distributed Systems, pp. 396-401, 20021217
  330. Drastic Fluctuation Prediction of the Number of Comments on Social Media by Attributes of Comments, INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING, 15巻, 01号, pp. 1-21, 202103
  331. 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
  332. 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
  333. Rating Prediction with Topic Gradient Descent Method for Matrix Factorization in Recommendation, INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 8巻, 12号, pp. 469-476, 201712
  334. A Japanese Tourism Recommender System with Automatic Generation of Seasonal Feature Vectors, INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 8巻, 6号, pp. 347-354, 201706
  335. A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 21巻, 3号, pp. 459-476, 201006
  336. Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E92D巻, 3号, pp. 451-459, 200903
  337. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, International Journal of Networking and Computing, 10巻, 2号, pp. 111-126, 2020
  338. Asynchronous message-passing distributed algorithm for the global critical section problem, International Journal of Networking and Computing, 9巻, 2号, 2019
  339. Brief Announcement: Neighborhood Mutual Remainder and its Self-Stabilizing Implementation of Look-Compute-Move Robots, Proc. 33rd International Symposium on Distributed Computing, 2019
  340. 履修支援のためのDoc2Vecを用いた科目推薦システム, 情報処理学会論文誌, 2019
  341. 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
  342. 口コミを用いた嗜好抽出に基づくホテル推薦手法, 情報処理学会第78回全国大会, 2016
  343. 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
  344. Ring Gathering by Robots with Limited Vision, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  345. Set Cover Formation Algorithms by Mobile Robots, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  346. 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),, pp. 251-265, 2013
  347. Special Issue on Selected Papers from the First International Conference Networking and Computing, IJNC, 1巻, 2号, pp. 131-131, 2011
  348. 口コミに基づくホテル推薦のための辞書作成法, 情報処理学会第78回全国大会
  349. 会話の選択的聴取を支援する音声チャットシステム, 情報処理学会第78回全国大会
  350. Self-stabilizing graph exploration by a single agent, Theoretical Computer Science, 1082巻, 20260902
  351. Self-stabilizing graph exploration by a single agent, Theoretical Computer Science, 1082巻, 20260902
  352. BERT Pre-Training for Cooking Time Prediction from Japanese Cooking Recipes, IEICE Transactions on Information and Systems, E109.D巻, 4号, pp. 531-540, 20260401
  353. BERT Pre-Training for Cooking Time Prediction from Japanese Cooking Recipes, IEICE Transactions on Information and Systems, E109.D巻, 4号, pp. 531-540, 20260401
  354. Message from the Doctoral Symposium Chairs, Icdcn 2026 Companion Proceedings of the International Conference on Distributed Computing and Networking 2026, 20260104
  355. Message from the Doctoral Symposium Chairs, Icdcn 2026 Companion Proceedings of the International Conference on Distributed Computing and Networking 2026, 20260104
  356. Pattern Formation of Mobile Agents in Dynamic Grids, Lecture Notes in Computer Science, 15736 LNCS巻, pp. 114-128, 20260101
  357. Pattern Formation of Mobile Agents in Dynamic Grids, Lecture Notes in Computer Science, 15736 LNCS巻, pp. 114-128, 20260101
  358. Image Captioning via Masked Conditional Diffusion, Lecture Notes in Computer Science, 16199 LNCS巻, pp. 482-495, 20260101
  359. Image Captioning via Masked Conditional Diffusion, Lecture Notes in Computer Science, 16199 LNCS巻, pp. 482-495, 20260101
  360. Extending the Writing Distance: the R(dr)W(dw) Communication Model for Self-stabilizing Distributed Algorithms, Lecture Notes in Computer Science, 16488 LNCS巻, pp. 411-429, 20260101
  361. Extending the Writing Distance: the R(dr)W(dw) Communication Model for Self-stabilizing Distributed Algorithms, Lecture Notes in Computer Science, 16488 LNCS巻, pp. 411-429, 20260101
  362. Uniform Deployment of Myopic Luminous Robots in Rings, Lecture Notes in Computer Science, 16488 LNCS巻, pp. 509-526, 20260101
  363. Uniform Deployment of Myopic Luminous Robots in Rings, Lecture Notes in Computer Science, 16488 LNCS巻, pp. 509-526, 20260101
  364. Privacy-Aware Table Data Generation by Adversarial Gradient Boosting Decision Tree, Mathematics, 13巻, 15号, 20250801
  365. Privacy-Aware Table Data Generation by Adversarial Gradient Boosting Decision Tree, Mathematics, 13巻, 15号, 20250801
  366. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics Lipics, 324巻, 20250108
  367. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics Lipics, 324巻, 20250108
  368. Self-stabilizing Graph Exploration by a Single Agent, Lecture Notes in Computer Science, 15671 LNCS巻, pp. 384-400, 20250101
  369. Self-stabilizing Graph Exploration by a Single Agent, Lecture Notes in Computer Science, 15671 LNCS巻, pp. 384-400, 20250101
  370. A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science, 15671 LNCS巻, pp. 159-175, 20250101
  371. A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science, 15671 LNCS巻, pp. 159-175, 20250101
  372. Crash-Tolerant perpetual exploration of myopic luminous robots with fewer colors on rings, International Symposium on Computing and Networking Workshops Candarw, 2025号, pp. 166-172, 20250101
  373. Crash-Tolerant perpetual exploration of myopic luminous robots with fewer colors on rings, International Symposium on Computing and Networking Workshops Candarw, 2025号, pp. 166-172, 20250101
  374. Multi-Interest Sequential Recommendation Based on Prompt-Oriented BERT, Proceedings 2025 13th International Symposium on Computing and Networking Candar 2025, pp. 167-173, 20250101
  375. Multi-Interest Sequential Recommendation Based on Prompt-Oriented BERT, Proceedings 2025 13th International Symposium on Computing and Networking Candar 2025, pp. 167-173, 20250101
  376. A self-stabilizing algorithm for the dynamic total domination problem, Proceedings 2025 13th International Symposium on Computing and Networking Candar 2025, pp. 58-65, 20250101
  377. A self-stabilizing algorithm for the dynamic total domination problem, Proceedings 2025 13th International Symposium on Computing and Networking Candar 2025, pp. 58-65, 20250101
  378. InstGAN: Instant Actor-Critic-Driven GAN for De Novo Molecule Generation and Property Optimization, Ijcai International Joint Conference on Artificial Intelligence, pp. 6236-6244, 20250101
  379. InstGAN: Instant Actor-Critic-Driven GAN for De Novo Molecule Generation and Property Optimization, Ijcai International Joint Conference on Artificial Intelligence, pp. 6236-6244, 20250101
  380. 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巻, pp. 270-284, 20250101
  381. 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巻, pp. 270-284, 20250101
  382. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation Practice and Experience, 36巻, 26号, 20241130
  383. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation Practice and Experience, 36巻, 26号, 20241130
  384. 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巻, pp. 127-141, 20240101
  385. 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巻, pp. 127-141, 20240101
  386. EarlGAN: An enhanced actor–critic reinforcement learning agent-driven GAN for de novo drug design, Pattern Recognition Letters, 175巻, pp. 45-51, 20231101
  387. EarlGAN: An enhanced actor–critic reinforcement learning agent-driven GAN for de novo drug design, Pattern Recognition Letters, 175巻, pp. 45-51, 20231101
  388. 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巻, pp. 548-562, 20230101
  389. 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巻, pp. 548-562, 20230101

招待講演、口頭・ポスター発表等

  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日, 通常, 英語, 発表資料
  2. Stand-Up Indulgent Gathering on Lines, 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2023年10月02日, 通常, 英語, 発表資料
  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日, 招待, 英語, Pisa, Italia
  4. Autonomous Distributed Systems of Myopic Mobile Robots with Lights, Sayaka Kamei, 22nd International Conference on Distributed Computing and Networking, 2021年01月07日, 招待, 英語, 奈良(オンライン)
  5. Gathering on Rings for Myopic Asynchronous Robots with Lights, 通常, 日本語
  6. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, 通常, 日本語
  7. Brief Announcement: Neighborhood Mutual Remainder: Self-Stabilizing Implementation of LCM Robots, 通常, 日本語
  8. Brief announcement: Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots, 通常, 日本語
  9. Brief Announcement: Neighborhood Mutual Remainder and its Self-Stabilizing Implementation of Look-Compute-Move Robots, 通常, 日本語
  10. A self-stabilizing algorithm for the local (1,|Ni|)-critical section problem with safe convergence, 通常, 日本語
  11. Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots, 通常, 日本語
  12. ホテルレビューサイトのレビューに関する支援システムの構築, 柴田諒人, ヒューマンメディア合同研究会, 2019年09月06日, 通常, 日本語, 立命館大学 大阪いばらきキャンパス
  13. 推薦システムのためのレビューを考慮した評価値予測, Sun Yang, 亀井 清華, ヒューマンメディア合同研究会, 2019年09月06日, 通常, 日本語, 黄 宏軒(理化学研究所), 立命館大学 大阪いばらきキャンパス
  14. Asynchronous Ring Gathering by Oblivious Robots with Limited Vision, 2014年10月06日, 通常, 英語
  15. Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots, 2014年12月19日, 通常, 英語
  16. How to Extract Seasonal Features of Sightseeing Spots from Twitter and Wikipedia (Preliminary Version), 2014年12月10日, 通常, 英語
  17. 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月, 通常, 英語, 広島
  18. Set Cover Formation Algorithms by Mobile Robots, 亀井清華, Tomoko Izumi, Yukiko Yamauchi, The 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015年05月, 通常, 英語
  19. 口コミを用いた嗜好抽出に基づくホテル推薦手法, 田熊浩二, 田熊浩二,福原 楓,亀井清華,藤田 聡, 情報処理学会第78回全国大会, 2016年03月, 通常, 日本語
  20. 口コミに基づくホテル推薦のための辞書作成法, 山本隼也, 山本隼也,田熊浩二,福原 楓,亀井清華,藤田 聡, 情報処理学会第78回全国大会, 2016年03月, 通常, 日本語
  21. A Method of Temporal Feature Characterization with Application to Tourism Recommender Systems, 房 冠深, 房 冠深,亀井清華,藤田 聡, 情報処理学会第78回全国大会, 2016年03月, 通常, 日本語
  22. 会話の選択的聴取を支援する音声チャットシステム, 神保周児, 神保周児,亀井清華,藤田 聡, 情報処理学会第78回全国大会, 2016年03月, 通常, 日本語
  23. A Survey on Self-stabilizing Distributed Approximation Algorithms, Sayaka Kamei, Workshop on Advanced Distributed Algorithms, 2016年11月23日, 招待, 英語, 東広島
  24. 2017年11月20日, 通常, 英語
  25. 科目推薦のためのdoc2vecの応用方法の検討, 竹森汰智, 情報処理学会第80回全国大会, 2018年03月15日, 通常, 日本語
  26. ホテル予約サイトのための口コミ作成支援システムの提案, 松本 翼, 情報処理学会第80回全国大会, 2018年03月15日, 通常, 日本語
  27. ブックレビューからの閲覧者の視点に沿ったレビュー文の抽出手法, 寺尾建登, 情報処理学会第80回全国大会, 2018年03月15日, 通常, 日本語
  28. Drastic Fluctuation Prediction of the Number of Comments on Social Media by Feature Comments, Yuan Wang, Sayaka Kamei, Satoshi Fujita, 平成30年度(第69回)電気・情報関連学会中国支部連合大会, 2018年10月20日, 通常, 英語, 広島

受賞

  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. 2019年03月01日, 平成30年度 電子情報通信学会中国支部連合大会奨励賞, 電子情報通信学会中国支部, Drastic Fluctuation Prediction of the Number of Comments on Social Media by Feature Comments
  5. 2017年11月20日, Best Paper Award The 9th International Workshop on Parallel and Distributed Algorithms and Applications
  6. 2017年11月20日, CANDAR/Workshop Best/Outstanding Paper Award, An asynchronous message-passing distributed algorithm for the global critical section problem
  7. 2016年11月23日, Best Paper Award The 7th International Workshop on Advances in Networking and Computing (WANC), WANC Organizing Committee

外部資金

競争的資金等の採択状況

  1. 科学研究費助成事業(基盤研究(C)), 動的ネットワークにおける適応的な故障耐性をもつ分散近似アルゴリズムの研究, 2014年, 2018年
  2. 科学研究費助成事業(若手研究(B)), 動的無線ネットワークにおける高度な故障耐性を持つ分散近似アルゴリズムの設計, 2010年, 2013年
  3. 科学研究費助成事業(基盤研究(B)), 動的ネットワークにおけるSelf-*分散アルゴリズム設計手法の研究, 2008年, 2011年
  4. 科学研究費助成事業(基盤研究(B)), 動的ネットワークにおける多様な故障に対する耐性を持つ分散アルゴリズム, 2023年, 2026年
  5. 科学研究費助成事業(若手研究(B)), MANETに適した故障耐性を持つ分散近似アルゴリズムに関する研究, 2007年, 2009年
  6. 科学研究費助成事業(基盤研究(C)), 動的ネットワークにおける動的タスクのための適応的な耐故障性を持つ分散アルゴリズム, 2019年, 2023年
  7. 国際科学技術共同研究推進事業(戦略的国際共同研究プログラム(SICORP), 低機能ロボット群による環境外乱に頑健で継続的な自律的組織化システム構築手法, 2018年06月01日, 2022年03月31日

社会活動

委員会等委員歴

  1. ソサイエティ論文誌編集委員会 査読委員, 2024年06月, 2025年06月, 電子情報通信学会
  2. 日本学術会議連携会員, 2023年10月, 2029年09月, 日本学術会議
  3. ソサイエティ論文誌編集委員会 査読委員, 2023年06月08日, 2024年06月05日, 電子情報通信学会
  4. Guest Editor, 2020年12月, 2021年06月, Concurrency and Computation: Practice and Experience
  5. 2020年09月, 2020年10月, 電子情報通信学会中国支部学生会
  6. guest editor, 2020年09月, 2021年03月, Concurrency and Computation: Practice and Experience
  7. IEICE英文論文誌D編集委員, 2020年05月, 2023年05月
  8. Guest Editor, 2019年12月, 2020年06月, Concurrency and Computation: Practice and Experience
  9. フレッシュITあわ~ど審査委員, 2019年10月, 2019年10月, 電子情報通信学会中国支部
  10. 編集委員, 2019年05月, 2023年05月, 電子情報通信学会
  11. IEICE英文論文誌D編集委員, 2019年05月, 2023年04月
  12. Guest Editor, 2018年11月, 2019年11月, Concurrency and Computation: Practice and Experience
  13. フレッシュITあわ~ど審査委員, 2018年10月, 2018年10月, 電子情報通信学会中国支部
  14. 日本学術会議連携会員, 2017年10月, 2023年09月, 日本学術会議
  15. コンピュテーション研究専門委員会, 2016年06月, 2022年06月, 電子情報通信学会
  16. 電子情報通信学会コンピュテーション研究専門委員, 2016年06月, 2020年06月
  17. 学生ケータイあわーど審査委員, 2016年, 2016年, 電子情報通信学会中国支部学生会
  18. 学生ケータイあわーど審査委員, 2015年08月, 2015年11月, 電子情報通信学会中国支部学生会
  19. 情報処理学会 論文誌ジャーナル/JIP編集委員会委員, 2015年06月, 2017年05月, 情報処理学会
  20. 電子情報通信学会コンピュテーション研究会 幹事, 2014年04月, 2016年06月
  21. 電子情報通信学会中国支部・支部委員、学生会顧問兼任, 2013年05月, 2015年05月, 電子情報通信学会中国支部
  22. Guest Editor, 2021年12月, 2022年06月, Concurrency and Computation: Practice and Experience
  23. Guest Editor, 2022年12月, 2023年06月, Concurrency and Computation: Practice and Experience
  24. Guest Editor, 2023年12月, 2024年06月, Concurrency and Computation: Practice and Experience
  25. 日本学術会議連携会員, 2017年10月, 2023年09月, 日本学術会議

学術会議等の主催

  1. SSS2025, Steering Committee, 2025年01月, 2025年10月
  2. CANDAR2025, Program vice-chairs (Track-chairs), 2025年04月, 2025年11月
  3. 電子情報通信学会 総合大会, 実行委員会 委員, 2023年09月, 2024年03月
  4. ALGOWIN 2024, program committee, 2024年04月, 2024年09月
  5. ICDCIT-2024, program committee, 2023年06月, 2024年01月
  6. ICDCIT-2025, program committee, 2024年06月, 2025年01月
  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月
  14. CANDAR, Program Committee, 2020年07月, 2020年11月
  15. ICDCN, Program comittee, 2020年06月, 2021年01月
  16. SSS2020, Track chair, 2020年03月, 2020年11月
  17. PDAA, Workshop co-chair, 2020年03月, 2020年11月
  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, 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. 平成28年度(第67回)電気・情報関連学会中国支部連合大会, プログラム編成会議 委員, 2016年03月, 2016年11月
  29. ISEC・COMP合同研究会, 現地世話人, 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. 2015年05月, 2015年05月
  35. 2015年04月, 2015年10月
  36. 2014年12月, 2014年12月
  37. 2014年09月, 2014年10月
  38. LAシンポジウム, 幹事, 2014年04月, 2015年05月
  39. 2013年09月, 2014年08月
  40. CANDAR, Program Committee, 2023年04月, 2023年11月
  41. CANDAR2024, Program Committee, 2024年04月, 2024年11月
  42. PDAA2023, Workshop co-chair, 2023年11月, 2023年11月
  43. PDAA2024, Workshop co-chair, 2024年11月, 2024年11月
  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月
  47. SSS, Program Comitee, 2023年01月, 2023年11月