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=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On heads versus tapes
W. Paul
Theoretical Computer Science
28
(1,2), 1984, pp. 1-12
Towards a programming language based on the notion of two-level grammar
J. Maluszyński
Theoretical Computer Science
28
(1,2), 1984, pp. 13-43
Parameter passing in algebraic specification languages
H. Ehrig
,
H.-J. Kreowski
,
J. Thatcher
,
E. Wagner
,
J. Wright
Theoretical Computer Science
28
(1,2), 1984, pp. 45-81
Ten years of Hoare's logic: A survey -- Part II: Nondeterminism
K.R. Apt
Theoretical Computer Science
28
(1,2), 1984, pp. 83-109
On the power of probabilistic strategies in inductive inference
R. Wiehagen
,
R. Freivalds
,
E.B. Kinber
Theoretical Computer Science
28
(1,2), 1984, pp. 111-133
On commutativity and approximation
D. Bini
Theoretical Computer Science
28
(1,2), 1984, pp. 135-150
Principal type schemes for an extended type theory
S. Ronchi Della Rocca
,
B. Venneri
Theoretical Computer Science
28
(1,2), 1984, pp. 151-169
D-continuous causal nets: A model of non-sequential processes
C. Fernández
,
P.S. Thiagarajan
Theoretical Computer Science
28
(1,2), 1984, pp. 171-196
On inherently ambiguous EOL languages
A. Ehrenfeucht
,
G. Rozenberg
,
R. Verraedt
Theoretical Computer Science
28
(1,2), 1984, pp. 197-214
Hoare's logic for programming languages with two data types
J.A. Bergstra
,
J.V. Tucker
Theoretical Computer Science
28
(1,2), 1984, pp. 215-221
The decomposition of stochastic systems
T. Kanaoka
,
S. Tomita
Theoretical Computer Science
28
(1,2), 1984, pp. 223-233
Coppo-Dezani types do not correspond to propositional logic
J.R. Hindley
Theoretical Computer Science
28
(1,2), 1984, pp. 235-236
A complete, nonredundant algorithm for reversed Skolemization
P.T. Cox
,
T. Pietrzykowski
Theoretical Computer Science
28
(3), 1984, pp. 239-261
Upper bounds for sorting integers on random access machines
D. Kirkpatrick
,
S. Reisch
Theoretical Computer Science
28
(3), 1984, pp. 263-276
Context-free complexity of finite languages
W. Bucher
,
H.A. Maurer
,
K. Culik II
Theoretical Computer Science
28
(3), 1984, pp. 277-285
Iterative factor algebras and induced metrics
F. Parisi-Presicce
Theoretical Computer Science
28
(3), 1984, pp. 287-298
Complexity of normal form grammars
A. Kelemenová
Theoretical Computer Science
28
(3), 1984, pp. 299-314
Characterization of
\omega
-regular languages by first-order formulas
K. Kobayashi
,
M. Takahashi
,
H. Yamasaki
Theoretical Computer Science
28
(3), 1984, pp. 315-327
Completing biprefix codes
D. Perrin
Theoretical Computer Science
28
(3), 1984, pp. 329-336
A Boolean function requiring
3 n
network size
N. Blum
Theoretical Computer Science
28
(3), 1984, pp. 337-345