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=149
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Set constraints and automata
RĂ©mi Gilleron
,
Sophie Tison
,
Marc Tommasi
Information and Computation
149
(1), 1999, pp. 1-41
Order-sorted inductive types
Gilles Barthe
Information and Computation
149
(1), 1999, pp. 42-76
Basic observables for processes
Michele Boreale
,
Rocco de Nicola
,
Rosario Pugliese
Information and Computation
149
(1), 1999, pp. 77-98
Sentences over integral domains and their computational complexities
Shih Ping Tung
Information and Computation
149
(2), 1999, pp. 99-133
Context-free event domains are recognizable
Eric Badouel
,
Philippe Darondeau
,
Jean-Claude Raoult
Information and Computation
149
(2), 1999, pp. 134-172
Perpetual reductions in
\lambda
-calculus
Femke van Raamsdonk
,
Paula Severi
,
Morten Heine B. Srensen
,
Hongwei Xi
Information and Computation
149
(2), 1999, pp. 173-225