Showing papers by "Gerth Stølting Brodal published in 1995"
16 Aug 1995
TL;DR: In this paper, the authors present priority queues that support the operations Find-Min, Insert, MakeQueue and Meld in worst case time O(1) and delete and deleteMin in worst-case O(log n).
Abstract: We present priority queues that support the operations Find-Min, Insert, MakeQueue and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations where Meld takes worst case time o(n).
42 citations
TL;DR: To the knowledge this is the first priority queue implementation that supports Meld in worst case constant time and DeleteMin in logarithmic time.
Abstract: We present priority queues that support the operations MakeQueue, FindMin, Insert and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations where Meld takes worst case time o(n). To our knowledge this is the first priority queue implementation that supports Meld in worst case constant time and DeleteMin in logarithmic time.
18 citations