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
[3]
Hilfe
Suche: Author="Inagaki, Yasuyoshi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic term rewriting calculus and its application to inductive equational reasoning
Su Feng
,
Toshiki Sakabe
,
Yasuyoshi Inagaki
Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems. DISCO '93 (Gmunden, Austria, September 15-17, 1993)
LNCS 722
, 1993, pp. 256271
The intersection searching problem for
c
-oriented polygons
Xue-Hou Tan
,
Tomio Hirata
,
Yasuyoshi Inagaki
Information Processing Letters
37
, 1991, pp. 201-204
An incremental algorithm for constructing shortest watchman routes
Xue-Hou Tan
,
Tomio Hirata
,
Yasuyoshi Inagaki
Lecture Notes in Computer Science
557
, 1991, pp. 163-175
Spatial point location and its applications
Xue-Hou Tan
,
Tomio Hirata
,
Yasuyoshi Inagaki
Lecture Notes in Computer Science
450
, 1990, pp. 241-250
The equivalence problem for real-time strict deterministic languages
MIchio Oyamaguchi
,
Namio Honda
,
Yasuyoshi Inagaki
Information and Control
45
, 1980, pp. 90-115
A simplicity test for deterministic pushdown automata
Michio Oyamaguchi
,
Yasuyoshi Inagaki
,
Namio Honda
Information and Control
47
, 1980, pp. 10-36
A real-time strictness test for deterministic pushdown automata
Michio Oyamaguchi
,
Yasuyoshi Inagaki
,
Namio Honda
Information and Control
47
, 1980, pp. 1-9