An Open Ended Tree

Details An Open Ended Tree An Open Ended Tree

2003-12-15

arxiv.org/abs/cs/0312027v1

TPLP Vol 3(3) 2003 pp 377-385

Computer Science

Programming Languages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Open Ended Tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Open Ended Tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Open Ended Tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102303