. . "Abstract: \"Breu [1] has given an algorithm for finding the maximum value between two pointers moving unidirectionally through an array. His algorithm achieves O(1) amortized time per operation. This paper describes how to eliminate the amortization from his algorithm, achieving O(1) worst-case time per operation.\""@en . "Elimination of amortization from Breu's algorithm" . "Elimination of amortization from Breu's algorithm"@en . . . . . . . . .