nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algebraic Constraints, Automata, and Regular Languages
|
Khoussainov, Bakhadyr |
|
2000 |
31 |
C |
p. 104-117 14 p. |
artikel |
2 |
An approach to strategies in concurrent systems
|
Davies, Bruce |
|
2000 |
31 |
C |
p. 33- 1 p. |
artikel |
3 |
An ω-Automata Approach to the Compression of Bi-Level Images
|
LIN, YIH-KAI |
|
2000 |
31 |
C |
p. 170-184 15 p. |
artikel |
4 |
Automatic Synthesis of Schedulers in Timed Systems 1 1 Extended Abstract: Only Proof Outlines are Presented
|
Krishnan, Padmanabhan |
|
2000 |
31 |
C |
p. 118-131 14 p. |
artikel |
5 |
Böhm's Theorem for Berarducci Trees 1 1 This paper was made possible thanks to the hospitality ETL offered in the March 1999 to both Mariangiola Dezani and Paula Severi.
|
Dezani-Ciancaglini, Mariangiola |
|
2000 |
31 |
C |
p. 34-57 24 p. |
artikel |
6 |
Dynamic Deterministic Pattern-Matching
|
Nedjah, Nadia |
|
2000 |
31 |
C |
p. 132-143 12 p. |
artikel |
7 |
Electronic Notes in Theoretical Computer Science
|
Wolfram, David |
|
2000 |
31 |
C |
p. 1- 1 p. |
artikel |
8 |
Multiple-Conclusion System as Communication Calculus
|
Fujita, Ken-etsu |
|
2000 |
31 |
C |
p. 73-88 16 p. |
artikel |
9 |
On a Simple Sampling Lemma
|
Gärtner, Bernd |
|
2000 |
31 |
C |
p. 160-169 10 p. |
artikel |
10 |
One Complexity Theorist's View of Quantum Computing
|
Fortnow, Lance |
|
2000 |
31 |
C |
p. 58-72 15 p. |
artikel |
11 |
On the Phenomenon of Autocomputability 1 1 This paper is part of my doctoral thesis at the University of Auckland, March, 1998
|
Arslanov, Asat |
|
2000 |
31 |
C |
p. 2-15 14 p. |
artikel |
12 |
ProveEasy: Helping people learn to do proofs
|
Burstall, Rod |
|
2000 |
31 |
C |
p. 16-32 17 p. |
artikel |
13 |
Pruning Terms for Principal Type Assignment
|
Izumi, Takeuti |
|
2000 |
31 |
C |
p. 144-159 16 p. |
artikel |
14 |
Strong Completeness of a Narrowing Calculus for Conditional Rewrite Systems with Extra Variables
|
Hamada, Mohamed |
|
2000 |
31 |
C |
p. 89-103 15 p. |
artikel |