nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An optimality proof for asynchronous recovery algorithms in distributed systems
|
Singhal, Mukesh |
|
1995 |
55 |
3 |
p. 117-121 5 p. |
artikel |
2 |
A note on improved deterministic time simulation of nondeterministic space for small space
|
Chang, Ee-Chien |
|
1995 |
55 |
3 |
p. 155-157 3 p. |
artikel |
3 |
A polynomial algorithm for testing whether a graph is 3-Steiner distance hereditary
|
Oellermann, Ortrud |
|
1995 |
55 |
3 |
p. 149-154 6 p. |
artikel |
4 |
A scheme to construct distance-three codes using latin squares, with applications to the n-cube
|
Jha, Pranava K. |
|
1995 |
55 |
3 |
p. 123-127 5 p. |
artikel |
5 |
Collisionful keyed hash functions with selectable collisions
|
Gong, Li |
|
1995 |
55 |
3 |
p. 167-170 4 p. |
artikel |
6 |
Constraint preservation through loops
|
Nikolik, Borislav |
|
1995 |
55 |
3 |
p. 143-148 6 p. |
artikel |
7 |
Constraint satisfaction — Algorithms and complexity analysis
|
Hower, Walter |
|
1995 |
55 |
3 |
p. 171-178 8 p. |
artikel |
8 |
Partitioning a planar assembly into two connected parts is NP-complete
|
Kavraki, Lydia E. |
|
1995 |
55 |
3 |
p. 159-165 7 p. |
artikel |
9 |
Simulations between two reconfigurable mesh models
|
Shi, Hongchi |
|
1995 |
55 |
3 |
p. 137-142 6 p. |
artikel |
10 |
Untiming timed languages
|
Berard, Béatrice |
|
1995 |
55 |
3 |
p. 129-135 7 p. |
artikel |