Worst-Case Optimal Priority Queues via Extended Regular Counters
release_xogofnn27rfmrbl3dagznl7eqa
by
Amr Elmasry, Jyrki Katajainen
2011
Abstract
We consider the classical problem of representing a collection of priority
queues under the operations , , , ,
, and . In the comparison-based model, if the first four
operations are to be supported in constant time, the last two operations must
take at least logarithmic time. Brodal showed that his worst-case efficient
priority queues achieve these worst-case bounds. Unfortunately, this data
structure is involved and the time bounds hide large constants. We describe a
new variant of the worst-case efficient priority queues that relies on extended
regular counters and provides the same asymptotic time and space bounds as the
original. Due to the conceptual separation of the operations on regular
counters and all other operations, our data structure is simpler and easier to
describe and understand. Also, the constants in the time and space bounds are
smaller. In addition, we give an implementation of our structure on a pointer
machine. For our pointer-machine implementation, and are
asymptotically slower and require O(n) worst-case time, where n
denotes the number of elements stored in the resulting priority queue.
In text/plain
format
Archived Files and Locations
application/pdf 361.2 kB
file_qrwsfppz4vf3rfeswhfbgz3by4
|
arxiv.org (repository) web.archive.org (webarchive) |
application/pdf 361.2 kB
file_rqk5qzpmizd3pavmyw3wkhugna
|
archive.org (archive) |
1112.0993v1
access all versions, variants, and formats of this works (eg, pre-prints)