On the Optimality of Some Set Algorithms

Journal of the ACM (JACM)

Volumn 19, Issue 4, 1972, Pages 649-659

  Reingold, Edward M ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

determining set equality; maximum of a set; optimal algorithms

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0015415680     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321724.321730     Document Type: Article

References (6)

1. Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L., and Tarjan, R. E. Linear time bounds for median computations. Proc. Fourth Ann. ACM Symp. on Theory of Computing, Denver, Colo., 1972, pp. 119-124.
2. Ford, L. R. Jr., and Johnson, S. M. A tournament problem. Amer. Math. Mon. 66 (1959), 387-389.
3. Knuth, D. E. The Art of Computer Programming, Vol. 8. Addison-Wesley, Reading, Mass. (in press), Sec. 5.3.1.
4. Rabin, M. O. Proving simultaneous positivity of linear forms. Presented at Third Annual ACM Symp. on Theory of Computing, Shaker Heights, Ohio, 1971 (unpublished).
5. Steinhaus, H. Mathematical Snapshots. Oxford U. Press, New York, 1st ed., 1950; 2nd ed., 1960.
6. Steinhaus, H. Some remarks about tournaments. Calcutta Math. Soc., Golden Jubilee Commem. Vol. (1958-1959), Pt. II, pp. 323-327.