Wim H. J. Feijen
According to our database^{1},
Wim H. J. Feijen
authored at least 13 papers
between 1981 and 2002.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at dl.acm.org
On csauthors.net:
Bibliography
2002
On computing a longest path in a tree.
Inf. Process. Lett., 2002
In memoriam: Edsger W. Dijkstra 19302002.
Commun. ACM, 2002
2001
The joy of formula manipulation.
Inf. Process. Lett., 2001
1999
On a Method of Multiprogramming
Monographs in Computer Science, Springer, ISBN: 9781475731262, 1999
1998
An Elementary Derivation of the Alternating Bit Protocol.
Proceedings of the Mathematics of Program Construction, 1998
1997
Peterson's Mutual Exclusion Algorithm Revisited.
Sci. Comput. Program., 1997
1996
Formal Derivation of an Algorithm for Distributed Phase Synchronization.
Inf. Process. Lett., 1996
1989
The Linear Search Revisited.
Structured Programming, 1989
1988
A method of programming.
AddisonWesley, ISBN: 9780201175363, 1988
1987
Insitu Inversion of a Cyclic Permutation.
Inf. Process. Lett., 1987
1985
Methodik des Programmierens.
Internationale ComputerBibliothek, AddisonWesley, ISBN: 9783925118180, 1985
1983
Derivation of a Termination Detection Algorithm for Distributed Computations.
Inf. Process. Lett., 1983
1981
Bulterman's Reshuffling Problem.
Sci. Comput. Program., 1981