Title: An open ended tree
Authors: Vandecasteele, Henk ×
Janssens, Gerda #
Issue Date: May-2003
Publisher: Cambridge univ press
Series Title: Theory and practice of logic programming vol:3 issue:3 pages:377-385
Abstract: An open ended list is a well known data structure in Prolog programs. It is frequently used to represent a value changing over time, while this value is referred to from several places in the data structure of the application. A weak point in this technique is that the time complexity is linear in the number of updates to the value represented by the open ended list. In this programming pearl we present a variant of the open ended list, namely an open ended tree, with an update and access time complexity logarithmic in the number of updates to the value.
ISSN: 1471-0684
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
39989.pdf Published 109KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science