F. Frances Yao

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