| 2002 |
|---|
| 12 | EE | R. W. Bulterman,
F. W. van der Sommen,
Gerard Zwaan,
Tom Verhoeff,
A. J. M. van Gasteren,
W. H. J. Feijen:
On computing a longest path in a tree.
Inf. Process. Lett. 81(2): 93-96 (2002) |
| 1998 |
|---|
| 11 | EE | W. H. J. Feijen,
A. J. M. van Gasteren,
Birgit Schieder:
An Elementary Derivation of the Alternating Bit Protocol.
MPC 1998: 175-187 |
| 10 | | A. J. M. van Gasteren,
A. Bijlsma:
An extension of the program derivation format.
PROCOMET 1998: 167-185 |
| 1997 |
|---|
| 9 | | F. W. van der Sommen,
W. H. J. Feijen,
A. J. M. van Gasteren:
Peterson's Mutual Exclusion Algorithm Revisited.
Sci. Comput. Program. 29(3): 327-334 (1997) |
| 1994 |
|---|
| 8 | | Roland Carl Backhouse,
J. P. H. W. van den Eijnde,
A. J. M. van Gasteren:
Calculating Path Algorithms.
Sci. Comput. Program. 22(1-2): 3-19 (1994) |
| 1992 |
|---|
| 7 | | Roland Carl Backhouse,
A. J. M. van Gasteren:
Calculating a Path Algorithm.
MPC 1992: 32-44 |
| 1990 |
|---|
| 6 | | A. J. M. van Gasteren:
On the Shape of Mathematical Arguments
Springer 1990 |
| 5 | | A. J. M. van Gasteren,
Gerard Tel:
Comments on ``On the Proof of a Distributed Algorithm'': Always-Tru is not Invariant.
Inf. Process. Lett. 35(6): 277-279 (1990) |
| 1987 |
|---|
| 4 | | W. H. J. Feijen,
A. J. M. van Gasteren,
David Gries:
In-situ Inversion of a Cyclic Permutation.
Inf. Process. Lett. 24(1): 11-14 (1987) |
| 1986 |
|---|
| 3 | | Edsger W. Dijkstra,
A. J. M. van Gasteren:
A Simple Fixpoint Argument Without the Restriction to Continuity.
Acta Inf. 23(1): 1-7 (1986) |
| 1983 |
|---|
| 2 | | Edsger W. Dijkstra,
W. H. J. Feijen,
A. J. M. van Gasteren:
Derivation of a Termination Detection Algorithm for Distributed Computations.
Inf. Process. Lett. 16(5): 217-219 (1983) |
| 1982 |
|---|
| 1 | | Edsger W. Dijkstra,
A. J. M. van Gasteren:
An Introduction to Three Algorithms for Sorting in Situ.
Inf. Process. Lett. 15(3): 129-134 (1982) |
