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=201
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Seal calculus
G. Castagna
,
J. Vitek
,
F. Zappa Nardelli
Information and Computation
201
(1), 2005, pp. 1-54
How many strings are easy to predict?
Yuri Kalnishkan
,
Vladimir Vovk
,
Michael V. Vyugin
Information and Computation
201
(1), 2005, pp. 55-71
An axiomatization of PCTL*
Mark Reynolds
Information and Computation
201
(1), 2005, pp. 72-119
Source-tracking unification
Venkatesh Choppella
,
Christopher T. Haynes
Information and Computation
201
(2), 2005, pp. 121-159
On the influence of the variable ordering for algorithmic learning using OBDDs
Matthias Krause
,
Petr Savický
,
Ingo Wegener
Information and Computation
201
(2), 2005, pp. 160-177
An efficient query learning algorithm for ordered binary decision diagrams
Atsuyoshi Nakamura
Information and Computation
201
(2), 2005, pp. 178-198
Arithmetic Meyer sets and finite automata
Shigeki Akiyama
,
Frédérique Bassino
,
Christiane Frougny
Information and Computation
201
(2), 2005, pp. 199-215
Tight lower bounds for certain parameterized
NP
-hard problems
Jianer Chen
,
Benny Chor
,
Mike Fellows
,
Xiuzhen Huang
,
David Juedes
,
Iyad A. Kanj
,
Ge Xia
Information and Computation
201
(2), 2005, pp. 216-231