Rchr
J-GLOBAL ID：201201079122494119
Update date: Mar. 09, 2026
koichi wada
ワダ コウイチ | koichi wada
Affiliation and department：
Job title：
professor
Homepage URL (1)：
http://www-wada.elcom.nitech.ac.jp/
Research field (1)：
Information theory
Research theme for competitive and other funds (4)：
- 2025 - 2029 ビザンチン移動体耐性を持つ分散アルゴリズムの研究
- 2025 - 2029 A Critical Reassessment of Theoretical Models of Autonomous Mobile Robot Systems and the Creation of Novel Paradigms
- グラフ問題に対する並列、分散アルゴリズム
- Parallel and distriluted algorithms for graph problems
Papers (46)：
-
Yonghwan Kim, Yoshiaki Katayama, Koichi Wada. Complete Visibility Algorithms of Luminous Robots With Two-Color Lights on Grid. Concurrency and Computation: Practice and Experience. 2024. 37. 2
-
Takashi Okumura, Koichi Wada 0001, Xavier Défago. Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights. Theoretical Computer Science. 2023. 979. 114198-114198
-
Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada 0001. Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space. Robotics and Autonomous Systems. 2023. 163. 104378-104378
-
Yonghwan Kim 0001, Yoshiaki Katayama, Koichi Wada 0001. Asynchronous Complete Visibility Algorithm for Luminous Robots on Grid. Eleventh International Symposium on Computing and Networking(CANDARW). 2023. 107-113
-
Satoshi Terai, Koichi Wada, Yoshiaki Katayama. Gathering problems for autonomous mobile robots with lights. Theoretical Computer Science. 2023. 941. 241-261
ｍore...
MISC (168)：
-
Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada. Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space. CoRR. 2019. abs/1907.09871
-
Takashi Okumura, Koichi Wada, Xavier Défago. Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights. CoRR. 2018. abs/1804.01368
-
WADA Koichi, IZUMI Taisuke. On parallel complexity of MapReduce computation. IEICE technical report. Theoretical foundations of Computing. 2013. 113. 50. 143-147
-
Koichi Wada, Taisuke Izumi. On parallel complexity of MapReduce computation. IPSJ SIG Notes. 2013. 2013. 22. 1-5
-
泉泰介, 泉朋子, 小野廣隆, 和田幸一. 木ネットワークにおける証明書分散問題の近似可能性について. 第74回全国大会講演論文集. 2012. 2012. 1. 269-270
ｍore...
Books (18)：
-
情報数学
森北出版 2010
-
Mathematics for Computer Science
Morikita Syuppan 2010
-
アルゴリズムの設計と解析手法 (アルゴリズムイントロダクション) 改定2版
近代科学社 2008
-
数学的構造とデータ構造(アルゴリズムイントロダクション)改定2版
近代科学社 2008
-
Introduction to Algorithms II Second Edition
Kindaikagakusya 2008
ｍore...
Lectures and oral presentations (6)：
-
動的メッセージ消失故障モデル上における乱択合意アルゴリズムについて.
(第6回情報科学ワークショップ 2010)
-
GPGPU 上でのマルコフ連鎖モンテカルロ法の実装について
(第6回情報科学ワークショップ 2010)
-
NP-困難問題の再最適化について.
(第6回情報科学ワークショップ 2010)
-
動的メッセージ消失故障モデル上における乱択合意アルゴリズムについて.
(2010)
-
GPGPU 上でのマルコフ連鎖モンテカルロ法の実装について
(2010)
ｍore...
Education (4)：
- - 1983 Osaka University
- - 1983 Osaka University Graduate School, Division of Engineering
- - 1978 Osaka University School of Engineering Science Direct Affiliates
- - 1978 Osaka University Faculty of Engineering Science
Professional career (2)：
- Doctor of Engineering (Osaka University)
- Master of Engineering (Osaka University)
Work history (5)：
- 1983 - 1984 Osaka University School of Engineering Science Direct Affiliates
- 1983 - 1984 Research Associate,Faculty of Basic Engineering, Osaka University
- 1984 - - 名古屋工業大学 教授
- 1984 - - Professor,Nagoya Institute of Technology
- Nagoya Institute of Technology Nagoya Institute of Technology Professor
Awards (2)：
- 1993 - 最優秀論文賞
- 1993 - Best Papers of XIII Congress of Brazilian Computer Society
Return to Previous Page
