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=124
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The comparison of a cpo-based semantics with a cms-based semantics for CSP
M.E. Majster-Cederbaum
,
F. Zetzsche
Theoretical Computer Science
124
(1), 1994, pp. 1-40
Global serializability of concurrent programs
Béatrice Bérard
Theoretical Computer Science
124
(1), 1994, pp. 41-70
A denotational semantics and dataflow construction for logic programs
Susumu Yamasaki
Theoretical Computer Science
124
(1), 1994, pp. 71-91
Bottom-up abstract interpretation of logic programs
Michael Codish
,
Dennis Dams
,
Eyal Yardeni
Theoretical Computer Science
124
(1), 1994, pp. 93-125
Type inference with partial types
Satish R. Thatte
Theoretical Computer Science
124
(1), 1994, pp. 127-148
Finite Petri nets as models for recursive causal behaviour
Ursula Goltz
,
Arend Rensink
Theoretical Computer Science
124
(1), 1994, pp. 169-179
Left termination turned into termination
Kees Doets
Theoretical Computer Science
124
(1), 1994, pp. 181-188
A co-induction principle for recursively defined domains
Andrew M. Pitts
Theoretical Computer Science
124
(2), 1994, pp. 195-219
Investigation of binary spectra by explicit polynomial transformations of graphs
Malika More
Theoretical Computer Science
124
(2), 1994, pp. 221-272
Nondeterminacy and recursion via stacks and games
Wim H. Hesselink
Theoretical Computer Science
124
(2), 1994, pp. 273-295
Norms on terms and their use in proving universal termination of a logic program
A. Bossi
,
N. Cocco
,
M. Fabris
Theoretical Computer Science
124
(2), 1994, pp. 297-328
On the construction of regular minimal broadcast digraphs
Jung-Heum Park
,
Kyung-Yong Chwa
Theoretical Computer Science
124
(2), 1994, pp. 329-342
A linear algorithm for renaming a set of clauses as a Horn set
J.-J. Hébrard
Theoretical Computer Science
124
(2), 1994, pp. 343-350