Leaf trees

Science of Computer Programming

Volumn 26, Issue 1-3, 1996, Pages 149-165

  Kaldewaij, Anne ^a   Dielissen, Victor J ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTER PROGRAMMING; FUNCTIONS; PROGRAMMING THEORY;

ABSTRACT DATATYPES; DECOMPOSABILITY; DIVIDE AND CONQUER TECHNIQUES; LEAF TREES;

DATA STRUCTURES;

EID: 0030143239     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(95)00026-7     Document Type: Article

References (13)

1. J.L. Bentley, Decomposable searching problems, Inform. Process. Lett. 8 (1979) 244-251.
2. W. Braun and M. Rem, A logarithmic implementation of flexible arrays, Memorandum MR83/4, University of Technology Eindhoven, 1983.
3. D.J. Challab, Implementation of flexible arrays using balanced trees, Comput. J., 34(5) (1991) 386-396.
4. E.W. Dijkstra, A Discipline of Programming (Prentice-Hall, Englewood Cliffs, NJ, 1976).
5. R.R. Hoogerwoord, A logarithmic implementation of flexible arrays, in: R.S. Bird, C.C. Morgan and J.C.P. Woodcock, eds., Mathematics of Program Construction: Proc. 2nd Internat. Conf., Oxford, UK, 1992; Lecture Notes in Computer Science, Vol. 669 (Springer, Berlin, 1993) 191-207.
6. A. Kaldewaij, Programming, The Derivation of Algorithms, Prentice-Hall International Series in Computer Science, 1990, 67-69.
7. A. Kaldewaij and V.J. Dielissen, Decomposable functions and leaf trees: a systematic approach, in: E.-R. Olderog, ed., Proc. IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conf. on Programming Concepts, Methods and Calculi (PROCOMET'94), San Miniato, Italy, 1994 (Elsevier, Amsterdam, 1994) 3-17.
8. D.E. Knuth, The Art of Computer Programming 3: Sorting and Searching (Addison-Wesley, Reading, MA, 1973).
9. H.R. Lewis and L. Denenberg, Data Structures and Their Algorithms (Harper Collins Publishers, 1991).
10. C.H. Lindsey, ALGOL-68 with fewer tears, Algol Bulletin 28 (1968), Science Reference Library, London, UK.
11. M.H. Overmars, Dynamization of order decomposable set problems, J. Algorithms 2 (1981) 245-260.
12. P. Wadler, Linear types can change the world!, in: M. Broy and C.B. Jones, eds., Programming Concepts and Methods (North-Holland, Amsterdam, 1990) 561-581.
13. D. Wood, Data structures, Algorithms, and Performance (Addison-Wesley, Reading, MA, 1993).