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=179
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The equational logic of fixed points
Stephen L. Bloom
,
Zoltán Ésik
Theoretical Computer Science
179
(1-2), 1997, pp. 1-60
Restrictions and representations of vector controlled concurrent system behaviours
N.W. Keesmaat
,
H.C.M. Kleijn
Theoretical Computer Science
179
(1-2), 1997, pp. 61-102
A calculational approach to mathematical induction
Henk Doornbos
,
Roland Backhouse
,
Jaap van der Woude
Theoretical Computer Science
179
(1-2), 1997, pp. 103-135
A
\kappa
-denotational semantics for map theory in ZFC+SI
Chantal Berline
,
Klaus Grue
Theoretical Computer Science
179
(1-2), 1997, pp. 137-202
Parallel product of event structures
Ilaria Castellani
,
Guo-Qiang Zhang
Theoretical Computer Science
179
(1-2), 1997, pp. 203-215
Trees and semantics
Christel Baier
Theoretical Computer Science
179
(1-2), 1997, pp. 217-250
Succinctness of descriptions of SBTA-languages
Jozef Gruska
,
Angelo Monti
,
Margherita Napoli
,
Domenico Parente
Theoretical Computer Science
179
(1-2), 1997, pp. 251-271
Order-sorted model theory for temporal executable specifications
Suad Alagić
,
Mara Alagić
Theoretical Computer Science
179
(1-2), 1997, pp. 273-299
On reachability equivalence for BPP-nets
Hsu-Chun Yen
Theoretical Computer Science
179
(1-2), 1997, pp. 301-317
Representability of locally compact regular spaces by domains and formal spaces
Inger Sigstam
,
Viggo Stoltenberg-Hansen
Theoretical Computer Science
179
(1-2), 1997, pp. 319-331
Processes are in the eye of the beholder
Leslie Lamport
Theoretical Computer Science
179
(1-2), 1997, pp. 333-351
Equivalence is in the eye of the beholder
Yuri Gurevich
,
James K. Huggins
Theoretical Computer Science
179
(1-2), 1997, pp. 353-380
On the parallel complexity of loops
Oscar H. Ibarra
,
Nicholas Q. Tran
,
Tao Yang
Theoretical Computer Science
179
(1-2), 1997, pp. 381-395
Essential transitions to bisimulation equivalences
Jaana Eloranta
,
Martti Tienari
,
Antti Valmari
Theoretical Computer Science
179
(1-2), 1997, pp. 397-419
Note on free algebras over continuous domains
Jürgen Koslowski
Theoretical Computer Science
179
(1-2), 1997, pp. 421-425
A logic for rough sets
Ivo Düntsch
Theoretical Computer Science
179
(1-2), 1997, pp. 427-436