nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A distributed self-stabilizing solution to the dining philosophers problem
|
Hoover, Debra |
|
1992 |
41 |
4 |
p. 209-213 5 p. |
artikel |
2 |
An efficient algorithm for the All Pairs Suffix-Prefix Problem
|
Gusfield, Dan |
|
1992 |
41 |
4 |
p. 181-185 5 p. |
artikel |
3 |
A simple lower bound for monotone clique using a communication game
|
Goldmann, Mikael |
|
1992 |
41 |
4 |
p. 221-226 6 p. |
artikel |
4 |
Axiomatizing fixpoint logics
|
Szalas, Andrzej |
|
1992 |
41 |
4 |
p. 175-180 6 p. |
artikel |
5 |
Connected domination and Steiner set on weighted permutation graphs
|
Arvind, K. |
|
1992 |
41 |
4 |
p. 215-220 6 p. |
artikel |
6 |
Counting convex k-gons in planar point sets
|
Rote, Günther |
|
1992 |
41 |
4 |
p. 191-194 4 p. |
artikel |
7 |
Head-strictness is not a monotonic abstract property
|
Kamin, Samuel |
|
1992 |
41 |
4 |
p. 195-198 4 p. |
artikel |
8 |
Improved bounds for covering complete uniform hypergraphs
|
Radhakrishnan, Jaikumar |
|
1992 |
41 |
4 |
p. 203-207 5 p. |
artikel |
9 |
Optimal embedding of 2-D torus into ring
|
Ma, Eva |
|
1992 |
41 |
4 |
p. 227-231 5 p. |
artikel |
10 |
Solving the satisfiability problem by using randomized approach
|
Wu, L.C. |
|
1992 |
41 |
4 |
p. 187-190 4 p. |
artikel |
11 |
The graph of multiplication is equivalent to counting
|
Buss, Samuel R. |
|
1992 |
41 |
4 |
p. 199-201 3 p. |
artikel |