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="Hamaguchi, Kiyoharu"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
Masaki Nakanishi
,
Kiyoharu Hamaguchi
,
Toshinobu Kashiwabara
Lecture Notes in Computer Science
1858
, 2000, pp. 467-476
The complexity of the optimal variable ordering problems of shared binary decision diagrams
Seiichiro Tani
,
Kiyoharu Hamaguchi
,
Shuzo Yajima
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 389-398
\infty
-regular temporal logic and its model checking problem
Kiyoharu Hamaguchi
,
Hiromi Hiraishi
,
Shuzo Yajima
Theoretical Computer Science
103
, 1992, pp. 191-204