Information and Computation, Volume 180

Volume 180, Number 1, 10 January 2003

• Huimin Lin:
  Complete inference systems for weak bisimulation equivalences in the pi-calculus. 1-29
  Electronic Edition (link) BibTeX
• Luis-Miguel Lopez, Philippe Narbel:
  Languages, D0L-systems, sets of curves, and surface automorphisms. 30-52
  Electronic Edition (link) BibTeX
• Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
  Variations on extending partially defined Boolean functions with missing bits. 53-70
  Electronic Edition (link) BibTeX

Volume 180, Number 2, 29 January 2003

• Klaus Jansen:
  The mutual exclusion scheduling problem for permutation and comparability graphs. 71-81
  Electronic Edition (link) BibTeX
• Sally A. Goldman, Stephen Kwek, Stephen D. Scott:
  Learning from examples with unspecified attribute values. 82-100
  Electronic Edition (link) BibTeX
• Sergio De Agostino, Riccardo Silvestri:
  Bounded size dictionary compression: SC^k-completeness and NC algorithms. 101-112
  Electronic Edition (link) BibTeX
• Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
  Multicoloring trees. 113-129
  Electronic Edition (link) BibTeX