登入選單

返回Google圖書搜尋

Confluently Persistent Deques Via Data-structural Bootstrapping

Princeton University. Department of Computer ScienceAdam Louis Buchsbaum

出版	Princeton University, Department of Computer Science, 1993
URL	http://books.google.com.hk/books?id=ebjiGwAACAAJ&hl=&source=gbs_api

註釋

Abstract: "We introduce data-structural bootstrapping, a technique to design data structures recursively, and use it to design confluently persistent deques. Our data structure requires O(log* k) worst-case time and space per deletion, where k is the total number of deque operations, and constant worst-case time and space for other operations. Further, the data structure allows a purely functional implementation, with no side effects. This improves a previous result of Driscoll, Sleator, and Tarjan."