On Lower Bounds for Computing the i-th Largest Element - Vaughan R. Pratt; Foong Frances Yao (SWAT, 1973)

The Complexity of Searching an Ordered Random Table (Extended Abstract) - Andrew Chi-Chih Yao; F. Frances Yao (FOCS, 1976)

Lower Bounds on Merging Networks. - Andrew Chi-Chih Yao; Foong Frances Yao (J. ACM, 1976)

On the Average-case Complexity of Selecting k-th Best - Andrew Chi-Chih Yao; F. Frances Yao (FOCS, 1978)

Addition chains with multiplicative cost. - Ronald L. Graham; Andrew Chi-Chih Yao; F. Frances Yao (Discret. Math., 1978)

Graph 2-Isomorphism is NP-Complete. - F. Frances Yao (Inf. Process. Lett., 1979)

On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report) - F. Frances Yao (FOCS, 1980)

On Translating a Set of Rectangles - Leonidas J. Guibas; F. Frances Yao (STOC, 1980)

Efficient Dynamic Programming Using Quadrangle Inequalities - F. Frances Yao (STOC, 1980)

Information Bounds Are Weak in the Shortest Distance Problem. - Ronald L. Graham; Andrew Chi-Chih Yao; F. Frances Yao (J. ACM, 1980)

On the Optimality of Linear Merge. - Paul K. Stockmeyer; F. Frances Yao (SIAM J. Comput., 1980)

Some Monotonicity Properties of Partial Orders. - Ronald L. Graham; Andrew C. Yao; F. Frances Yao (SIAM J. Algebraic Discret. Methods, 1980)

On the Average-Case Complexity of Selecting the kth Best. - Andrew Chi-Chih Yao; F. Frances Yao (SIAM J. Comput., 1982)

A 3-Space Partition and Its Applications (Extended Abstract) - F. Frances Yao (STOC, 1983)

Finding the Convex Hull of a Simple Polygon. - Ronald L. Graham; F. Frances Yao (J. Algorithms, 1983)

A General Approach to d-Dimensional Geometric Queries (Extended Abstract) - Andrew Chi-Chih Yao; F. Frances Yao (STOC, 1985)

On Fault-Tolerant Networks for Sorting. - Andrew Chi-Chih Yao; F. Frances Yao (SIAM J. Comput., 1985)

Finite-Resolution Computational Geometry - Daniel H. Greene; F. Frances Yao (FOCS, 1986)

Point Retrieval for Polygons. - Mike Paterson; F. Frances Yao (J. Algorithms, 1986)

Clustering Algorithms Based on Minimum and Maximum Spanning Trees. - Tetsuo Asano; Binay K. Bhattacharya; J. Mark Keil; F. Frances Yao (SCG, 1988)

Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. - Mike Paterson; F. Frances Yao (SCG, 1989)

Partitioning Space for Range Queries. - F. Frances Yao; David P. Dobkin; Herbert Edelsbrunner; Mike Paterson (SIAM J. Comput., 1989)

Computational Geometry. - F. Frances Yao (Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990)

Horizon Theorems for Lines and Polygons. - Marshall W. Bern; David Eppstein; Paul E. Plassmann; F. Frances Yao (Discrete and Computational Geometry, 1990)

Computing Euclidean Maximum Spanning Trees. - Clyde L. Monma; Mike Paterson; Subhash Suri; F. Frances Yao (Algorithmica, 1990)

Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling. - Mike Paterson; F. Frances Yao (Discret. Comput. Geom., 1990)

Nearest Neighbors Revisited. - F. Frances Yao (ISA, 1991)

Neighborhood Graphs and Geometric Embedding. - F. Frances Yao (WADS, 1991)

The expected extremes in a Delaunay triangulation. - Marshall W. Bern; David Eppstein; F. Frances Yao (Int. J. Comput. Geom. Appl., 1991)

On Nearest-Neighbor Graphs. - Mike Paterson; F. Frances Yao (ICALP, 1992)

Optimal Binary Space Partitions for Orthogonal Objects. - Mike Paterson; F. Frances Yao (J. Algorithms, 1992)

Multi-Index Hashing for Information Retrieval - Daniel H. Greene; Michal Parnas; F. Frances Yao (FOCS, 1994)

Dictionary Loop-Up with Small Errors. - Andrew Chi-Chih Yao; F. Frances Yao (CPM, 1995)

A Scheduling Model for Reduced CPU Energy. - F. Frances Yao; Alan J. Demers; Scott Shenker (FOCS, 1995)

A progressive Ziv-Lempel algorithm for image compression. - Daniel Greene 001; Mohan Vishwanath; F. Frances Yao; Tong Zhang 001 (SEQUENCES, 1997)

On Nearest-Neighbor Graphs. - David Eppstein; Mike Paterson; F. Frances Yao (Discret. Comput. Geom., 1997)

Dictionary Look-Up with One Error. - Andrew Chi-Chih Yao; Frances F. Yao (J. Algorithms, 1997)

Approximating Shortest Superstrings. - Shang-Hua Teng; F. Frances Yao (SIAM J. Comput., 1997)

A Linear Algorithm for Optimal Context Clustering with Application to Bi-level Image Coding. - Daniel H. Greene; F. Frances Yao; Tong Zhang 001 (ICIP (1), 1998)

Algorithmic Problems in Wireless Ad Hoc Networks. - F. Frances Yao (ISAAC, 2005)

An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. - Minming Li; F. Frances Yao (SIAM J. Comput., 2005)

Design and Analysis of Password-Based Key Derivation Functions. - Frances F. Yao; Yiqun Lisa Yin (IEEE Trans. Inf. Theory, 2005)

Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks. - Hai Liu 001; Peng-Jun Wan; Xiaohua Jia; Xinxin Liu 010; F. Frances Yao (INFOCOM, 2006)

Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks. - Peng-Jun Wan; Chih-Wei Yi; F. Frances Yao; Xiaohua Jia (MobiHoc, 2006)

Min-energy voltage allocation for tree-structured tasks. - Minming Li; Becky Jie Liu; Frances F. Yao (J. Comb. Optim., 2006)

Discrete and continuous min-energy schedules for variable voltage processors. - Minming Li; Andrew C. Yao; Frances F. Yao (Proc. Natl. Acad. Sci. USA, 2006)

Algorithms for Minimum m -Connected k -Dominating Set Problem. - Weiping Shang; F. Frances Yao; Peng-Jun Wan; Xiaodong Hu 001 (COCOA, 2007)

Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors. - Frances F. Yao (CPM, 2007)

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks. - Scott C.-H. Huang; Peng-Jun Wan; Chinh T. Vu; Yingshu Li; F. Frances Yao (INFOCOM, 2007)

Approximately Optimal Trees for Group Key Management with Batch Updates. - Minming Li; Ze Feng; Ronald L. Graham; Frances F. Yao (TAMC, 2007)

A Note on the Feasibility of Generalized Universal Composability. - Andrew Chi-Chih Yao; Frances F. Yao; Yunlei Zhao (TAMC, 2007)

k-Nearest-Neighbor Clustering and Percolation Theory. - Shang-Hua Teng; Frances F. Yao (Algorithmica, 2007)

Deniable Internet Key-Exchange. - Andrew Chi-Chih Yao; Frances F. Yao; Yunlei Zhao; Bin B. Zhu (IACR Cryptol. ePrint Arch., 2007)

Optimal Tree Structures for Group Key Management with Batch Updates. - Ronald L. Graham; Minming Li; Frances F. Yao (SIAM J. Discret. Math., 2007)

Algorithms for minimum m-connected k-tuple dominating set problem. - Weiping Shang; Peng-Jun Wan; F. Frances Yao; Xiaodong Hu 001 (Theor. Comput. Sci., 2007)

A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks. - Hai Liu 001; Xiaohua Jia; Peng-Jun Wan; Xinxin Liu 010; Frances F. Yao (IEEE Trans. Parallel Distributed Syst., 2007)

Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. - Peng-Jun Wan; Lixin Wang; F. Frances Yao (ICDCS, 2008)

Improved asymptotic bounds on critical transmission radius for greedy forward routing in wireless ad hoc networks. - Lixin Wang; Chih-Wei Yi; F. Frances Yao (MobiHoc, 2008)

On minimum m -connected k -dominating set problem in unit disc graphs. - Weiping Shang; F. Frances Yao; Peng-Jun Wan; Xiaodong Hu 001 (J. Comb. Optim., 2008)

Optimizing deletion cost for secure multicast key management. - Zhi-Zhong Chen; Ze Feng; Minming Li; F. Frances Yao (Theor. Comput. Sci., 2008)

Lower bounds and new constructions on secure group communication schemes. - Scott C.-H. Huang; F. Frances Yao; Minming Li; Weili Wu 001 (Theor. Comput. Sci., 2008)

Algorithmic Problems in Computer and Network Power Management. - Frances F. Yao (FAW, 2009)

Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. - Minming Li; Peng-Jun Wan; F. Frances Yao (ISAAC, 2009)

Maximum Independent Set of Links under Physical Interference Model. - Peng-Jun Wan; Xiaohua Jia; F. Frances Yao (WASA, 2009)

On the Longest RNG Edge of Wireless Ad Hoc Networks. - Peng-Jun Wan; Lixin Wang; F. Frances Yao; Chih-Wei Yi (Discret. Math. Algorithms Appl., 2009)

A note on the feasibility of generalised universal composability. - Andrew Chi-Chih Yao; Frances F. Yao; Yunlei Zhao (Math. Struct. Comput. Sci., 2009)

Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks. - Peng-Jun Wan; Chih-Wei Yi; Lixin Wang; F. Frances Yao; Xiaohua Jia (IEEE Trans. Commun., 2009)

Approximately optimal trees for group key management with batch updates. - Minming Li; Ze Feng; Nan Zang; Ronald L. Graham; Frances F. Yao (Theor. Comput. Sci., 2009)

A note on universal composable zero-knowledge in the common reference string model. - Andrew Chi-Chih Yao; Frances F. Yao; Yunlei Zhao (Theor. Comput. Sci., 2009)

Approximate Capacity Subregions of Uniform Multihop Wireless Networks. - Peng-Jun Wan; Lixin Wang; Ai Huang; Minming Li; F. Frances Yao (INFOCOM, 2010)

Multiflows in multi-channel multi-radio multihop wireless networks. - Peng-Jun Wan; Yu Cheng 003; Zhu Wang 002; F. Frances Yao (INFOCOM, 2011)

Wireless link scheduling under physical interference model. - Peng-Jun Wan; Ophir Frieder; Xiaohua Jia; F. Frances Yao; Xiaohua Xu 002; Shaojie Tang 001 (INFOCOM, 2011)

Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs. - Minming Li; Peng-Jun Wan; F. Frances Yao (Algorithmica, 2011)

Maximizing capacity with power control under physical interference model in duplex mode. - Peng-Jun Wan; Dechang Chen; Guojun Dai; Zhu Wang 002; F. Frances Yao (INFOCOM, 2012)

Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges. - Lixin Wang; Peng-Jun Wan; F. Frances Yao (IEEE Trans. Mob. Comput., 2013)

An $O(n^2)$ Algorithm for Computing Optimal Continuous Voltage Schedules. - Minming Li; Frances F. Yao; Hao Yuan (CoRR, 2014)

An O(n2) Algorithm for Computing Optimal Continuous Voltage Schedules. - Minming Li; Frances F. Yao; Hao Yuan (TAMC, 2017)