Leo J. Guibas and Robert Sedgewick. A dichromatic framework for balanced trees. In Proceedings of the Nineteenth Annual Symposium on Foundations of Computer Science, pages 8-21, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Digital Access to Comparison-Based Tree Data - Structures And Algorithms (Correct)
....digit guided search trees. On the one hand, comparison based search trees require some care to avoid the worst case Theta(N ) for the average number of visited nodes per search or update (insertion or deletion) This can be achieved by explicitly balancing the tree (AVL trees [1] red black trees [6], etc. or by randomising it [9] All these strategies guarantee that the (worst case or expected) number of visited nodes per search or update is Theta(log N ) irrespectively of the order of the updates. For our example above, the difference is roughly between 50000=2 = 25000 and just log 2 ....
L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. of the 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 8--21, October 1978.
A Locality-Preserving Cache-Oblivious Dynamic Dictionary - Bender, Duan, Iacono, Wu (2002) (15 citations) (Correct)
....basic structure is a balanced tree having a fan out proportional to the disk block size B. The B tree uses linear space and its query and update performance are O(log B N ) memory transfers. This is a O(logB) factor improvement over the O(log 2 N ) bound obtained by the RAM model structures (e.g. [1, 21, 30, 33, 37, 38]) This improvement translates to approximately an order of magnitude speedup, depending on the application. Although B trees are in widespread use, they do have several limitations. They depend critically on Department of Computer Science, State University of New York, Stony Brook, NY ....
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. Symp. on Foundations of Computer Science, pages 8-21, 1978.
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
....mechanisms that admit fast access and update operations. For a generic n element ordered data set that is accessed and updated uniformly, this goal is typically satisfied by dictionaries that achieve O(log n) time performance for searches and updates; for example, AVL trees [2] red black trees [12], and (a, b) trees [13] Nevertheless, many dictionary applications involve sets of weighted data items that are searched and updated non uniformly according to those weights; that is, they are biased. For example, most operating systems textbooks (e.g. see Stallings [23] devote major coverage ....
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symp. on Foundations of Computer Science, pages 8--21, 1978.
Three-Dimensional Layers of Maxima - Buchsbaum, Goodrich (2002) (Correct)
....within p s range of in uence is an ancestor of y(p) or some y(v) that was deleted above and hence gets updated appropriately. Straightforward implementations of T do not improve upon the results of Section 2. For example, if we construct T as a balanced, binary search tree and use redblack trees [8] to implement the entry and exit lists, then Q(N) O(log N) as before: O(log n) time at each level of T to perform a stabbing test using Lemma 2. R(N) O(log n) and I(N) D(N) O(log N) argue as with Q(N ) Each point in S yields an element in at most one entry and exit list in each ....
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE FOCS, pages 8-21, 1978.
Space-Efficient Finger Search on Degree-Balanced Search.. - Blelloch, Maggs, Leung, Woo (2003) (3 citations) (Correct)
....on degree balanced search trees. All the leaves in such a tree are at the same depth and its balance is maintained by varying the degree of internal nodes between fixed constants. 23 trees [2] B trees [3] and (a, b) trees [11] are all variants of degree balanced search trees. Red Black trees [10] can also be viewed as degree balanced easily via the isomorphism with 2 3 4 trees. We sometimes simplify our presentation by assuming a complete binary search tree (BST ) but we also show how to account for this to retain full generality. A k ary node x has (2k 1) fields. The keys are sorted ....
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 8--21, 1978.
Space-Efficient Finger Search on Degree-Balanced Search.. - Blelloch, Maggs, Leung, Woo (2003) (3 citations) (Correct)
....on degree balanced search trees. All the leaves in such a tree are at the same depth and its balance is maintained by varying the degree of internal nodes between fixed constants. 2 3 trees [2] B trees [3] and (a, b) trees [11] are all variants of degree balanced search trees. Red Black trees [10] can also be viewed as degree balanced easily via the isomorphism with 2 3 4 trees. We sometimes simplify our presentation by assuming a complete binary search tree (BST) but we also show how to account for this to retain full generality. A k ary node x has (2k 1) fields. The keys are sorted ....
L. J. Guibas and R. Sedgewick. A dichromatic frame- work for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 8-21, 1978.
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (Correct)
....organization mechanisms that admit fast access and update operations. For a generic n element ordered data set that is accessed and updated uniformly, this goal is typically satis ed by dictionaries that achieve O(log n) time search and update performance; e.g. AVL trees [2] red black trees [12], and (a; b) trees [13] Nevertheless, many dictionary applications involve sets of weighted data items subject to non uniform access patterns that are biased according to the weights. For example, operating systems (e.g. see Stallings [22] deal with biasing in memory requests. Other recent ....
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE FOCS, pages 8-21, 1978.
Efficient Randomized Algorithms for Robust Estimation of.. - Mount, Netanyahu (2001) (Correct)
....then clockwise around the boundary, and then summing the two counts for each segment, we will have counted all of the segment s intersections. The stack can be implemented by a simple modification of virtually any type of a balanced binary search tree, for example, a red black tree (see, e.g. [21] or [11] Chapters 14, 15) The tree is modified for the purposes of counting in the following manner. The segments that are currently on the stack are stored in the leaves of the tree. They are ordered so that the top bottom of the stack is the leftmost rightmost leaf of the tree. Unlike a ....
L. J. Guibas and R. Sedgewick (1978), A dichromatic framework for balanced trees, in Proceedings of the Nineteenth Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 1--8.
Efficient Rebalancing of Chromatic Search Trees - Boyar, Larsen (1993) (7 citations) (Correct)
....and deletion modify the data structure, they are called the updating operations. For an implementation of a dictionary, Nurmi and Soisalon Soininen propose a new type of binary search tree, which they call a chromatic tree. One standard implementation of a dictionary is as a red black tree [GS78], which is a type of balanced binary search tree. However, often when a data structure is accessed and updated by different processes in a concurrent environment, parts of the structure have to be locked while data items are changed or deleted. In the case of red black trees of size n, an update ....
....a data structure is accessed and updated by different processes in a concurrent environment, parts of the structure have to be locked while data items are changed or deleted. In the case of red black trees of size n, an update requires locking (log2(n) nodes, though not necessarily simultaneously [GS78], in order to rebalance the tree. No other users can access the subtree below a node which is locked. Since the root is often one of the nodes locked, this greatly limits the amount of concurrency possible. This leads Nurmi and Soisalon Soininen to consider a very interesting idea for making the ....
[Article contains additional citation context not shown here]
L. J. Guibas and R. Sedgewick. A Dichromatic Framework for Bal- anced Trees. In IEEE FOCS, pages 8 21, 1978.
Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
....the search with a handle in the data structure to element i 2 X. Reweight(X; i; w i ) Change the weight of i to w i . Biased dictionaries can improve on the (m log n) time required to perform m accesses on n items in classical, unbiased dictionaries such as AVL trees[3] red black trees [38], and (a; b) trees [41] Let w i be the number of times item i is accessed. De ne W = i=1 w i . A biased dictionary with O search time for the i th item can perform m searches on n items in O(m(1 p i log p i ) time, where p i = m , which is optimal [2] 3.1.2 A New Structure for ....
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pages 8-21, 1978.
Important Extrema of Time Series: Theory and Applications - Gandhi (2004) (1 citation) (Correct)
No context found.
Leo J. Guibas and Robert Sedgewick. A dichromatic framework for balanced trees. In Proceedings of the Nineteenth Annual Symposium on Foundations of Computer Science, pages 8-21, 1978.
Space-Ecient Finger Search on Degree-Balanced Search Trees - Guy Blelloch Bruce (Correct)
No context found.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 8--21, 1978.
Self-Adjusting Distributed Trees - Michael Reiter Asad (2005) (Correct)
No context found.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, 1978.
Compact Data Structures with Fast Queries - Blandford (2005) (Correct)
No context found.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 8--21, 1978.
Implementing the Reliable Server Pooling Framework - Dreibholz, Rathgeb (2005) (Correct)
No context found.
L. J. Guibas and R. Sedgewick, "A dichromatic framework for balanced trees," in Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, 1978, pp. 8--21.
CATS: Certified Authenticated Tamper-evident State Store.. - Yumerefendi, Chase (Correct)
No context found.
L. J. Guibas and R. Sedgewick. A Dichromatic Framework for Balanced Trees. In Proceedings of 19th Annual Symposium on Foundations of Computer Science, pages 8--21. IEEE Computer Society, 1978.
Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
No context found.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pages 8--21, 1978.
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
No context found.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symp. on Foundations of Computer Science, pages 8--21, 1978.
Denial of Service via Algorithmic Complexity Attacks - Scott Crosby Dan (2003) (16 citations) (Correct)
No context found.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proceedings of 19th Foundations of Computer Science, pages 8-- 21, 1978.
Data Structures for Maintaining Set Partitions - Bender, Sethia, Skiena (2003) (Correct)
No context found.
L. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symp. Foundations of Computer Science, pages 8-21, Ann Arbor, MI, USA, 1978. SpringerVerlag.
Amortization Results for Chromatic Search Trees, with an .. - Boyar, Fagerberg, Larsen (1997) (1 citation) (Correct)
No context found.
L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, in Proceedings, Nineteenth Annual Symposium on Foundations of Computer Science," pp. 8#21, IEEE Comput. Soc. Press, Long Beach, CA, 1978.
Functors for Proofs and Programs - Filliatre, Letouzey (2003) (Correct)
No context found.
Leo J. Guibas and Robert Sedgewick. A dichromatic framework for balanced trees. In 19th Annual Symposium on Foundations of Computer Science, pages 821, Ann Arbor, Michigan, 16-18 October 1978. IEEE.
Cache-Oblivious B-Trees - Bender, Demaine, Farach-Colton (2000) (25 citations) (Correct)
No context found.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Sympos. Found. Comp. Sci., pp. 8-- 21, Ann Arbor, Michigan, 1978.
A Locality-Preserving Cache-Oblivious Dynamic Dictionary - Bender, Duan, Iacono, Wu (2002) (15 citations) (Correct)
No context found.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pages 8-21, Ann Arbor, Michigan, 1978.
A New Weight Balanced Binary Search Tree - Cho, Sahnit (Correct)
No context found.
L. J. Guibas and R. Sedgewick, A Dichromatic Framework for Balanced Trees, Proc. 19th FOCS, pp. 8-21, 1978.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC