| Article ID: | iaor19921908 |
| Country: | United States |
| Volume: | 34 |
| Issue: | 3 |
| Start Page Number: | 616 |
| End Page Number: | 625 |
| Publication Date: | Jul 1987 |
| Journal: | Journal of the Association for Computing Machinery |
| Authors: | Hirschberg D.S., Larmore L.L. |
| Keywords: | computational analysis |
Presented are several algorithms whose operations are governed by a principle of failure functions: When searching for an extremal value within a sequence, it suffices to consider only the subsequence of items each of which is the first possible improvement of its predecessor. These algorithms are more efficient than their more traditional counterparts.