A paradigm for running distributed algorithms. Omer Berkman , Baruch Schieber , and Uzi Vishkin . Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. The parallel simplicity of compaction and chaining. Convex hulls for random lines.
Linear optimization queries.
Yishay Mansour and Boaz Patt-Shamir . Greedy packet scheduling on shortest paths. On the set LCS and set-set LCS problems. Bala Kalyanasundaram and Kirk Pruhs . Online weighted matching.