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
[1]
Hilfe
Suche: Author="Wu, Hongzhong"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the arrangement complexity of uniform trees
Günter Hotz
,
Hongzhong Wu
Lecture Notes in Computer Science
1337
, 1997, pp. 337-350
On the arrangment complexity of uniform trees
Günter Hotz
,
Hongzhong Wu
Technical Report (05/1995), 1995
On
n
-column
0,1
-matrices with all
k
-projections surjective
Hongzhong Wu
Acta Informatica
31
(3), 1994, pp. 285-299
On the assignment complexity of uniform trees
Hongzhong Wu
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, ISSAC'93 (Kiev, Ukraine, July 6-8, 1993)
, 1993, pp. 95-104
Synthesis of
O(\lg n)
testable trees
Hongzhong Wu
Proceedings of the 9th International Conference on Fundamentals of Computation Theory. FCT '93 (Szeged, Hungary, August 1993)
LNCS 710
, 1993, pp. 452-461
On tests of uniform tree circuits
Hongzhong Wu
Lecture Notes in Computer Science
634
, 1992, pp. 527-538