Electronic Notes in Theoretical Computer Science, Volume 31

Volume 31, 2000

• David A. Wolfram:
  Preface.
  Electronic Edition (link) BibTeX
• Asat Arslanov:
  On the phenomenon of autocomputability.
  Electronic Edition (link) BibTeX
• Rod M. Burstall:
  ProveEasy: helping people learn to do proofs.
  Electronic Edition (link) BibTeX
• Bruce Davies, Graham Wrightson:
  An approach to strategies in concurrent systems.
  Electronic Edition (link) BibTeX
• Mariangiola Dezani-Ciancaglini, Paula Severi, Fer-Jan de Vries:
  Böhm's theorem for Berarducci trees.
  Electronic Edition (link) BibTeX
• Lance Fortnow:
  One complexity theorist's view of quantum computing.
  Electronic Edition (link) BibTeX
• Ken-etsu Fujita:
  Multiple-conclusion system as communication calculus.
  Electronic Edition (link) BibTeX
• Mohamed Hamada:
  Strong completeness of a narrowing calculus for conditional rewrite systems with extra variables.
  Electronic Edition (link) BibTeX
• Bakhadyr Khoussainov:
  Algebraic constraints, automata, and regular languages.
  Electronic Edition (link) BibTeX
• Padmanabhan Krishnan:
  Automatic synthesis of schedulers in timed systems.
  Electronic Edition (link) BibTeX
• Nadia Nedjah, Luiza de Macedo Mourelle:
  Dynamic deterministic pattern-matching.
  Electronic Edition (link) BibTeX
• Izumi Takeuti:
  Pruning Terms for Principal Type Assignment.
  Electronic Edition (link) BibTeX
• Bernd Gärtner, Emo Welzl:
  On a simple sampling lemma.
  Electronic Edition (link) BibTeX
• Yih-Kai Lin, Hsu-Chun Yen:
  An omega-automata approach to the compression of bi-level images.
  Electronic Edition (link) BibTeX