Affiliation:
1. Univ. of Iowa, Iowa City
Abstract
Execution times for a variety of priority-queue implementations are compared under the hold model, showing many to be faster than implicit heaps.
Publisher
Association for Computing Machinery (ACM)
Cited by
107 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献