ACM

Communications of the ACM

Home/Magazine Archive/April 1986 (Vol. 29, No. 4)/An empirical comparison of priority-queue and event.../Abstract

An empirical comparison of priority-queue and event-set implementations

By Douglas W. Jones
Communications of the ACM, April 1986, Vol. 29 No. 4, Pages 300-311
10.1145/5684.5686
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

Execution times for a variety of priority-queue implementations are compared under the hold model, showing many to be faster than implicit heaps.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.