Abstract
This paper presents a new implementation technique for priority search queues. This
abstract data type is an amazing blend of finite maps and priority queues. Our implementation
supports logarithmic access to a binding with a given key and constant access to
a binding with the minimum value. Priority search queues can be used,
... read more