亀井 清華SAYAKA KAMEI

Last Updated :2025/06/16

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

基本情報

学歴

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

学位

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

教育担当

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

研究分野

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

研究キーワード

  • 分散アルゴリズム

所属学会

教育活動

授業担当

  1. 2025年, 教養教育, 1ターム, 教養ゼミ
  2. 2025年, 学部専門, セメスター(前期), プログラミングI
  3. 2025年, 学部専門, セメスター(後期), プログラミングIV
  4. 2025年, 学部専門, 1ターム, 情報科学演習I
  5. 2025年, 学部専門, 集中, 長期フィールドワークII
  6. 2025年, 学部専門, 1ターム, データ科学セミナーI
  7. 2025年, 学部専門, 2ターム, データ科学セミナーII
  8. 2025年, 学部専門, セメスター(後期), 卒業論文
  9. 2025年, 修士課程・博士課程前期, 1ターム, 情報科学特別演習A
  10. 2025年, 修士課程・博士課程前期, 2ターム, 情報科学特別演習A
  11. 2025年, 修士課程・博士課程前期, 3ターム, 情報科学特別演習A
  12. 2025年, 修士課程・博士課程前期, 4ターム, 情報科学特別演習A
  13. 2025年, 修士課程・博士課程前期, 3ターム, 情報科学特別演習B
  14. 2025年, 修士課程・博士課程前期, 4ターム, 情報科学特別演習B
  15. 2025年, 修士課程・博士課程前期, 年度, 情報科学特別研究
  16. 2025年, 博士課程・博士課程後期, 年度, 情報科学特別研究

研究活動

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

  1. Gathering on Rings for Myopic Asynchronous Robots with Lights, Theory of Computing Systems, 69巻, 1号, 20250301
  2. Gathering on Rings for Myopic Asynchronous Robots with Lights, Theory of Computing Systems, 69巻, 1号, 20250301
  3. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324巻, 20250108
  4. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324巻, 20250108
  5. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319巻, 20241024
  6. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319巻, 20241024
  7. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983巻, 20240201
  8. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983巻, 20240201
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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
  14. 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
  15. 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
  16. 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
  17. 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
  18. 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
  19. 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
  20. 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
  21. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10巻, 2号, 20170601
  22. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10巻, 2号, 20170601
  23. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, pp. 203-207, 20161217
  24. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, pp. 203-207, 20161217
  25. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0巻, 0号, pp. 46-49, 20141230
  26. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0巻, 0号, pp. 46-49, 20141230
  27. 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
  28. 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
  29. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24巻, 4号, pp. 716-723, 20130319
  30. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24巻, 4号, pp. 716-723, 20130319
  31. 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
  32. 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
  33. 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
  34. 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
  35. 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
  36. 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
  37. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412巻, 33号, pp. 4336-4349, 20110729
  38. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412巻, 33号, pp. 4336-4349, 20110729
  39. 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
  40. 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
  41. 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
  42. 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
  43. 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
  44. 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
  45. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180巻, 10号, pp. 1802-1816, 20100515
  46. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180巻, 10号, pp. 1802-1816, 20100515
  47. 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
  48. 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
  49. 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
  50. 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
  51. 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
  52. 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
  53. Hierarchical composition of self-stabilizing protocols preserving the fault-containment property, IEICE Transactions on Information and Systems, E92-D巻, 3号, pp. 451-459, 20090101
  54. Hierarchical composition of self-stabilizing protocols preserving the fault-containment property, IEICE Transactions on Information and Systems, E92-D巻, 3号, pp. 451-459, 20090101
  55. 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
  56. 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
  57. Timer-based composition of fault-containing self-stabilizing protocols, Studies in Computational Intelligence, 162巻, pp. 217-226, 20080922
  58. Timer-based composition of fault-containing self-stabilizing protocols, Studies in Computational Intelligence, 162巻, pp. 217-226, 20080922
  59. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19巻, 9号, pp. 1153-1166, 20080819
  60. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19巻, 9号, pp. 1153-1166, 20080819
  61. 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
  62. 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
  63. 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
  64. 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
  65. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics Lipics, 324巻, 20250108
  66. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics Lipics, 324巻, 20250108
  67. 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
  68. 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
  69. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation Practice and Experience, 36巻, 26号, 20241130
  70. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation Practice and Experience, 36巻, 26号, 20241130
  71. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics Lipics, 319巻, 20241024
  72. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics Lipics, 319巻, 20241024
  73. Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Acta Informatica, 61巻, 1号, pp. 83-100, 20240301
  74. Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Acta Informatica, 61巻, 1号, pp. 83-100, 20240301
  75. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983巻, 20240201
  76. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983巻, 20240201
  77. 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
  78. 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
  79. 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
  80. 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
  81. 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
  82. 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
  83. 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
  84. 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
  85. 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
  86. 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
  87. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 110-121, 20240101
  88. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 110-121, 20240101
  89. 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
  90. 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
  91. Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots, Concurrency and Computation Practice and Experience, 35巻, 11号, 20230515
  92. Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots, Concurrency and Computation Practice and Experience, 35巻, 11号, 20230515
  93. 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
  94. 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
  95. 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
  96. 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
  97. 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
  98. 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
  99. Asynchronous Gathering in a Torus, Leibniz International Proceedings in Informatics Lipics, 217巻, 20220201
  100. Asynchronous Gathering in a Torus, Leibniz International Proceedings in Informatics Lipics, 217巻, 20220201
  101. 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
  102. 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
  103. 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
  104. 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
  105. 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
  106. 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
  107. 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
  108. 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
  109. A self-stabilizing distributed algorithm for the local (1,|Ni|)-critical section problem, Concurrency and Computation Practice and Experience, 33巻, 12号, 20210625
  110. A self-stabilizing distributed algorithm for the local (1,|Ni|)-critical section problem, Concurrency and Computation Practice and Experience, 33巻, 12号, 20210625
  111. 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
  112. 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
  113. 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
  114. 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
  115. 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
  116. 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
  117. 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
  118. 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
  119. 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
  120. 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
  121. 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
  122. 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
  123. Gathering on rings for myopic asynchronous robots with lights, Leibniz International Proceedings in Informatics Lipics, 153巻, 20200201
  124. Gathering on rings for myopic asynchronous robots with lights, Leibniz International Proceedings in Informatics Lipics, 153巻, 20200201
  125. 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
  126. 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
  127. 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
  128. 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
  129. Brief announcement: Neighborhood mutual remainder and its self-stabilizing implementation of look-compute-move robots, Leibniz International Proceedings in Informatics Lipics, 146巻, 20191001
  130. Brief announcement: Neighborhood mutual remainder and its self-stabilizing implementation of look-compute-move robots, Leibniz International Proceedings in Informatics Lipics, 146巻, 20191001
  131. 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
  132. 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
  133. 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
  134. 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
  135. 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
  136. 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
  137. 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
  138. 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
  139. 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
  140. 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
  141. 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
  142. 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
  143. 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
  144. 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
  145. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10巻, 2号, 20170601
  146. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10巻, 2号, 20170601
  147. 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
  148. 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
  149. 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
  150. 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
  151. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, pp. 203-207, 20161217
  152. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, pp. 203-207, 20161217
  153. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615巻, pp. 102-119, 20160215
  154. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615巻, pp. 102-119, 20160215
  155. 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
  156. 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
  157. 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
  158. 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
  159. 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
  160. 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
  161. 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
  162. 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
  163. 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
  164. 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
  165. 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
  166. 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
  167. 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
  168. 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
  169. 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
  170. 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
  171. 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
  172. 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
  173. 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
  174. 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
  175. 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
  176. 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
  177. 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
  178. 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
  179. 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
  180. 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
  181. 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
  182. 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
  183. 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
  184. 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
  185. 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
  186. 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
  187. 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
  188. 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
  189. 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
  190. 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
  191. 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
  192. 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
  193. 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
  194. 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
  195. 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
  196. 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
  197. 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
  198. 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
  199. 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
  200. 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
  201. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing Applications and Technologies PDCAT Proceedings, pp. 742-746, 20031201
  202. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing Applications and Technologies PDCAT Proceedings, pp. 742-746, 20031201
  203. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324巻, 20250108
  204. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324巻, 20250108
  205. 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
  206. 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
  207. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation: Practice and Experience, 36巻, 26号, 20241130
  208. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation: Practice and Experience, 36巻, 26号, 20241130
  209. Stand-up indulgent gathering on lines, Theoretical Computer Science, 1016巻, 20241112
  210. Stand-up indulgent gathering on lines, Theoretical Computer Science, 1016巻, 20241112
  211. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319巻, 20241024
  212. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319巻, 20241024
  213. 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
  214. 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
  215. 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
  216. 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
  217. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 110-121, 20240101
  218. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 110-121, 20240101
  219. 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
  220. 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
  221. Gathering on Rings for Myopic Asynchronous Robots with Lights, THEORY OF COMPUTING SYSTEMS, 69巻, 1号, 202503
  222. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 36巻, 26号, 20241130
  223. MacGAN: A Moment-actor-critic Reinforcement Learning-based Generative Adversarial Network for Molecular Generation, Web and Big Data. APWeb-WAIM 2023, 20240529
  224. Stand-up indulgent gathering on lines, THEORETICAL COMPUTER SCIENCE, 1016巻, 20241112
  225. Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Acta Informatica, 61巻, 1号, pp. 83-100, 20231218
  226. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983巻, 20240201
  227. 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
  228. An Asynchronous Maximum Independent Set Algorithm By Myopic Luminous Robots On Grids, Computer Journal, 67巻, 1号, pp. 57-77, 20240101
  229. 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
  230. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200巻, pp. 110-121, 20240410
  231. EarlGAN: An enhanced actor–critic reinforcement learning agent-driven GAN for de novo drug design, Pattern Recognition Letters, 175巻, pp. 45-51, 20231101
  232. 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
  233. Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots, Concurrency and Computation: Practice and Experience, 35巻, 11号, 20230515
  234. Location functions for self-stabilizing byzantine tolerant swarms, THEORETICAL COMPUTER SCIENCE, 954巻, 20230418
  235. 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
  236. 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
  237. Data Augmentation Methods for Enhancing Robustness in Text Classification Tasks, Algorithms, 16巻, 1号, 20230116
  238. 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
  239. A self-stabilizing token circulation with graceful handover on bidirectional ring networks, International Journal of Networking and Computing, 12巻, 1号, pp. 103-130, 20220610
  240. Asynchronous Gathering in a Torus, Leibniz International Proceedings in Informatics, LIPIcs, 217巻, 20220201
  241. 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
  242. 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
  243. 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
  244. 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
  245. ホテルの評価値予測のためのカテゴリ特化型感情極性辞書, 情報処理学会論文誌(TOD), 14巻, 3号, pp. 16-29, 20210713
  246. Matrix Factorization with Topic and Sentiment Analysis for Rating Prediction, International Journal of Networking and Computing, 11巻, 2号, pp. 198-214, 20210701
  247. A self-stabilizing distributed algorithm for the local (1,|Ni|)-critical section problem, Concurrency and Computation: Practice and Experience, 33巻, 12号, 20210625
  248. 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
  249. 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
  250. 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
  251. 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
  252. 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
  253. 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
  254. Gathering on rings for myopic asynchronous robots with lights, Leibniz International Proceedings in Informatics, LIPIcs, 153巻, 20200201
  255. 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
  256. 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
  257. Brief announcement: Neighborhood mutual remainder and its self-stabilizing implementation of look-compute-move robots, Leibniz International Proceedings in Informatics, LIPIcs, 146巻, 20191001
  258. 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
  259. 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
  260. 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
  261. 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
  262. 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
  263. 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
  264. 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
  265. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10巻, 2号, 20170601
  266. 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
  267. 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
  268. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, pp. 203-207, 20161217
  269. Personalized web page recommendation based on preference footprint to browsed pages, IEICE Transactions on Information and Systems, E99D巻, 11号, pp. 2705-2715, 20161101
  270. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615巻, pp. 102-119, 20160215
  271. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0巻, 0号, pp. 46-49, 20141230
  272. レビューを対象とした信頼性判断支援システムの提案, 情報処理学会論文誌, 55巻, 11号, pp. 2461-2475, 20141115
  273. レビューに対する信頼性判断支援システムの提案, 第76回全国大会講演論文集, 2014巻, 1号, pp. 633-634, 20140311
  274. 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
  275. 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
  276. 事例間の距離に応じた重要度の付与によるノイズ耐性を考慮したブースティング手法(ポスターセッション,第16回情報論的学習理論ワークショップ), 電子情報通信学会技術研究報告. IBISML, 情報論的学習理論と機械学習, 113巻, 286号, pp. 15-21, 20131105
  277. 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
  278. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24巻, 4号, pp. 716-723, 20130319
  279. 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
  280. 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
  281. 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
  282. 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
  283. 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
  284. 転送遅延を考慮したWMN上のアクセスポイント削減手法(映像/音声サービスの品質,メディア品質,ネットワークの品質・QoS制御,次世代/新世代ネットワークアーキテクチャ,超臨場感コミュニケーション,信頼性,一般), 電子情報通信学会技術研究報告. CQ, コミュニケーションクオリティ, 112巻, 119号, pp. 71-76, 20120705
  285. 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
  286. 周波数分析を利用した周期的にブックマークされるwebページの特定, 第74回全国大会講演論文集, 2012巻, 1号, pp. 719-720, 20120306
  287. 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
  288. Autonomous multi-source multi-sink routing in wireless sensor networks, Journal of Information Processing, 20巻, 1号, pp. 319-326, 20120101
  289. 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
  290. 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
  291. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412巻, 33号, pp. 4336-4349, 20110729
  292. 無線センサネットワーク上の低遅延な耐故障ルーティングアルゴリズム(モバイルユビキタス/センサ技術,アドホックネットワーク,RFID,一般及び技術展示), 電子情報通信学会技術研究報告. USN, ユビキタス・センサネットワーク, 110巻, 378号, pp. 73-78, 20110113
  293. 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
  294. 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
  295. 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
  296. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180巻, 10号, pp. 1802-1816, 20100515
  297. 偏りのあるインデックス配布手法とP2Pファイル検索への応用(P2P,コンテンツ配信,コンテンツ配信,コンテキストアウェアネス,IPv6,認証,ID/名前管理及び一般), 電子情報通信学会技術研究報告. IN, 情報ネットワーク, 109巻, 362号, pp. 1-6, 20100107
  298. 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
  299. 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
  300. 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
  301. 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
  302. 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
  303. 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
  304. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19巻, 9号, pp. 1153-1166, 20080819
  305. ネットワーク再構成を用いたインタレストマイニング法の改良(IPv6,P2P,NGN,VoIP,FMC,コンテンツ配信,IPv6及び一般), 電子情報通信学会技術研究報告. IN, 情報ネットワーク, 108巻, 136号, pp. 7-12, 20080710
  306. P2Pファイル共有システムにおける効率的なインデックスキャッシュ手法(IPv6,P2P,NGN,VoIP,FMC,コンテンツ配信,IPv6及び一般), 電子情報通信学会技術研究報告. IN, 情報ネットワーク, 108巻, 136号, pp. 1-6, 20080710
  307. 故障封じ込め自己安定プロトコルに対するタイマーを利用した合成手法, 情報処理学会研究報告. AL, アルゴリズム研究会報告, 2008巻, 49号, pp. 1-8, 20080520
  308. 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
  309. キャッシュを行うP2Pシステムにおける時間を基にした評価手法(コンカレントシステム, 一般), 電子情報通信学会技術研究報告. CST, コンカレント工学, 105巻, 573号, pp. 69-74, 20060120
  310. 動的環境に於けるコータリ構成アルゴリズム(コンカレントシステム, 一般), 電子情報通信学会技術研究報告. CST, コンカレント工学, 105巻, 573号, pp. 63-68, 20060120
  311. 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
  312. 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
  313. 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
  314. A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem, IEICE Transactions on Information and Systems, E87-D巻, 2号, pp. 299-307, 20040101
  315. 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
  316. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, pp. 742-746, 20031201
  317. スタイナー木問題を解く自己安定分散アルゴリズム, 情報処理学会研究報告. AL, アルゴリズム研究会報告, 2003巻, 92号, pp. 43-50, 20030919
  318. A self-stabilizing algorithm for the Steiner tree problem, Proceedings of the IEEE Symposium on Reliable Distributed Systems, pp. 396-401, 20021217
  319. 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
  320. 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
  321. 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
  322. 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
  323. 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
  324. 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
  325. Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E92D巻, 3号, pp. 451-459, 200903
  326. 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
  327. Asynchronous message-passing distributed algorithm for the global critical section problem, International Journal of Networking and Computing, 9巻, 2号, 2019
  328. Brief Announcement: Neighborhood Mutual Remainder and its Self-Stabilizing Implementation of Look-Compute-Move Robots, Proc. 33rd International Symposium on Distributed Computing, 2019
  329. 履修支援のためのDoc2Vecを用いた科目推薦システム, 情報処理学会論文誌, 2019
  330. 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
  331. 口コミを用いた嗜好抽出に基づくホテル推薦手法, 情報処理学会第78回全国大会, 2016
  332. 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
  333. Ring Gathering by Robots with Limited Vision, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  334. Set Cover Formation Algorithms by Mobile Robots, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  335. 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
  336. Special Issue on Selected Papers from the First International Conference Networking and Computing, IJNC, 1巻, 2号, pp. 131-131, 2011
  337. 口コミに基づくホテル推薦のための辞書作成法, 情報処理学会第78回全国大会
  338. 会話の選択的聴取を支援する音声チャットシステム, 情報処理学会第78回全国大会

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

  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. 2020年11月29日, CANDAR Outstanding Paper Award, CANDAR, Evacuation from a Finite 2D Square Grid Field by a Metamorphic Robotic System
  2. 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
  3. 2019年03月01日, 平成30年度 電子情報通信学会中国支部連合大会奨励賞, 電子情報通信学会中国支部, Drastic Fluctuation Prediction of the Number of Comments on Social Media by Feature Comments
  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

外部資金

競争的資金等の採択状況

  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. 電子情報通信学会 総合大会, 実行委員会 委員, 2023年09月, 2024年03月
  2. ALGOWIN 2024, program committee, 2024年04月, 2024年09月
  3. ICDCIT-2024, program committee, 2023年06月, 2024年01月
  4. ICDCIT-2025, program committee, 2024年06月, 2025年01月
  5. Euro-Par'2023 (Euro-Par'2023: 29th International European Conference on Parallel and Distributed Computing (Euro-Par'2023)), PC member, 2023年02月, 2023年09月
  6. ICDCN2023, Program Comittee, 2022年01月, 2023年01月
  7. SSS, Program Comitee, 2022年01月, 2022年11月
  8. OPODIS, Program Comitee, 2021年05月, 2021年12月
  9. PDAA, Workshop co-chair, 2021年11月, 2021年11月
  10. CANDAR, Program Committee, 2021年04月, 2021年11月
  11. WDALFR, WORKSHOP co-organizer, 2020年20月, 2021年01月
  12. CANDAR, Program Committee, 2020年07月, 2020年11月
  13. ICDCN, Program comittee, 2020年06月, 2021年01月
  14. SSS2020, Track chair, 2020年03月, 2020年11月
  15. PDAA, Workshop co-chair, 2020年03月, 2020年11月
  16. ICDCN, Technical Program Committee, 2020年01月, 2020年01月
  17. CANDAR, Program Committee, 2019年11月, 2019年11月
  18. PDAA, Workshop co-chair, 2019年11月, 2019年11月
  19. Workshop on Distributed Algorithms for Low-Functional Robots, Organizers, 2019年11月, 2019年11月
  20. 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月
  21. PDAA, Workshop co-chair, 2018年11月, 2018年11月
  22. CANDAR, PC member, 2018年11月, 2018年11月
  23. SSS, 2017年11月, 2017年11月
  24. CANDAR, PC member (Track 1: Algorithms and Applications), 2017年11月, 2017年11月
  25. PDAA, PC member (PDAA: International Workshop on Parallel and Distributed Algorithms and Applications), 2017年11月, 2017年11月
  26. 平成28年度(第67回)電気・情報関連学会中国支部連合大会, プログラム編成会議 委員, 2016年03月, 2016年11月
  27. ISEC・COMP合同研究会, 現地世話人, 2016年, 2016年
  28. ICDCN 2017, program committee, 2016年, 2016年
  29. PDAA2016, Program comittee, 2016年, 2016年
  30. CANDAR 2016, program committee, 2016年, 2016年
  31. APDCM 2016, Program Committee, 2016年, 2016年
  32. 2015年05月, 2015年05月
  33. 2015年04月, 2015年10月
  34. 2014年12月, 2014年12月
  35. 2014年09月, 2014年10月
  36. LAシンポジウム, 幹事, 2014年04月, 2015年05月
  37. 2013年09月, 2014年08月
  38. CANDAR, Program Committee, 2023年04月, 2023年11月
  39. CANDAR2024, Program Committee, 2024年04月, 2024年11月
  40. PDAA2023, Workshop co-chair, 2023年11月, 2023年11月
  41. PDAA2024, Workshop co-chair, 2024年11月, 2024年11月
  42. PDAA, Workshop co-chair, 2022年11月, 2022年11月
  43. OPODIS, Program Comitee, 2023年05月, 2023年12月
  44. SSS2024, Track A, Co-Chair, 2024年01月, 2024年11月
  45. SSS, Program Comitee, 2023年01月, 2023年11月