Gerth Stlting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan. The randomized complexity of maintaining the minimum. In Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1097 of Lecture Notes in Computer Science, pages 4--15. Springer Verlag, Berlin, 1996. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Predecessor Queries in Dynamic Integer Sets - Brodal (1997) (4 citations) (Correct)
....in S. In the comparison model Insert, Delete and Pred can be supported in worst case O(logn) time and FindMin and FindMax in worst case constant time by a balanced search tree, say an (a; b) tree [8] For the comparison model a tradeoff between the operations has been shown by Brodal et al. [6]. The tradeoff shown in [6] is that if Insert and Delete take worst case O(t(n) time then FindMin (and FindMax) requires at least worst case n=2 O(t(n) time. Because predecessor queries can be used to answer member queries, minimum queries and maximumqueries, Pred requires worst case ....
.... model Insert, Delete and Pred can be supported in worst case O(logn) time and FindMin and FindMax in worst case constant time by a balanced search tree, say an (a; b) tree [8] For the comparison model a tradeoff between the operations has been shown by Brodal et al. 6] The tradeoff shown in [6] is that if Insert and Delete take worst case O(t(n) time then FindMin (and FindMax) requires at least worst case n=2 O(t(n) time. Because predecessor queries can be used to answer member queries, minimum queries and maximumqueries, Pred requires worst case maxf Omega (log n) n=2 O(t(n) g ....
[Article contains additional citation context not shown here]
Gerth Stlting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan. The randomized complexity of maintaining the minimum. In Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1097 of Lecture Notes in Computer Science, pages 4--15. Springer Verlag, Berlin, 1996.
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