Anne Kaldewaij

According to our database1, Anne Kaldewaij authored at least 17 papers between 1983 and 2001.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
Optimal real-time garbage collection for acyclic pointer structures.
Inf. Process. Lett., 2001

1996
Leaf Trees.
Sci. Comput. Program., 1996

1995
The Matrix as In-Situ Data Structure.
Sci. Comput. Program., 1995

A Simple, Efficient, and Flexible Implementation of Flexible Arrays.
Proceedings of the Mathematics of Program Construction, 1995

1994
Decomposable Functions and Leaf Trees: A Systematic Approach.
Proceedings of the Programming Concepts, 1994

1992
Rank Order Filters and Priority Queues.
Distributed Comput., 1992

1991
The Derivation of a Tighter Bound for Top-Down Skew Heaps.
Inf. Process. Lett., 1991

Rectangular Partition is Polynomial in Two Dimensions but NP-Complete in Three.
Inf. Process. Lett., 1991

1990
A Systolic Design for Acceptors of Regular Languages.
Sci. Comput. Program., 1990

Searching by Elimination.
Sci. Comput. Program., 1990

The Derivation of Systolic Computations.
Sci. Comput. Program., 1990

Programming - the derivation of algorithms.
Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-204108-9, 1990

1989
A Derivation of a Systolic Rank Order Filter with Constant Response Time.
Proceedings of the Mathematics of Program Construction, 1989

1987
Some Algorithms Based on the Dual of Dilworth's Theorem.
Sci. Comput. Program., 1987

The Translation of Processes into Circuits.
Proceedings of the PARLE, 1987

1985
On the Decomposition of Sequences into Ascending Subsequences.
Inf. Process. Lett., 1985

1983
Trace Theory and the Specification of Concurrent Systems.
Proceedings of the Analysis of Concurrent Systems, 1983


  Loading...