An Open Ended Tree
| dc.creator | Vandecasteele, Henk | |
| dc.creator | Janssens, Gerda | |
| dc.date | 2003-12-15 | |
| dc.date.accessioned | 2026-07-07T03:20:43Z | |
| dc.date.available | 2026-07-07T03:20:43Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0312027 | |
| dc.identifier | http://arxiv.org/abs/cs/0312027 | |
| dc.identifier | TPLP Vol 3(3) 2003 pp 377-385 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31925 | |
| dc.subject | Programming Languages | |
| dc.subject | D.1.6;D.3.3;.E.2 | |
| dc.title | An Open Ended Tree | |
| dc.type | text |