Checking Mergeable Priority Queues (1994)
| Venue: | In Digest of the 24th Symposium on Fault-Tolerant Computing |
| Citations: | 17 - 4 self |
BibTeX
@INPROCEEDINGS{Bright94checkingmergeable,
author = {Jonathan Bright and Gregory Sullivan},
title = {Checking Mergeable Priority Queues},
booktitle = {In Digest of the 24th Symposium on Fault-Tolerant Computing},
year = {1994},
pages = {144--153},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present an efficient algorithm which can check the answers given by the fundamental abstract data types priority queues and mergeable priority queues. This is the first linear-time checker for mergeable priority queues. These abstract data types are widely used in routing, scheduling, simulation, computational geometry and many other algorithmic domains. We have implemented our answer checker and have performed experiments comparing the speed of our checker to recently benchmarked priority queue and mergeable priority queue implementations, and our checker is substantially faster than the best of these implementations. 1 Introduction This paper concerns the fundamental abstract data types of priority queues (PQs) and mergeable priority queues (MPQs). These abstract data types have been recognized as centrally important from the early days of computer-algorithm design. They appear in seminal algorithm texts such as Knuth's [10] and Aho, Hopcroft and Ullman's [1]. Data structure impl...
