Information and Computation, Volume 194

Volume 194, Number 1, 10 October 2004

• Doron Bustan, Orna Grumberg:
  Applicability of fair simulation. 1-18
  
• Alexander Okhotin:
  Boolean grammars. 19-48
  
• Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
  On multi-partition communication complexity. 49-75
  

Volume 194, Number 2, 10 October 2004

• Alexander A. Shvartsman:
  Editor's introduction. 77-78
  
• Gösta Grahne, Victoria Kiricenko:
  Towards an algebraic theory of information integration. 79-100
  
• Dina Q. Goldin, Scott A. Smolka, Paul C. Attie, Elaine L. Sonderegger:
  Turing machines, transition systems, and interaction. 101-128
  
• Faron Moller, Scott A. Smolka, Jirí Srba:
  On the computational complexity of bisimulation, redux. 129-143
  
• Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, Jens Palsberg:
  Stack size analysis for interrupt-driven programs. 144-174
  
• Aris Anagnostopoulos, Russell Bent, Eli Upfal, Pascal Van Hentenryck:
  A simple and deterministic competitive algorithm for online facility location. 175-202
  
• Dina Q. Goldin, Todd D. Millstein, Ayferi Kutlu:
  Bounded similarity querying for time-series data. 203-241
  

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