Wim H. J. Feijen

According to our database, Wim H. J. Feijen authored at least 13 papers between 1981 and 2002.

Collaborative distances:

• Dijkstra number of one.
• Erdős number of four.

2002

On computing a longest path in a tree.

R. W. Bulterman, F. W. van der Sommen, Gerard Zwaan, Tom Verhoeff, A. J. M. van Gasteren, W. H. J. Feijen

Inf. Process. Lett., 2002

In memoriam: Edsger W. Dijkstra 1930-2002.

Robert S. Boyer, W. H. J. Feijen, David Gries, C. A. R. Hoare, Jayadev Misra, J. Moore, H. Richards

Commun. ACM, 2002

2001

The joy of formula manipulation.

W. H. J. Feijen

Inf. Process. Lett., 2001

1999

On a Method of Multiprogramming

W. H. J. Feijen, A. J. M. van Gasteren

Monographs in Computer Science, Springer, ISBN: 978-1-4757-3126-2, 1999

1998

An Elementary Derivation of the Alternating Bit Protocol.

W. H. J. Feijen, A. J. M. van Gasteren, Birgit Schieder

Proceedings of the Mathematics of Program Construction, 1998

1997

Peterson's Mutual Exclusion Algorithm Revisited.

F. W. van der Sommen, W. H. J. Feijen, A. J. M. van Gasteren

Sci. Comput. Program., 1997

1996

Formal Derivation of an Algorithm for Distributed Phase Synchronization.

D. S. Buhaceanu, W. H. J. Feijen

Inf. Process. Lett., 1996

1989

The Linear Search Revisited.

Edsger W. Dijkstra, W. H. J. Feijen

Struct. Program., 1989

1988

A method of programming.

Edsger W. Dijkstra, W. H. J. Feijen

Addison-Wesley, ISBN: 978-0-201-17536-3, 1988

1987

In-situ Inversion of a Cyclic Permutation.

W. H. J. Feijen, A. J. M. van Gasteren, David Gries

Inf. Process. Lett., 1987

1985

Methodik des Programmierens.

Edsger W. Dijkstra, Wim H. J. Feijen

Internationale Computer-Bibliothek, Addison-Wesley, ISBN: 978-3-925118-18-0, 1985

1983

Derivation of a Termination Detection Algorithm for Distributed Computations.

Edsger W. Dijkstra, W. H. J. Feijen, A. J. M. van Gasteren

Inf. Process. Lett., 1983

1981

Bulterman's Reshuffling Problem.

W. H. J. Feijen

Sci. Comput. Program., 1981