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: Journal=Theor.~Comput.~Sci. AND Volume=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast verification, testing, and generation of large primes
D.A. Plaisted
Theoretical Computer Science
9
(1), 1979, pp. 1-16
Périodes et répétitions des mots du monoide libre
J.-P. Duval
Theoretical Computer Science
9
(1), 1979, pp. 17-26
Church-Rosser strategies in the lambda calculus
J.A. Bergstra
,
J.W. Klop
Theoretical Computer Science
9
(1), 1979, pp. 27-38
Program transformations and algebraic semantics
I. Guessarian
Theoretical Computer Science
9
(1), 1979, pp. 39-65
Intuitionistic propositional logic is polynomial-space complete
R. Statman
Theoretical Computer Science
9
(1), 1979, pp. 67-72
The typed
\lambda
-calculus is not elementary recursive
R. Statman
Theoretical Computer Science
9
(1), 1979, pp. 73-81
Switching functions whose monotone complexity is nearly quadratic
I. Wegener
Theoretical Computer Science
9
(1), 1979, pp. 83-97
The number of registers required for evaluating arithmetic expressions
P. Flajolet
,
J.C. Raoult
,
J. Vuillemin
Theoretical Computer Science
9
(1), 1979, pp. 99-125
A relation between space, return and dual return complexities
G. Wechsung
,
A. Brandstädt
Theoretical Computer Science
9
(1), 1979, pp. 127-140
Ensembles presque periodiques k-reconnaissables
G. Christol
Theoretical Computer Science
9
(1), 1979, pp. 141-145
A counterexample to a conjecture of Schnorr referring to monotone networks
I. Wegener
Theoretical Computer Science
9
(1), 1979, pp. 147-150
Chain properties in
P_\omega
A. Tang
Theoretical Computer Science
9
(2), 1979, pp. 153-172
On equivalence of grammars through transformation trees
M.A. Harrison
,
I.M. Havel
,
A. Yehudai
Theoretical Computer Science
9
(2), 1979, pp. 173-205
On commutative DTOL systems
J. Karhumäki
Theoretical Computer Science
9
(2), 1979, pp. 207-220
La représentation ergodique d'un automate fini
D. Perrin
Theoretical Computer Science
9
(2), 1979, pp. 221-241
A generalized setting for fixpoint theory
E.A. Ashcroft
,
F.E. Fich
Theoretical Computer Science
9
(2), 1979, pp. 243-256
Algebraic and graph theoretic characterizations of structured flowchart schemes
S.L. Bloom
,
R. Tindell
Theoretical Computer Science
9
(3), 1979, pp. 265-286
Simple chain grammars and languages
A. Nijholt
Theoretical Computer Science
9
(3), 1979, pp. 287-309
One-way simple multihead finite automata
K. Inoue
,
I. Takanami
,
A. Nakamura
,
T. Ae
Theoretical Computer Science
9
(3), 1979, pp. 311-328
Mechanizing structural induction part I: Formal system
R. Aubin
Theoretical Computer Science
9
(3), 1979, pp. 329-345
Mechanizing structural induction part II: Strategies
R. Aubin
Theoretical Computer Science
9
(3), 1979, pp. 347-362
Sur les séries associées à certains systmes de Lindenmayer
C. Reutenauer
Theoretical Computer Science
9
(3), 1979, pp. 363-375
On some decidability problems for HDOL systems with nonsingular Parikh matrices
K. Ruohonen
Theoretical Computer Science
9
(3), 1979, pp. 377-384
Familles de langages fermees par crochet ouvert
F. Rodriquez
Theoretical Computer Science
9
(3), 1979, pp. 385-398