Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-07T05:53:59.304Z Has data issue: false hasContentIssue false
  • English
  • Français

Functional Pearls Efficient sets—a balancing act

Part of: JFP Research Articles

Published online by Cambridge University Press:  07 November 2008

Stephen Adams
Stephen Adams
Affiliation:
Electronics and Computer Science Department, University of Southampton, UK
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Articles
Information
Journal of Functional Programming , Volume 3 , Issue 4 , October 1993 , pp. 553 - 561
Copyright
Copyright © Cambridge University Press 1993

References

Adams, S. R. (1992) An efficient functional implementatation of sets. Report CSTR 92–10, Electronics and Computer Science, University of Southampton.Google Scholar
Adel'son-Vel'skii, G. M. and Landis, Y. M. (1962) An algorithm for the organization of information, Dokl. Akad. Nauk SSSR 146, 263–266 (in Russian). English translation in Soviet Math. Dokl. 3, 1962, 1259–1262.Google Scholar
Aho, A. V, Hopcroft, J. E. and Ullman, J. D. (1974) The Design and Analysis of Computer Algorithms. Addison-Wesley.Google Scholar
Crane, C. A. (1972) Linear lista and priotity queues as balanced binary trees. PhD Thesis, Stanford University.Google Scholar
Knuth, D. E. (1973) The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley.Google Scholar
Nievergelt, J. and Reingold, E. M. (1973) Binary search trees of bounded balance, SIAM J. Computing 2(1).CrossRefGoogle Scholar
Submit a response

Discussions

No Discussions have been published for this article.