Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing (1994)
Austin, TX, USA
June 15, 1994 to June 17, 1994
J.D. Bright , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
G.P. Sullivan , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
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.<
abstract data types, algorithm theory, merging
J. Bright and G. Sullivan, "Checking mergeable priority queues," Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing(FTCS), Austin, TX, USA, 1994, pp. 144-153.