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=198
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Competing provers yield improved Karp-Lipton collapse results
Jin-Yi Cai
,
Venkatesan T. Chakaravarthy
,
Lane A. Hemaspaandra
,
Mitsunori Ogihara
Information and Computation
198
(1), 2005, pp. 1-23
Integrated prefetching and caching in single and parallel disk systems
Susanne Albers
,
Markus Büttner
Information and Computation
198
(1), 2005, pp. 24-39
Locally guided randomized elections in trees: The totally fair case
Yves Métivier
,
Nasser Saheb-Djahromi
,
Akka Zemmari
Information and Computation
198
(1), 2005, pp. 40-55
Functions computable in polynomial space
Matthias Galota
,
Heribert Vollmer
Information and Computation
198
(1), 2005, pp. 56-70
Subtyping, recursion, and parametric polymorphism in kernel Fun
Dario Colazzo
,
Giorgio Ghelli
Information and Computation
198
(2), 2005, pp. 71-147
Timer formulas and decidable metric temporal logic
Yoram Hirshfeld
,
Alexander Rabinovich
Information and Computation
198
(2), 2005, pp. 148-178