Volume 74, Number 1, February 2008
Learning Theory 2004
Volume 74, Number 2, March 2008
Web and Mobile Information Systems 2006
Volume 74, Number 3, May 2008
Computational Complexity 2003
Detlef Sieling:
Minimization of decision trees is hard to approximate. 394-403
Erratum
Volume 74, Number 4, June 2008
Carl Smith Memorial Issue
Articles
Andris Ambainis:
Probabilistic and team PFIN-type learning: General properties. 457-489
Volume 74, Number 5, August 2008
Shlomo Moran,
Sagi Snir:
Convex recolorings of strings and trees: Definitions, hardness results and algorithms. 850-869 Qiang Li,
Huimin Xie:
Finite automata for testing composition-based reconstructibility of sequences. 870-874
Volume 74, Number 6, September 2008
Xiaolong Jin,
Geyong Min:
A heuristic flow-decomposition approach for generalized processor sharing under self-similar traffic. 1055-1066 Nigel Thomas:
Comparing job allocation schemes where service demand is unknown. 1067-1081
Volume 74, Number 7, November 2008
Katsuhiko Nakamura:
Languages not recognizable in real time by one-dimensional cellular automata. 1095-1102
Volume 74, Number 8, December 2008
maintained by

, founded at
