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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The behavior-realization adjunction and generalized homomorphic relations
Gray T. Leavens
,
Don Pigozzi
Theoretical Computer Science
177
(1), 1997, pp. 183-216
Completeness of Park induction
Z. Ésik
Theoretical Computer Science
177
(1), 1997, pp. 217-283
The algebra of communicating processes with empty process
J.L.M. Vrancken
Theoretical Computer Science
177
(2), 1997, pp. 287-328
Notes on the methodology of CCS and CSP
R.J. van Glabbeek
Theoretical Computer Science
177
(2), 1997, pp. 329-349
A general conservative extension theorem in process algebras with inequalities
Pedro R. D'Argenio
,
Chris Verhoef
Theoretical Computer Science
177
(2), 1997, pp. 351-380
Process algebra with propositional signals
J.C.M. Baeten
,
J.A. Bergstra
Theoretical Computer Science
177
(2), 1997, pp. 381-405
Termination modulo equations by abstract commutation with an application to iteration
Wan Fokkink
,
Hans Zantema
Theoretical Computer Science
177
(2), 1997, pp. 407-423
Process algebra with language matching
Jos van Wamel
Theoretical Computer Science
177
(2), 1997, pp. 425-458
Formal verification of a leader election protocol in process algebra
Lars-åke Fredlund
,
Jan Friso Groote
,
Henri Korver
Theoretical Computer Science
177
(2), 1997, pp. 459-486
Two finite specifications of a queue
Marc Bezem
,
Alban Ponse
Theoretical Computer Science
177
(2), 1997, pp. 487-507
Composition and behaviors of probabilistic I/O automata
Sue-Hwey Wu
,
Scott A. Smolka
,
Eugene W. Stark
Theoretical Computer Science
176
(1-2), 1997, pp. 1-38
A symbolic reachability graph for coloured Petri nets
G. Chiola
,
C. Dutheillet
,
G. Franceschinis
,
S. Haddad
Theoretical Computer Science
176
(1-2), 1997, pp. 39-65
The first-order theory of lexicographic path orderings is undecidable
Hubert Comon
,
Ralf Treinen
Theoretical Computer Science
176
(1-2), 1997, pp. 67-87
Limiting semantics of numerical programs
D.N. Hoover
Theoretical Computer Science
176
(1-2), 1997, pp. 89-110
Unification of infinite sets of terms schematized by primal grammars
Miki Hermann
,
Roman Galbavý
Theoretical Computer Science
176
(1-2), 1997, pp. 111-158
Experiments in linear natural deduction
Simone Martini
,
Andrea Masini
Theoretical Computer Science
176
(1-2), 1997, pp. 159-173
Monadic logic programs and funtional complexity
Armando B. Matos
Theoretical Computer Science
176
(1-2), 1997, pp. 175-204
Semantics for finite delay
Chrysafis Hartonas
Theoretical Computer Science
176
(1-2), 1997, pp. 205-234
Higher-order subtyping
Benjamin Pierce
,
Martin Steffen
Theoretical Computer Science
176
(1-2), 1997, pp. 235-282
Bounded fixpoints for complex objects
Dan Suciu
Theoretical Computer Science
176
(1-2), 1997, pp. 283-328
Representing inductively defined sets by wellorderings in Martin-Löf's type theory
Peter Dybjer
Theoretical Computer Science
176
(1-2), 1997, pp. 329-335
Unifying overloading and
\lambda
-abstraction:
\lambda^{\{\}}
Giuseppe Castagna
Theoretical Computer Science
176
(1-2), 1997, pp. 337-345
Minimality of the system of seven equations for the category of finite sets
A. Massol
Theoretical Computer Science
176
(1-2), 1997, pp. 347-353
The bounded-complete hull of an
\alpha
-space
Yu.L. Ershov
Theoretical Computer Science
175
(1), 1997, pp. 3-13
Program schemata vs. automata for decidability of program logics
N.V. Shilov
Theoretical Computer Science
175
(1), 1997, pp. 15-27
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>