default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnne Kaldewaij
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j11]Anne Kaldewaij, Laurens de Vries:
Optimal real-time garbage collection for acyclic pointer structures. Inf. Process. Lett. 77(2-4): 151-157 (2001)
1990 – 1999
- 1996
- [j10]Anne Kaldewaij, Victor J. Dielissen:
Leaf Trees. Sci. Comput. Program. 26(1-3): 149-165 (1996) - 1995
- [j9]Anne Kaldewaij, Laurens de Vries:
The Matrix as In-Situ Data Structure. Sci. Comput. Program. 24(2): 149-158 (1995) - [c6]Victor J. Dielissen, Anne Kaldewaij:
A Simple, Efficient, and Flexible Implementation of Flexible Arrays. MPC 1995: 232-241 - 1994
- [c5]Anne Kaldewaij, Victor J. Dielissen:
Decomposable Functions and Leaf Trees: A Systematic Approach. PROCOMET 1994: 3-17 - 1992
- [j8]Anne Kaldewaij, Jan Tijmen Udding:
Rank Order Filters and Priority Queues. Distributed Comput. 6(2): 99-105 (1992) - 1991
- [j7]Anne Kaldewaij, Berry Schoenmakers:
The Derivation of a Tighter Bound for Top-Down Skew Heaps. Inf. Process. Lett. 37(5): 265-271 (1991) - [j6]Victor J. Dielissen, Anne Kaldewaij:
Rectangular Partition is Polynomial in Two Dimensions but NP-Complete in Three. Inf. Process. Lett. 38(1): 1-6 (1991) - 1990
- [b1]Anne Kaldewaij:
Programming - the derivation of algorithms. Prentice Hall international series in computer science, Prentice Hall 1990, ISBN 978-0-13-204108-9, pp. I-XII, 1-216 - [j5]Anne Kaldewaij, Martin Rem:
The Derivation of Systolic Computations. Sci. Comput. Program. 14(2-3): 229-242 (1990) - [j4]Anne Kaldewaij, Berry Schoenmakers:
Searching by Elimination. Sci. Comput. Program. 14(2-3): 243-254 (1990) - [j3]Anne Kaldewaij, Gerard Zwaan:
A Systolic Design for Acceptors of Regular Languages. Sci. Comput. Program. 15(2-3): 171-183 (1990)
1980 – 1989
- 1989
- [c4]Anne Kaldewaij, Martin Rem:
A Derivation of a Systolic Rank Order Filter with Constant Response Time. MPC 1989: 281-296 - [c3]Anne Kaldewaij, Berry Schoenmakers:
Searching by Elimination. MPC 1989: 297-306 - 1987
- [j2]Anne Kaldewaij:
Some Algorithms Based on the Dual of Dilworth's Theorem. Sci. Comput. Program. 9(1): 85-89 (1987) - [c2]Anne Kaldewaij:
The Translation of Processes into Circuits. PARLE (1) 1987: 195-212 - 1985
- [j1]Anne Kaldewaij:
On the Decomposition of Sequences into Ascending Subsequences. Inf. Process. Lett. 21(2): 69 (1985) - 1983
- [c1]Anne Kaldewaij:
Trace Theory and the Specification of Concurrent Systems. The Analysis of Concurrent Systems 1983: 211-221
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
