Roberto Tamassia . On embedding a graph in the grid with the minimum number of bends. Sam Toueg , Kenneth J. Perry , and T. K. Srikanth . Fast distributed agreement. Yossi Azar and Uzi Vishkin .
Tight comparison bounds on the complexity of parallel sorting.
Yuri Gurevich and Saharon Shelah . Expected computation time for Hamiltonian path problem. Weighted leaf AVL-trees. Christos H. Papadimitriou and Mihalis Yannakakis . The complexity of reliable concurrency control.