nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on restricted H-colouring
|
Brewster, Richard |
|
1991 |
40 |
3 |
p. 149-151 3 p. |
artikel |
2 |
Binary self-stabilization in distributed systems
|
Ghosh, Sukumar |
|
1991 |
40 |
3 |
p. 153-159 7 p. |
artikel |
3 |
Broadcasting in complete networks with faulty nodes using unreliable calls
|
Pelc, Andrzej |
|
1991 |
40 |
3 |
p. 169-174 6 p. |
artikel |
4 |
Computing the optimal IO sequences of a protocol in polynomial time
|
Chen, Wen-Huei |
|
1991 |
40 |
3 |
p. 145-148 4 p. |
artikel |
5 |
Constrained integer approximation to planar line intersection
|
Mehta, Shashank |
|
1991 |
40 |
3 |
p. 137-139 3 p. |
artikel |
6 |
Deferred data structure for the nearest neighbor problem
|
Aggarwal, Alok |
|
1991 |
40 |
3 |
p. 119-122 4 p. |
artikel |
7 |
Las Vegas RNC algorithms for unary weighted perfect matching and T-join problems
|
Wein, Joel |
|
1991 |
40 |
3 |
p. 161-167 7 p. |
artikel |
8 |
Linear time algorithms on circular-arc graphs
|
Hsu, Wen-Lian |
|
1991 |
40 |
3 |
p. 123-129 7 p. |
artikel |
9 |
Preserving liveness: Comments on “safety and liveness from a methodological point of view”
|
Abadi, Martín |
|
1991 |
40 |
3 |
p. 141-142 2 p. |
artikel |
10 |
Reply to the comments by M. Abadi et al.
|
Dederichs, Frank |
|
1991 |
40 |
3 |
p. 143- 1 p. |
artikel |
11 |
The synchronization problem in protocol testing and its complexity
|
Boyd, Sylvia |
|
1991 |
40 |
3 |
p. 131-136 6 p. |
artikel |