Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Wada, Koichi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances''
Jun Hosoda
,
Juraj Hromkovic̑
,
Taisuke Izumi
,
Hirotaka Ono
,
Monika Steinová
,
Koichi Wada
Theoretical Computer Science
562
, 2014, pp. 660-661
Space-efficient self-stabilizing counting population protocols on mobile sensor networks
Tomoko Izumi
,
Keigo Kinpara
,
Taisuke Izumi
,
Koichi Wada
Theoretical Computer Science
552
, 2014, pp. 99-108
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
50
(3), 2012, pp. 433-445
On the approximability and hardness of minimum topic connected overlay and its special instances
Jun Hosoda
,
Juraj Hromkovic̑
,
Taisuke Izumi
,
Hirotaka Ono
,
Monika Steinová
,
Koichi Wada
Theoretical Computer Science
429
, 2012, pp. 144-154
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
41
(1), 2012, pp. 26-46
The optimal tolerance of uniform observation error for mobile robot convergence
Kenta Yamamoto
,
Taisuke Izumi
,
Yoshiaki Katayama
,
Nobuhiro Inuzuka
,
Koichi Wada
Theoretical Computer Science
444
, 2012, pp. 77-86
Adaptive and doubly-expedited one-step consensus in Byzantine asynchronous systems
Nazreen Banu
,
Taisuke Izumi
,
Koichi Wada
Parallel Processing Letters
21
(4), 2011, pp. 461-477
On the approximability of minimum topic connected overlay and its special instances
Jun Hosoda
,
Juraj Hromkovic̑
,
Taisuke Izumi
,
Hirotaka Ono
,
Monika Steinová
,
Koichi Wada
Lecture Notes in Computer Science
6907
, 2011, pp. 376-387
Communication latency tolerant parallel algorithm for particle swarm optimization
Bo Li
,
Koichi Wada
Parallel Computing
37
(1), 2011, pp. 1-10
Oracle-based flocking of mobile robots in crash-recovery model
Samia Souissi
,
Taisuke Izumi
,
Koichi Wada
Theoretical Computer Science
412
(33), 2011, pp. 4350-4360
Approximability and inapproximability of the minimum certificate dispersal problem
Tomoko Izumi
,
Taisuke Izumi
,
Hirotaka Ono
,
Koichi Wada
Theoretical Computer Science
411
(31-33), 2010, pp. 2773-2783
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
5609
, 2009, pp. 56-65
Acknowledged broadcasting and gossiping in ad hoc radio networks
Jiro Uchida
,
Wei Chen
,
Koichi Wada
Theoretical Computer Science
377
(1-3), 2007, pp. 43-54
Robust algorithms for constructing strongly convex hulls in parallel
Wei Chen
,
Koichi Wada
,
Kimio Kawaguchi
Theoretical Computer Science
289
(1), 2002, pp. 277-295
On computing the upper envelope segments in parallel
Wei Chen
,
Koichi Wada
IEEE Transactions on Parallel and Distributed Systems
13
(1), 2002, pp. 5-13
Parallelizability of some
P
-complete geometric problems in the EREW-PRAM
Carla Denise Castanho
,
Wei Chen
,
Koichi Wada
,
Akihiro Fujiwara
Lecture Notes in Computer Science
2108
, 2001, pp. 59-63
Optimal fault-tolerant routings for
k
-connected graphs with smaller routing tables
Koichi Wada
,
Wei Chen
Lecture Notes in Computer Science
1928
, 2000, pp. 302-313
An optimal fault-tolerant routing for triconnected planar graphs
Koichi Wada
,
Yoriyuki Nagata
,
Wei Chen
Lecture Notes in Computer Science
1665
, 1999, pp. 191-201
On computing the upper envelope of segments in parallel
Wei Chen
,
Koichi Wada
Proceedings of the 1998 International Conference on Parallel Processing, ICPP'98 (Minneapolis, Minnesota, August 10-14, 1998)
, 1998, pp. 253-260
Integer summing algorithms on reconfigurable meshes
Koji Nakano
,
Koichi Wada
Theoretical Computer Science
197
(1-2), 1998, pp. 57-77
Linear algorithms for a
k
-partition problem of planar graphs without specifying bases
Koichi Wada
,
Wei Chen
Lecture Notes in Computer Science
1517
, 1998, pp. 324-336
Efficient algorithms for a mixed
k
-partition problem of graphs without specifying bases
Koichi Wada
,
Akinari Takaki
,
Kimio Kawaguchi
Theoretical Computer Science
201
(1-2), 1998, pp. 233-248
Constructing a strongly convex superhull of points
Wei Chen
,
Xiao Wen Deng
,
Koichi Wada
,
Kimio Kawaguchi
Lecture Notes in Computer Science
1276
, 1997, pp. 42-51
Optimal fault-tolerant ATM-routings for biconnected graphs
Koichi Wada
,
Wei Chen
,
Yupin Luo
,
Kimio Kawaguchi
Lecture Notes in Computer Science
1335
, 1997, pp. 354-367
Highly fault-tolerant routings and fault-induced diameter for generalized hypercube graphs
Koichi Wada
,
Takaharu Ikeo
,
Kimio Kawaguchi
,
Wei Chen
Journal Parallel Distributed Computing
43
(1), 1997, pp. 57-62
Seiten 1
2
>