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=198
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Equational unification, word unification, and 2nd-order equational unification
Friedrich Otto
,
Paliath Narendran
,
Daniel J. Dougherty
Theoretical Computer Science
198
(1-2), 1998, pp. 1-47
A notation for lambda terms - A generalization of environments
Gopalan Nadathur
,
Debra Sue Wilson
Theoretical Computer Science
198
(1-2), 1998, pp. 49-98
A communication hierarchy of parallel computations
Viliam Geffert
Theoretical Computer Science
198
(1-2), 1998, pp. 99-130
A fixpoint approach to finite delay and fairness
Chrysafis Hartonas
Theoretical Computer Science
198
(1-2), 1998, pp. 131-158
Some congruence properties for
\pi
-calculus bisimilarities
Michele Boreale
,
Davide Sangiorgi
Theoretical Computer Science
198
(1-2), 1998, pp. 159-176
Enlargements of functional algebras for the lambda calculus
Robert Goldblatt
Theoretical Computer Science
198
(1-2), 1998, pp. 177-200
An answer to an open problem of Urquhart
Uwe Egly
Theoretical Computer Science
198
(1-2), 1998, pp. 201-209
Reachability in live and safe free-choice Petri nets is
NP
-complete
Javier Esparza
Theoretical Computer Science
198
(1-2), 1998, pp. 211-224
On the coarsest congruence within global-clock-bounded equivalence
Flavio Corradini
Theoretical Computer Science
198
(1-2), 1998, pp. 225-237
Combinatory weak reduction in lambda calculus
Naim Çağman
,
J. Roger Hindley
Theoretical Computer Science
198
(1-2), 1998, pp. 239-247