F. Frances Yao

Publication Activity (10 Years)

Years Active: 1976-2013
Publications (10 Years): 0

Top Topics

Communication Protocol

Top Venues

IEEE Trans. Mob. Comput.

Publications

Lixin Wang, Peng-Jun Wan, F. Frances Yao
Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges. IEEE Trans. Mob. Comput. 12 (5) (2013)
Peng-Jun Wan, Dechang Chen, Guojun Dai, Zhu Wang, F. Frances Yao
Maximizing capacity with power control under physical interference model in duplex mode. INFOCOM (2012)
Minming Li, Peng-Jun Wan, F. Frances Yao
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs. Algorithmica 61 (4) (2011)
Peng-Jun Wan, Yu Cheng, Zhu Wang, F. Frances Yao
Multiflows in multi-channel multi-radio multihop wireless networks. INFOCOM (2011)
Peng-Jun Wan, Ophir Frieder, Xiaohua Jia, F. Frances Yao, XiaoHua Xu, Shaojie Tang
Wireless link scheduling under physical interference model. INFOCOM (2011)
Lixin Wang, Peng-Jun Wan, F. Frances Yao
Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges. WASA (2010)
Peng-Jun Wan, Lixin Wang, Ai Huang, Minming Li, F. Frances Yao
Approximate Capacity Subregions of Uniform Multihop Wireless Networks. INFOCOM (2010)
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei Yi
On the Longest RNG Edge of Wireless Ad Hoc Networks. Discret. Math. Algorithms Appl. 1 (1) (2009)
Peng-Jun Wan, Xiaohua Jia, F. Frances Yao
Maximum Independent Set of Links under Physical Interference Model. WASA (2009)
Minming Li, Peng-Jun Wan, F. Frances Yao
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. ISAAC (2009)
Peng-Jun Wan, Chih-Wei Yi, Lixin Wang, F. Frances Yao, Xiaohua Jia
Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks. IEEE Trans. Commun. 57 (5) (2009)
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu
-dominating set problem in unit disc graphs. J. Comb. Optim. 16 (2) (2008)
Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Yao
Optimizing deletion cost for secure multicast key management. Theor. Comput. Sci. 401 (1-3) (2008)
Scott C.-H. Huang, F. Frances Yao, Minming Li, Weili Wu
Lower bounds and new constructions on secure group communication schemes. Theor. Comput. Sci. 407 (1-3) (2008)
Peng-Jun Wan, Lixin Wang, F. Frances Yao
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. ICDCS (2008)
Lixin Wang, Chih-Wei Yi, F. Frances Yao
Improved asymptotic bounds on critical transmission radius for greedy forward routing in wireless ad hoc networks. MobiHoc (2008)
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei Yi
On the Longest RNG Edge of Wireless Ad Hoc Networks. ICDCS (2008)
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu
-Dominating Set Problem. COCOA (2007)
Weiping Shang, Peng-Jun Wan, F. Frances Yao, Xiaodong Hu
Algorithms for minimum m-connected k-tuple dominating set problem. Theor. Comput. Sci. 381 (1-3) (2007)
Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yingshu Li, F. Frances Yao
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks. INFOCOM (2007)
Hai Liu, Peng-Jun Wan, Xiaohua Jia, Xinxin Liu, F. Frances Yao
Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks. INFOCOM (2006)
Peng-Jun Wan, Chih-Wei Yi, F. Frances Yao, Xiaohua Jia
Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks. MobiHoc (2006)
Minming Li, F. Frances Yao
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. SIAM J. Comput. 35 (3) (2005)
F. Frances Yao
Algorithmic Problems in Wireless Ad Hoc Networks. ISAAC (2005)
Daniel H. Greene, F. Frances Yao, Tong Zhang
A Linear Algorithm for Optimal Context Clustering with Application to Bi-level Image Coding. ICIP (1) (1998)
David Eppstein, Mike Paterson, F. Frances Yao
On Nearest-Neighbor Graphs. Discret. Comput. Geom. 17 (3) (1997)
Daniel Greene, Mohan Vishwanath, F. Frances Yao, Tong Zhang
A progressive Ziv-Lempel algorithm for image compression. SEQUENCES (1997)
Shang-Hua Teng, F. Frances Yao
Approximating Shortest Superstrings. SIAM J. Comput. 26 (2) (1997)
Andrew Chi-Chih Yao, F. Frances Yao
Dictionary Loop-Up with Small Errors. CPM (1995)
F. Frances Yao, Alan J. Demers, Scott Shenker
A Scheduling Model for Reduced CPU Energy. FOCS (1995)
Daniel H. Greene, Michal Parnas, F. Frances Yao
Multi-Index Hashing for Information Retrieval FOCS (1994)
Shang-Hua Teng, F. Frances Yao
Approximating Shortest Superstrings FOCS (1993)
Mike Paterson, F. Frances Yao
Optimal Binary Space Partitions for Orthogonal Objects. J. Algorithms 13 (1) (1992)
Mike Paterson, F. Frances Yao
On Nearest-Neighbor Graphs. ICALP (1992)
F. Frances Yao
Nearest Neighbors Revisited. ISA (1991)
Marshall W. Bern, David Eppstein, F. Frances Yao
The expected extremes in a Delaunay triangulation. Int. J. Comput. Geom. Appl. 1 (1) (1991)
F. Frances Yao
Neighborhood Graphs and Geometric Embedding. WADS (1991)
Marshall W. Bern, David Eppstein, F. Frances Yao
The Expected Extremes in a Delaunay Triangulation. ICALP (1991)
Marshall W. Bern, David Eppstein, Paul E. Plassmann, F. Frances Yao
Horizon Theorems for Lines and Polygons. Discrete and Computational Geometry (1990)
Mike Paterson, F. Frances Yao
Optimal Binary Space Partitions for Orthogonal Objects. SODA (1990)
Mike Paterson, F. Frances Yao
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling. Discret. Comput. Geom. 5 (1990)
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
Computing Euclidean Maximum Spanning Trees. Algorithmica 5 (3) (1990)
F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson
Partitioning Space for Range Queries. SIAM J. Comput. 18 (2) (1989)
Mike Paterson, F. Frances Yao
Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. SCG (1989)
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
Computing Euclidean Maximum Spanning Trees. SCG (1988)
Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao
Clustering Algorithms Based on Minimum and Maximum Spanning Trees. SCG (1988)
Daniel H. Greene, F. Frances Yao
Finite-Resolution Computational Geometry FOCS (1986)
Mike Paterson, F. Frances Yao
Point Retrieval for Polygons. J. Algorithms 7 (3) (1986)
Andrew Chi-Chih Yao, F. Frances Yao
On Fault-Tolerant Networks for Sorting. SIAM J. Comput. 14 (1) (1985)
Andrew Chi-Chih Yao, F. Frances Yao
A General Approach to d-Dimensional Geometric Queries (Extended Abstract) STOC (1985)
Ronald L. Graham, F. Frances Yao
Finding the Convex Hull of a Simple Polygon. J. Algorithms 4 (4) (1983)
F. Frances Yao
A 3-Space Partition and Its Applications (Extended Abstract) STOC (1983)
Andrew Chi-Chih Yao, F. Frances Yao
On the Average-Case Complexity of Selecting the kth Best. SIAM J. Comput. 11 (3) (1982)
Leonidas J. Guibas, F. Frances Yao
On Translating a Set of Rectangles STOC (1980)
F. Frances Yao
On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report) FOCS (1980)
Paul K. Stockmeyer, F. Frances Yao
On the Optimality of Linear Merge. SIAM J. Comput. 9 (1) (1980)
Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao
Information Bounds Are Weak in the Shortest Distance Problem. J. ACM 27 (3) (1980)
Ronald L. Graham, Andrew C. Yao, F. Frances Yao
Some Monotonicity Properties of Partial Orders. SIAM J. Algebraic Discret. Methods 1 (3) (1980)
F. Frances Yao
Efficient Dynamic Programming Using Quadrangle Inequalities STOC (1980)
F. Frances Yao
Graph 2-Isomorphism is NP-Complete. Inf. Process. Lett. 9 (2) (1979)
Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao
Addition chains with multiplicative cost. Discret. Math. 23 (2) (1978)
Andrew Chi-Chih Yao, F. Frances Yao
On the Average-case Complexity of Selecting k-th Best FOCS (1978)
Andrew Chi-Chih Yao, F. Frances Yao
The Complexity of Searching an Ordered Random Table (Extended Abstract) FOCS (1976)