| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A minimal property for characterizing deadlock-free programs ☆ ☆ This work is partially supported by the CICYT under grant TEL99-0582.
|
Cholvi, Vicent
|
|
2001
|
77 |
5-6 |
p. 283-290
8 p.
|
artikel
|
| 2 |
A new graph characteristic and its application to numerical computability
|
Harary, Frank
|
|
2001
|
77 |
5-6 |
p. 277-282
6 p.
|
artikel
|
| 3 |
A Sperner lemma complete for PPA
|
Grigni, Michelangelo
|
|
2001
|
77 |
5-6 |
p. 255-259
5 p.
|
artikel
|
| 4 |
Author Index — Volume 77 (2001)
|
|
|
2001
|
77 |
5-6 |
p. 293-294
2 p.
|
artikel
|
| 5 |
Efficient verification of a class of time Petri nets using linear programming
|
Li, Xuandong
|
|
2001
|
77 |
5-6 |
p. 219-224
6 p.
|
artikel
|
| 6 |
Factorization of de Bruijn digraphs by cycle-rooted trees
|
Kawai, Hiroyuki
|
|
2001
|
77 |
5-6 |
p. 269-275
7 p.
|
artikel
|
| 7 |
On generating k-ary trees in computer representation
|
Xiang, Limin
|
|
2001
|
77 |
5-6 |
p. 231-238
8 p.
|
artikel
|
| 8 |
On local modularity variants and Π-institutions
|
Veloso, Paulo A.S.
|
|
2001
|
77 |
5-6 |
p. 247-253
7 p.
|
artikel
|
| 9 |
Robot localization in a grid
|
Wongngamnit, Chinda
|
|
2001
|
77 |
5-6 |
p. 261-267
7 p.
|
artikel
|
| 10 |
Some undecidable problems for parallel communicating finite automata systems
|
Martı́n-Vide, Carlos
|
|
2001
|
77 |
5-6 |
p. 239-245
7 p.
|
artikel
|
| 11 |
Subject Index — Volume 77 (2001)
|
|
|
2001
|
77 |
5-6 |
p. 291-292
2 p.
|
artikel
|
| 12 |
The reconstruction of polyominoes from their orthogonal projections
|
Woeginger, Gerhard J.
|
|
2001
|
77 |
5-6 |
p. 225-229
5 p.
|
artikel
|
Tijdschrift beschrijving