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="Gallier, J.H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Building exact computation sequences
A. Pelin
,
J.H. Gallier
Theoretical Computer Science
53
(1), 1987, pp. 125-150
Continuation semantics for flowgraph equations
W.F. Dowling
,
J.H. Gallier
Theoretical Computer Science
44
(3), 1986, pp. 307-331
Reductions in tree replacement systems
J.H. Gallier
,
R.V. Book
Theoretical Computer Science
37
(2), 1985, pp. 123-150
Tree pushdown automata
K.M. Schimpf
,
J.H. Gallier
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 25-40
n
-rational algebras II. Varieties and logic of inequalities
J.H. Gallier
SIAM Journal on Computing
13
(4), 1984, November, pp. 776-794
n
-rational algebras I. Basic properties and free algebras
J.H. Gallier
SIAM Journal on Computing
13
(4), 1984, November, pp. 750-775
Recursion-closed algebraic theories
J.H. Gallier
Journal of Computer and System Sciences
23
(1), 1981, August, pp. 69-105
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness I
J.H. Gallier
Theoretical Computer Science
13
, 1981, pp. 193-223
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness II
J.H. Gallier
Theoretical Computer Science
13
, 1981, pp. 239-270
Recursion schemes and generalized interpretations
J.H. Gallier
Lecture Notes in Computer Science
71
, 1979, pp. 256-270