Searching for "Worst-Case Efficient Priority Queues." – sorted by Relevance.
-
Worst-Case Efficient Priority Queues
- Worst-Case Efficient Priority Queues Gerth St��lting Brodal y Abstract An implementation
- Cited by 23 (2 self) – Add To MetaCart
-
Relaxed weak queues: an alternative to run-relaxed heaps
- in realizations of a priority queue which are efficient in the worst-case sense. In particular, our target is a
- Cited by 3 (3 self) – Add To MetaCart
-
This document in subdirectory DS/97/1 / Worst Case Efficient Data Structures
- volume 955, pages 282–290, 1995. Chapter 6 [18]: Worst-Case Efficient Priority Queues. In Proc. 7th ACM
- Add To MetaCart

