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=164
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Higher-order substitutions
Dominic Duggan
Information and Computation
164
(1), 2001, pp. 1-53
Robust threshold DSS signatures
Rosario Gennaro
,
Stanisƚaw Jarecki
,
Hugo Krawczyk
,
Tal Rabin
Information and Computation
164
(1), 2001, pp. 54-84
Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
Marc Gyssens
,
Dan Suciu
,
Dirk van Gucht
Information and Computation
164
(1), 2001, pp. 85-117
Perpetuality and uniform normalization in orthogonal rewrite systems
Zurab Khasidashvili
,
Mizuhito Ogawa
,
Vincent van Oostrom
Information and Computation
164
(1), 2001, pp. 118-151
On equations for union-free regular languages
Sinis̑a Crvenković
,
Igor Dolinka
,
Zoltán Ésik
Information and Computation
164
(1), 2001, pp. 152-172
Decidability of linear afine logic
A.P. Kopylov
Information and Computation
164
(1), 2001, pp. 173-198
On the formalization of the modal
mu
-calculus in the calculus of inductive constructions
Marino Miculan
Information and Computation
164
(1), 2001, pp. 199-231
Pushdown processes: Games and model-checking
Igor Walukiewicz
Information and Computation
164
(2), 2001, pp. 234-263
A partition refinement algorithm for the
pi
-calculus
Marco Pistore
,
Davide Sangiorgi
Information and Computation
164
(2), 2001, pp. 264-321
Module checking
Orna Kupferman
,
Moshe Y. Vardi
,
Pierre Wolper
Information and Computation
164
(2), 2001, pp. 322-344
A sequent calculus for subtyping polymorphic types
Jerzy Tiuryn
Information and Computation
164
(2), 2001, pp. 345-369