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=Inf.~Comput. AND Volume=172
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Privacy via subsumption
Jon G. Riecke
,
Christopher A. Stone
Information and Computation
172
(1), 2002, pp. 2-28
Type destructors
Martin Hofmann
,
Benjamin C. Pierce
Information and Computation
172
(1), 2002, pp. 29-62
Objects and classes in Algol-like languages
Uday S. Reddy
Information and Computation
172
(1), 2002, pp. 63-97
Erratum to ''Verification by augmented finitary abstraction''
Yonit Kesten
,
Amir Pnueli
Information and Computation
172
(1), 2002, pp. 98-100
The nonapproximability of OBDD minimization
Detlef Sieling
Information and Computation
172
(2), 2002, pp. 103-138
Trace and testing equivalence on asynchronous processes
Michele Boreale
,
Rocco de Nicola
,
Rosario Pugliese
Information and Computation
172
(2), 2002, pp. 139-164
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators
Domenico Cantone
,
Pietro Ursino
,
Eugenio G. Omodeo
Information and Computation
172
(2), 2002, pp. 165-201
Communication complexity method for measuring nondeterminism in finite automata
Juraj Hromkovic̑
,
Sebastian Seibert
,
Juhani Karhumáki
,
Hartmut Klauck
,
Georg Schnitger
Information and Computation
172
(2), 2002, pp. 202-217