191 search results - page 5 / 39 » Multipartite priority queues |
112
click to vote
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
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...
109
Voted
CATS
2007
15 years 2 months ago
2007
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ ...
123
Voted
QUESTA
2007
15 years 9 days ago
2007
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
63
Voted
ORL
2006
15 years 22 days ago
2006
We consider a memoryless single server queue with two classes of customers, each having its fixed entry fee. We show that profit and social welfare may benefit from a service disc...
123
click to vote
DM
1999
15 years 14 days ago
1999
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...