Two applications of a probabilistic search technique: Sorting X+Y and building balanced search trees

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1975, Pages 240-244

  Fredman, Michael L ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84993532110     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. L.H. Harper, T.H. Payne, J.E. Savage, E. Strauss, "Sorting X + Y", to appear in Comm. ACM.
2. D.E. Knuth, "Optimum Binary Search Trees", Acta Informatics 1, 1971, 14-25.
3. T.C. Hu, A.C. Tucker, "Optimum Binary Search Trees", SIAM J. Applied Math. 21:4, 1971, 514-532.
4. D.E. Knuth, Fundamental Algorithms, Addison-Wesley, Reading, Mass., 1968.
5. D.E. Knuth, Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.
6. W.A. Walker, C.C. Gotlieb, Graph Theory and Computing, (edited by R.C. Read), Academic Press, 1972.
7. P. Erdos, J. Spencer, Probabilistic Methods in Combinatorics, Akademiai Kiado, 1974.