Koichi Wada

Proceedings of the Second International Symposium on Computing and Networking, 2014

2013

Self-stabilizing DAG-Constructing Protocols with Application to Geocast in MANET.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

2012

The optimal tolerance of uniform observation error for mobile robot convergence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On the approximability and hardness of minimum topic connected overlay and its special instances.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

The Gathering Problem for Two Oblivious Robots with Unreliable Compasses.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model.

[BibT_eX]

[DOI]

Shukai Cai

Theory Comput. Syst., 2012

Minimum Certificate Dispersal with Tree Structures.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

2011

Oracle-based flocking of mobile robots in crash-recovery model.

[BibT_eX]

[DOI]

Samia Souissi

Theor. Comput. Sci., 2011

Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems.

[BibT_eX]

[DOI]

Nazreen Banu

Parallel Process. Lett., 2011

The BG-simulation for Byzantine Mobile Robots

[BibT_eX]

[DOI]

CoRR, 2011

Brief Announcement: The BG-Simulation for Byzantine Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

On the Approximability of Minimum Topic Connected Overlay and Its Special Instances.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Time-Efficient Data Congregation Protocols on Wireless Sensor Network.

[BibT_eX]

[DOI]

Proceedings of the 2011 International Symposium on Ubiquitous Virtual Reality (ISUVR), 2011

Distributed Algorithms for Cooperative Mobile Robots: A Survey.

[BibT_eX]

[DOI]

Samia Souissi

Proceedings of the Second International Conference on Networking and Computing, 2011

An efficient routing protocol on a Dynamic Cluster-based Sensor Network.

[BibT_eX]

[DOI]

Shahrum Shah Abdullah

Proceedings of the 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, 2011

2010

Approximability and inapproximability of the minimum certificate dispersal problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Foreword.

[BibT_eX]

[DOI]

Mirka Miller

Math. Comput. Sci., 2010

Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Doubly-expedited one-step Byzantine consensus.

[BibT_eX]

[DOI]

Nazreen Banu

Proceedings of the 2010 IEEE/IFIP International Conference on Dependable Systems and Networks, 2010

2009

Convergence of Mobile Robots with Uniformly-Inaccurate Sensors.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents.

[BibT_eX]

[DOI]

Shukai Cai

Proceedings of the Structural Information and Communication Complexity, 2009

Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

Autonomous market-based approach for resource allocation in a cluster-based sensor network.

[BibT_eX]

[DOI]

Heh Miao

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.

[BibT_eX]

[DOI]

Yoshiaki Katayama

Ad Hoc Sens. Wirel. Networks, 2008

Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2008

2007

Acknowledged broadcasting and gossiping in ad hoc radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Efficient Initialization Algorithms on Single-Hop Radio Networks.

[BibT_eX]

[DOI]

Naoki Inaba

IEICE Trans. Inf. Syst., 2007

Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

On the Probabilistic Omission Adversary.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2007

Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

Novel Broadcast/Multicast Protocols for Dynamic Sensor Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 2006

An Approximation Algorithm for Minimum Certificate Dispersal Problems.

[BibT_eX]

[DOI]

Hua Zheng

Shingo Omura

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Special Section on Invited Papers from New Horizons in Computing.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

Construction and Maintenance of a Cluster-Based Architecture for Sensor Networks.

[BibT_eX]

[DOI]

Yoshiaki Katayama

Proceedings of the 39th Hawaii International International Conference on Systems Science (HICSS-39 2006), 2006

2005

Parallel matrix-multiplication algorithm for distributed parallel computers.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 2005

An Optimal Certificate Dispersal Algorithm for Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Neighborhood Broadcasting in Undirected de Bruijn and Kautz Networks.

[BibT_eX]

[DOI]

Shingo Omura

Hua Zheng

IEICE Trans. Inf. Syst., 2005

2004

Optimal fault-tolerant routings with small routing tables for k-connected graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

2003

Reinforcement Learning Methods to Handle Actions with Differing Costs in MDPs.

[BibT_eX]

[DOI]

Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2003

An Optimal Algorithm of Acknowledged Broadcasting in Ad Hoc Radio Networks.

[BibT_eX]

[DOI]

Takaya Okuwa

Proceedings of the 2nd International Symposium on Parallel and Distributed Computing (ISPDC 2003), 2003

2002

On Computing the Upper Envelope of Segments in Parallel.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2002

Robust algorithms for constructing strongly convex hulls in parallel.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

Constructing a Strongly Convex Superhull of Points.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2001

A Design of Agents for the Disaster Simulator on RoboCup-Rescue.

[BibT_eX]

[DOI]

Proceedings of the RoboCup 2001: Robot Soccer World Cup V, 2001

Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM.

[BibT_eX]

[DOI]

Carla Denise Castanho

Akihiro Fujiwara

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Parallel Algorithms for Partitioning Sorted Sets and Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 2000

Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Kakitsubata Team Description.

[BibT_eX]

[DOI]

Proceedings of the RoboCup 2000: Robot Soccer World Cup IV, 2000

A Hardware Implementation of PRAM and Its Performance Evaluation.

[BibT_eX]

[DOI]

Carla Denise Castanho

Y. Okajima

H. Okamoto

Proceedings of the Parallel and Distributed Processing, 2000

1999

An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs.

[BibT_eX]

[DOI]

Yoriyuki Nagata

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998

Efficient Algorithms for a Mixed k-Partition Problem of Graphs Without Specifying Bases.

[BibT_eX]

[DOI]

Akinari Takaki

Theor. Comput. Sci., 1998

Integer Summing Algorithms on Reconfigurable Meshes.

[BibT_eX]

[DOI]

Koji Nakano

Theor. Comput. Sci., 1998

Finding the Convex Hull of Discs in Parallel.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1998

Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1997

Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

Parallel Robust Algorithms for Constructing Strongly Convex Hulls.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

1994

Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases.

[BibT_eX]

[DOI]

Akinari Takaki

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993

New Results in Graph Routing

[BibT_eX]

[DOI]

Inf. Comput., October, 1993

Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

Distributed algorithms for connectivity problem of networks with faulty elements.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1992

Optimal Fault-Tolerant Routings for Connected Graphs.

[BibT_eX]

[DOI]

Yupin Luo

Inf. Process. Lett., 1992

Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1989

Maximum lower bound on embedding areas of general graphs.

[BibT_eX]

[DOI]

Hideyuki Fujishima

Syst. Comput. Jpn., 1989

1987

Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs.

[BibT_eX]

[DOI]

Yupin Luo

Syst. Comput. Jpn., 1987

1986

Area-time complexity on a vlsi model with boundary layout assumption.

[BibT_eX]

[DOI]

Kouichi Wada

Syst. Comput. Jpn., 1986

Embedding area of d-way shuffle graph on a VLSI model.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1986

Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1986

1984

Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model.

[BibT_eX]

[DOI]

Kouichi Wada

IEEE Trans. Computers, 1984

1982

Effect of Practical Assumption in Area Complexity of VLSI Computation.

[BibT_eX]

[DOI]

Kouichi Wada