A. J. M. van Gasteren

According to our database1, A. J. M. van Gasteren authored at least 13 papers between 1982 and 2002.

Collaborative distances:
  • Dijkstra number2 of one.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
On computing a longest path in a tree.
Inf. Process. Lett., 2002

1999
On a Method of Multiprogramming
Monographs in Computer Science, Springer, ISBN: 978-1-4757-3126-2, 1999

1998
An extension of the program derivation format.
Proceedings of the Programming Concepts and Methods, 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

1994
Calculating Path Algorithms.
Sci. Comput. Program., 1994

1992
Calculating a Path Algorithm.
Proceedings of the Mathematics of Program Construction, Second International Conference, Oxford, UK, June 29, 1992

1990
Comments on "On the Proof of a Distributed Algorithm": Always-Tru is not Invariant.
Inf. Process. Lett., 1990

On the Shape of Mathematical Arguments
Lecture Notes in Computer Science 445, Springer, ISBN: 3-540-52849-0, 1990

1987
In-situ Inversion of a Cyclic Permutation.
Inf. Process. Lett., 1987

1986
A Simple Fixpoint Argument Without the Restriction to Continuity.
Acta Informatica, 1986

1983
Derivation of a Termination Detection Algorithm for Distributed Computations.
Inf. Process. Lett., 1983

1982
An Introduction to Three Algorithms for Sorting in Situ.
Inf. Process. Lett., 1982


  Loading...