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=174
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning to win process-control games watching game-masters
John Case
,
Matthias Ott
,
Arun Sharma
,
Frank Stephan
Information and Computation
174
(1), 2002, pp. 1-19
Abstract state machines and computationally complete query languages
Andreas Blass
,
Yuri Gurevich
,
Jan van den Bussche
Information and Computation
174
(1), 2002, pp. 20-36
Secure implementation of channel abstractions
Martín Abadi
,
Cédric Fournet
,
Georges Gonthier
Information and Computation
174
(1), 2002, pp. 37-83
The complexity of propositional linear temporal logics in simple cases
Stéphane Demri
,
Philippe Schnoebelen
Information and Computation
174
(1), 2002, pp. 84-103
Tarskian set constraints
Robert Givan
,
David McAllester
,
Carl Witty
,
Dexter Kozen
Information and Computation
174
(2), 2002, pp. 105-131
Nonerasing, counting, and majority over the linear time hierarchy
Arnaud Durand
,
Malika More
Information and Computation
174
(2), 2002, pp. 132-142
Assigning types to processes
Nobuko Yoshida
,
Matthew Hennessy
Information and Computation
174
(2), 2002, pp. 143-179
Compact recognizers of episode sequences
Alberto Apostolico
,
Mikhail J. Atallah
Information and Computation
174
(2), 2002, pp. 180-192
A general decomposition theorem for the
k
-server problem
Steven S. Seiden
Information and Computation
174
(2), 2002, pp. 193-202
Scalable secure storage when half the system is faulty
Noga Alon
,
Haim Kaplan
,
Michael Krivelevich
,
Dahlia Malkhi
,
Julien Stern
Information and Computation
174
(2), 2002, pp. 203-213