Andrew Chi-Chih Yao
A study of concrete computational complexity
Lower bounds on merging networks
On a problem of Katona on minimal separating systems
On computing the rank function for a set of vectors
On random 3-2 trees
On the evaluation of powers
An O(/E/loglog/V/) algorithm for finding minimum spanning trees- An O(/E/loglog/V/) algorithm for finding minimum spanning trees