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="Wu, I-Chen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Drawn
k
-in-a-row games
Sheng-Hao Chiang
,
I-Chen Wu
,
Ping-Hung Lin
Theoretical Computer Science
412
(35), 2011, pp. 4558-4569
On the time complexity of minimum and maximum global snapshot problems
Loon-Been Chen
,
I-Chen Wu
Information Processing Letters
67
(3), 1998, pp. 151-156
Communication complexity for parallel divide-and-conquer
I-Chen Wu
,
H.T. Kung
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 151-162
Efficient parallel divide-and-conquer for a class of interconnection topologies
I-Chen Wu
Lecture Notes in Computer Science
557
, 1991, pp. 229-240
Area-period tradeoffs for multiplication of rectangular matrices
Ferng-Ching Lin
,
I-Chen Wu
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 329-342