SEARCH
Search Details
WADA Koichi
Faculty of Science and Engineering Department of Applied Informatics
Professor
Researchmap URL
https://researchmap.jp/wadakovich0310
Career
■ Career
- 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
Research activity information
■ Award
■ Paper
■ Paper
- Efficient GPU-Implementation for Integer Sorting Based on Histogram and Prefix-Sums.
Seiya Kozakai; Noriyuki Fujimoto; Koichi Wada
ICPP 2021: 50th International Conference on Parallel Processing(ICPP), Aug. 2021, [Reviewed] - 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
International Symposium on Reliable Distributed Systems(SRDS), 2020 - Brief announcement: Model checking rendezvous algorithms for robots with lights in Euclidean space
Xavier Défago; Adam Heriban; Sébastien Tixeuil; Koichi Wada
Leibniz International Proceedings in Informatics, LIPIcs, Oct. 2019, [Reviewed] - Approximability of minimum certificate dispersal with tree structures
Taisuke Izumi; Tomoko Izumi; Hirotaka Ono; Koichi Wada
THEORETICAL COMPUTER SCIENCE, Aug. 2015, [Reviewed] - On the approximability and hardness of minimum topic connected overlay and its special instances (vol 429, pg 144, 2012)
Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono; Monika Steinova; Koichi Wada
THEORETICAL COMPUTER SCIENCE, Jan. 2015, [Reviewed] - 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
THEORY OF COMPUTING SYSTEMS, Apr. 2012, [Reviewed] - On the approximability and hardness of minimum topic connected overlay and its special instances
Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono; Monika Steinova; Koichi Wada
THEORETICAL COMPUTER SCIENCE, Apr. 2012, [Reviewed] - The gathering problem for two oblivious robots with unreliable compasses
Taisuke Izumi; Samia Souissi; Yoshiaki Katayama; Nobuhiro Inuzuka; Xavier Défago; Koichi Wada; Masafumi Yamashita
SIAM Journal on Computing, 2012, [Reviewed] - Minimum certificate dispersal with tree structures
Taisuke Izumi; Tomoko Izumi; Hirotaka Ono; Koichi Wada
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, [Reviewed] - Adaptive and doubly-expedited one-step consensus in byzantine asynchronous systems
Nazreen Banu; Taisuke Izumi; Koichi Wada
Parallel Processing Letters, Dec. 2011, [Reviewed] - Oracle-based flocking of mobile robots in crash-recovery model
Samia Souissi; Taisuke Izumi; Koichi Wada
THEORETICAL COMPUTER SCIENCE, Jul. 2011, [Reviewed] - Distributed algorithms for cooperative mobile robots: A survey
Samia Souissi; Taisuke Izumi; Koichi Wada
Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011, 2011 - Byzantine-tolerant circle formation by oblivious mobile robots
Samia Souissi; Taisuke Izumi; Koichi Wada
2011 International Conference on Communications, Computing and Control Applications, CCCA 2011, 2011, [Reviewed] - Brief Announcement: The BG-Simulation for Byzantine Mobile Robots
Taisuke Izumi; Zohir Bouzid; Sebastien Tixeuil; Koichi Wada
DISTRIBUTED COMPUTING, 2011, [Reviewed] - On the Approximability of Minimum Topic Connected Overlay and Its Special Instances
Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono; Monika Steinova; Koichi Wada
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, [Reviewed] - Approximability and inapproximability of the minimum certificate dispersal problem
Tomoko Izumi; Taisuke Izumi; Hirotaka Ono; Koichi Wada
THEORETICAL COMPUTER SCIENCE, Jun. 2010, [Reviewed] - Doubly-Expedited One-Step Byzantine Consensus
Nazreen Banu; Taisuke Izumi; Koichi Wada
2010 IEEE-IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS DSN, 2010, [Reviewed] - Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks
Keigo Kinpara; Tomoko Izumi; Taisuke Izumi; Koichi Wada
PRINCIPLES OF DISTRIBUTED SYSTEMS, 2010, [Reviewed] - Efficient initialization algorithms on single-hop radio networks
Naoki Inaba; Koichi Wada
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Jun. 2007, [Reviewed] - On the probabilistic omission adversary
Taisuke Izumi; Koichi Wada
STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2007, [Reviewed] - Gathering autonomous mobile robots with dynamic compasses: An optimal result
Taisuke Izumi; Yoshiaki Katayama; Nobuhiro Inuzuka; Koichi Wada
DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, [Reviewed] - Parallel matrix-multiplication algorithm for distributed parallel computers
Masamitsu Hattori; Nobuhiro Ito; Wei Chen; Koichi Wada
Systems and Computers in Japan, Apr. 2005, [Reviewed] - An error-resilient encoding with fewer DNA strands for graph problems on DNA computing
S Nakamoto; K Goshonoo; W Chen; K Wada
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2005, [Reviewed] - Acknowledged broadcasting and gossiping in ad hoc radio networks
J Uchida; W Chen; K Wada
PRINCIPLES OF DISTRIBUTED SYSTEMS, 2004, [Reviewed] - An optimal algorithm of acknowledged broadcasting in ad hoc radio networks
T Okuwa; W Chen; K Wada
SECOND INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING, PROCEEDINGS, 2003, [Reviewed] - Polynomially fast parallel algorithms for some P-complete problems
CD Castanho; W Chen; K Wada; A Fujiwara
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, May 2001, [Reviewed] - On computing the upper envelope of segments in parallel
W Chen; K Wada
1998 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING - PROCEEDINGS, 1998, [Reviewed] - Efficient algorithms for some k-partition problem of graphs
A Takaki; K Wada; K Kawaguchi
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, Jul. 1997, [Reviewed] - EFFECTS OF PRACTICAL ASSUMPTION IN AREA COMPLEXITY OF VLSI COMPUTATION
K HAGIHARA; K WADA; N TOKURA
LECTURE NOTES IN COMPUTER SCIENCE, 1983, [Reviewed]
- 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
CoRR, 2019 - Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights.
Takashi Okumura; Koichi Wada; Xavier Défago
CoRR, 2018 - On parallel complexity of MapReduce computation
WADA Koichi; IZUMI Taisuke
IEICE technical report. Theoretical foundations of Computing, 17 May 2013 - On parallel complexity of MapReduce computation
Koichi Wada; Taisuke Izumi
IPSJ SIG Notes, 10 May 2013 - On the complexity of minimum topic-connected overlay problems
和田幸一; JurajHromkovic; 泉泰介; 小野廣隆; SteinovaMonika
全国大会講演論文集, 06 Mar. 2012 - Fast and Memory Efficient Image Segmentation Using Graph Cuts by Divided Images
SHIBA Ryosuke; IZUMI Taisuke; WADA Koichi
The IEICE transactions on information and systems (Japanese edetion), 01 Mar. 2012 - Complexity of Minimum Certificate Dispersal Problem with Tree Structure
Taisuke Izumi; Tomoko Izumi; Hirotaka Ono; Koichi Wada
研究報告アルゴリズム（AL）, 30 Aug. 2011 - Fast and Memory-Efficient Image Segmentation Using Local Graph cuts
柴 涼介; 泉 泰介; 和田 幸一
研究報告コンピュータビジョンとイメージメディア（CVIM）, 12 May 2011 - Communication-Efficient Broadcast on Markovian Evolving Graphs
MATSUBARA Kei; IZUMI TAISUKE; WADA Koichi
IEICE technical report, 02 Mar. 2011 - Adaptive One-Step Byzantine Consensus (アルゴリズム(AL) Vol.2010-AL-128)
BANU NAZREEN; IZUMI TAISUKE; WADA KOICHI
情報処理学会研究報告, Feb. 2010 - Adaptive One-Step Byzantine Consensus
BANU NAZREEN; IZUMI TAISUKE; WADA KOICHI
研究報告アルゴリズム（AL）, 19 Jan. 2010 - Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
Shukai Cai; Taisuke Izumi; Koichi Wada
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010 - On Approximability of the Minimum Certificate Dispersal Problem
IZUMI Tomoko; IZUMI Taisuke; ONO Hirotaka; WADA Koich
IPSJ SIG Notes, 26 Feb. 2009 - Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction
Toshimitsu Masuzawa; Taisuke Izumi; Yoshiaki Katayama; Koichi Wada
PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009 - Oracle-based flocking of mobile robots in crash-recovery model
Samia Souissi; Taisuke Izumi; Koichi Wada
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009 - Relationship between Approximability and request structures in the minimum certificate dispersal problem
Tomoko Izumi; Taisuke Izumi; Hirotaka Ono; Koichi Wada
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009 - Convergence of mobile robots with uniformly-inaccurate sensors
K.Yamamoto; T.Izumi; Y.Katayama; N.Inuzuka; K.Wada
LectureNotes in Computer Science, 2009 - Autonomous Market-Based Approach for Resource Allocation in A Cluster-Based Sensor Network
Wei Chen; Heh Miao; Koichi Wada
MCDM: 2009 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN MULTI-CRITERIA DECISION-MAKING, 2009 - Oracle-Based Flocking of Mobile Robots in Crash-Recovery Model
Samia Souissi; Taisuke Izumi; Koichi Wada
STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009 - Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem
Tomoko Izumi; Taisuke Izumi; Hirotaka Ono; Koichi Wada
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009 - Convergence of mobile robots with uniformly-inaccurate sensors
K.Yamamoto; T.Izumi; Y.Katayama; N.Inuzuka; K.Wada
LectureNotes in Computer Science, 2009 - Autonomous Market-Based Approach for Resource Allocation in A Cluster-Based Sensor Network
Wei Chen; Heh Miao; Koichi Wada
MCDM: 2009 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN MULTI-CRITERIA DECISION-MAKING, 2009 - On Solvability of Self-Stabilizing Leader Election without Oracles in Population Protocols
CAI Shukai; IZUMI Taisuke; WADA Koichi
IPSJ SIG Notes, 31 Oct. 2008 - On Gathering Problem in a Ring for 2n Autonomous Mobile Robots
HABA Kotaro; IZUMI Taisuke; KATAYAMA Yoshiaki; INUZUKA Nobuhiro; WADA Koichi
IEICE technical report, 04 Sep. 2008 - A Consensus Algorithm Tolerating Adversarial Crash and Probabilistic Omission
IZUMI Taisuke; WADA Koichi
IEICE technical report, 05 Mar. 2007 - Optimal fault-tolerant routings with small routing tables for k-connected graphs
Koichi Wada; Wei Chen
Journal of Discrete Algorithms, Dec. 2004 - Robust algorithms for constructing strongly convex hulls in parallel
W Chen; K Wada; K Kawaguchi
THEORETICAL COMPUTER SCIENCE, Oct. 2002 - Robust algorithms for constructing strongly convex hulls in parallel
W Chen; K Wada; K Kawaguchi
THEORETICAL COMPUTER SCIENCE, Oct. 2002 - An Error-resilient Encoding with Less DNA Strands for Graph Problems on DNA Computing
S. Nakamoto; K. Gosyonoo; W. Chen; K. Wada
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS D-1 IEICE, 2002 - An Error-resilient Encoding with Less DNA Strands for Graph Problems on DNA Computing
S. Nakamoto; K. Gosyonoo; W. Chen; K. Wada
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS D-1, 2002 - On computing the upper envelope of segments in parallel
W Chen; K Wada
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, Jan. 2002 - Constructing a strongly convex superhull of points
W Chen; XW Deng; KC Wada; K Kawaguchi
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, Oct. 2001 - Designing efficient parallel algorithms with multi-level divide-and-conquer
W Chen; K Wada
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, May 2001 - Designing efficient parallel algorithms with multi-level divide-and-conquer
W Chen; K Wada
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, May 2001 - Polynomially Fast Parallel Algorithms for some P-Complete Gemetric Problems
C.D. Castanho; W. Chen; K. Wada
IEICE TRANSACTIONS ON Fundamentals of Electronics, Communications and Computer Sciences, 2001 - Polynomially Fast Parallel Algorithms for some P-Complete Gemetric Problems
C.D. Castanho; W. Chen; K. Wada
IEICE TRANSACTIONS ON Fundamentals of Electronics, Communications and Computer Sciences, 2001 - Parallelizability of some P-complete geometric problems in the EREW-PRAM
CD Castanho; W Chen; K Wada; A Fujiwara
COMPUTING AND COMBINATORICS, 2001 - Parallel algorithms for partitioning sorted sets and related problems
DZ Chen; W Chen; K Wada; K Kawaguchi
ALGORITHMICA, Oct. 2000 - A parallel algorithm for constructing strongly convex superhulls of points
CD Castanho; W Chen; K Wada
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Apr. 2000 - Parallel Algorithms for Convex Hull Problems and Their Paradigm
CHEN Wei; NAKANO Koji; WADA Koichi
IEICE transactions on information and systems, 25 Mar. 2000 - Parallel algorithms for convex hull problems and their paradigm
W Chen; K Nakano; K Wada
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Mar. 2000 - A hardware implementation of PRAM and its performance evaluation
M Imai; Y Hayakawa; H Kawanaka; W Chen; K Wada; CD Castanho; Y Okajima; H Okamoto
PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 2000 - A hardware implementation of PRAM and its performance evaluation
M Imai; Y Hayakawa; H Kawanaka; W Chen; K Wada; CD Castanho; Y Okajima; H Okamoto
PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 2000 - Optimal fault-tolerant routings for k-connected graphs with smaller routing tables
Koichi Wada; Wei Chen
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000 - Optimal Fault-Torelant Routings on Surviving Route Graph Model
K. Wada
Proc. of International Conference on Advances in Infrastructure for Electrinic Business, Science, and Education on the Internet, 2000 - An Optimal Fault-Torelant Routing for Triconnected Planar Graphs
K. Wada; Y. Nagata; W. Chen
Proc. Of 25th International Workshop on Graph-Theoretic Concepts in Computer Science, 1999 - An Optimal Fault-Torelant Routing for Triconnected Planar Graphs
K. Wada; Y. Nagata; W. Chen
Proc. Of 25th International Workshop on Graph-Theoretic Concepts in Computer Science, 1999 - Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
K Wada; A Takaki; K Kawaguchi
THEORETICAL COMPUTER SCIENCE, Jul. 1998 - Finding the convex hull of discs in parallel
W Chen; K Wada; K Kawaguchi; DZ Chen
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, Jun. 1998 - Integer summing algorithms on reconfigurable meshes
K Nakano; K Wada
THEORETICAL COMPUTER SCIENCE, May 1998 - Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases
WADA Koichi; CHEN Wei
IEICE technical report. Theoretical foundations of Computing, 24 Apr. 1998 - Integer Summing Algorithms on Reconfigurable Meshes
Theoretical Computer Science, 1998 - Linear algorithms for a k-partition problem of planar graphs without specifying bases
K Wada; W Chen
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998 - Highly fault-tolerant routings and fault-induced diameter for generalized hypercube graphs
K Wada; T Ikeo; K Kawaguchi; W Chen
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, May 1997 - Optimal Fault-Torelant ATM-Routings for Biconnected Graphs
Proc. Of 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, 1997 - Constructing a Strongly Convex Superhull of Points
Proc. Of Third Annual International Computing and Combinatorics Conference, 1997 - Optimal Fault-Torelant ATM-Routings for Biconnected Graphs
WADA K.
Proc. Of 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, 1997 - Constructing a Strongly Convex Superhull of Points
Proc. Of Third Annual International Computing and Combinatorics Conference, 1997 - Parallel robust algorithms for constructing strongly convex hulls
CHEN W.
Proc. 12th Annual ACM Symposium on Computational Geometry, 1996 - Parallel Robust Algorithms for Constructing Strongly Convex Hulls
Proc. of 12th Annual ACM Symposium on COMPUTATIONAL GEOMETRY, 1996 - Parallel algorithms for partitioning sorted sets and related problems
Danny Z. Chen; Wei Chent; Koichi Wada; Kimio Kawaguchi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1996 - ハードウェアアルゴリズムの記述と検証
情報処理学会誌, 1995 - Parallel Convex Hull Algorithms in a Curved World
Proc. Of the fourth International Conf. For Young Scientists, 1995 - グラフのあるｋ－分割問題に対する効率的なアルゴリズムについて
電子情報通信学会論文誌(A), 1995 - Integer summing algorithms on reconfigurable meshes
K Nakano; K Wada
IEEE FIRST ICA3PP - IEEE FIRST INTERNATIONAL CONFERENCE ON ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, VOLS 1 AND 2, 1995 - Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs
K Wada; T Ikeo; K Kawaguchi; W Chen
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995 - Verification and Transformation for Systolic Algorithms
IPSJ Magazine, 1995 - Parallel Convex Hull Algorithms in a Curved World
Proc. Of the fourth International Conf. For Young Scientists, 1995 - ３個の空位を持つN×M－平面自動倉庫（N,M≧３）の最小歩数関数 The Minimum Number of Slidinig Operations of Palettes in a Tow-Dimensional Autmatic Warehouse of Size N×M(N,M≧３）with Three Spaces
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A, 1995 - Efficient Algorithms for some k-Partition Problem of Graphs
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A, 1995 - A Parallel Method for Finding the Convex Hull of Discs
Proc. Of IEEE 1st Int. Conf. On Algorithms and Architectures for Parallel Processng, 1994 - Efficient algorithms for a mixed k-partition problem of graphs whithout specifying bases
WADA K.
20th International Workshop on Graph-Theoretic Concepts in Computer Science, 1994 - The Graph Classes with Optimal Algorithms for k-Connectivity Augmentation Problems
Proc. of International Conf. On Computers, Systems and Signal Processing, 1994 - A Parallel Method for Finding the Convex Hull of Discs
Proc. Of IEEE 1st Int. Conf. On Algorithms and Architectures for Parallel Processng, 1994 - Integer Summing Algorithms on Reconfigurable Meshes
Proc. Of IEEE 1st Int. Conf. On Algorithms and Architectures for Parallel Processng, 1994 - Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases
Proc. Of 20th International Workshop on Graph-Theoretic Concepts in Computer Science, 1994 - The Graph Classes with Optimal Algorithms for k-Connectivity Augmentation Problems
Proc. of International Conf. On Computers, Systems and Signal Processing, 1994 - Improvement of the Sufficient Conditions and the Computational Complexity in Defining Optimal Graph Routings
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS D-1, 1993 - Efficient algorithms for triconnected graphs and 3-edge-connected graphs
WADA K.
19th International Workshop on Graph-Theoretic Concepts in Computer Science, 1993 - A Linear-Time Algorithm for Centering a Spanning Tree of a Biconnected Graph
Revista Brasileira de Computacao, 1993 - A Linear-Time Algorithm for Centering a Spanning Tree of a Biconnected Graph
Proc. Of ⅩⅢ Conference of Brazilizn Computer Society, 1993 - 通信網に対する高信頼性路線割当ての存在条件と計算量の改善
電子情報通信学会論文誌（D－１）, 1993 - Improvement of the Sufficient Conditions and the Computational Complexity in Defining Optimal Graph Routings
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS D-1, 1993 - Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs
Proc. Of 19th International Workshop on Graph-Theoretic Concepts in Computer Science, 1993 - A Linear-Time Algorithm for Centering a Spanning Tree of a Biconnected Graph
Revista Brasileira de Computacao, 1993 - A Linear-Time Algorithm for Centering a Spanning Tree of a Biconnected Graph
Proc. Of ⅩⅢ Conference of Brazilizn Computer Society, 1993 - 通信網に対する高信頼性路線割当ての存在条件と計算量の改善
電子情報通信学会論文誌（D－１）, 1993 - EFFICIENT FAULT-TOLERANT FIXED ROUTINGS ON (K+1)-CONNECTED DIGRAPHS
K WADA; K KAWAGUCHI
DISCRETE APPLIED MATHEMATICS, Jul. 1992 - OPTIMAL FAULT-TOLERANT ROUTINGS FOR CONNECTED GRAPHS
K WADA; Y LUO; K KAWAGUCHI
INFORMATION PROCESSING LETTERS, Mar. 1992 - 非阻寒グラフに関する一考案
電子情報通信学会論文誌（A), 1992 - Optimal Bounds of the crossing number and the Bisection width for Generalized Hypercube Graphs
Peoc. Of 16th Biennial Symposium on Communications, 1992 - A Linear Time (L, κ)-Edge-Partition Algorithm for Connected Graphs and Fault-Tolerant Routings for κ-Edge-Connected Graphs
WADA Koichi; SHIBUYA Takatoshi; KAWAGUCHI-IZAWA Kimio; SHAMOTO Eiji
The Transactions of the Institute of Electronics,Information and Communication Engineers., 1992 - A 3-Independent-Tree Algorithm and a Disjoint-Path Algorithm for 3-Connected Graphs
WADA Koichi; SHIBUYA Takatoshi; KAWAGUCHI-IZAWA Kimio
The Transactions of the Institute of Electronics,Information and Communication Engineers., 1992 - A Linear Time (L, κ)-Edge-Partition Algorithm for Connected Graphs and Fault-Tolerant Routings for κ-Edge-Connected Graphs
WADA Koichi; SHIBUYA Takatoshi; KAWAGUCHI-IZAWA Kimio; SHAMOTO Eiji
The Transactions of the Institute of Electronics,Information and Communication Engineers., 1992 - A 3-Independent-Tree Algorithm and a Disjoint-Path Algorithm for 3-Connected Graphs
WADA Koichi; SHIBUYA Takatoshi; KAWAGUCHI-IZAWA Kimio
The Transactions of the Institute of Electronics,Information and Communication Engineers., 1992 - Distributed algorithms for connectivity problem of networks with faulty elements
Koichi Wada; Yukio Moritani; Kimio Kawaguchi; Masahiro Morishita
Systems and Computers in Japan, 1992 - On Nonblocking Graphs
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A, 1992 - Optimal Bounds of the crossing number and the Bisection width for Generalized Hypercube Graphs
Peoc. Of 16th Biennial Symposium on Communications, 1992 - Efficient Fault-Torelant Fixed Routings on (k+1)-Connected Digraphs
Discrete Applied Mathematics, 1992 - A Linear Time (L,k)-Edge-Partition Algorithm for Connected Graphs and Fault-Tolerant Routings for k-Edge-Connected Graphs
WADA Koichi; SHIBUYA Takatoshi; KAWAGUCHI-IZAWA Kimio; SHAMOTO Eiji
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS D-1, 1992 - A 3-Independent-Tree Algorithm and a Disjoint-Path Algorithm for 3-Connected Graphs
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS D-1, 1992 - 連結グラフの（Ｌ，ｋ）－辺分割線形時間アルゴリズとｋ－辺連結グラフに対する高信頼性路線割当
WADA Koichi; SHIBUYA Takatoshi; KAWAGUCHI-IZAWA Kimio; SHAMOTO Eiji
電子情報通信学会論文誌（D－１）, 1992 - ３連結グラフにおける３－独立木構成アルゴリズムと２点間の内点独立路を求めるアルゴリズム
WADA Koichi; SHIBUYA Takatoshi; KAWAGUCHI-IZAWA Kimio
電子情報通信学会論文誌（D－１）, 1992 - Distributed algorithms for connectivity problem of networks with faulty elements
Koichi Wada; Yukio Moritani; Kimio Kawaguchi; Masahiro Morishita
Systems and Computers in Japan, 1992 - Highly fault-tolerant routings on the small scale multi-cycle graphs
川口 喜三男; 羅 予頻; 和田 幸一
The Transactions of the Institute of Electronics,Information and Communication Engineers. A, 1991 - Distributed algorithms for connectivity problem of networks with faulty elements
和田 幸一; 守谷 幸男; 川口 喜三男; 森下 正浩
The Transactions of the Institute of Electronics,Information and Communication Engineers., 1991 - Highly Fault-Tolerant Routings on the Small Scale Multi-Cycle Graphs
川口 喜三男; 羅 予頻; 和田 幸一
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A, 1991 - A New Measure of Fault-Tolerance for Interconnection Networks
WADA K.
Proceeding of 1990 BILLENT International Conference on New Trends in Communication, Control and Signal Processing, 1990 - A New Measure of Fault-tolerance for Interconnection Network
Proc. Of 1990 BILKENT InternatinalbConf. On New Trends in Communication, Control and Signal Processing, 1990 - The upper and lower bounds on the area of a generalized graph embedding
和田 幸一; 川口 喜三男; 藤嶋 秀幸
The Transactions of the Institute of Electronics,Information and Communication Engineers., 1989 - Minimal and Bidirectional Faoult-Torelant Network Routing for k-Hypercube Graphs
Proc. Of IEEE Pacific RIM Congf. On Communications Computers and Signal Processing, 1989 - The highly fault-tolerant routings on the multi-cycle graphs
羅 予頻; 川口 喜三男; 和田 幸一
The Transactions of the Institute of Electronics,Information and Communication Engineers. A, 1989 - A construction of graphs with small diameter and fault-tolerant routings
守谷 幸男; 和田 幸一; 川口 喜三男
The Transactions of the Institute of Electronics,Information and Communication Engineers. A, 1989 - The upper and lower bounds on the area of a generalized graph embedding
和田 幸一; 川口 喜三男; 藤嶋 秀幸
The Transactions of the Institute of Electronics,Information and Communication Engineers., 1989 - The Upper and Lower Bounds on the Area of a Generalized Graph Embedding
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS D-1, 1989 - Minimal and Bidirectional Faoult-Torelant Network Routing for k-Hypercube Graphs
Proc. Of IEEE Pacific RIM Congf. On Communications Computers and Signal Processing, 1989 - The Highly Fault-Torelant Routings on the Multi-Cycle Graphs
羅 予頻; 川口 喜三男; 和田 幸一
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A, 1989 - A Construction of Graphs with Small Diameter and Fault-Tolerant Routings
守谷 幸男; 和田 幸一; 川口 喜三男
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A, 1989 - The maximum lower bound on embedding areas of general graphs
和田 幸一; 川口 喜三男; 藤嶋 秀幸
The Transactions of the Institute of Electronics,Information and Communication Engineers, 1988 - The Maximum Lower Bound on Embedding Areas of General Graphs
和田 幸一; 川口 喜三男; 藤嶋 秀幸
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS, 1988 - Highly fault-tolerant network routings for (k+1)-node (edge) connected graphs
川口 喜三男; 和田 幸一
The Transactions of the Institute of Electronics,Information and Communication Engineers. A, 1987 - Some considerations of fault-tolerance for fixed network routings
和田 幸一; 川口 喜三男
The Transactions of the Institute of Electronics,Information and Communication Engineers. A, 1987 - A construction of networks with highly fault-tolerant routings
羅 予頻; 和田 幸一; 川口 喜三男
The Transactions of the Institute of Electronics,Information and Communication Engineers. A, 1987 - Highly Fault-Tolerant Network Routings for (k+1)-Node(Edge) Connected Graphs
川口 喜三男; 和田 幸一
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A, 1987 - Some Considerations of Fault-Tolerance for Fixed Network Routings
和田 幸一; 川口 喜三男
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A, 1987 - A Construction of Networks with Highly Fault-Tolerant Routings
羅 予頻; 和田 幸一; 川口 喜三男
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS A, 1987 - Fault-tolerant network routings for (k+1)-node connected and (k+1)-edge connected graphs
和田 幸一; 川口 喜三男; 羅 予頻
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1986 - Fault-Tolerant Network Routings for (k+1)-Node Connected and (k+1)-Edge Connected Graphs
和田 幸一; 川口 喜三男; 羅 予頻
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1986 - The Embedding Area of d-Way Shuffle Graph on a VLSI Model
和田 幸一; 萩原 兼一; 都倉 信樹
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1985 - The optimal time algorithm for the k-node-connectivity augmentation problem for directed ternary trees
増沢 利光; 萩原 兼一; 和田 幸一; 都倉 信樹
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1985 - ＶＬＳＩモデルと面積複雑度
情報処理学会誌, 1985 - The area-time complexity on a VLSI model with boundary layout assumption
和田 幸一; 萩原 兼一; 都倉 信樹
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1985 - Systolic algorithms for polynomial multiplication and division with the same data flow
和田 幸一; 水野 雅信; 川口 喜三男
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1985 - The Embedding Area of d-Way Shuffle Graph on a VLSI Model
和田 幸一; 萩原 兼一; 都倉 信樹
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1985 - The Optimal Time Algorithm for the k-Node-Connectivity Augmentation Problem for Directed Ternary Trees
増沢 利光; 萩原 兼一; 和田 幸一; 都倉 信樹
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1985 - VLSI Models and Area-Time Complexity
IPSJ Magazine, 1985 - The Area-Time Complexity on a VLSI Model with Boundary Layout Assumption
和田 幸一; 萩原 兼一; 都倉 信樹
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1985 - Systolic Algorithms for Polynomial Mutiplication and Division with the Same Data Flow
和田 幸一; 水野 雅信; 川口 喜三男
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1985 - Area-Time Optimal Constructions of Several Boolean Functions
和田 幸一; 萩原 兼一; 都倉 信樹
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1984 - AREA TIME OPTIMAL FAST IMPLEMENTATION OF SEVERAL FUNCTIONS IN A VLSI MODEL
K WADA; K HAGIHARA; N TOKURA
IEEE TRANSACTIONS ON COMPUTERS, 1984 - Vulnerability of a communication network with a satellite
萩原 兼一; 和田 幸一; 池田 光二; 増澤 利光; 都倉 信樹
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1984 - The k-Node-Connenctivity Augmentation Problem for Directed Binery Tress
増沢 利光; 萩原 兼一; 和田 幸一; 都倉 信樹
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1984 - Area-Time Optimal Constructions for Logical Functions
和田 幸一; 萩原 兼一; 都倉 信樹
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1984 - Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model
IEEE Transactions on Computers, 1984 - Vulnerability of a Communication Network with a Satellite
萩原 兼一; 和田 幸一; 池田 光二; 増澤 利光; 都倉 信樹
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1984 - The k-Node-Connectivity Augmentation Problem for Directed Binary Trees
増沢 利光; 萩原 兼一; 和田 幸一; 都倉 信樹
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1984 - Systolic Algorithm Description Language SADL and Support System for Systric Algorithm Design
Proc. of 1983 International Symp. On VLSI Technology, Systems and Applications, 1983 - Specification of Shedulers with Algebraic Specification Techniques
Lecture Notes in Computer Science, 1983 - Effects of Practical Assumption in Area Complexity of VLSI Computation
Transaction on IECE, 1983 - Systolic Algorithm Description Language SADL and Support System for Systric Algorithm Design
Proc. of 1983 International Symp. On VLSI Technology, Systems and Applications, 1983 - Specification of Shedulers with Algebraic Specification Techniques
Lecture Notes in Computer Science, 1983 - Effects of Practical Assumption in Area Complexity of VLSI Computation
Transaction on IECE, 1983 - The Area Complexity on a VLSI Model
和田 幸一; 萩原 兼一; 都倉 信樹
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1982 - Area and Time Complexities of VLSI Computations
Proceedings of The Seventh IBM Symposium on Mathematical Foundations of Computer Science Mathematical Theory of Computations, 1982 - The Area Cpmpexity on a VLSI Model
和田 幸一; 萩原 兼一; 都倉 信樹
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1982 - Area and Time Complexities of VLSI Computations
Proceedings of The Seventh IBM Symposium on Mathematical Foundations of Computer Science Mathematical Theory of Computations, 1982 - The Area-Time Complexity of n Variable Logical Functions
和田 幸一; 萩原 兼一; 都倉 信樹
The Transactions of the Institute of Electronics and Communication Engineers of Japan, 1981 - Area-Time Bounds for VLSI Circuits
Proc. of 19th Annual Allerton Conf. on Communication, Control and Computing, 1981 - The Area-time Complexity of n Variables Functions
和田 幸一; 萩原 兼一; 都倉 信樹
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS, 1981 - Area-Time Bounds for VLSI Circuits
Proc. of 19th Annual Allerton Conf. on Communication, Control and Computing, 1981
- 情報数学
森北出版, 2010, Not reviewed - Mathematics for Computer Science
Morikita Syuppan, 2010, Not reviewed - アルゴリズムの設計と解析手法 (アルゴリズムイントロダクション) 改定2版
近代科学社, 2008, Not reviewed - 数学的構造とデータ構造（アルゴリズムイントロダクション）改定2版
近代科学社, 2008, Not reviewed - Introduction to Algorithms II Second Edition
Kindaikagakusya, 2008, Not reviewed - Introduction to Algorithms I Second Edition
Kindaikagakusya, 2008, Not reviewed - ITテキスト アルゴリズム論
オーム社, 2003, Not reviewed - IT Text Algorithm Theory
Ohmsya, 2003, Not reviewed - アルゴリズム工学
共立出版, 2001, Not reviewed - Algorithm Engineering
Kyoritsu Syuppan, 2001, Not reviewed - Ⅲ精選トピックス(翻訳）
近代科学社, 1995, Not reviewed - Ⅱアルゴリズムの設計と解析手法(翻訳）
近代科学社, 1995, Not reviewed - Ⅰ数学的基礎とデータ構造(翻訳）
近代科学社, 1995, Not reviewed - Introduction to Algorithms III
Kindaikagakusya, 1995, Not reviewed - Introduction to Algorithms II
Kindaikagakusya, 1995, Not reviewed - Introduction to Algorithms I
Kindaikagakusya, 1995, Not reviewed - VLSI計算の諸側面ーＶＬＳＩ設計のための理論とアルゴリズム(翻訳）
近代科学社, 1990, Not reviewed - Computational Aspect of VLSI
Kindaikagakusya, 1990, Not reviewed
- 動的メッセージ消失故障モデル上における乱択合意アルゴリズムについて.
第6回情報科学ワークショップ, 2010 - GPGPU 上でのマルコフ連鎖モンテカルロ法の実装について
第6回情報科学ワークショップ, 2010 - NP-困難問題の再最適化について.
第6回情報科学ワークショップ, 2010 - 動的メッセージ消失故障モデル上における乱択合意アルゴリズムについて.
2010 - GPGPU 上でのマルコフ連鎖モンテカルロ法の実装について
2010 - NP-困難問題の再最適化について.
2010
