ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Remark on “Algorithm 489: The Algorithm SELECT—for Finding the ith Smallest of n Elements [M1]”
Full text PdfPdf (231 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 ,  Issue 3  (September 1976) table of contents
Pages: 301 - 304  
Year of Publication: 1976
ISSN:0098-3500
Author
Theodore Brown  Department of Computer Science, Queens College of the City of New York, Flushing, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355694.355704
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BULTHEEL, A. Remark on Algorithm 450. Comm. ACM 17, 8 (Aug. 1974), 470.
 
2
ROSENBROCK, H H. An automatic method for finding the greatest or least value of a function. Computer J. 3 (1960), 175-184.
 
3
Box, M.J. A comparison of several current optimization methods and the use of transformations in constrained problems Computer J. 9 (1966), 67-77.
1
Robert W. Floyd , Ronald L. Rivest, Expected time bounds for selection, Communications of the ACM, v.18 n.3, p.165-172, March 1975  [doi>10.1145/360680.360691]
2
W. D. Frazer , A. C. McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, Journal of the ACM (JACM), v.17 n.3, p.496-507, July 1970  [doi>10.1145/321592.321600]
3
C. A. R. Hoare, Algorithm 63: partition, Communications of the ACM, v.4 n.7, p.321, July 1961  [doi>10.1145/366622.366642]

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS


General Terms:
Algorithms, Theory


The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player