Anne Kaldewaij

18 papers B 3Journal 11Unranked 3
YearRankTypeTitle / Venue / Authors
2001 J jnl
Optimal real-time garbage collection for acyclic pointer structures.
Inf. Process. Lett.
Anne Kaldewaij, Laurens de Vries
1996 J jnl
Leaf Trees.
Sci. Comput. Program.
Anne Kaldewaij, Victor J. Dielissen
1995 B conf
A Simple, Efficient, and Flexible Implementation of Flexible Arrays.
MPC
Victor J. Dielissen, Anne Kaldewaij
1995 J jnl
The Matrix as In-Situ Data Structure.
Sci. Comput. Program.
Anne Kaldewaij, Laurens de Vries
1994 — conf
Decomposable Functions and Leaf Trees: A Systematic Approach.
PROCOMET
Anne Kaldewaij, Victor J. Dielissen
1992 J jnl
Rank Order Filters and Priority Queues.
Distributed Comput.
Anne Kaldewaij, Jan Tijmen Udding
1991 J jnl
Rectangular Partition is Polynomial in Two Dimensions but NP-Complete in Three.
Inf. Process. Lett.
Victor J. Dielissen, Anne Kaldewaij
1991 J jnl
The Derivation of a Tighter Bound for Top-Down Skew Heaps.
Inf. Process. Lett.
Anne Kaldewaij, Berry Schoenmakers
1990 J jnl
A Systolic Design for Acceptors of Regular Languages.
Sci. Comput. Program.
Anne Kaldewaij, Gerard Zwaan
1990 — book
Programming - the derivation of algorithms.
Anne Kaldewaij
1990 J jnl
Searching by Elimination.
Sci. Comput. Program.
Anne Kaldewaij, Berry Schoenmakers
1990 J jnl
The Derivation of Systolic Computations.
Sci. Comput. Program.
Anne Kaldewaij, Martin Rem
1989 B conf
A Derivation of a Systolic Rank Order Filter with Constant Response Time.
MPC
Anne Kaldewaij, Martin Rem
1989 B conf
Searching by Elimination.
MPC
Anne Kaldewaij, Berry Schoenmakers
1987 J jnl
Some Algorithms Based on the Dual of Dilworth's Theorem.
Sci. Comput. Program.
Anne Kaldewaij
1987 — conf
The Translation of Processes into Circuits.
PARLE (1)
Anne Kaldewaij
1985 J jnl
On the Decomposition of Sequences into Ascending Subsequences.
Inf. Process. Lett.
Anne Kaldewaij
1983 — conf
Trace Theory and the Specification of Concurrent Systems.
The Analysis of Concurrent Systems
Anne Kaldewaij