Fischer, Michael J. and Paterson, Michael S. (1994) Fishspear : a priority queue algorithm. Journal of the ACM, Volume 41 (Number 1). pp. 3-30. doi:10.1145/174644.174645 ISSN 0004-5411.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

Abstract

The Fishspear priority queue algorithm is presented and analyzed. Fishspear is comparable to the usual heap algorithm in its worst-case running time, and its relative performance is much better in many common situations. Fishspear also differs from the heap method in that it can be implemented efficiently using sequential storage such as stacks or tapes, making it potentially attractive for implementation of very large queues on paged memory systems.

Item Type:	Journal Article
Alternative Title:
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Journal or Publication Title:	Journal of the ACM
Publisher:	Association for Computing Machinery, Inc.
ISSN:	0004-5411
Official Date:	January 1994
Dates:	Date Event January 1994 Published
Volume:	Volume 41
Number:	Number 1
Number of Pages:	28
Page Range:	pp. 3-30
DOI:	10.1145/174644.174645
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Version or Related Resource:	Fischer, M.J. and Paterson, M.S. (1992). Fishspear : a priority queue algorithm. University of Warwick. Department of Computer Science. (Department of Computer Science research report, 221)
Related URLs:	Related item in WRAP

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item