16 search results - page 1 / 4 » Fast Meldable Priority Queues |
93
Voted
WADS
1995
Springer
15 years 1 months ago
1995
Springer
SWAT
2004
Springer
15 years 3 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...
COMPUTING
2008
14 years 9 months ago
2008
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
DKE
2002
14 years 9 months ago
2002
The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a pri...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
-In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) gu...