| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An analysis of the Karp-Rabin string matching algorithm
|
Gonnet, Gaston H.
|
|
1990
|
34 |
5 |
p. 271-274
4 p.
|
artikel
|
| 2 |
A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
|
Kim, Sung Kwon
|
|
1990
|
34 |
5 |
p. 235-241
7 p.
|
artikel
|
| 3 |
A unifying framework for trie design heuristics
|
Murphy, Owen
|
|
1990
|
34 |
5 |
p. 243-249
7 p.
|
artikel
|
| 4 |
Comment on Kochol's paper “efficient monotone circuits for threshold functions”
|
Dunne, Paul E.
|
|
1990
|
34 |
5 |
p. 221-222
2 p.
|
artikel
|
| 5 |
Distributed termination detection with counters
|
Rönn, Stefan
|
|
1990
|
34 |
5 |
p. 223-227
5 p.
|
artikel
|
| 6 |
More on shellsort increment sequences
|
Weiss, Mark Allen
|
|
1990
|
34 |
5 |
p. 267-270
4 p.
|
artikel
|
| 7 |
Periodic string division generated by deterministic l systems
|
Tuza, Zsolt
|
|
1990
|
34 |
5 |
p. 229-234
6 p.
|
artikel
|
| 8 |
Random access machines with multi-dimensional memories
|
Robson, J.M.
|
|
1990
|
34 |
5 |
p. 265-266
2 p.
|
artikel
|
| 9 |
Sharing special purpose resources in a multiprocessor environment
|
Pombortsis, A.
|
|
1990
|
34 |
5 |
p. 255-260
6 p.
|
artikel
|
| 10 |
Slow optimally balanced search strategies vs. cached fast uniformly balanced search strategies
|
Pugh, William
|
|
1990
|
34 |
5 |
p. 251-254
4 p.
|
artikel
|
| 11 |
The necessary and sufficient condition for the worst-case male optimal stable matching
|
Kuo, R.T.
|
|
1990
|
34 |
5 |
p. 261-263
3 p.
|
artikel
|
| 12 |
Tight lower bounds on the length of word chains
|
Althöfer, Ingo
|
|
1990
|
34 |
5 |
p. 275-276
2 p.
|
artikel
|
Tijdschrift beschrijving