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=75
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Interpreting one concurrent calculus in another
Robin Milner
Theoretical Computer Science
75
, 1990, pp. 3-13
Comparative metric semantics for concurrent prolog
J.W. de Bakker
,
J.N. Kok
Theoretical Computer Science
75
, 1990, pp. 15-43
Finite failures and partial computations in concurrent logic languages
Moreno Falaschi
,
Giorgio Levi
Theoretical Computer Science
75
, 1990, pp. 45-66
A declarative semantics of flat guarded Horn clauses for programs with perpetual processes
Masaki Murakami
Theoretical Computer Science
75
, 1990, pp. 67-83
Conditional equational theories and complete sets of transformations
Steffen Hölldobler
Theoretical Computer Science
75
, 1990, pp. 85-110
A rationale for conditional equational programming
Nachum Dershowitz
Theoretical Computer Science
75
, 1990, pp. 111-138
Preservation of stronger equivalence in unfold/fold logic program transformation
Tadashi Kawamura
,
Tadashi Kanamori
Theoretical Computer Science
75
, 1990, pp. 139-156
Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming
Philippe Devienne
Theoretical Computer Science
75
, 1990, pp. 157-215
A partial ordering semantics for CCS
P. Degano
,
R. de Nicola
,
U. Montanari
Theoretical Computer Science
75
, 1990, pp. 223-262
Interleaving set temporal logic
Shmuel Katz
,
Doron Peled
Theoretical Computer Science
75
, 1990, pp. 263-287
Non-deterministic information systems and their domains
Manfred Droste
,
Rüdiger Göbel
Theoretical Computer Science
75
, 1990, pp. 289-309
The Sprague-Grundy function for Wythoff's game
Uri Blass
,
Aviezri S. Fraenkel
Theoretical Computer Science
75
, 1990, pp. 311-333
Downward translations of equality
Eric Allender
,
Christopher Wilson
Theoretical Computer Science
75
, 1990, pp. 335-346
Minimizing mean flow time with release time constraint
Jianzhong Du
,
Joseph Y.-T. Leung
,
Gilbert H. Young
Theoretical Computer Science
75
, 1990, pp. 347-355
The binary network flow problem is logspace complete for
\P
Thomas Lengauer
,
Klaus W. Wagner
Theoretical Computer Science
75
, 1990, pp. 357-363