A Simple Implementation Technique for Priority Search Queues

A Simple Implementation Technique for Priority Search Queues (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ralf Hinze

Venue:	Proceedings of the 2001 International Conference on Functional Programming
Citations:	7 - 2 self

BibTeX

@INPROCEEDINGS{Hinze01asimple,
    author = {Ralf Hinze},
    title = {A Simple Implementation Technique for Priority Search Queues},
    booktitle = {Proceedings of the 2001 International Conference on Functional Programming},
    year = {2001},
    pages = {110--121},
    publisher = {Press}
}

Bookmark

OpenURL

Abstract

This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation supports logarithmic access to a binding with a given key and constant access to a binding with the minimum value. Priority search queues can be used, for instance, to give a simple, purely functional implementation of Dijkstra's single-source shortest-paths algorithm.

Citations

605	The art of computer programming, volume 3: Sorting and searching - Knuth - 1973
299	The Art of Computer Programming, volume 1 (Fundamental Algorithms - Knuth - 1973
275	Functional Programming with Bananas, Lenses, Envelopes and Barbed - Meijer, Fokkinga, et al. - 1991
212	A dichromatic framework for balanced trees - Guibas, Sedgewick - 1978
196	Purely Functional Data Structures - Okasaki - 1998
156	Priority search trees - McCreight - 1985
154	An algorithm for the organization of information - Adelson-Velskii, Landis - 1962
119	Views: A way for pattern matching to cohabit with data abstraction - Wadler - 1987
107	A fold for all seasons - Sheard, Fegaras - 1993
95	Report on Haskell 98: A non-strict, purely functional language - Jones, Hughes - 1999
94	A new data structure for representing sorted lists - Huddleston, Mehlhorn - 1982
84	A data structure for manipulating priority queues - Vuillemin - 1978
83	A unifying look at data structures - Vuillemin - 1980
19	Views for Standard ML - Okasaki - 1998
19	Breadth-First Numbering: Lessons from a Small Exercise - Okasaki - 2000
11	A logarithmic implementation of flexible arrays. Memorandum MR83/4 - Braun, Rem - 1983
9	Constructing Red-Black Trees - Hinze - 1999
9	Functional Pearls: Efficient sets—a balancing act - Adams - 1993
8	A log log n data structure for three-sided range queries - Fries, Mehlhorn, et al. - 1987
7	Views: An Extension to Haskell Pattern Matching. Available from http://www.haskell.org/development/views.html - Burton, Meijer, et al. - 1996
7	A characterization of heaps and its applications - Sack, Strothotte - 1990
6	Functional Programming and Graph Algorithms - King - 1996
5	Functional Pearls: Efficient sets – a balancing act - Adams - 1993
5	Functional Pearl: Explaining binomial heaps - Hinze - 1999
4	Functional Pearl: Red-Black trees in a functional setting - Okasaki - 1999
2	Constructing red-black trees. Okasaki, C. (ed - Hinze - 1999
2	A new data structure for representing sorted lists. Acta Informatica 17:157–184 - Huddleston, Mehlhorn - 1982
2	Functional Pearls: E#cient sets---a balancing act - Adams - 1993
2	A logarithmic implementation of arrays. Memorandum MR83/4 - Braun - 1983
1	Functional Pearh Explaining binomial heaps - Hinze - 1999
1	Breadth-first numbering: lessons fi'om a small exercise in algorithm design - Okasaki - 2000
1	editors. Haskell 93 A Non-strict, Purely Functional Language - Jones, Hughes - 1999
1	A Simple Implementation Technique for Priority Search Queues 25 - McCreight - 1985
1	Views for Standard ML. The 1998 - Okasaki - 1998
1	A characterization of heaps and its applications. Information and Computation 86(1):69–86 - Sack, Strothotte - 1990
1	Data Structures, Algorithms, and Performance. Addison-Wesley Publishing Company. A Auxiliary types and functions This appendix lists auxiliary types and functions used in the paper. All of them with the notable exception of foldm are predefined in Haskell - Wood - 1993