Electronic Notes in Theoretical Computer Science, Volume 31

Volume 31, 2000

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