1995 |
21 | | Jan L. A. van de Snepscheut:
The Sliding-Window Protocol Revisited.
Formal Asp. Comput. 7(1): 3-17 (1995) |
1994 |
20 | | K. Rustan M. Leino,
Jan L. A. van de Snepscheut:
Semantics of Exceptions.
PROCOMET 1994: 447-466 |
19 | | Jan L. A. van de Snepscheut:
Mechanized Support for Stepwise Refinement.
Programming Languages and System Architectures 1994: 35-48 |
1992 |
18 | | Johan J. Lukkien,
Jan L. A. van de Snepscheut:
Weakest Preconditions for Progress.
Formal Asp. Comput. 4(2): 195-236 (1992) |
17 | | Jan L. A. van de Snepscheut:
A LISP Programming Exercise.
Inf. Process. Lett. 42(2): 103-108 (1992) |
1991 |
16 | | H. Peter Hofstee,
Johan J. Lukkien,
Jan L. A. van de Snepscheut:
A Distributed Implementation of a Task Pool.
Research Directions in High-Level Parallel Programming Languages 1991: 338-348 |
15 | | Jan L. A. van de Snepscheut:
Inversion of a Recursive Tree Traversal.
Inf. Process. Lett. 39(5): 265-267 (1991) |
1990 |
14 | | Alain J. Martin,
Jan L. A. van de Snepscheut:
An Interconnection Network for Distributed Recursive Computations.
IEEE Trans. Computers 39(11): 1393-1395 (1990) |
13 | | Jan L. A. van de Snepscheut:
Foreword (Special Issue on Mathematics of Program Construction).
Sci. Comput. Program. 14(2-3): 113-115 (1990) |
12 | | H. Peter Hofstee,
Alain J. Martin,
Jan L. A. van de Snepscheut:
Distributed Sorting.
Sci. Comput. Program. 15(2-3): 119-133 (1990) |
1989 |
11 | | Jan L. A. van de Snepscheut:
Mathematics of Program Construction, 375th Anniversary of the Groningen University, International Conference, Groningen, The Netherlands, June 26-30, 1989, Proceedings
Springer 1989 |
10 | EE | Jan L. A. van de Snepscheut,
Johan B. Swenker:
On the design of some systolic algorithms.
J. ACM 36(4): 826-840 (1989) |
9 | | David Gries,
Alain J. Martin,
Jan L. A. van de Snepscheut,
Jan Tijmen Udding:
An Algorithm for Transitive Reduction of an Acyclic Graph.
Sci. Comput. Program. 12(2): 151-155 (1989) |
1987 |
8 | | Peter A. J. Hilbers,
Marion R. J. Koopman,
Jan L. A. van de Snepscheut:
The Twisted Cube.
PARLE (1) 1987: 152-159 |
7 | | Jan L. A. van de Snepscheut:
Fair Mutual Exclusion on a Graph of Processes.
Distributed Computing 2(2): 113-115 (1987) |
6 | | Jan L. A. van de Snepscheut:
"Algorithms for On-the-Fly Garbage Collection" Revisited.
Inf. Process. Lett. 24(4): 211-216 (1987) |
1986 |
5 | | Jan L. A. van de Snepscheut,
Jan Tijmen Udding:
An Alternative Implementation of Communication Primitives.
Inf. Process. Lett. 23(5): 231-238 (1986) |
4 | | Jan L. A. van de Snepscheut:
A Derivation of a Distributed Implementation of Warshall's Algorithm.
Sci. Comput. Program. 7(1): 55-60 (1986) |
1985 |
3 | | Jan L. A. van de Snepscheut:
Evaluating Expressions with a Queue.
Inf. Process. Lett. 20(2): 65-66 (1985) |
1981 |
2 | | Jan L. A. van de Snepscheut:
Synchronous Communication Between Asynchronous Components.
Inf. Process. Lett. 13(3): 127-130 (1981) |
1980 |
1 | | F. E. J. Kruseman Aretz,
Jan L. A. van de Snepscheut,
H. Grasdijk,
J. M. H. Smeets:
SATHE: Some Aspects of an ALGOL Implementation.
Softw., Pract. Exper. 10(7): 563-573 (1980) |