2 search results - page 1 / 1 » Purely Functional Worst Case Constant Time Catenable Sorted ... |
ESA
2006
Springer
13 years 6 months ago
2006
Springer
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
SODA
1998
ACM
13 years 6 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...