Sciweavers

199 search results - page 1 / 40
» On RAM Priority Queues
Sort
View
SODA
1996
ACM
102views Algorithms» more  SODA 1996»
13 years 6 months ago
On RAM Priority Queues
Mikkel Thorup
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
13 years 11 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
13 years 10 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
COMPUTING
2008
94views more  COMPUTING 2008»
13 years 5 months ago
Two new methods for constructing double-ended priority queues from priority queues
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
ANOR
2008
76views more  ANOR 2008»
13 years 5 months ago
Performance comparison of several priority schemes with priority jumps
In this paper, we consider several discrete-time priority queues with priority jumps. In a priority scheduling scheme with priority jumps, real-time and non-real-time packets arri...
Tom Maertens, Joris Walraevens, Herwig Bruneel