nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
|
Yen, Hsu-Chun |
|
1991 |
38 |
2 |
p. 71-76 6 p. |
artikel |
2 |
Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms
|
Messeguer, Xavier |
|
1991 |
38 |
2 |
p. 89-100 12 p. |
artikel |
3 |
Efficient parallel algorithms to test square-freeness and factorize strings
|
Crochemore, Maxime |
|
1991 |
38 |
2 |
p. 57-60 4 p. |
artikel |
4 |
Lower bounds for arithmetic problems
|
Meidânis, João |
|
1991 |
38 |
2 |
p. 83-87 5 p. |
artikel |
5 |
Phase synchronization
|
Misra, Jayadev |
|
1991 |
38 |
2 |
p. 101-105 5 p. |
artikel |
6 |
Radix sort on the hypercube
|
Manzini, Giovanni |
|
1991 |
38 |
2 |
p. 77-81 5 p. |
artikel |
7 |
The parallel complexity of two problems on concurrency
|
Àlvarez, C. |
|
1991 |
38 |
2 |
p. 61-70 10 p. |
artikel |
8 |
The towers of Antwerpen problem
|
Minsker, Steven |
|
1991 |
38 |
2 |
p. 107-111 5 p. |
artikel |