Before revision:  For probabilistic recurrences, our approach can derive tighter bounds than the  well-established methods of and for classical algorithmssuch as quick sort, quick select, and randomized diameter computation .
After revision:  For probabilistic recurrences, our approach can derive tighter bounds than the Karp's well-established methods of and for classical algorithmssuch as quick sort, quick select, and randomized diameter computation .