Searching for "On RAM Priority Queues." – sorted by Relevance.
10 documents found, showing 1 through 10.
-
On RAM priority queues
- …Chapter 1 On RAM priority queues Mikkel Thorup y Abstract Priority queues are some of the most…
- Cited by 67 (9 self) – Add To MetaCart
-
Word-based RAM Priority Queues
- …CS 473: Topics in Analysis of Algorithms Fall 2001 Word-based RAM Priority Queues a semester…
- Add To MetaCart
-
Melding Priority Queues
- … recently by Thorup, and by Han and Thorup, we obtain meldable RAM priority queues with O(log log n…
- Cited by 2 (0 self) – Add To MetaCart
-
DIMACS Technical Report 95-12 May 1995
- … and plain priority queues. Theorem 1 For a RAM with arbitrary word size, if we can sort n integers, each…
- Add To MetaCart
-
Worst-Case Efficient External-Memory Priority Queues
- …. This idea is borrowed from a RAM priority-queue structure of Thorup [29]. Thorup used two-way merging in his…
- Cited by 30 (2 self) – Add To MetaCart
-
Worst-Case Efficient External-Memory Priority Queues
- … collection of sorted lists that are incrementally merged. This idea is borrowed from a RAM priority-queue…
- Add To MetaCart
-
Computing Undirected Shortest Paths with Comparisons and Additions
- … Thorup's algorithm seems to require RAM-based priority queues to achieve linear time. Thorup noted that a…
- Add To MetaCart
-
Computing Shortest Paths with Comparisons and Additions
- … seems to require RAM-based priority queues to achieve linear time. Thorup noted that a simplified…
- Cited by 14 (7 self) – Add To MetaCart
-
An Experimental Study of Priority Queues in External Memory
- …, starting from an idea of Thorup [19] for RAM priority queues, Brodal and Katajainen [4] designed…
- Cited by 11 (1 self) – Add To MetaCart
-
Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations
- … the following consequence of Theorem 1: Corollary 4 There is a monotone Practical RAM priority queue supporting…
- Cited by 9 (2 self) – Add To MetaCart
Showing 1 through 10.
