Information and Computation, Volume 201

Volume 201, Number 1, 25 August 2005

• Giuseppe Castagna, Jan Vitek, Francesco Zappa Nardelli:
  The Seal Calculus. 1-54
  
• Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin:
  How many strings are easy to predict? 55-71
  
• Mark Reynolds:
  An axiomatization of PCTL*. 72-119
  

Volume 201, Number 2, 15 September 2005

• Venkatesh Choppella, Christopher T. Haynes:
  Source-tracking unification. 121-159
  
• Matthias Krause, Petr Savický, Ingo Wegener:
  On the influence of the variable ordering for algorithmic learning using OBDDs. 160-177
  
• Atsuyoshi Nakamura:
  An efficient query learning algorithm for ordered binary decision diagrams. 178-198
  
• Shigeki Akiyama, Frédérique Bassino, Christiane Frougny:
  Arithmetic Meyer sets and finite automata. 199-215
  
• Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia:
  Tight lower bounds for certain parameterized NP-hard problems. 216-231
  

Last update Tue May 21 18:57:04 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page