| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A lower bound for randomized on-line scheduling algorithms
|
Chen, Bo
|
|
1994
|
51 |
5 |
p. 219-222
4 p.
|
artikel
|
| 2 |
Faster implementation of a shortest superstring approximation
|
Gusfield, Dan
|
|
1994
|
51 |
5 |
p. 271-274
4 p.
|
artikel
|
| 3 |
Halfspace learning, linear programming, and nonmalicious distributions
|
Long, Philip M.
|
|
1994
|
51 |
5 |
p. 245-250
6 p.
|
artikel
|
| 4 |
Many-face complexity in incremental convex arrangements
|
Dey, Tamal K.
|
|
1994
|
51 |
5 |
p. 227-231
5 p.
|
artikel
|
| 5 |
On transmitting delay in a distance-transitive strongly antipodal graph
|
Jwo, Jung-Sing
|
|
1994
|
51 |
5 |
p. 233-235
3 p.
|
artikel
|
| 6 |
Parallel algorithm for finding a core of a tree network
|
Albacea, Eliezer A.
|
|
1994
|
51 |
5 |
p. 223-226
4 p.
|
artikel
|
| 7 |
Realization of an arbitrary permutation on a hypercube
|
Shen, Xiaojun
|
|
1994
|
51 |
5 |
p. 237-243
7 p.
|
artikel
|
| 8 |
Serializability by commitment ordering
|
Raz, Yoav
|
|
1994
|
51 |
5 |
p. 257-264
8 p.
|
artikel
|
| 9 |
Time–space tradeoffs for integer multiplication on various types of input oblivious sequential machines
|
Gergov, Jordan
|
|
1994
|
51 |
5 |
p. 265-269
5 p.
|
artikel
|
| 10 |
Using Hirschberg's algorithm to generate random alignments of strings
|
Allison, Lloyd
|
|
1994
|
51 |
5 |
p. 251-255
5 p.
|
artikel
|
Tijdschrift beschrijving