Functional pearl: Explaining binomial heaps

Journal of Functional Programming

Volumn 9, Issue 1, 1999, Pages 93-104

  Hinze, Ralf ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033424399     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796899003317     Document Type: Article

References (18)

1. Brodai, G. S. and Okasaki, C. (1996) Optimal purely functional priority queues. J. Functional Programming, 6(6), 839-857.
2. Brown, M. R. (1978) Implementation and analysis of binomial queue algorithms. SIAM J. Computing, 7(3), 298-319.
3. Buchsbaum, A. L. (1993) Data-structural bootstrapping and catenable deques. PhD thesis, Department of Computer Science, Princeton University.
4. Carlsson, S., Munro, J. I. and Poblete, P. V. (1988) An implicit binomial queue with constant insertion time. Proceedings of 1st Scandinavian workshop on algorithm theory: Lecture Notes in Computer Science 318, pp. 1-13. Springer-Verlag.
5. Cormen, T. H., Leiserson, C. E. and Rivest, R. L. (1991) Introduction to algorithms. MIT Press.
6. Høyer, P. (1994) A general technique for implementation of efficient priority queues. Technical report PP-1994-33, Department of Mathematics and Computer Science, Odense University.
7. Jones, M. P. (1995) A system of constructor classes: overloading and implicit higher-order polymorphism. J. Functional Programming, 5(1), 1-35.
8. Khoong, C. M. and Leong, H. W. (1993) Double-ended binomial queues. Proceedings 4th International Symposium ISAAC'93. Lecture Notes in Computer Science 762, pp. 128-137. Springer-Verlag.
9. King, D. J. (1994) Functional binomial queues. In: Hammond, K., Turner, D. N. and Sansom, P. M. (eds.), Glasgow Functional Programming Workshop. Ayr, Scotland. Springer-Verlag.
10. King, D. J. (1996) Functional programming and graph algorithms. PhD thesis, Department of Computer Science, University of Glasgow.
11. Knuth, D. E. (1968) The Art of Computer Programming, Volume 1: Fundamental algorithms. Addison-Wesley.
12. Knuth, D. E. (1973) The Art of Computer Programming, Volume 3: Sorting and searching. Addison-Wesley.
13. Myers, E. W. (1983) An applicative random-access stack. Information Processing Letters, 17(5), 241-248.
14. Okasaki, C. (1996a) Purely functional data structures. PhD thesis, School of Computer Science, Carnegie Mellon University.
15. Okasaki, C. (1996b) The role of lazy evaluation in amortized data structures. ACM SIGPLAN International Conference on Functional Programming, pp. 62-72.
16. Peterson, J. and Hammond, K. (1997) Report on the programming language Haskell 1.4, a non-strict, purely functional language. Research Report YALEU/DCS/RR-1106, Yale University, Department of Computer Science.
17. Sack, J.-R. and Strothotte, T. (1990) A characterization of heaps and its applications. Information and Computation, 86(1), 69-86.
18. Vuillemin, J. (1978) A data structure for manipulating priority queues. Communications of the ACM, 21(4), 309-315.