- Andrew Chi-Chih Yao and Foong Frances Yao. Lower bounds on merging networks.
Journal of the ACM, 23(3):566-571, July 1976.
Citations.
- Andrew C. Yao and Ronald L. Rivest. k+1 heads are better than
k. Journal of the ACM, 25(2):337-340, April
1978.
Citations.
- Richard J. Lipton, Arnold L. Rosenberg, and Andrew C. Yao. External hashing schemes for
collections of data structures. Journal of the ACM,
27(1):81-95, January 1980.
- Andrew Chi-Chih Yao. New
algorithms for bin packing. Journal of the ACM,
27(2):207-227, April 1980.
Citations.
- Ronald L. Graham, Andrew C. Yao, and F. Frances Yao. Information bounds are weak in the
shortest distance problem. Journal of the ACM,
27(3):428-444, July 1980.
Citations.
- Andrew Chi-Chih Yao. Should
tables be sorted? Journal of the ACM, 28(3):615-628,
July 1981.
Citations.
- Andrew Chi-Chih Yao. A lower
bound to finding convex hulls. Journal of the ACM,
28(4):780-787, October 1981.
Citations.
- Andrew Chi-Chih Yao. On
parallel computation for the knapsack problem. Journal of the
ACM, 29(3):898-903, July 1982.
Citations.
- Andrew C. Yao. Uniform
hashing is optimal. Journal of the ACM, 32(3):687-693,
July 1985.
Citations.
Shortcuts: