Functional data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1129, Issue , 1996, Pages 131-158

  Okasaki, Chris ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84941149943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61628-4_5     Document Type: Conference Paper

References (27)

1. Stephen Adams. Efficient sets—a balancing act. Journal of Functional Programming, 3(4):553-561, October 1993.
2. Gerth Stolting Brodal and Chris Okasaki. Optimal purely functional priority queues. Journal of Functional Programming, 6(6), December 1996. To appear.
3. F. Warren Burton. An efficient functional implementation of FIFO queues. Information Processing Letters, 14(5):205-206, July 1982.
4. Seonghun Cho and Sartaj Sahni. Weight biased leftist trees and modified skip lists. In International Computing and Combinatorics Conference, page ??, June 1996.
5. Tyng-Ruey Chuang and Benjamin Goldberg. Real-time deques, multihead Turing machines, and purely functional programming. In Conference on Functional Programming Languages and Computer Architecture, pages 289-298, June 1993.
6. Clark Allan Crane. Linear lists and priority queues as balanced binary trees. PhD thesis, Computer Science Department, Stanford University, February 1972. Available as STAN-CS-72-259.
7. James R. Driscoll, Neil Sarnak, Daniel D. K. Sleator, and Robert E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, February 1989.
8. Michael L. Fredman, Robert Sedgewick, Daniel D. K. Sleator, and Robert E. Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1(1):111-129, 1986.
9. David Gries. The Science of Programming. Texts and Monographs in Computer Science. Springer-Verlag, New York, 1981.
10. Robert Hood. The Efficient Implementation of Very-High-Level Programming Language Constructs. PhD thesis, Department of Computer Science, Cornell University, August 1982. (Cornell TR 82-503).
11. Robert Hood and Robert Melville. Real-time queue operations in pure Lisp. Information Processing Letters, 13(2):50-53, November 1981.
12. Rob R. Hoogerwoord. A symmetric set of efficient list operations. Journal of Functional Programming, 2(4):505-513, October 1992.
13. John Hughes. A novel representation of lists and its application to the function "reverse". Information Processing Letters, 22(3):141-144, March 1986.
14. John Hughes. The design of a pretty-printing library. In First International Spring School on Advanced Functional Programming Techniques, volume 519 of LNCS, pages 53-96. Springer-Verlag, May 1995.
15. Douglas W. Jones. An empirical comparison of priority-queue and event-set implementations. Communications of the ACM, 29(4):300-311, April 1986.
16. Haim Kaplan and Robert E. Tarjan. Persistent lists with catenation via recursive slow-down. In ACM Symposium on Theory of Computing, pages 93-102, May 1995.
17. David J. King. Functional binomial queues. In Glasgow Workshop on Functional Programming, pages 141-150, September 1994.
18. Donald E. Knuth. Searching and Sorting, volume 3 of The Art of Computer Programming. Addison-Wesley, 1973.
19. Andrew M. Liao. Three priority queue applications revisited. Algorithmica, 7(4):415-427, 1992.
20. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. The MIT Press, Cambridge, Massachusetts, 1990.
21. Bernard M. E. Moret and Henry D. Shapiro. An empirical analysis of algorithms for constructing a minimum spanning tree. In Workshop on Algorithms and Data Structures, volume 519 of LNCS, pages 400-411. Springer-Verlag, August 1991.
22. Chris Okasaki. Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking. In IEEE Symposium on Foundations of Computer Science, pages 646-654, October 1995.
23. Chris Okasaki. Simple and efficient purely functional queues and deques. Journal of Functional Programming, 5(4):583-592, October 1995.
24. Chris Okasaki. The role of lazy evaluation in amortized data structures. In ACM SIGPLAN International Conference on Functional Programming, pages 62-72, May 1996.
25. David A. Schmidt. Detecting global variables in denotational specifications. ACM Transactions on Programming Languages and Systems, 7(2):299-310, April 1985.
26. John T. Stasko and Jeffrey S. Vitter. Pairing heaps: experiments and analysis. Communications of the ACM, 30(3):234-249, March 1987.
27. Robert E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, 6(2):306-318, April 1985.