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
Algorithm 63: partition
Full text PdfPdf (406 KB)
Source
Communications of the ACM archive
Volume 4 ,  Issue 7  (July 1961) table of contents
Page: 321  
Year of Publication: 1961
ISSN:0001-0782
Author
C. A. R. Hoare  Elliott Brothers Ltd., Hertfordshire, England, U.K.
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 105,   Citation Count: 28
Additional Information:

cited by   collaborative colleagues  

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/366622.366642
What is a DOI?

CITED BY  28
Marc Daumas , Paraskevas Evripidou, Parallel Implementations of the Selection Problem: A Case Study, International Journal of Parallel Programming, v.28 n.1, p.103-131, February 2000
Richard C. Singleton, Algorithm 347: an efficient algorithm for sorting with minimal storage [M1], Communications of the ACM, v.12 n.3, p.185-186, March 1969
J. Morris, ACM Algorithm 346: F-Test Probabilities, Communications of the ACM, v.12 n.3, p.184-185, March 1969
W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971
Guy E. Blelloch , Jonathan C. Hardwick , Siddhartha Chatterjee , Jay Sipelstein , Marco Zagha, Implementation of a portable nested data-parallel language, ACM SIGPLAN Notices, v.28 n.7, p.102-111, July 1993
Gary A. Hyslop , Edmund A. Lamagna, An application of the method of Buckets to the selection problem, Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's, p.1167-1172, March 1992, Kansas City, Missouri, United States
Seth Pettie , Vijaya Ramachandran, Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.713-722, January 06-08, 2002, San Francisco, California
J. M. Chambers, Algorithm 410 Partial sorting, Communications of the ACM, v.14 n.5, p.357-358, May 1971
John F. Monahan, Algorithm 616: fast computation of the Hodges-Lehmann location estimator, ACM Transactions on Mathematical Software (TOMS), v.10 n.3, p.265-270, Sept. 1984
Theodore Brown, Remark on “Algorithm 489: The Algorithm SELECT—for Finding the ith Smallest of n Elements [M1]”, ACM Transactions on Mathematical Software (TOMS), v.2 n.3, p.301-304, Sept. 1976
J. Nievergelt, Binary search trees and file organization, Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control, p.165-187, January 1972
J. Nievergelt, Binary Search Trees and File Organization, ACM Computing Surveys (CSUR), v.6 n.3, p.195-207, Sept. 1974
Dalia Motzkin, Pracniques: Meansort, Communications of the ACM, v.26 n.4, p.250-251, April 1983
W. A. Martin , D. N. Ness, Optimizing binary trees grown with a sorting algorithm, Communications of the ACM, v.15 n.2, p.88-93, Feb. 1972
Jacques J. Arsac, Syntactic source to source transforms and program manipulation, Communications of the ACM, v.22 n.1, p.43-54, Jan. 1979
Rudolf Loeser, Survey on Algorithms 347, 426, and Quicksort, ACM Transactions on Mathematical Software (TOMS), v.2 n.3, p.290-299, Sept. 1976
Jonathan C. Hardwick, Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.239-248, June 23-25, 1997, Newport, Rhode Island, United States
Robert W. Floyd , Ronald L. Rivest, Expected time bounds for selection, Communications of the ACM, v.18 n.3, p.165-172, March 1975
Jing-Chao Chen, Proportion split sort, Nordic Journal of Computing, v.3 n.3, p.271-279, Fall 1996
Robert W. Floyd , Ronald L. Rivest, Algorithm 489: the algorithm SELECT—for finding the ith smallest of n elements [M1], Communications of the ACM, v.18 n.3, p.173, March 1975
M. Colebrook , J. Gutiérrez , J. Sicilia, A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks, Computers and Operations Research, v.32 n.2, p.309-325, February 2005
Marc Daumas , Paraskevas Evripidou, Results of Parallel Implementations of the Selection Problem Using Sisal, Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, p.265-272, January 20-22, 1993
Brian C. Dean, A simple expected running time analysis for randomized "divide and conquer" algorithms, Discrete Applied Mathematics, v.154 n.1, p.1-5, 1 January 2006
Markus Hegland, Implementing partition on vector computers, Proceedings of the 5th international conference on Supercomputing, p.304-311, June 17-21, 1991, Cologne, West Germany
Tina Yu, Hierarchical Processing for Evolving Recursive and Modular Programs Using Higher-Order Functions and Lambda Abstraction, Genetic Programming and Evolvable Machines, v.2 n.4, p.345-380, December 2001
Gerth Stølting Brodal , Rolf Fagerberg , Gabriel Moruz, On the adaptiveness of Quicksort, Journal of Experimental Algorithmics (JEA), 12, June 2008
Fritz Henglein, Generic discrimination: sorting and paritioning unshared data in linear time, ACM SIGPLAN Notices, v.43 n.9, September 2008
Umamaheswari C. Devi , J. H. Anderson, Tardiness bounds under global EDF scheduling on a multiprocessor, Real-Time Systems, v.38 n.2, p.133-189, February 2008
Collaborative Colleagues:
C. A. R. Hoare: colleagues

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