Trace Theory and the Specification of Concurrent Systems. - Anne Kaldewaij (The Analysis of Concurrent Systems, 1983)

On the Decomposition of Sequences into Ascending Subsequences. - Anne Kaldewaij (Inf. Process. Lett., 1985)

The Translation of Processes into Circuits. - Anne Kaldewaij (PARLE (1), 1987)

Some Algorithms Based on the Dual of Dilworth's Theorem. - Anne Kaldewaij (Sci. Comput. Program., 1987)

A Derivation of a Systolic Rank Order Filter with Constant Response Time. - Anne Kaldewaij; Martin Rem (MPC, 1989)

Programming - the derivation of algorithms. - Anne Kaldewaij (Prentice Hall, 1990)

The Derivation of Systolic Computations. - Anne Kaldewaij; Martin Rem (Sci. Comput. Program., 1990)

Searching by Elimination. - Anne Kaldewaij; Berry Schoenmakers (Sci. Comput. Program., 1990)

A Systolic Design for Acceptors of Regular Languages. - Anne Kaldewaij; Gerard Zwaan (Sci. Comput. Program., 1990)

Rectangular Partition is Polynomial in Two Dimensions but NP-Complete in Three. - Victor J. Dielissen; Anne Kaldewaij (Inf. Process. Lett., 1991)

The Derivation of a Tighter Bound for Top-Down Skew Heaps. - Anne Kaldewaij; Berry Schoenmakers (Inf. Process. Lett., 1991)

Rank Order Filters and Priority Queues. - Anne Kaldewaij; Jan Tijmen Udding (Distributed Comput., 1992)

Decomposable Functions and Leaf Trees: A Systematic Approach. - Anne Kaldewaij; Victor J. Dielissen (PROCOMET, 1994)

A Simple, Efficient, and Flexible Implementation of Flexible Arrays. - Victor J. Dielissen; Anne Kaldewaij (MPC, 1995)

The Matrix as In-Situ Data Structure. - Anne Kaldewaij; Laurens de Vries (Sci. Comput. Program., 1995)

Leaf Trees. - Anne Kaldewaij; Victor J. Dielissen (Sci. Comput. Program., 1996)

Optimal real-time garbage collection for acyclic pointer structures. - Anne Kaldewaij; Laurens de Vries (Inf. Process. Lett., 2001)