nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A general method for avoiding cycling in a network
|
Golumbic, Martin Charles |
|
1987 |
24 |
4 |
p. 251-253 3 p. |
artikel |
2 |
“Algorithms for on-the-fly garbage collection” revisited
|
Van De Snepscheut, Jan L.A. |
|
1987 |
24 |
4 |
p. 211-216 6 p. |
artikel |
3 |
A liveness property of a parallel algorithm
|
Ruby, Jonathan |
|
1987 |
24 |
4 |
p. 275-277 3 p. |
artikel |
4 |
A logarithmic Boolean time algorithm for parallel polynomial division
|
Bini, Dario |
|
1987 |
24 |
4 |
p. 233-237 5 p. |
artikel |
5 |
A note on the computation of the k-closure of a graph
|
Szwarcfiter, Jayme Luiz |
|
1987 |
24 |
4 |
p. 279-280 2 p. |
artikel |
6 |
A note on the formula size of the “mod k” functions
|
Van Leijenhorst, D.C. |
|
1987 |
24 |
4 |
p. 223-224 2 p. |
artikel |
7 |
A variant of heapsort with almost optimal number of comparisons
|
Carlsson, Svante |
|
1987 |
24 |
4 |
p. 247-250 4 p. |
artikel |
8 |
Chordal graph recognition is in NC
|
Edenbrandt, Anders |
|
1987 |
24 |
4 |
p. 239-241 3 p. |
artikel |
9 |
Computing dominators in parallel
|
Pawagi, Shaunak R. |
|
1987 |
24 |
4 |
p. 217-221 5 p. |
artikel |
10 |
Correctness of an extended operator-precedence parsing algorithm
|
Horspool, R.Nigel |
|
1987 |
24 |
4 |
p. 265-273 9 p. |
artikel |
11 |
Minimizing mean weighted execution time loss on identical and uniform processors
|
Błażewicz, J. |
|
1987 |
24 |
4 |
p. 259-263 5 p. |
artikel |
12 |
Obtaining lower bounds using artificial components
|
Ramanan, Prakash |
|
1987 |
24 |
4 |
p. 243-246 4 p. |
artikel |
13 |
Strict combinators
|
Meira, Silvio Romero de Lemos |
|
1987 |
24 |
4 |
p. 255-258 4 p. |
artikel |
14 |
Time efficient systolic architecture for matrix vector multiplication
|
Zubair, M. |
|
1987 |
24 |
4 |
p. 225-231 7 p. |
artikel |