Anne Kaldewaij

From MaRDI portal
(Redirected from Anne Kaldewaij)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Optimal real-time garbage collection for acyclic pointer structures
Information Processing Letters
2002-07-25Paper
Leaf trees
Science of Computer Programming
1996-12-12Paper
The matrix as in-situ data structure
Science of Computer Programming
1995-07-04Paper
Rank order filters and priority queues
Distributed Computing
1993-01-16Paper
The derivation of a tighter bound for top-down skew heaps
Information Processing Letters
1991-01-01Paper
Rectangular partition is polynomial in two dimensions but NP-complete in three
Information Processing Letters
1991-01-01Paper
A systolic design for acceptors of regular languages
Science of Computer Programming
1990-01-01Paper
Searching by elimination
Science of Computer Programming
1990-01-01Paper
The derivation of systolic computations
Science of Computer Programming
1990-01-01Paper
Some algorithms based on the dual of Dilworth's theorem
Science of Computer Programming
1987-01-01Paper
scientific article; zbMATH DE number 3938548 (Why is no real title available?)1986-01-01Paper
On the decomposition of sequences into ascending subsequences
Information Processing Letters
1985-01-01Paper


Research outcomes over time


This page was built for person: Anne Kaldewaij