Information and Computation, Volume 165

Volume 165, Number 1, February 2001

• Giovanni Pighizzini: How Hard Is Computing the Edit Distance? 1-13 BibTeX
• François Fages, Paul Ruet, Sylvain Soliman: Linear Concurrent Constraint Programming: Operational and Phase Semantics. 14-41 BibTeX
• Vincenzo Auletta, Pino Persiano: Optimal Pebble Motion on a Tree. 42-68 BibTeX
• Werner Kuich: Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series. 69-99 BibTeX
• Rosario Gennaro, Pankaj Rohatgi: How to Sign Digital Streams. 100-116 BibTeX

Volume 165, Number 2, 15 March 2001

• Samson Abramsky, Luca Aceto, Anna Ingólfsdóttir:
  Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218. 119-122
  Electronic Edition (link) BibTeX
• Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
  Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree. 123-143
  Electronic Edition (link) BibTeX
• Roberto Baldoni, Jean-Michel Hélary, Michel Raynal:
  Rollback-Dependency Trackability: A Minimal Characterization and Its Protocol. 144-173
  Electronic Edition (link) BibTeX
• Alberto Bertoni, Marco Carpentieri:
  Regular Languages Accepted by Quantum Automata. 174-182
  Electronic Edition (link) BibTeX
• Georg Gottlob, Reinhard Pichler:
  Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models. 183-207
  Electronic Edition (link) BibTeX