Programming pearls

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Programming pearls: thanks, heaps

Full text

Pdf (586 KB)

Source

Communications of the ACM archive
Volume 28 , Issue 3 (March 1985) table of contents

Pages: 245 - 250

Year of Publication: 1985

ISSN:0001-0782

Author

Jon Bentley

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 14, Downloads (12 Months): 79, Citation Count: 5

Additional Information:

cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/3166.315010 What is a DOI?

CITED BY 5

	Robert Rönngren , Rassul Ayani, A comparative study of parallel and sequential priority queue algorithms, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.7 n.2, p.157-209, April 1997
	Rick Siow Mong Goh , Ian Li-Jin Thng, Twol-amalgamated priority queues, Journal of Experimental Algorithmics (JEA), v.9 n.es, 2004
	John J. DiLeo, FreeSML: delivering on the open-source simulation language promise, Proceedings of the 37th conference on Winter simulation, December 04-07, 2005, Orlando, Florida
	Douglas W. Jones, An empirical comparison of priority-queue and event-set implementations, Communications of the ACM, v.29 n.4, p.300-311, April 1986
	Gerald Paul, A Complexity O(1) priority queue for event driven molecular dynamics simulations, Journal of Computational Physics, v.221 n.2, p.615-625, February, 2007

INDEX TERMS