A Survey of Analysis Techniques for Discrete Algorithms
- 1 December 1977
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 9 (4) , 291-313
- https://doi.org/10.1145/356707.356711
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Finding the medianJournal of Computer and System Sciences, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Expected time bounds for selectionCommunications of the ACM, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- An analysis of alpha-beta pruningArtificial Intelligence, 1975
- On the time required to recognize properties of graphsACM SIGACT News, 1973
- A Note on Dijkstra's Shortest Path AlgorithmJournal of the ACM, 1973
- On the Optimality of Some Set AlgorithmsJournal of the ACM, 1972
- Algorithm 245: TreesortCommunications of the ACM, 1964