Yao, Andrew C.; Yao, F. Frances On fault-tolerant networks for sorting. (English) Zbl 0557.68042 SIAM J. Comput. 14, 120-128 (1985). MSC: 68P10 94C15 PDFBibTeX XMLCite \textit{A. C. Yao} and \textit{F. F. Yao}, SIAM J. Comput. 14, 120--128 (1985; Zbl 0557.68042) Full Text: DOI Link
Yao, Andrew C.; Yao, F. Frances On the average-case complexity of selecting the kth best. (English) Zbl 0486.68069 SIAM J. Comput. 11, 428-447 (1982). MSC: 68R99 PDFBibTeX XMLCite \textit{A. C. Yao} and \textit{F. F. Yao}, SIAM J. Comput. 11, 428--447 (1982; Zbl 0486.68069) Full Text: DOI Link
Graham, R. L.; Yao, A. C.; Yao, F. F. Some monotonicity properties of partial orders. (English) Zbl 0496.68043 SIAM J. Algebraic Discrete Methods 1, 251-258 (1980). MSC: 68P10 06A06 PDFBibTeX XMLCite \textit{R. L. Graham} et al., SIAM J. Algebraic Discrete Methods 1, 251--258 (1980; Zbl 0496.68043) Full Text: DOI Link
Graham, Ronald L.; Yao, Andrew C.; Yao, F. Frances Information bounds are weak in the shortest distance problem. (English) Zbl 0475.68043 J. Assoc. Comput. Mach. 27, 428-444 (1980). MSC: 68R10 90B10 PDFBibTeX XMLCite \textit{R. L. Graham} et al., J. Assoc. Comput. Mach. 27, 428--444 (1980; Zbl 0475.68043) Full Text: DOI
Graham, R. L.; Yao, A. C.-C.; Yao, F.-F. Addition chains with multiplicative cost. (English) Zbl 0391.10039 Discrete Math. 23, 115-119 (1978). MSC: 11B83 PDFBibTeX XMLCite \textit{R. L. Graham} et al., Discrete Math. 23, 115--119 (1978; Zbl 0391.10039) Full Text: DOI
Yao, Andrew Chi-Chih; Yao, Foong Frances Lower bounds on merging networks. (English) Zbl 0335.68034 J. Assoc. Comput. Mach. 23, 566-571 (1976). MSC: 68Q25 68W99 68Q45 94C10 PDFBibTeX XMLCite \textit{A. C. C. Yao} and \textit{F. F. Yao}, J. Assoc. Comput. Mach. 23, 566--571 (1976; Zbl 0335.68034) Full Text: DOI Link