Koichi Wada
Orcid: 0000-0002-5351-1459Affiliations:
- Hosei University, Tokyo, Japan
- Nagoya Institute of Technology, Japan (former)
- Osaka University, Japan (former)
According to our database1,
Koichi Wada
authored at least 109 papers
between 1980 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications.
Acta Informatica, March, 2024
Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots.
CoRR, 2024
Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region, 2024
2023
Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights.
Theor. Comput. Sci., November, 2023
J. Parallel Distributed Comput., July, 2023
Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space.
Robotics Auton. Syst., May, 2023
Theor. Comput. Sci., 2023
Theor. Comput. Sci., 2023
Complete Visibility Algorithm for Autonomous Mobile Luminous Robots under an Asynchronous Scheduler on Grid Plane.
CoRR, 2023
Concurr. Comput. Pract. Exp., 2023
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023
Proceedings of the Eleventh International Symposium on Computing and Networking, CANDAR 2023, 2023
2022
On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis.
Proceedings of the Structural Information and Communication Complexity, 2022
2021
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021
Proceedings of the ICPP 2021: 50th International Conference on Parallel Processing, Lemont, IL, USA, August 9, 2021
2020
Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots.
CoRR, 2020
2019
Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract).
CoRR, 2019
Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019
Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019
Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019
Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
Proceedings of the Seventh International Symposium on Computing and Networking Workshops, 2019
A Measurement Coding System for Block-Based Compressive Sensing Images by Using Pixel-Domain Features.
Proceedings of the Data Compression Conference, 2019
2018
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018
2017
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017
2015
Theor. Comput. Sci., 2015
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., 2015
2014
Space-efficient self-stabilizing counting population protocols on mobile sensor networks.
Theor. Comput. Sci., 2014
Proceedings of the Second International Symposium on Computing and Networking, 2014
2013
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013
2012
Theor. Comput. Sci., 2012
On the approximability and hardness of minimum topic connected overlay and its special instances.
Theor. Comput. Sci., 2012
SIAM J. Comput., 2012
How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model.
Theory Comput. Syst., 2012
Proceedings of the Theory and Applications of Models of Computation, 2012
2011
Theor. Comput. Sci., 2011
Parallel Process. Lett., 2011
Proceedings of the Distributed Computing - 25th International Symposium, 2011
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
Proceedings of the 2011 International Symposium on Ubiquitous Virtual Reality (ISUVR), 2011
Proceedings of the Second International Conference on Networking and Computing, 2011
Proceedings of the 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, 2011
2010
Theor. Comput. Sci., 2010
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010
Proceedings of the 2010 IEEE/IFIP International Conference on Dependable Systems and Networks, 2010
2009
Proceedings of the Structural Information and Communication Complexity, 2009
Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents.
Proceedings of the Structural Information and Communication Complexity, 2009
Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009
Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009
Autonomous market-based approach for resource allocation in a cluster-based sensor network.
Proceedings of the 2009 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making, 2009
2008
Construction and Maintenance of a Novel Cluster-based Architecture for Ad Hoc Sensor Networks.
Ad Hoc Sens. Wirel. Networks, 2008
Proceedings of the Structural Information and Communication Complexity, 2008
2007
Theor. Comput. Sci., 2007
IEICE Trans. Inf. Syst., 2007
Proceedings of the Distributed Computing, 21st International Symposium, 2007
Proceedings of the Structural Information and Communication Complexity, 2007
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007
2006
A pattern formation algorithm for a set of autonomous distributed robots with agreement on orientation along one axis.
Syst. Comput. Jpn., 2006
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
IEICE Trans. Inf. Syst., 2006
Proceedings of the 39th Hawaii International International Conference on Systems Science (HICSS-39 2006), 2006
2005
Syst. Comput. Jpn., 2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
IEICE Trans. Inf. Syst., 2005
2004
Optimal fault-tolerant routings with small routing tables for <i>k</i>-connected graphs.
J. Discrete Algorithms, 2004
2003
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2003
Proceedings of the 2nd International Symposium on Parallel and Distributed Computing (ISPDC 2003), 2003
2002
IEEE Trans. Parallel Distributed Syst., 2002
Theor. Comput. Sci., 2002
2001
Int. J. Comput. Geom. Appl., 2001
Proceedings of the RoboCup 2001: Robot Soccer World Cup V, 2001
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
Algorithmica, 2000
Optimal Fault-Tolerant Routings for <i>k</i>-Connected Graphs with Smaller Routing Tables.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000
Proceedings of the RoboCup 2000: Robot Soccer World Cup IV, 2000
Proceedings of the Parallel and Distributed Processing, 2000
1999
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999
1998
Efficient Algorithms for a Mixed <i>k</i>-Partition Problem of Graphs Without Specifying Bases.
Theor. Comput. Sci., 1998
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998
1997
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs.
J. Parallel Distributed Comput., 1997
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997
1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
1995
Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995
1994
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994
1993
Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993
1992
Syst. Comput. Jpn., 1992
Discret. Appl. Math., 1992
1989
1987
Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs.
Syst. Comput. Jpn., 1987
1986
Syst. Comput. Jpn., 1986
Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees.
Syst. Comput. Jpn., 1986
1984
IEEE Trans. Computers, 1984
1982
Proceedings of the RIMS Symposium on Software Science and Engineering, 1982
1980
Proceedings of the Operating Systems Engineering: Proceedings of the 14th IBM Computer SCience Symposium, 1980