Information and Computation, Volume 188

Volume 188, Number 1, 10 January 2004

• Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa:
  DP lower bounds for equivalence-checking and model-checking of one-counter automata. 1-19
  Electronic Edition (link) BibTeX
• Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park:
  Parallel two dimensional witness computation. 20-67
  Electronic Edition (link) BibTeX
• Franck van Breugel:
  De Bakker-Zucker processes revisited. 68-76
  Electronic Edition (link) BibTeX
• Ji-Hoon Kang, Ki-Hyung Hong, Kyu-Young Whang, Jung Wan Cho:
  Generalization of ZYT-linearizability for bilinear datalog programs. 77-98
  Electronic Edition (link) BibTeX
• Philip M. Long:
  Efficient algorithms for learning functions with bounded variation. 99-115
  Electronic Edition (link) BibTeX
• Aduri Pavan, Alan L. Selman:
  Bi-immunity separates strong NP-completeness notions. 116-126
  Electronic Edition (link) BibTeX
• Sanjay Jain, Frank Stephan, Sebastiaan Terwijn:
  Counting extensional differences in BC-learning. 127-142
  Electronic Edition (link) BibTeX

Volume 188, Number 2, 29 January 2004

• Manfred Schmidt-Schauß:
  Decidability of bounded second order unification. 143-178
  Electronic Edition (link) BibTeX
• Francesca Levi, Sergio Maffeis:
  On abstract interpretation of Mobile Ambients. 179-240
  Electronic Edition (link) BibTeX
• Carsten Führmann, Hayo Thielecke:
  On the call-by-value CPS transform and its semantics. 241-283
  Electronic Edition (link) BibTeX