{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T19:40:07Z","timestamp":1750448407344,"version":"3.41.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:00:00Z","timestamp":1052784000000},"content-version":"unspecified","delay-in-days":12,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2003,5]]},"abstract":"<jats:p>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 <jats:italic>programming pearl<\/jats:italic> 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.<\/jats:p>","DOI":"10.1017\/s1471068402001618","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T16:31:21Z","timestamp":1052843481000},"page":"377-385","source":"Crossref","is-referenced-by-count":1,"title":["An open ended tree"],"prefix":"10.1017","volume":"3","author":[{"given":"HENK","family":"VANDECASTEELE","sequence":"first","affiliation":[]},{"given":"GERDA","family":"JANSSENS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2003,5,13]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068402001618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T19:06:24Z","timestamp":1750446384000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068402001618\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S1471068402001618"],"URL":"https:\/\/doi.org\/10.1017\/s1471068402001618","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}