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=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The completeness theorem for typing
\lambda
-terms
R. Hindley
Theoretical Computer Science
22
(1,2), 1983, pp. 1-17
Theory of symbolic expressions, I
M. Sato
Theoretical Computer Science
22
(1,2), 1983, pp. 19-55
Constructing a realtime deterministic pushdown automaton from a grammar
J. Pittl
,
A. Yehudai
Theoretical Computer Science
22
(1,2), 1983, pp. 57-69
On the relation between descriptional complexity and algorithmic probability
P. Gács
Theoretical Computer Science
22
(1,2), 1983, pp. 71-93
Infinite linear systems and one counter languages
W. Kuich
,
F.J. Urbanek
Theoretical Computer Science
22
(1,2), 1983, pp. 95-126
Curry's type-rules are complete with respect to the F-semantics too
R. Hindley
Theoretical Computer Science
22
(1,2), 1983, pp. 127-133
Recursion induction principle revisited
G. Boudol
,
L. Kott
Theoretical Computer Science
22
(1,2), 1983, pp. 135-173
Membership problem for embedded multivalued dependencies under some restricted conditions
M. Ito
,
K. Taniguchi
,
T. Kasami
Theoretical Computer Science
22
(1,2), 1983, pp. 175-194
Any iteration for polynomial equations using linear information has infinite complexity
G.W. Wasilkowski
Theoretical Computer Science
22
(1,2), 1983, pp. 195-208
(g_0, g_1,\ldots, g_k)
-trees and unary OL systems
D.T. Lee
,
C.L. Liu
,
C.K. Wong
Theoretical Computer Science
22
(1,2), 1983, pp. 209-217
Systolic trees and systolic language recognition by tree automata
M. Steinby
Theoretical Computer Science
22
(1,2), 1983, pp. 219-232
Size bounds for superconcentrators
G. Lev
,
L.G. Valiant
Theoretical Computer Science
22
(3), 1983, pp. 233-251
Nest sets and relativized closure properties
M. Takahashi
Theoretical Computer Science
22
(3), 1983, pp. 253-264
Hoare's logic and Peano's arithmetic
J.A. Bergstra
,
J.V. Tucker
Theoretical Computer Science
22
(3), 1983, pp. 265-284
On the complexity of multiplication in finite fields
A. Lempel
,
G. Seroussi
,
S. Winograd
Theoretical Computer Science
22
(3), 1983, pp. 285-296
Optimal off-line detection of repetitions in a string
A. Apostolico
,
F.P. Preparata
Theoretical Computer Science
22
(3), 1983, pp. 297-315
The complexity of partial derivatives
W. Baur
,
V. Strassen
Theoretical Computer Science
22
(3), 1983, pp. 317-330
L codes and number systems
H.A. Maurer
,
A. Salomaa
,
D. Wood
Theoretical Computer Science
22
(3), 1983, pp. 331-346