Finger trees: A simple general-purpose data structure

Journal of Functional Programming

Volumn 16, Issue 2, 2006, Pages 197-217

  Hinze, Ralf ^a   Paterson, Ross ^b  

^a UNIVERSITY OF BONN   (Germany)

^b CITY UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT TIME; FINGER TREES; FUNCTIONAL REPRESENTATION; PRIORITY QUEUES; SEARCH QUEUES; SEARCH TREES; SPLIT OPERATIONS;

DATA STRUCTURES;

FORESTRY;

EID: 31744449997     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796805005769     Document Type: Article

References (19)

1. Bird, R. and Meertens, L. (1998) Nested datatypes. In: Jeuring, J. (ed), Fourth International Conference on Mathematics of Program Construction, MPC'98, Marstrand, Sweden. Lecture Notes in Computer Science 1422, pp. 52-67. Springer-Verlag.
2. Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C. (2001) Introduction to Algorithms. 2nd ed. The MIT Press.
3. Driscoll, J. R., Sarnak, N., Sleator, D. D. and Tarjan, R. E. (1989) Making data structures persistent. J. Comput. Syst. Sci. 38(1): 86-124.
4. Guibas, L. J., McCreight, E. M., Plass, M. F. and Roberts, J. R. (1977) A new representation for linear lists. Conference Record of the Ninth Annual ACM Symposium on Theory of Computing pp. 49-60.
5. Hinze, R. and Jeuring, J. (2003) Generic Haskell: Practice and theory. In: Backhouse, R. and Gibbons, J. (eds.), Generic Programming: Advanced Lectures. Lecture Notes in Computer Science 2793, pp. 1-56. Springer-Verlag.
6. Huet, G. (1997) Functional Pearl: The Zipper. J. Funct. Program. 7(5): 549-554.
7. Kaplan, H. and Tarjan, R. E. (1995) Persistent lists with catenation via recursive slow-down. Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing pp. 93-102.
8. Kaplan, H. and Tarjan, R. E. (1996) Purely functional representations of catenable sorted lists. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing pp. 202-211.
9. McCreight, E. M. (1985) Priority search trees. SIAM J. Comput 14(2): 257-276.
10. Meertens, L. (1996) Calculate polytypically! In: Kuchen, H. and Swierstra, S. (eds.), Proceedings 8th International Symposium on Programming Languages: Implementations, Logics, and Programs PLILP'96, Aachen, Germany. Lecture Notes in Computer Science 1140, pp. 1-16. Springer-Verlag.
11. Moffat, A., Petersson, O. and Wormald, N. (1992) Sorting and/by merging finger trees. ISAAC: 3rd International Symposium on Algorithms and Computation, vol. 650, pp. 499-509.
12. Mycroft, A. (1984) Polymorphic type schemes and recursive definitions. In: Paul, M. and Robinet, B. (eds.), Proceedings of the International Symposium on Programming, 6th Colloquium, Toulouse, France. Lecture Notes in Computer Science 167, pp. 217-228.
13. Okasaki, C. (1997) Catenable double-ended queues. In: Mads Tofte (ed.), Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming. ACM SIGPLAN Not. 32(8): 66-74.
14. Okasaki, C. (1998) Purely Functional Data Structures. Cambridge University Press.
15. Okasaki, C. (2000) Breadth-first numbering: lessons from a small exercise in algorithm design. In: Philip Wadler (ed.), Proceedings of the 2000 ACM SIGPLAN International Conference on Functional Programming. ACM SIGPLAN Not. 35(9): 131-136.
16. Peyton Jones, S. (2003) Haskell 98 Language and Libraries. Cambridge University Press.
17. Peyton Jones, S., Jones, M. and Meijer, E. (1997) Type classes: Exploring the design space. Proceedings of the Haskell Workshop, Amsterdam, The Netherlands.
18. Sleator, D. D. and Tarjan, R. E. (1985) Self-adjusting binary search trees. J. ACM 32(3): 652-686.
19. Tsakalidis, A. K. (1985) AVL-trees for localized search. Infor. & Control 67: 173-194.