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 65: find
Full text PdfPdf (406 KB)
Source
Communications of the ACM archive
Volume 4 ,  Issue 7  (July 1961) table of contents
Pages: 321 - 322  
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): 13,   Downloads (12 Months): 60,   Citation Count: 35
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.366647
What is a DOI?

CITED BY  35
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
Donald I. Good, Provable programming, ACM SIGPLAN Notices, v.10 n.6, p.411-419, June 1975
Richard J. Waldinger , Karl N. Levitt, Reasoning about programs, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.169-182, October 01-03, 1973, Boston, Massachusetts
Salvador Roura, Improved master theorems for divide-and-conquer recurrences, Journal of the ACM (JACM), v.48 n.2, p.170-205, March 2001
Walter Cunto , J. Ian Munro, Average case selection, Journal of the ACM (JACM), v.36 n.2, p.270-279, April 1989
Richard A. DeMillo , Hsin Pan , Eugene H. Spafford, Critical slicing for software fault localization, ACM SIGSOFT Software Engineering Notes, v.21 n.3, p.121-134, May 1996
Christian A. Lang , Ambuj K. Singh, Modeling high-dimensional index structures using sampling, ACM SIGMOD Record, v.30 n.2, p.389-400, June 2001
Robert S. Boyer , Bernard Elspas , Karl N. Levitt, SELECT—a formal system for testing and debugging programs by symbolic execution, ACM SIGPLAN Notices, v.10 n.6, p.234-245, June 1975
Manuel Blum , Robert W. Floyd , Vaughan Pratt , Ronald L. Rivest , Robert E. Tarjan, Linear time bounds for median computations, Proceedings of the fourth annual ACM symposium on Theory of computing, p.119-124, May 01-03, 1972, Denver, Colorado, United States
C. A. R. Hoare, Proof of a program: FIND, Communications of the ACM, v.14 n.1, p.39-45, Jan. 1971
Simeon C. Ntafos, An evaluation of required element testing strategies, Proceedings of the 7th international conference on Software engineering, p.250-256, March 26-29, 1984, Orlando, Florida, United States
Alois Panholzer, Analysis of multiple quickselect variants, Theoretical Computer Science, v.302 n.1-3, p.45-91, 13 June 2003
Conrado Martínez , Daniel Panario , Alfredo Viola, Adaptive sampling for quickselect, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 11-14, 2004, New Orleans, Louisiana
Naga K. Govindaraju , Brandon Lloyd , Wei Wang , Ming Lin , Dinesh Manocha, Fast computation of database operations using graphics processors, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
Leonard H. Weiner, The roots of structured programming, ACM SIGCSE Bulletin, v.10 n.1, February 1978
Richard A. DeMillo , Richard J. Lipton , Alan J. Perlis, Social processes and proofs of theorems and programs, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.206-214, January 17-19, 1977, Los Angeles, California
Jesper Bojesen , Jyrki Katajainen , Maz Spork, Performance engineering case study: heap construction, Journal of Experimental Algorithmics (JEA), 5, p.15-es, 2000
Walter Cunto , J. Ian Munro, Average case selection, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.369-375, December 1984
Cliff B. Jones, The Early Search for Tractable Ways of Reasoning about Programs, IEEE Annals of the History of Computing, v.25 n.2, p.26-49, April 2003
Krzysztof C. Kiwiel, On Floyd and Rivest's SELECT algorithm, Theoretical Computer Science, v.347 n.1-2, p.214-238, 30 November 2005
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
Markus Kuba, On quickselect, partial sorting and multiple quickselect, Information Processing Letters, v.99 n.5, p.181-186, 15 September 2006
Ahmed Metwally , Divyakant Agrawal , Amr El Abbadi, An integrated efficient solution for computing frequent and top-k elements in data streams, ACM Transactions on Database Systems (TODS), v.31 n.3, p.1095-1133, September 2006
Wei-Mei Chen, Probabilistic analysis of algorithms for the Dutch national flag problem, Theoretical Computer Science, v.341 n.1, p.398-410, 5 September 2005
Prosenjit Bose , Anil Maheshwari , Pat Morin , Jason Morrison , Michiel Smid , Jan Vahrenhold, Space-efficient geometric divide-and-conquer algorithms, Computational Geometry: Theory and Applications, v.37 n.3, p.209-227, August, 2007
Naga K. Govindaraju , Brandon Lloyd , Wei Wang , Ming Lin , Dinesh Manocha, Fast computation of database operations using graphics processors, ACM SIGGRAPH 2005 Courses, July 31-August 04, 2005, Los Angeles, California
Tien-Ching Lin , D. T. Lee, Randomized algorithm for the sum selection problem, Theoretical Computer Science, v.377 n.1-3, p.151-156, May, 2007
Jean-Christophe Filliâtre, Formal proof of a program: Find, Science of Computer Programming, v.64 n.3, p.332-340, February, 2007
Naga K. Govindaraju , Dinesh Manocha, Efficient relational database management using graphics processors, Proceedings of the 1st international workshop on Data management on new hardware, June 12-12, 2005, Baltimore, Maryland
Rajeev Raman, A simpler analysis of algorithm 65 (find), ACM SIGACT News, v.25 n.2, p.86-89, June 1994
Hsien-Kuei Hwang , Tsung-Hsi Tsai, Quickselect and the Dickman Function, Combinatorics, Probability and Computing, v.11 n.4, p.353-371, July 2002
Todd Eavis , Alex Lopez, Rk-hist: an r-tree based histogram for multi-dimensional selectivity estimation, Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, November 06-10, 2007, Lisbon, Portugal
T. A. Linden, A summary of progress toward proving program correctness, Proceedings of the December 5-7, 1972, fall joint computer conference, part I, December 05-07, 1972, Anaheim, California
Mauricio Marin , Rodrigo Paredes , Carolina Bonacic, High-performance priority queues for parallel crawlers, Proceeding of the 10th ACM workshop on Web information and data management, October 30-30, 2008, Napa Valley, California, USA
Conrado Martínez , Helmut Prodinger, Note: Moves and displacements of particular elements in Quicksort, Theoretical Computer Science, v.410 n.21-23, p.2279-2284, May, 2009
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