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 YEAR=1983
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of monadic recursion schemes: Executability problems, nesting depth and applications
H.B. Hunt III
,
D.J. Rosenkrantz
Theoretical Computer Science
27
(1,2), 1983, pp. 3-38
Algebraic relations and presentations
T. Kamimura
,
A. Tang
Theoretical Computer Science
27
(1,2), 1983, pp. 39-60
Two-dimensional alternating Turing machines
K. Inoue
,
I. Takanami
,
H. Taniguchi
Theoretical Computer Science
27
(1,2), 1983, pp. 61-83
Subset languages of Petri nets Part II: Closure properties
G. Rozenberg
,
R. Verraedt
Theoretical Computer Science
27
(1,2), 1983, pp. 85-108
The largest cartesian closed category of domains
M.B. Smyth
Theoretical Computer Science
27
(1,2), 1983, pp. 109-119
One-way simple multihead finite automata are not closed under concatenation
P. Dúris̑
,
J. Hromkovic̑
Theoretical Computer Science
27
(1,2), 1983, pp. 121-125
The propositional dynamic logic of deterministic, well-structured programs
J.Y. Halpern
,
J.H. Reif
Theoretical Computer Science
27
(1,2), 1983, pp. 127-165
Algebraic domain equations
H.-D. Ehrich
,
U. Lipeck
Theoretical Computer Science
27
(1,2), 1983, pp. 167-196
The comparison of the expressive power of first-order dynamic logics
A.P. Stolboushkin
,
M.A. Taitslin
Theoretical Computer Science
27
(1,2), 1983, pp. 197-209
The rank of a formal tree power series
S. Bozapalidis
,
O. Louscou-Bozapalidou
Theoretical Computer Science
27
(1,2), 1983, pp. 211-215
Open maps for tessellation automata
A. Maruoka
Theoretical Computer Science
27
(1,2), 1983, pp. 217-224
Separately continuous algebras
J. Adámek
,
E. Nelson
Theoretical Computer Science
27
(1,2), 1983, pp. 225-231
Fast detection of polyhedral intersection
D.P. Dobkin
,
D.G. Kirkpatrick
Theoretical Computer Science
27
(3), 1983, pp. 241-253
Compatibility of parameter passing and implementation of parameterized data types
H. Ehrig
,
H.-J. Kreowsky
Theoretical Computer Science
27
(3), 1983, pp. 255-286
More on the power of chain rules in context-free grammars
N. Blum
Theoretical Computer Science
27
(3), 1983, pp. 287-295
Semantics of interference control
R.D. Tennent
Theoretical Computer Science
27
(3), 1983, pp. 297-310
On regularity of context-free languages
A. Ehrenfeucht
,
D. Haussler
,
G. Rozenberg
Theoretical Computer Science
27
(3), 1983, pp. 311-332
Results on the propositional
\mu
-calculus
D. Kozen
Theoretical Computer Science
27
(3), 1983, pp. 333-354
The inclusion problem for some classes of deterministic multitape automata
E.B. Kinber
Theoretical Computer Science
26
(1,2), 1983, pp. 1-24
Bandwidth constraints on problems complete for polynomial time
I.H. Sudborough
Theoretical Computer Science
26
(1,2), 1983, pp. 25-52
On infinite computations in denotational semantics
J.W. de Bakker
,
J.-J.Ch. Meyer
,
J.I. Zucker
Theoretical Computer Science
26
(1,2), 1983, pp. 53-82
Nivat's processing systems: Decision problems related to protection and synchronization
S. Istrail
,
C. Masalagiu
Theoretical Computer Science
26
(1,2), 1983, pp. 83-102
A more complete model of communicating processes
E.C.R. Hehner
,
C.A.R. Hoare
Theoretical Computer Science
26
(1,2), 1983, pp. 105-120
Alternative semantics for temporal logics
E.A. Emerson
Theoretical Computer Science
26
(1,2), 1983, pp. 121-130
Admissible representations of effective cpo's
K. Weihrauch
,
G. Scháfer
Theoretical Computer Science
26
(1,2), 1983, pp. 131-147
Seiten 1
2
3
4
5
>