A simple implementation technique for priority search queues

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2001, Pages 110-121

  Hinze, R ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Haskell; Priority search queues; Tournament; Views

Indexed keywords

COMPUTER PROGRAMMING; DATA STRUCTURES; HEURISTIC METHODS; HIGH LEVEL LANGUAGES; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS); SEMANTICS;

FUNCTIONAL PROGRAMMING; HASKELL; PRIORITY SEARCH QUEUES; TOURNAMENT;

ALGORITHMS;

EID: 0034771899     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/507647.507650     Document Type: Conference Paper

References (23)

1. Functional pearls: Efficient sets - A balancing act
2. An algorithm for the organization of information
3. A logarithmic implementation of flexible arrays
4. Views: An extension to Haskell pattern matching
5. A log log n data structure for three-sided range queries
6. A dichromatic framework for balanced trees
7. Constructing red-black trees
8. Functional pearl: Explaining binomial heaps
9. A simple implementation technique for priority search queues
10. A new data structure for representing sorted lists
11. Priority search trees
12. Views for standard ML
13. Functional pearl: Red-black trees in a functional setting
14. Breadth-first numbering: Lessons from a small exercise in algorithm design
15. A characterization of heaps and its applications
16. A data structure for manipulating priority queues
17. A unifying look at data structures
18. Views: A way for pattern matching to cohabit with data abstraction