Information and Computation, Volume 190

Volume 190, Number 1, 10 April 2004

• Johannes Köbler, Rainer Schuler:
  Average-case intractability vs. worst-case intractability. 1-17
  Electronic Edition (link) BibTeX
• H. C. M. Kleijn, Maciej Koutny:
  Process semantics of general inhibitor nets. 18-69
  Electronic Edition (link) BibTeX
• Juha Honkala:
  Bounds for the D0L language equivalence problem. 70-80
  Electronic Edition (link) BibTeX
• Sanjay Jain, Wolfram Menzel, Frank Stephan:
  Classes with easily learnable subclasses. 81-99
  Electronic Edition (link) BibTeX
• Amihood Amir, Kenneth Ward Church, Emanuel Dar:
  The submatrices character count problem: an efficient solution using separable values. 100-116
  Electronic Edition (link) BibTeX

Volume 190, Number 2, 1 May 2004

• Hagit Attiya, Hadas Shachnai:
  Tight bounds for FEC-based reliable multicast. 117-135
  Electronic Edition (link) BibTeX
• Gian Luca Cattani, Peter Sewell:
  Models for name-passing processes: interleaving and causal. 136-178
  Electronic Edition (link) BibTeX
• Daowen Qiu:
  Automata theory based on quantum logic: some characterizations. 179-195
  Electronic Edition (link) BibTeX
• Sergei G. Vorobyov:
  The most nonelementary theory. 196-219
  Electronic Edition (link) BibTeX
• Nadia Creignou, Hervé Daudé:
  Combinatorial sharpness criterion and phase transition classification for random CSPs. 220-238
  Electronic Edition (link) BibTeX