default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoichi Wada 0001
Kouichi Wada 0001
Person information
- affiliation: Hosei University, Tokyo, Japan
- affiliation (former): Nagoya Institute of Technology, Japan
- affiliation (former): Osaka University, Japan
Other persons with the same name
- Koichi Wada 0002
![[0000-0001-9271-5641]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9271-5641")
— University of Tsukuba, Japan - Koichi Wada 0003 — Kobe University, Graduate School of Science and Technology, Japan
- Koichi Wada 0004 — Kobe Eye Center, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j46]Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications. Acta Informatica 61(1): 83-100 (2024)- 2023
- [j45]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, Koichi Wada:
Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots. Concurr. Comput. Pract. Exp. 35(11) (2023) - [j44]Fabian Frei, Koichi Wada:
Efficient deterministic MapReduce algorithms for parallelizable problems. J. Parallel Distributed Comput. 177: 28-38 (2023) - [j43]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. Robotics Auton. Syst. 163: 104378 (2023) - [j42]Satoshi Terai, Koichi Wada, Yoshiaki Katayama:
Gathering problems for autonomous mobile robots with lights. Theor. Comput. Sci. 941: 241-261 (2023) - [j41]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Location functions for self-stabilizing byzantine tolerant swarms. Theor. Comput. Sci. 954: 113755 (2023) - [j40]Takashi Okumura, Koichi Wada, Xavier Défago:
Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights. Theor. Comput. Sci. 979: 114198 (2023) - 2015
- [j39]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. Theor. Comput. Sci. 562: 660-661 (2015) - [j38]Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada:
Approximability of minimum certificate dispersal with tree structures. Theor. Comput. Sci. 591: 5-14 (2015) - 2014
- [j37]Tomoko Izumi, Keigo Kinpara, Taisuke Izumi, Koichi Wada:
Space-efficient self-stabilizing counting population protocols on mobile sensor networks. Theor. Comput. Sci. 552: 99-108 (2014) - 2012
- [j36]Shukai Cai, Taisuke Izumi, Koichi Wada:
How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model. Theory Comput. Syst. 50(3): 433-445 (2012) - [j35]Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita:
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. SIAM J. Comput. 41(1): 26-46 (2012) - [j34]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. 429: 144-154 (2012) - [j33]Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada:
The optimal tolerance of uniform observation error for mobile robot convergence. Theor. Comput. Sci. 444: 77-86 (2012) - 2011
- [j32]Nazreen Banu, Taisuke Izumi, Koichi Wada:
Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems. Parallel Process. Lett. 21(4): 461-477 (2011) - [j31]Samia Souissi, Taisuke Izumi, Koichi Wada:
Oracle-based flocking of mobile robots in crash-recovery model. Theor. Comput. Sci. 412(33): 4350-4360 (2011) - 2010
- [j30]Mirka Miller, Koichi Wada:
Foreword. Math. Comput. Sci. 3(1): 1-2 (2010) - [j29]Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada:
Approximability and inapproximability of the minimum certificate dispersal problem. Theor. Comput. Sci. 411(31-33): 2773-2783 (2010) - 2008
- [j28]Jiro Uchida, Islam A. K. M. Muzahidul, Yoshiaki Katayama, Wei Chen, Koichi Wada:
Construction and Maintenance of a Novel Cluster-based Architecture for Ad Hoc Sensor Networks. Ad Hoc Sens. Wirel. Networks 6(1-2): 1-31 (2008) - 2007
- [j27]Naoki Inaba, Koichi Wada:
Efficient Initialization Algorithms on Single-Hop Radio Networks. IEICE Trans. Inf. Syst. 90-D(6): 915-922 (2007) - [j26]Jiro Uchida, Wei Chen, Koichi Wada:
Acknowledged broadcasting and gossiping in ad hoc radio networks. Theor. Comput. Sci. 377(1-3): 43-54 (2007) - 2006
- [j25]Hua Zheng, Shingo Omura, Koichi Wada:
An Approximation Algorithm for Minimum Certificate Dispersal Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(2): 551-558 (2006) - [j24]Koichi Wada:
Special Section on Invited Papers from New Horizons in Computing. IEICE Trans. Inf. Syst. 89-D(8): 2331 (2006) - [j23]Masao Kasuya, Nobuhiro Ito, Nobuhiro Inuzuka, Koichi Wada:
A pattern formation algorithm for a set of autonomous distributed robots with agreement on orientation along one axis. Syst. Comput. Jpn. 37(10): 89-100 (2006) - 2005
- [j22]Shingo Omura, Hua Zheng, Koichi Wada:
Neighborhood Broadcasting in Undirected de Bruijn and Kautz Networks. IEICE Trans. Inf. Syst. 88-D(1): 89-95 (2005) - [j21]Hua Zheng, Shingo Omura, Jiro Uchida, Koichi Wada:
An Optimal Certificate Dispersal Algorithm for Mobile Ad Hoc Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1258-1266 (2005) - [j20]Masamitsu Hattori, Nobuhiro Ito, Wei Chen, Koichi Wada:
Parallel matrix-multiplication algorithm for distributed parallel computers. Syst. Comput. Jpn. 36(4): 48-59 (2005) - 2004
- [j19]Koichi Wada, Wei Chen:
Optimal fault-tolerant routings with small routing tables for k-connected graphs. J. Discrete Algorithms 2(4): 517-530 (2004) - 2002
- [j18]Wei Chen, Koichi Wada, Kimio Kawaguchi:
Robust algorithms for constructing strongly convex hulls in parallel. Theor. Comput. Sci. 289(1): 277-295 (2002) - [j17]Wei Chen, Koichi Wada:
On Computing the Upper Envelope of Segments in Parallel. IEEE Trans. Parallel Distributed Syst. 13(1): 5-13 (2002) - 2001
- [j16]Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi:
Constructing a Strongly Convex Superhull of Points. Int. J. Comput. Geom. Appl. 11(5): 487-502 (2001) - 2000
- [j15]Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi:
Parallel Algorithms for Partitioning Sorted Sets and Related Problems. Algorithmica 28(2): 217-241 (2000) - 1998
- [j14]Wei Chen, Koichi Wada, Kimio Kawaguchi, Danny Z. Chen:
Finding the Convex Hull of Discs in Parallel. Int. J. Comput. Geom. Appl. 8(3): 305-320 (1998) - [j13]Koji Nakano, Koichi Wada:
Integer Summing Algorithms on Reconfigurable Meshes. Theor. Comput. Sci. 197(1-2): 57-77 (1998) - [j12]Koichi Wada, Akinari Takaki, Kimio Kawaguchi:
Efficient Algorithms for a Mixed k-Partition Problem of Graphs Without Specifying Bases. Theor. Comput. Sci. 201(1-2): 233-248 (1998) - 1997
- [j11]Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen:
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs. J. Parallel Distributed Comput. 43(1): 57-62 (1997) - 1993
- [j10]Kimio Kawaguchi, Koichi Wada:
New Results in Graph Routing. Inf. Comput. 106(2): 203-233 (1993) - 1992
- [j9]Koichi Wada, Kimio Kawaguchi:
Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs. Discret. Appl. Math. 37/38: 539-552 (1992) - [j8]Koichi Wada, Yupin Luo, Kimio Kawaguchi:
Optimal Fault-Tolerant Routings for Connected Graphs. Inf. Process. Lett. 41(3): 169-174 (1992) - [j7]Koichi Wada, Yukio Moritani, Kimio Kawaguchi, Masahiro Morishita:
Distributed algorithms for connectivity problem of networks with faulty elements. Syst. Comput. Jpn. 23(7): 12-22 (1992) - 1989
- [j6]Koichi Wada, Kimio Kawaguchi, Hideyuki Fujishima:
Maximum lower bound on embedding areas of general graphs. Syst. Comput. Jpn. 20(10): 39-52 (1989) - 1987
- [j5]Koichi Wada, Kimio Kawaguchi, Yupin Luo:
Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs. Syst. Comput. Jpn. 18(11): 50-60 (1987) - 1986
- [j4]Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura, Koichi Wada:
Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees. Syst. Comput. Jpn. 17(3): 56-65 (1986) - [j3]Koichi Wada, Kenichi Hagihara, Nobuki Tokura:
Embedding area of d-way shuffle graph on a VLSI model. Syst. Comput. Jpn. 17(6): 10-19 (1986) - [j2]Kouichi Wada, Kenichi Hagihara, Nobuki Tokura:
Area-time complexity on a vlsi model with boundary layout assumption. Syst. Comput. Jpn. 17(6): 67-75 (1986) - 1984
- [j1]Kouichi Wada, Kenichi Hagihara, Nobuki Tokura:
Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model. IEEE Trans. Computers 33(5): 455-462 (1984)
Conference and Workshop Papers
- 2024
- [c66]Kaito Takase, Takumi Hagihara, Noriyuki Fujimoto, Koichi Wada:
Efficient GPU-Implementation of H-P Sort Based on Improved Histogram Computation. HPC Asia 2024: 134-144 - [c65]Keita Nakajima, Kaito Takase, Koichi Wada:
Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. SIROCCO 2024: 494-500 - 2023
- [c64]Yonghwan Kim, Yoshiaki Katayama, Koichi Wada:
Asynchronous Complete Visibility Algorithm for Luminous Robots on Grid. CANDARW 2023: 107-113 - [c63]Paola Flocchini, Nicola Santoro, Yuichi Sudo, Koichi Wada:
On Asynchrony, Memory, and Communication: Separations and Landscapes. OPODIS 2023: 28:1-28:23 - 2022
- [c62]Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada:
On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis. SIROCCO 2022: 42-61 - 2021
- [c61]Seiya Kozakai, Noriyuki Fujimoto, Koichi Wada:
Efficient GPU-Implementation for Integer Sorting Based on Histogram and Prefix-Sums. ICPP 2021: 11:1-11:11 - [c60]Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada:
Autonomous Mobile Robots: Refining the Computational Landscape. IPDPS Workshops 2021: 576-585 - [c59]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Asynchronous Gathering in a Torus. OPODIS 2021: 9:1-9:17 - [c58]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Location Functions for Self-stabilizing Byzantine Tolerant Swarms. SSS 2021: 229-242 - [c57]Rikuo Nakai, Yuichi Sudo, Koichi Wada:
Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights. SSS 2021: 410-424 - 2020
- [c56]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. SRDS 2020: 113-122 - 2019
- [c55]Jirayu Peetakul, Jinjia Zhou, Koichi Wada:
A Measurement Coding System for Block-Based Compressive Sensing Images by Using Pixel-Domain Features. DCC 2019: 599 - [c54]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, Koichi Wada:
Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots. CANDAR Workshops 2019: 188-194 - [c53]Fabian Frei, Koichi Wada:
Efficient Circuit Simulation in MapReduce. ISAAC 2019: 52:1-52:21 - [c52]Paola Flocchini, Nicola Santoro, Koichi Wada:
On Memory, Communication, and Synchronous Schedulers When Moving and Computing. OPODIS 2019: 25:1-25:17 - [c51]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Gathering on Rings for Myopic Asynchronous Robots With Lights. OPODIS 2019: 27:1-27:17 - [c50]Yotam Ashkenazi, Shlomi Dolev, Sayaka Kamei, Fukuhito Ooshita, Koichi Wada:
Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots. SSS 2019: 16-21 - [c49]Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder. SSS 2019: 127-132 - [c48]Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada:
Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space. DISC 2019: 41:1-41:3 - [c47]Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. DISC 2019: 43:1-43:3 - 2018
- [c46]Takashi Okumura, Koichi Wada, Yoshiaki Katayama:
Rendezvous of Asynchronous Mobile Robots with Lights. Adventures Between Lower Bounds and Higher Altitudes 2018: 434-448 - [c45]Takashi Okumura, Koichi Wada, Xavier Défago:
Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights. OPODIS 2018: 24:1-24:16 - 2017
- [c44]Takashi Okumura, Koichi Wada, Yoshiaki Katayama:
Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights. SSS 2017: 484-488 - 2014
- [c43]Koichi Wada:
Computational Models for Big Data Processing. CANDAR 2014: 28-31 - 2013
- [c42]Koichi Ito, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi:
Self-stabilizing DAG-Constructing Protocols with Application to Geocast in MANET. SSS 2013: 373-375 - 2012
- [c41]Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada:
Minimum Certificate Dispersal with Tree Structures. TAMC 2012: 548-559 - 2011
- [c40]Islam A. K. M. Muzahidul, Shahrum Shah Abdullah, Koichi Wada, Jiro Uchida, Wei Chen:
An efficient routing protocol on a Dynamic Cluster-based Sensor Network. CrownCom 2011: 161-165 - [c39]Samia Souissi, Taisuke Izumi, Koichi Wada:
Distributed Algorithms for Cooperative Mobile Robots: A Survey. ICNC 2011: 364-371 - [c38]Islam A. K. M. Muzahidul, Koichi Wada, Wei Chen:
Time-Efficient Data Congregation Protocols on Wireless Sensor Network. ISUVR 2011: 33-36 - [c37]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS 2011: 376-387 - [c36]Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada:
Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. DISC 2011: 330-331 - 2010
- [c35]Nazreen Banu, Taisuke Izumi, Koichi Wada:
Doubly-expedited one-step Byzantine consensus. DSN 2010: 373-382 - [c34]Keigo Kinpara, Tomoko Izumi, Taisuke Izumi, Koichi Wada:
Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks. OPODIS 2010: 504-515 - 2009
- [c33]Wei Chen, Heh Miao, Koichi Wada:
Autonomous market-based approach for resource allocation in a cluster-based sensor network. MCDM 2009: 1-8 - [c32]Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada:
Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. COCOON 2009: 56-65 - [c31]Toshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada:
Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction. OPODIS 2009: 219-224 - [c30]Shukai Cai, Taisuke Izumi, Koichi Wada:
Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents. SIROCCO 2009: 113-125 - [c29]Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada:
Convergence of Mobile Robots with Uniformly-Inaccurate Sensors. SIROCCO 2009: 309-322 - [c28]Samia Souissi, Taisuke Izumi, Koichi Wada:
Oracle-Based Flocking of Mobile Robots in Crash-Recovery Model. SSS 2009: 683-697 - 2008
- [c27]Nobuhiro Inuzuka, Yuichi Tomida, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada:
Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. SIROCCO 2008: 5-19 - 2007
- [c26]Wei Chen, Islam A. K. M. Muzahidul, Mohan Malkani, Amir Shirkhodaie, Koichi Wada, Mohamed Zein-Sabatto:
Novel Broadcast/Multicast Protocols for Dynamic Sensor Networks. IPDPS 2007: 1-8 - [c25]Yoshiaki Katayama, Yuichi Tomida, Hiroyuki Imazu, Nobuhiro Inuzuka, Koichi Wada:
Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots. SIROCCO 2007: 274-288 - [c24]Taisuke Izumi, Koichi Wada:
On the Probabilistic Omission Adversary. SSS 2007: 357-371 - [c23]Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada:
Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result. DISC 2007: 298-312 - 2006
- [c22]Jiro Uchida, Islam A. K. M. Muzahidul, Yoshiaki Katayama, Wei Chen, Koichi Wada:
Construction and Maintenance of a Cluster-Based Architecture for Sensor Networks. HICSS 2006 - 2004
- [c21]Hua Zheng, Shingo Omura, Jiro Uchida, Koichi Wada:
An Optimal Certificate Dispersal Algorithm for Mobile Ad Hoc Networks. ISPDC/HeteroPar 2004: 42-48 - 2003
- [c20]Takaya Okuwa, Wei Chen, Koichi Wada:
An Optimal Algorithm of Acknowledged Broadcasting in Ad Hoc Radio Networks. ISPDC 2003: 178-184 - [c19]Takahisa Ishiguro, Tohgoroh Matsui, Nobuhiro Inuzuka, Koichi Wada:
Reinforcement Learning Methods to Handle Actions with Differing Costs in MDPs. KES 2003: 553-560 - [c18]Jiro Uchida, Wei Chen, Koichi Wada:
Acknowledged Broadcasting and Gossiping in Ad Hoc Radio Networks. OPODIS 2003: 223-234 - 2001
- [c17]Carla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara:
Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM. COCOON 2001: 59-63 - [c16]Taku Sakushima, Tetsuya Esaki, Yoshiki Asai, Nobuhiro Ito, Koichi Wada:
A Design of Agents for the Disaster Simulator on RoboCup-Rescue. RoboCup 2001: 743-746 - 2000
- [c15]M. Imai, Y. Hayakawa, H. Kawanaka, Wei Chen, Koichi Wada, Carla Denise Castanho, Y. Okajima, H. Okamoto:
A Hardware Implementation of PRAM and Its Performance Evaluation. IPDPS Workshops 2000: 143-148 - [c14]Tetsuya Esaki, Taku Sakushima, Shinji Futamase, Nobuhiro Ito, Tomoichi Takahashi, Wei Chen, Koichi Wada:
Kakitsubata Team Description. RoboCup 2000: 425-428 - [c13]Koichi Wada, Wei Chen:
Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables. WG 2000: 302-313 - 1999
- [c12]Koichi Wada, Yoriyuki Nagata, Wei Chen:
An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs. WG 1999: 191-201 - 1998
- [c11]Wei Chen, Koichi Wada:
On Computing the Upper Envelope of Segments in Parallel. ICPP 1998: 253-261 - [c10]Koichi Wada, Wei Chen:
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases. WG 1998: 324-336 - 1997
- [c9]Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi:
Constructing a Strongly Convex Superhull of Points. COCOON 1997: 42-51 - [c8]Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi:
Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. WG 1997: 354-367 - 1996
- [c7]Wei Chen, Koichi Wada, Kimio Kawaguchi:
Parallel Robust Algorithms for Constructing Strongly Convex Hulls. SCG 1996: 133-140 - [c6]Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi:
Parallel Algorithms for Partitioning Sorted Sets and Related Problems. ESA 1996: 234-245 - 1995
- [c5]Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen:
Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. WG 1995: 197-208 - 1994
- [c4]Koichi Wada, Akinari Takaki, Kimio Kawaguchi:
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. WG 1994: 319-330 - 1993
- [c3]Koichi Wada, Kimio Kawaguchi:
Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs. WG 1993: 132-143 - 1982
- [c2]Kenichi Hagihara, Kouichi Wada, Nobuki Tokura:
Effect of Practical Assumption in Area Complexity of VLSI Computation. RIMS Symposium on Software Science and Engineering 1982: 128-146 - 1980
- [c1]Kouichi Wada, Kenichi Hagihara, Toshiro Araki, Nobuki Tokura:
Specification of schedulers with algebraic specification techniques. Operating Systems Engineering 1980: 42-62
Editorship
- 2024
- [e2]Alysson Bessani, Xavier Défago, Junya Nakamura, Koichi Wada, Yukiko Yamauchi:
27th International Conference on Principles of Distributed Systems, OPODIS 2023, December 6-8, 2023, Tokyo, Japan. LIPIcs 286, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-308-9 [contents] - 2008
- [e1]Mirka Miller, Koichi Wada:
Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan. College Publications 2008, ISBN 978-1-904987-74-1 [contents]
Informal and Other Publications
- 2024
- [i19]Keita Nakajima, Kaito Takase, Koichi Wada:
Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots. CoRR abs/2403.05542 (2024) - [i18]Kohei Otaka, Fabian Frei, Koichi Wada:
Gathering Semi-Synchronously Scheduled Two-State Robots. CoRR abs/2408.09999 (2024) - 2023
- [i17]Yonghwan Kim, Yoshiaki Katayama, Koichi Wada:
Complete Visibility Algorithm for Autonomous Mobile Luminous Robots under an Asynchronous Scheduler on Grid Plane. CoRR abs/2306.08354 (2023) - [i16]Paola Flocchini, Nicola Santoro, Yuichi Sudo, Koichi Wada:
On Asynchrony, Memory, and Communication: Separations and Landscapes. CoRR abs/2311.03328 (2023) - 2022
- [i15]Kevin Buchin, Paola Flocchini, Irina Kostitsyna, Tom Peters, Nicola Santoro, Koichi Wada:
On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis. CoRR abs/2203.06546 (2022) - 2021
- [i14]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Asynchronous Gathering in a Torus. CoRR abs/2101.05421 (2021) - [i13]Rikuo Nakai, Yuichi Sudo, Koichi Wada:
Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights. CoRR abs/2109.12289 (2021) - 2020
- [i12]Yonghwan Kim, Yoshiaki Katayama, Koichi Wada:
Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots. CoRR abs/2009.14426 (2020) - 2019
- [i11]Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract). CoRR abs/1903.02843 (2019) - [i10]Fabian Frei, Koichi Wada:
Efficient Circuit Simulation in MapReduce. CoRR abs/1907.01624 (2019) - [i9]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 abs/1907.09871 (2019) - [i8]Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Gathering on Rings for Myopic Asynchronous Robots with Lights. CoRR abs/1911.04757 (2019) - 2018
- [i7]Takashi Okumura, Koichi Wada, Xavier Défago:
Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights. CoRR abs/1804.01368 (2018) - [i6]Satoshi Terai, Koichi Wada, Yoshiaki Katayama:
Gathering Problems for Autonomous Mobile Robots with Lights. CoRR abs/1811.12068 (2018) - 2017
- [i5]Takashi Okumura, Koichi Wada, Yoshiaki Katayama:
Optimal Asynchronous Rendezvous for Mobile Robots with Lights. CoRR abs/1707.04449 (2017) - 2011
- [i4]Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada:
The BG-simulation for Byzantine Mobile Robots. CoRR abs/1106.0113 (2011) - [i3]Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada:
Minimum Certificate Dispersal with Tree Structures. CoRR abs/1106.5845 (2011) - [i2]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances. CoRR abs/1107.2443 (2011) - [i1]Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita:
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. CoRR abs/1111.1492 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
