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=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Average case optimality for linear problems
J.F. Traub
,
G.W. Wasilkowski
,
H. Woźniakowski
Theoretical Computer Science
29
(1,2), 1984, pp. 1-25
Representation of nondeterministic information
E. Orƚowska
,
Z. Pawlak
Theoretical Computer Science
29
(1,2), 1984, pp. 27-39
On simulation and propagating EOL forms
G. Rozenberg
,
R. Verraedt
Theoretical Computer Science
29
(1,2), 1984, pp. 41-48
Wythoff games, continued fractions, cedar trees and Fibonacci searches
A.S. Fraenkel
Theoretical Computer Science
29
(1,2), 1984, pp. 49-73
Recursively rotated orders and implicit data structures: A lower bound
G.N. Frederickson
Theoretical Computer Science
29
(1,2), 1984, pp. 75-85
Nets, sequential components and concurrency relations
R. Janicki
Theoretical Computer Science
29
(1,2), 1984, pp. 87-121
Characterizations and computational complexity of systolic trellis automata
O.H. Ibarra
,
S.M. Kim
Theoretical Computer Science
29
(1,2), 1984, pp. 123-153
Effectively given spaces
T. Kamimura
,
A. Tang
Theoretical Computer Science
29
(1,2), 1984, pp. 155-166
Closure and fairness in the semantics of programming logic
J.-L. Lassez
,
M.J. Maher
Theoretical Computer Science
29
(1,2), 1984, pp. 167-184
Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
E. Fachini
,
M. Napoli
Theoretical Computer Science
29
(1,2), 1984, pp. 185-227
A weakest precondition semantics for communicating processes
T. Elrad
,
N. Francez
Theoretical Computer Science
29
(3), 1984, pp. 231-250
Reduction graphs in the lambda calculus
M. Venturini Zilli
Theoretical Computer Science
29
(3), 1984, pp. 251-275
Remarks on an example of Jantzen
D.H. Potts
Theoretical Computer Science
29
(3), 1984, pp. 277-284
The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
J. Karhumäki
Theoretical Computer Science
29
(3), 1984, pp. 285-308
Completeness of type assignment in continuous lambda models
M. Coppo
Theoretical Computer Science
29
(3), 1984, pp. 309-324
On the ratio of growth functions in EDTOL languages
G.S. Eisman
Theoretical Computer Science
29
(3), 1984, pp. 325-349