default search action
6th CATS 2000: Caberra, ACT, Australia
- David A. Wolfram:
Computing: the Australasian Theory Symposium, CATS 2000, Canberra, Australia, January 1-2, 2000. Electronic Notes in Theoretical Computer Science 31, Elsevier 2000 - David A. Wolfram:
Preface. 1 - Asat Arslanov:
On the phenomenon of autocomputability. 2-15 - Rod M. Burstall:
ProveEasy: helping people learn to do proofs. 16-32 - Bruce Davies, Graham Wrightson:
An approach to strategies in concurrent systems. 33 - Mariangiola Dezani-Ciancaglini, Paula Severi, Fer-Jan de Vries:
Böhm's theorem for Berarducci trees. 34-57 - Lance Fortnow:
One complexity theorist's view of quantum computing. 58-72 - Ken-etsu Fujita:
Multiple-conclusion system as communication calculus. 73-88 - Mohamed Hamada:
Strong completeness of a narrowing calculus for conditional rewrite systems with extra variables. 89-103 - Bakhadyr Khoussainov:
Algebraic constraints, automata, and regular languages. 104-117 - Padmanabhan Krishnan:
Automatic synthesis of schedulers in timed systems. 118-131 - Nadia Nedjah, Luiza de Macedo Mourelle:
Dynamic deterministic pattern-matching. 132-143 - Izumi Takeuti:
Pruning Terms for Principal Type Assignment. 144-159 - Bernd Gärtner, Emo Welzl:
On a simple sampling lemma. 160-169 - Yih-Kai Lin, Hsu-Chun Yen:
An omega-automata approach to the compression of bi-level images. 170-184
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.