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=277
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Set-sharing is redundant for pair-sharing
Roberto Bagnara
,
Patricia M. Hill
,
Enea Zaffanella
Theoretical Computer Science
277
(1-2), 2002, pp. 3-46
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Patrick Cousot
Theoretical Computer Science
277
(1-2), 2002, pp. 47-103
Satisfying subtype inequalities in polynomial space
Alexandre Frey
Theoretical Computer Science
277
(1-2), 2002, pp. 105-117
On sparse evaluation representations
G. Ramalingam
Theoretical Computer Science
277
(1-2), 2002, pp. 119-147
Logical optimality of groundness analysis
Francesca Scozzari
Theoretical Computer Science
277
(1-2), 2002, pp. 149-184
A cost-effective estimation of uncaught exceptions in Standard ML programs
Kwangkeun Yi
,
Sukyoung Ryu
Theoretical Computer Science
277
(1-2), 2002, pp. 185-217