The complexity of maintaining a set under the operations Insert, Delete and FindMin is considered. In the comparison model it is shown that any randomized algorithm with expected amortized cost t comparisons per Insert and Delete has expected cost at least n/(e22t)-1 comparisons for FindMin. If FindMin is replaced by a weaker operation, FindAny, then it is shown that a randomized algorithm with constant expected cost per operation exists, but no deterministic algorithm. Finally, a deterministic algorithm with constant amortized cost per operation for an offiine version of the problem is given.
CITATION STYLE
Brodal, G. S., Chaudhuri, S., & Radhakrishnan, J. (1996). The randomized complexity of maintaining the minimum. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1097, pp. 4–15). Springer Verlag. https://doi.org/10.1007/3-540-61422-2_116
Mendeley helps you to discover research relevant for your work.