SEARCH
検索詳細
和田 幸一
理工学部 応用情報工学科
教授
Researchmap個人ページ
https://researchmap.jp/wadakovich0310
研究活動情報
■ 受賞
■ 論文
■ 論文
- 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), 2021年08月, ［］ - 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, 2019年10月, ［］ - Approximability of minimum certificate dispersal with tree structures
Taisuke Izumi; Tomoko Izumi; Hirotaka Ono; Koichi Wada
THEORETICAL COMPUTER SCIENCE, 2015年08月, ［］ - 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, 2015年01月, ［］ - 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, 2012年04月, ［］ - 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, 2012年04月, ［］ - 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年, ［］ - 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年, ［］ - Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems(共著)
Nazreen Banu; Taisuke Izumi; Koichi Wada
Parallel Processing Letters, 2011年12月, ［］ - Oracle-based flocking of mobile robots in crash-recovery model(共著)
Samia Souissi; Taisuke Izumi; Koichi Wada
Theoretical Computer Science, 2011年07月, ［］ - Distributed Algorithms for Cooperative Mobile Robots: A Survey(共著)
Samia Souissi; Taisuke Izumi; Koichi Wada
Proc. of 2nd International Conference on Networking and Computing (ICNC), 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年, ［］ - The BG-simulation for Byzantine Mobile Robots(共著)
Taisuke Izumi; Zohir Bouzid; Sébastien Tixeuil; Koichi Wada
Proc. of 25th International Symposium on Distributed Computing(DISC), 2011年, ［］ - 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年, ［］ - Approximability and inapproximability of the minimum certificate dispersal problem
Tomoko Izumi; Taisuke Izumi; Hirotaka Ono; Koichi Wada
THEORETICAL COMPUTER SCIENCE, 2010年06月, ［］ - Doubly-expedited one-step Byzantine consensus (共著)
Nazreen Banu; Taisuke Izumi; Koichi Wada
Proceedings of IEEE/IFIP International Conference on Dependable Systems and Networks, DSN2010, 2010年, ［］ - Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks (共著)
Keigo Kinpara; Tomoko Izumi; Taisuke Izumi; Koichi Wada
Proceedings of 14th International Conference on Principles of Distributed Systems, OPODIS2010, 2010年, ［］ - Efficient initialization algorithms on single-hop radio networks
Naoki Inaba; Koichi Wada
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007年06月, ［］ - On the probabilistic omission adversary
Taisuke Izumi; Koichi Wada
STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2007年, ［］ - Gathering autonomous mobile robots with dynamic compasses: An optimal result
Taisuke Izumi; Yoshiaki Katayama; Nobuhiro Inuzuka; Koichi Wada
DISTRIBUTED COMPUTING, PROCEEDINGS, 2007年, ［］ - Parallel matrix-multiplication algorithm for distributed parallel computers
Masamitsu Hattori; Nobuhiro Ito; Wei Chen; Koichi Wada
Systems and Computers in Japan, 2005年04月, ［］ - 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年, ［］ - Acknowledged broadcasting and gossiping in ad hoc radio networks
J Uchida; W Chen; K Wada
PRINCIPLES OF DISTRIBUTED SYSTEMS, 2004年, ［］ - 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年, ［］ - 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, 2001年05月, ［］ - On computing the upper envelope of segments in parallel
W Chen; K Wada
1998 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING - PROCEEDINGS, 1998年, ［］ - 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, 1997年07月, ［］ - EFFECTS OF PRACTICAL ASSUMPTION IN AREA COMPLEXITY OF VLSI COMPUTATION
K HAGIHARA; K WADA; N TOKURA
LECTURE NOTES IN COMPUTER SCIENCE, 1983年, ［］
- 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 (コンピュテーション)
和田 幸一; 泉 泰介
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 2013年05月17日 - On the complexity of minimum topic-connected overlay problems
和田幸一; JurajHromkovic; 泉泰介; 小野廣隆; SteinovaMonika
全国大会講演論文集, 2012年03月06日 - 分割画像のグラフカットに基づく高速かつ省メモリな画像前景抽出
柴 涼介; 泉 泰介; 和田 幸一
電子情報通信学会論文誌. D, 情報・システム = The IEICE transactions on information and systems (Japanese edition), 2012年03月01日 - Complexity of Minimum Certificate Dispersal Problem with Tree Structure
Taisuke Izumi; Tomoko Izumi; Hirotaka Ono; Koichi Wada
研究報告アルゴリズム（AL）, 2011年08月30日 - Adaptive One-Step Byzantine Consensus (アルゴリズム(AL) Vol.2010-AL-128)
BANU NAZREEN; IZUMI TAISUKE; WADA KOICHI
情報処理学会研究報告, 2010年02月 - Adaptive One-Step Byzantine Consensus
Nazreen Banu; Taisuke Izumi; Koichi Wada
研究報告アルゴリズム（AL）, 2010年01月19日 - 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年 - 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年 - Population protocolにおけるオラクルをもたない自己安定リーダー選挙問題の可解性に関して
Shukai Cai; 泉 泰介; 和田 幸一
情報処理学会研究報告アルゴリズム（AL）, 2008年10月31日 - 偶数台の自律分散ロボット群に対するリング上での一点集合問題について
羽場 康太郎; 泉 泰介; 片山 喜章; 犬塚 信博; 和田 幸一
電子情報通信学会技術研究報告. COMP, コンピュテーション, 2008年09月04日 - Optimal fault-tolerant routings with small routing tables for k-connected graphs
Koichi Wada; Wei Chen
Journal of Discrete Algorithms, 2004年12月 - Robust algorithms for constructing strongly convex hulls in parallel
W Chen; K Wada; K Kawaguchi
THEORETICAL COMPUTER SCIENCE, 2002年10月 - Robust algorithms for constructing strongly convex hulls in parallel
W Chen; K Wada; K Kawaguchi
THEORETICAL COMPUTER SCIENCE, 2002年10月 - 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, 2002年01月 - Constructing a strongly convex superhull of points
W Chen; XW Deng; KC Wada; K Kawaguchi
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2001年10月 - Designing efficient parallel algorithms with multi-level divide-and-conquer
W Chen; K Wada
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001年05月 - Designing efficient parallel algorithms with multi-level divide-and-conquer
W Chen; K Wada
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001年05月 - 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, 2000年10月 - 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, 2000年04月 - Parallel Algorithms for Convex Hull Problems and Their Paradigm
CHEN Wei; NAKANO Koji; WADA Koichi
IEICE transactions on information and systems, 2000年03月25日 - Parallel algorithms for convex hull problems and their paradigm
W Chen; K Nakano; K Wada
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000年03月 - 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-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年 - 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, 1998年07月 - Finding the convex hull of discs in parallel
W Chen; K Wada; K Kawaguchi; DZ Chen
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1998年06月 - Integer summing algorithms on reconfigurable meshes
K Nakano; K Wada
THEORETICAL COMPUTER SCIENCE, 1998年05月 - 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, 1997年05月 - 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-tolerant ATM-Routings for Biconnected Graphs
WADA K.
23rd International Workshop on Graph-Theoretic Concepts in Comuputer 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. of 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 without Specifying Bases
WADA K.
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年 - 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 Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs
WADA K.
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年 - 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, 1992年07月 - OPTIMAL FAULT-TOLERANT ROUTINGS FOR CONNECTED GRAPHS
K WADA; Y LUO; K KAWAGUCHI
INFORMATION PROCESSING LETTERS, 1992年03月 - 非阻寒グラフに関する一考案
電子情報通信学会論文誌（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,k)-Edge-Partition Algorithm for Connected Graphs and Fault-Tolerant Routings for k-Edge-Connected Graphs
和田 幸一; 渋谷 貴利; 川口 喜三男; 社本 英司
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年 - 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年 - 連結グラフの(L,κ)-辺分割線形時間アルゴリズムとκ-辺連結グラフに対する高信頼性路線割当
和田 幸一; 渋谷 貴利; 川口 喜三男; 社本 英司
電子情報通信学会論文誌. D-I, 情報・システム, I-コンピュータ = 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
THE TRANACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS D-1, 1992年 - 連結グラフの(L,κ)-辺分割線形時間アルゴリズムとκ-辺連結グラフに対する高信頼性路線割当
和田 幸一; 渋谷 貴利; 川口 喜三男; 社本 英司
電子情報通信学会論文誌. D-I, 情報・システム, I-コンピュータ = The transactions of the Institute of Electronics, Information and Communication Engineers, 1992年 - 3連結グラフにおける3-独立木構成アルゴリズムと2点間の内点独立路を求めるアルゴリズム
和田 幸一; 渋谷 貴利; 川口 喜三男
電子情報通信学会論文誌. D-I, 情報・システム, I-コンピュータ = 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年 - A New Measure of Fault-tolerance for Interconnection Network
WADA K.
Proc. Of 1990 BILKENT InternatinalbConf. 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 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 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年 - ＶＬＳＩモデルと面積複雑度
情報処理学会誌, 1985年 - VLSI Models and Area-Time Complexity
IPSJ Magazine, 1985年 - AREA TIME OPTIMAL FAST IMPLEMENTATION OF SEVERAL FUNCTIONS IN A VLSI MODEL
K WADA; K HAGIHARA; N TOKURA
IEEE TRANSACTIONS ON COMPUTERS, 1984年 - Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model
IEEE Transactions on Computers, 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年 - Area and Time Complexities of VLSI Computations
Proceedings of The Seventh IBM Symposium on Mathematical Foundations of Computer Science Mathematical Theory of Computations, 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年 - Area-Time Bounds for VLSI Circuits
Proc. of 19th Annual Allerton Conf. on Communication, Control and Computing, 1981年 - Area-Time Bounds for VLSI Circuits
Proc. of 19th Annual Allerton Conf. on Communication, Control and Computing, 1981年
- 情報数学
森北出版, 2010年, 査読無し - Mathematics for Computer Science
Morikita Syuppan, 2010年, 査読無し - アルゴリズムの設計と解析手法 (アルゴリズムイントロダクション) 改定2版
近代科学社, 2008年, 査読無し - 数学的構造とデータ構造（アルゴリズムイントロダクション）改定2版
近代科学社, 2008年, 査読無し - Introduction to Algorithms II Second Edition
Kindaikagakusya, 2008年, 査読無し - Introduction to Algorithms I Second Edition
Kindaikagakusya, 2008年, 査読無し - ITテキスト アルゴリズム論
オーム社, 2003年, 査読無し - IT Text Algorithm Theory
Ohmsya, 2003年, 査読無し - アルゴリズム工学
共立出版, 2001年, 査読無し - Algorithm Engineering
Kyoritsu Syuppan, 2001年, 査読無し - Ⅲ精選トピックス(翻訳）
近代科学社, 1995年, 査読無し - Ⅱアルゴリズムの設計と解析手法(翻訳）
近代科学社, 1995年, 査読無し - Ⅰ数学的基礎とデータ構造(翻訳）
近代科学社, 1995年, 査読無し - Introduction to Algorithms III
Kindaikagakusya, 1995年, 査読無し - Introduction to Algorithms II
Kindaikagakusya, 1995年, 査読無し - Introduction to Algorithms I
Kindaikagakusya, 1995年, 査読無し - VLSI計算の諸側面ーＶＬＳＩ設計のための理論とアルゴリズム(翻訳）
近代科学社, 1990年, 査読無し - Computational Aspect of VLSI
Kindaikagakusya, 1990年, 査読無し
- 動的メッセージ消失故障モデル上における乱択合意アルゴリズムについて.
第6回情報科学ワークショップ, 2010年 - GPGPU 上でのマルコフ連鎖モンテカルロ法の実装について
第6回情報科学ワークショップ, 2010年 - NP-困難問題の再最適化について.
第6回情報科学ワークショップ, 2010年 - 動的メッセージ消失故障モデル上における乱択合意アルゴリズムについて.
2010年 - GPGPU 上でのマルコフ連鎖モンテカルロ法の実装について
2010年 - NP-困難問題の再最適化について.
2010年
