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=90
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Theory and practice
Donald E. Knuth
Theoretical Computer Science
90
, 1991, pp. 1-15
Analysis of program optimization possibilities and further development
I.V. Pottosin
Theoretical Computer Science
90
, 1991, pp. 17-36
Transformational approach to program concretization
V. Kasyanov
Theoretical Computer Science
90
, 1991, pp. 37-46
From partial evaluation to mixed computation
M.A. Bulyonkov
Theoretical Computer Science
90
, 1991, pp. 47-60
Essence of generalized partial computation
Yoshihiko Futamura
,
Kenroku Nogi
,
Akihiko Takano
Theoretical Computer Science
90
, 1991, pp. 61-79
An algebra of mixed computation
V.E. Itkin
Theoretical Computer Science
90
, 1991, pp. 81-93
Static semantics, types, and binding time analysis
Neil D. Jones
Theoretical Computer Science
90
, 1991, pp. 95-118
Prescribing behaviours
Wladyslaw M. Turski
Theoretical Computer Science
90
, 1991, pp. 119-125
Four domains of concurrency
J.W. de Bakker
,
J.H.A. Warmerdam
Theoretical Computer Science
90
, 1991, pp. 127-149
An algebra of concurrent non-deterministic processes
Ludmila A. Cherkasova
,
Vadim E. Kotov
Theoretical Computer Science
90
, 1991, pp. 151-170
Connectedness and synchronization
A. Mazurkiewicz
,
A. Rabinovich
,
B.A. Trakhtenbrot
Theoretical Computer Science
90
, 1991, pp. 171-184
Higher order dataflow schemas
Enn Tyugu
Theoretical Computer Science
90
, 1991, pp. 185-198
Rapid construction of algebraic axioms from samples
J.M. Barzdin
,
G.J. Barzdin
Theoretical Computer Science
90
, 1991, pp. 199-208
On conservative extensions of syntax in system development
Andrzej Blikle
,
Andrzej Tarlecki
,
Mikkel Thorup
Theoretical Computer Science
90
, 1991, pp. 209-233
A theory for the derivation of combinational C-MOS circuit designs
C.A.R. Hoare
Theoretical Computer Science
90
, 1991, pp. 235-251
A bridge between constructive logic and computer programming
N.N. Nepejvoda
Theoretical Computer Science
90
, 1991, pp. 253-270
Algebraic construction of compilers
Theodor Rus
Theoretical Computer Science
90
, 1991, pp. 271-308
Program synthesis using realizability
Makoto Tatsuta
Theoretical Computer Science
90
, 1991, pp. 309-353
Dynamics of equivalence relations in automata networks
Takashi Saito
Theoretical Computer Science
90
, 1991, pp. 355-367
How to prove equivalence of term rewriting systems without induction
Yoshihito Toyama
Theoretical Computer Science
90
, 1991, pp. 369-390
Localizable constraints for object histories
Guozhu Dong
,
Seymour Ginsburg
Theoretical Computer Science
90
, 1991, pp. 391-432
Modal logics for knowledge representation systems
Dimiter Vakarelov
Theoretical Computer Science
90
, 1991, pp. 433-456