Optimal purely functional priority queues

Journal of Functional Programming

Volumn 6, Issue 6, 1996, Pages 839-857

  Brodal, Gerth Stølting ^a   Okasaki, Chris ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030328722     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S095679680000201X     Document Type: Article

References (31)

1. Brodal, G. S. (1995) Fast meldable priority queues. Workshop on Algorithms and Data Structures: Lecture Notes in Computer Science 955 pp. 282-290. Springer-Verlag.
2. Brodal, G. S. (1996) Worst-case priority queues. ACM-SIAM Symposium on Discrete Algorithms pp. 52-58.
3. Brown, M. R. (1978) Implementation and analysis of binomial queue algorithms. SIAM J. Computing 7(3):298-319.
4. Buchsbaum, A. L. and Tarjan, R. E. (1995) Confluently persistent deques via data structural bootstrapping. J. Algorithms 18(3):513-547.
5. Buchsbaum, A. L., Sundar, R. and Tarjan, R. E. (1995) Data-structural bootstrapping, linear path compression, and catenable heap-ordered double-ended queues. SIAM J. Computing 24(6):1190-1206.
6. Crane, C. A. (1972) Linear lists and priority queues as balanced binary trees. PhD thesis, Computer Science Department, Stanford University. (Available as STAN-CS-72-259.)
7. Driscoll, J. R., Sarnak, N., Sleator, D. D. K. and Tarjan, R. E. (1989) Making data structures persistent. J. Computer and System Sciences 38(1):86-124.
8. Fredman, M. L. and Tarjan, R. E. (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3):596-615.
9. Fredman, M. L., Sedgewick, R., Sleator, D. D. K. and Tarjan, R. E. (1986) The pairing heap: A new form of self-adjusting heap. Algorithmica 1(1):111-129.
10. Hood, R. (1982) The Efficient Implementation of Very-High-Level Programming Language Constructs. PhD thesis, Department of Computer Science, Cornell University. (Available as Cornell TR 82-503.)
11. Hoogerwoord, R. R. (1992) A logarithmic implementation of flexible arrays. Conference on Mathematics of Program Construction: Lecture Notes in Computer Science 669 pp. 191-207. Springer-Verlag.
12. Hudak, P., Peyton Jones, S., Wadler, P., Boutel, B., Fairbairn, J., Fasel, J., Guzmán, M., Hammond, K., Hughes, J., Johnsson, T., Kieburtz, D., Nikhil, R., Partain, W. and Peterson, J. (1992) Report on the functional programming language Haskell, Version 1.2. SIGPLAN Notices 27(5).
13. Jones, D. W. (1986) An empirical comparison of priority-queue and event-set implementations. Comm. ACM 29(4):300-311.
14. Kaldewaij, A. and Schoenmakers, B. (1991) The derivation of a tighter bound for top-down skew heaps. Information Processing Letters 37(5):265-271.
15. Kaplan, H. and Tarjan, R. E. (1995) Persistent lists with catenation via recursive slow-down. ACM Symposium on Theory of Computing pp. 93-102.
16. King, D. J. (1994) Functional binomial queues. Glasgow Workshop on Functional Programming pp. 141-150.
17. MacQueen, D. B. and Tofte, M. (1994) A semantics for higher-order functors. European Symposium on Programming pp. 409-423.
18. Milner, R., Tofte, M. and Harper, R. (1990) The Definition of Standard ML. The MIT Press.
19. Myers, E. W. (1983) An applicative random-access stack. Information Processing Letters 17(5):241-248.
20. Okasaki, C. (1995a) Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking. IEEE Symposium on Foundations of Computer Science pp. 646-654.
21. Okasaki, C. (1995b) Purely functional random-access lists. Conference on Functional Programming Languages and Computer Architecture pp. 86-95.
22. Okasaki, C. (1995c) Simple and efficient purely functional queues and deques. J. Functional Programming 5(4):583-592.
23. Okasaki, C. (1996) The role of lazy evaluation in amortized data structures. ACM SIGPLAN International Conference on Functional Programming pp. 62-72.
24. Paulson, L. C. (1991) ML for the Working Programmer. Cambridge University Press.
25. Schoenmakers, B. (1992) Data Structures and Amortized Complexity in a Functional Setting. PhD thesis, Eindhoven University of Technology.
26. Sleator, D. D. K. and Tarjan, R. E. (1985) Self-adjusting binary search trees. J. ACM, 32(3):652-686.
27. Sleator, D. D. K. and Tarjan, R. E. (1986) Self-adjusting heaps. SIAM J. Computing 15(1):52-69.
28. Tarjan, R. E. (1983) Data Structures and Network Algorithms. CBMS Regional Conference Series in Applied Mathematics, vol. 44. Society for Industrial and Applied Mathematics.
29. Vuillemin, J. (1978) A data structure for manipulating priority queues. Comm. ACM 21(4) :309-315.
30. Wadler, P. (1990) Linear types can change the world! Proceedings of the IFIP TC 2 Working Conference on Programming Concepts and Methods pp. 561-581.
31. Williams, J. W. J. (1964) Algorithm 232: Heapsort. Comm. ACM 7(6):347-348.