A simple implementation technique for priority search queues

DOI10.1145/507635.507650MaRDI QIDQ5178002zbMATH OpenOpenAlexFDO

Authors Ralf Hinze

Publication date 9 March 2015

Published in Proceedings of the sixth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/2472

zbMATH Keywords

Haskellpriority search queuestournamentviews

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Recommendations

• On RAM Priority Queues
• Worst-case efficient external-memory priority queues
• Optimal purely functional priority queues
• scientific article; zbMATH DE number 871900
• Fast meldable priority queues

Cited in

(9)

• An explicit solution for the value function of a priority queue
• New Data Structures for IP Lookup and Conflict Detection
• Fishspear: a priority queue algorithm
• Optimal purely functional priority queues
• scientific article; zbMATH DE number 1553160 (Why is no real title available?)
• A Back-to-Basics Empirical Study of Priority Queues
• scientific article; zbMATH DE number 7649972 (Why is no real title available?)
• Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra
• Priority Search Trees

This page was built for publication: A simple implementation technique for priority search queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178002)