A Fully-Functional Static and Dynamic Succinct Trees
... We propose new succinct representations of ordinal trees, and match various space/time lower bounds. It is known that any n-node static tree can be represented in 2n + o(n) bits so that a number of operations on the tree can be supported in constant time under the word-RAM model. However, the data s ...
... We propose new succinct representations of ordinal trees, and match various space/time lower bounds. It is known that any n-node static tree can be represented in 2n + o(n) bits so that a number of operations on the tree can be supported in constant time under the word-RAM model. However, the data s ...
Korat: Automated Testing Based on Java Predicates (ISSTA 2002)
... This section illustrates the generation and checking of array-based data structures, using the heap data structure [8]. The (binary) heap data structure can be viewed as a complete binary tree—the tree is completely filled on all levels except possibly the lowest, which is filled from the left up to ...
... This section illustrates the generation and checking of array-based data structures, using the heap data structure [8]. The (binary) heap data structure can be viewed as a complete binary tree—the tree is completely filled on all levels except possibly the lowest, which is filled from the left up to ...
Burst Tries: A Fast, Efficient Data Structure for
... accessed rapidly; the tree quickly adapts to local changes in vocabulary; and the use of splaying guarantees that the amortised cost of accessing a tree of n nodes is at most O(log n). In practice, however, splay trees have significant disadvantages [53]. In comparison to a BST, a splay tree requir ...
... accessed rapidly; the tree quickly adapts to local changes in vocabulary; and the use of splaying guarantees that the amortised cost of accessing a tree of n nodes is at most O(log n). In practice, however, splay trees have significant disadvantages [53]. In comparison to a BST, a splay tree requir ...
Functional Data Structures
... Nowadays, when a C programmer needs an ecient data structure for a particular problem, he or she can often simply look one up in any of a number of good textbooks or handbooks. However, the same cannot be said for the ML or Haskell programmer. Although some imperative data structures can be adapted ...
... Nowadays, when a C programmer needs an ecient data structure for a particular problem, he or she can often simply look one up in any of a number of good textbooks or handbooks. However, the same cannot be said for the ML or Haskell programmer. Although some imperative data structures can be adapted ...
Worst Case Efficient Data Structures
... We present two new comparison based priority queue implementations, with the following properties. The first implementation supports the operations FindMin, Insert and Meld in worst case constant time and Delete and DeleteMin in worst case time O(log n). The priority queues can be implemented on the ...
... We present two new comparison based priority queue implementations, with the following properties. The first implementation supports the operations FindMin, Insert and Meld in worst case constant time and Delete and DeleteMin in worst case time O(log n). The priority queues can be implemented on the ...