Specification of schedulers with algebraic specification techniques. - Kouichi Wada 001; Kenichi Hagihara; Toshiro Araki; Nobuki Tokura (Operating Systems Engineering, 1980)

Effect of Practical Assumption in Area Complexity of VLSI Computation. - Kenichi Hagihara; Kouichi Wada 001; Nobuki Tokura (RIMS Symposium on Software Science and Engineering, 1982)

Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model. - Kouichi Wada 001; Kenichi Hagihara; Nobuki Tokura (IEEE Trans. Computers, 1984)

Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees. - Toshimitsu Masuzawa; Kenichi Hagihara; Nobuki Tokura; Koichi Wada 001 (Syst. Comput. Jpn., 1986)

Embedding area of d-way shuffle graph on a VLSI model. - Koichi Wada 001; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1986)

Area-time complexity on a vlsi model with boundary layout assumption. - Kouichi Wada 001; Kenichi Hagihara; Nobuki Tokura (Syst. Comput. Jpn., 1986)

Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs. - Koichi Wada 001; Kimio Kawaguchi; Yupin Luo (Syst. Comput. Jpn., 1987)

Maximum lower bound on embedding areas of general graphs. - Koichi Wada 001; Kimio Kawaguchi; Hideyuki Fujishima (Syst. Comput. Jpn., 1989)

Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs. - Koichi Wada 001; Kimio Kawaguchi (Discret. Appl. Math., 1992)

Optimal Fault-Tolerant Routings for Connected Graphs. - Koichi Wada 001; Yupin Luo; Kimio Kawaguchi (Inf. Process. Lett., 1992)

Distributed algorithms for connectivity problem of networks with faulty elements. - Koichi Wada 001; Yukio Moritani; Kimio Kawaguchi; Masahiro Morishita (Syst. Comput. Jpn., 1992)

Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. - Koichi Wada 001; Kimio Kawaguchi (WG, 1993)

New Results in Graph Routing - Kimio Kawaguchi; Koichi Wada 001 (Inf. Comput., 1993)

Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. - Koichi Wada 001; Akinari Takaki; Kimio Kawaguchi (WG, 1994)

Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. - Koichi Wada 001; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen 003 (WG, 1995)

Parallel Robust Algorithms for Constructing Strongly Convex Hulls. - Wei Chen 003; Koichi Wada 001; Kimio Kawaguchi (SCG, 1996)

Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. - Koichi Wada 001; Wei Chen 003; Yupin Luo; Kimio Kawaguchi (WG, 1997)

Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs. - Koichi Wada 001; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen 003 (J. Parallel Distributed Comput., 1997)

Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases. - Koichi Wada 001; Wei Chen 003 (WG, 1998)

Finding the Convex Hull of Discs in Parallel. - Wei Chen 003; Koichi Wada 001; Kimio Kawaguchi; Danny Z. Chen (Int. J. Comput. Geom. Appl., 1998)

Integer Summing Algorithms on Reconfigurable Meshes. - Koji Nakano; Koichi Wada 001 (Theor. Comput. Sci., 1998)

Efficient Algorithms for a Mixed k-Partition Problem of Graphs Without Specifying Bases. - Koichi Wada 001; Akinari Takaki; Kimio Kawaguchi (Theor. Comput. Sci., 1998)

An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs. - Koichi Wada 001; Yoriyuki Nagata; Wei Chen 003 (WG, 1999)

A Hardware Implementation of PRAM and Its Performance Evaluation. - M. Imai; Y. Hayakawa; H. Kawanaka; Wei Chen 003; Koichi Wada 001; Carla Denise Castanho; Y. Okajima; H. Okamoto (IPDPS Workshops, 2000)

Kakitsubata Team Description. - Tetsuya Esaki; Taku Sakushima; Shinji Futamase; Nobuhiro Ito; Tomoichi Takahashi; Wei Chen 003; Koichi Wada 001 (RoboCup, 2000)

Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables. - Koichi Wada 001; Wei Chen 003 (WG, 2000)

Parallel Algorithms for Partitioning Sorted Sets and Related Problems. - Danny Z. Chen; Wei Chen 003; Koichi Wada 001; Kimio Kawaguchi (Algorithmica, 2000)

Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM. - Carla Denise Castanho; Wei Chen 003; Koichi Wada 001; Akihiro Fujiwara (COCOON, 2001)

A Design of Agents for the Disaster Simulator on RoboCup-Rescue. - Taku Sakushima; Tetsuya Esaki; Yoshiki Asai; Nobuhiro Ito; Koichi Wada 001 (RoboCup, 2001)

Constructing a Strongly Convex Superhull of Points. - Wei Chen 003; Xiaowen Deng; Koichi Wada 001; Kimio Kawaguchi (Int. J. Comput. Geom. Appl., 2001)

Robust algorithms for constructing strongly convex hulls in parallel. - Wei Chen 003; Koichi Wada 001; Kimio Kawaguchi (Theor. Comput. Sci., 2002)

On Computing the Upper Envelope of Segments in Parallel. - Wei Chen 003; Koichi Wada 001 (IEEE Trans. Parallel Distributed Syst., 2002)

An Optimal Algorithm of Acknowledged Broadcasting in Ad Hoc Radio Networks. - Takaya Okuwa; Wei Chen 003; Koichi Wada 001 (ISPDC, 2003)

Reinforcement Learning Methods to Handle Actions with Differing Costs in MDPs. - Takahisa Ishiguro; Tohgoroh Matsui; Nobuhiro Inuzuka; Koichi Wada 001 (KES, 2003)

Optimal fault-tolerant routings with small routing tables for k-connected graphs. - Koichi Wada 001; Wei Chen 003 (J. Discrete Algorithms, 2004)

Neighborhood Broadcasting in Undirected de Bruijn and Kautz Networks. - Shingo Omura; Hua Zheng; Koichi Wada 001 (IEICE Trans. Inf. Syst., 2005)

An Optimal Certificate Dispersal Algorithm for Mobile Ad Hoc Networks. - Hua Zheng; Shingo Omura; Jiro Uchida; Koichi Wada 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Parallel matrix-multiplication algorithm for distributed parallel computers. - Masamitsu Hattori; Nobuhiro Ito; Wei Chen 003; Koichi Wada 001 (Syst. Comput. Jpn., 2005)

Construction and Maintenance of a Cluster-Based Architecture for Sensor Networks. - Jiro Uchida; Islam A. K. M. Muzahidul; Yoshiaki Katayama; Wei Chen 003; Koichi Wada 001 (HICSS, 2006)

Special Section on Invited Papers from New Horizons in Computing. - Koichi Wada 001 (IEICE Trans. Inf. Syst., 2006)

An Approximation Algorithm for Minimum Certificate Dispersal Problems. - Hua Zheng; Shingo Omura; Koichi Wada 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

A pattern formation algorithm for a set of autonomous distributed robots with agreement on orientation along one axis. - Masao Kasuya; Nobuhiro Ito; Nobuhiro Inuzuka; Koichi Wada 001 (Syst. Comput. Jpn., 2006)

Novel Broadcast/Multicast Protocols for Dynamic Sensor Networks. - Wei Chen 003; Islam A. K. M. Muzahidul; Mohan Malkani; Amir Shirkhodaie; Koichi Wada 001; Mohamed Zein-Sabatto (IPDPS, 2007)

Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots. - Yoshiaki Katayama; Yuichi Tomida; Hiroyuki Imazu; Nobuhiro Inuzuka; Koichi Wada 001 (SIROCCO, 2007)

On the Probabilistic Omission Adversary. - Taisuke Izumi; Koichi Wada 001 (SSS, 2007)

Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result. - Taisuke Izumi; Yoshiaki Katayama; Nobuhiro Inuzuka; Koichi Wada 001 (DISC, 2007)

Efficient Initialization Algorithms on Single-Hop Radio Networks. - Naoki Inaba; Koichi Wada 001 (IEICE Trans. Inf. Syst., 2007)

Acknowledged broadcasting and gossiping in ad hoc radio networks. - Jiro Uchida; Wei Chen 003; Koichi Wada 001 (Theor. Comput. Sci., 2007)

Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. - Nobuhiro Inuzuka; Yuichi Tomida; Taisuke Izumi; Yoshiaki Katayama; Koichi Wada 001 (SIROCCO, 2008)

Construction and Maintenance of a Novel Cluster-based Architecture for Ad Hoc Sensor Networks. - Jiro Uchida; Islam A. K. M. Muzahidul; Yoshiaki Katayama; Wei Chen 003; Koichi Wada 001 (Ad Hoc Sens. Wirel. Networks, 2008)

Autonomous market-based approach for resource allocation in a cluster-based sensor network. - Wei Chen 003; Heh Miao; Koichi Wada 001 (MCDM, 2009)

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. - Tomoko Izumi; Taisuke Izumi; Hirotaka Ono 001; Koichi Wada 001 (COCOON, 2009)

Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction. - Toshimitsu Masuzawa; Taisuke Izumi; Yoshiaki Katayama; Koichi Wada 001 (OPODIS, 2009)

Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents. - Shukai Cai; Taisuke Izumi; Koichi Wada 001 (SIROCCO, 2009)

Convergence of Mobile Robots with Uniformly-Inaccurate Sensors. - Kenta Yamamoto; Taisuke Izumi; Yoshiaki Katayama; Nobuhiro Inuzuka; Koichi Wada 001 (SIROCCO, 2009)

Doubly-expedited one-step Byzantine consensus. - Nazreen Banu; Taisuke Izumi; Koichi Wada 001 (DSN, 2010)

Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks. - Keigo Kinpara; Tomoko Izumi; Taisuke Izumi; Koichi Wada 001 (OPODIS, 2010)

Foreword. - Mirka Miller; Koichi Wada 001 (Math. Comput. Sci., 2010)

Approximability and inapproximability of the minimum certificate dispersal problem. - Tomoko Izumi; Taisuke Izumi; Hirotaka Ono 001; Koichi Wada 001 (Theor. Comput. Sci., 2010)

An efficient routing protocol on a Dynamic Cluster-based Sensor Network. - Islam A. K. M. Muzahidul; Shahrum Shah Abdullah; Koichi Wada 001; Jiro Uchida; Wei Chen 003 (CrownCom, 2011)

Distributed Algorithms for Cooperative Mobile Robots: A Survey. - Samia Souissi; Taisuke Izumi; Koichi Wada 001 (ICNC, 2011)

Time-Efficient Data Congregation Protocols on Wireless Sensor Network. - Islam A. K. M. Muzahidul; Koichi Wada 001; Wei Chen 003 (ISUVR, 2011)

On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (MFCS, 2011)

Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. - Taisuke Izumi; Zohir Bouzid; Sébastien Tixeuil; Koichi Wada 001 (DISC, 2011)

The BG-simulation for Byzantine Mobile Robots - Taisuke Izumi; Zohir Bouzid; Sébastien Tixeuil; Koichi Wada 001 (CoRR, 2011)

Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems. - Nazreen Banu; Taisuke Izumi; Koichi Wada 001 (Parallel Process. Lett., 2011)

Oracle-based flocking of mobile robots in crash-recovery model. - Samia Souissi; Taisuke Izumi; Koichi Wada 001 (Theor. Comput. Sci., 2011)

Minimum Certificate Dispersal with Tree Structures. - Taisuke Izumi; Tomoko Izumi; Hirotaka Ono 001; Koichi Wada 001 (TAMC, 2012)

How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model. - Shukai Cai; Taisuke Izumi; Koichi Wada 001 (Theory Comput. Syst., 2012)

The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. - Taisuke Izumi; Samia Souissi; Yoshiaki Katayama; Nobuhiro Inuzuka; Xavier Défago; Koichi Wada 001; Masafumi Yamashita (SIAM J. Comput., 2012)

On the approximability and hardness of minimum topic connected overlay and its special instances. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (Theor. Comput. Sci., 2012)

The optimal tolerance of uniform observation error for mobile robot convergence. - Kenta Yamamoto; Taisuke Izumi; Yoshiaki Katayama; Nobuhiro Inuzuka; Koichi Wada 001 (Theor. Comput. Sci., 2012)

Self-stabilizing DAG-Constructing Protocols with Application to Geocast in MANET. - Koichi Ito; Yoshiaki Katayama; Koichi Wada 001; Naohisa Takahashi (SSS, 2013)

Computational Models for Big Data Processing. - Koichi Wada 001 (CANDAR, 2014)

Space-efficient self-stabilizing counting population protocols on mobile sensor networks. - Tomoko Izumi; Keigo Kinpara; Taisuke Izumi; Koichi Wada 001 (Theor. Comput. Sci., 2014)

Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (Theor. Comput. Sci., 2015)

Approximability of minimum certificate dispersal with tree structures. - Taisuke Izumi; Tomoko Izumi; Hirotaka Ono 001; Koichi Wada 001 (Theor. Comput. Sci., 2015)

Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights. - Takashi Okumura; Koichi Wada 001; Yoshiaki Katayama (SSS, 2017)

Optimal Asynchronous Rendezvous for Mobile Robots with Lights. - Takashi Okumura; Koichi Wada 001; Yoshiaki Katayama (CoRR, 2017)

Rendezvous of Asynchronous Mobile Robots with Lights. - Takashi Okumura; Koichi Wada 001; Yoshiaki Katayama (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights. - Takashi Okumura; Koichi Wada 001; Xavier Défago (OPODIS, 2018)

A Measurement Coding System for Block-Based Compressive Sensing Images by Using Pixel-Domain Features. - Jirayu Peetakul; Jinjia Zhou; Koichi Wada 001 (DCC, 2019)

Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots. - Yotam Ashkenazi; Shlomi Dolev; Sayaka Kamei; Fukuhito Ooshita; Koichi Wada 001 (CANDAR Workshops, 2019)

Efficient Circuit Simulation in MapReduce. - Fabian Frei; Koichi Wada 001 (ISAAC, 2019)

On Memory, Communication, and Synchronous Schedulers When Moving and Computing. - Paola Flocchini; Nicola Santoro; Koichi Wada 001 (OPODIS, 2019)

Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots. - Yotam Ashkenazi; Shlomi Dolev; Sayaka Kamei; Fukuhito Ooshita; Koichi Wada 001 (SSS, 2019)

Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder. - Shlomi Dolev; Sayaka Kamei; Yoshiaki Katayama; Fukuhito Ooshita; Koichi Wada 001 (SSS, 2019)

Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space. - Xavier Défago; Adam Heriban; Sébastien Tixeuil; Koichi Wada 001 (DISC, 2019)

Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. - Shlomi Dolev; Sayaka Kamei; Yoshiaki Katayama; Fukuhito Ooshita; Koichi Wada 001 (DISC, 2019)

Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract). - Shlomi Dolev; Sayaka Kamei; Yoshiaki Katayama; Fukuhito Ooshita; Koichi Wada 001 (CoRR, 2019)

Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots. - Yonghwan Kim 001; Yoshiaki Katayama; Koichi Wada 001 (CoRR, 2020)

Efficient GPU-Implementation for Integer Sorting Based on Histogram and Prefix-Sums. - Seiya Kozakai; Noriyuki Fujimoto; Koichi Wada 001 (ICPP, 2021)

Autonomous Mobile Robots: Refining the Computational Landscape. - Kevin Buchin; Paola Flocchini; Irina Kostitsyna; Tom Peters; Nicola Santoro; Koichi Wada 001 (IPDPS Workshops, 2021)

Asynchronous Gathering in a Torus. - Sayaka Kamei; Anissa Lamani; Fukuhito Ooshita; Sébastien Tixeuil; Koichi Wada 001 (OPODIS, 2021)

Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights. - Rikuo Nakai; Yuichi Sudo; Koichi Wada 001 (SSS, 2021)

On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis. - Kevin Buchin; Paola Flocchini; Irina Kostitsyna; Tom Peters; Nicola Santoro; Koichi Wada 001 (SIROCCO, 2022)

Asynchronous Complete Visibility Algorithm for Luminous Robots on Grid. - Yonghwan Kim 001; Yoshiaki Katayama; Koichi Wada 001 (CANDARW, 2023)

On Asynchrony, Memory, and Communication: Separations and Landscapes. - Paola Flocchini; Nicola Santoro; Yuichi Sudo; Koichi Wada 001 (OPODIS, 2023)

Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots. - Yotam Ashkenazi; Shlomi Dolev; Sayaka Kamei; Fukuhito Ooshita; Koichi Wada 001 (Concurr. Comput. Pract. Exp., 2023)

Complete Visibility Algorithm for Autonomous Mobile Luminous Robots under an Asynchronous Scheduler on Grid Plane. - Yonghwan Kim 001; Yoshiaki Katayama; Koichi Wada 001 (CoRR, 2023)

Location functions for self-stabilizing byzantine tolerant swarms. - Yotam Ashkenazi; Shlomi Dolev; Sayaka Kamei; Yoshiaki Katayama; Fukuhito Ooshita; Koichi Wada 001 (Theor. Comput. Sci., 2023)

Gathering problems for autonomous mobile robots with lights. - Satoshi Terai; Koichi Wada 001; Yoshiaki Katayama (Theor. Comput. Sci., 2023)

Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space. - Xavier Défago; Adam Heriban; Sébastien Tixeuil; Koichi Wada 001 (Robotics Auton. Syst., 2023)

Efficient deterministic MapReduce algorithms for parallelizable problems. - Fabian Frei; Koichi Wada 001 (J. Parallel Distributed Comput., 2023)

Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights. - Takashi Okumura; Koichi Wada 001; Xavier Défago (Theor. Comput. Sci., 2023)

Efficient GPU-Implementation of H-P Sort Based on Improved Histogram Computation. - Kaito Takase; Takumi Hagihara; Noriyuki Fujimoto; Koichi Wada 001 (HPC Asia, 2024)

Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. - Keita Nakajima; Kaito Takase; Koichi Wada 001 (SIROCCO, 2024)

Invited Paper: Gathering Oblivious Robots in the Plane. - Fabian Frei; Koichi Wada 001 (SSS, 2024)

Gathering Semi-Synchronously Scheduled Two-State Robots. - Kohei Otaka; Fabian Frei; Koichi Wada 001 (SSS, 2024)

Brief Announcement: Distinct Gathering Under Round Robin. - Fabian Frei; Koichi Wada 001 (DISC, 2024)

Neighborhood mutual remainder: self-stabilizing distributed implementation and applications. - Shlomi Dolev; Sayaka Kamei; Yoshiaki Katayama; Fukuhito Ooshita; Koichi Wada 001 (Acta Informatica, 2024)

Pairbot: Enhancing Computational Capabilities by Pairing of Autonomous Mobile Robots. - Yonghwan Kim 001; Yoshiaki Katayama; Koichi Wada 001 (IPDPS (Workshops), 2025)

On the computational power of energy-constrained mobile robots. - Kevin Buchin; Paola Flocchini; Irina Kostitsyna; Tom Peters; Nicola Santoro; Koichi Wada 001 (Inf. Comput., 2025)

Complete Visibility Algorithms of Luminous Robots With Two-Color Lights on Grid. - Yonghwan Kim 001; Yoshiaki Katayama; Koichi Wada 001 (Concurr. Comput. Pract. Exp., 2025)

Gathering on Rings for Myopic Asynchronous Robots with Lights. - Sayaka Kamei; Anissa Lamani; Fukuhito Ooshita; Sébastien Tixeuil; Koichi Wada 001 (Theory Comput. Syst., 2025)