Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarF. Frances Yao
Frances F. Yao – Foong Frances Yao
Person information
- affiliation: City University of Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
[c47]Minming Li, Frances F. Yao, Hao Yuan:
An O(n2) Algorithm for Computing Optimal Continuous Voltage Schedules. TAMC 2017: 389-400- 2014
- [i2]Minming Li, Frances F. Yao, Hao Yuan:
An $O(n^2)$ Algorithm for Computing Optimal Continuous Voltage Schedules. CoRR abs/1408.5995 (2014) - 2013
- [j35]Lixin Wang, Peng-Jun Wan, F. Frances Yao:
Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges. IEEE Trans. Mob. Comput. 12(5): 909-916 (2013) - 2012
- [c46]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: 415-423 - 2011
- [j34]Minming Li, Peng-Jun Wan, F. Frances Yao:
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs. Algorithmica 61(4): 1000-1021 (2011) - [c45]Peng-Jun Wan, Ophir Frieder, Xiaohua Jia, F. Frances Yao, XiaoHua Xu, Shaojie Tang:
Wireless link scheduling under physical interference model. INFOCOM 2011: 838-845 - [c44]Peng-Jun Wan, Yu Cheng, Zhu Wang, F. Frances Yao:
Multiflows in multi-channel multi-radio multihop wireless networks. INFOCOM 2011: 846-854 - 2010
- [c43]Peng-Jun Wan, Lixin Wang, Ai Huang, Minming Li, F. Frances Yao:
Approximate Capacity Subregions of Uniform Multihop Wireless Networks. INFOCOM 2010: 1388-1396 - [c42]Lixin Wang, Peng-Jun Wan, F. Frances Yao:
Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges. WASA 2010: 47-56
2000 – 2009
- 2009
- [j33]Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei Yi:
On the Longest RNG Edge of Wireless Ad Hoc Networks. Discrete Math., Alg. and Appl. 1(1): 25-44 (2009) - [j32]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A note on the feasibility of generalised universal composability. Mathematical Structures in Computer Science 19(1): 193-205 (2009) - [j31]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. Communications 57(5): 1433-1443 (2009) - [j30]Minming Li, Ze Feng, Nan Zang, Ronald L. Graham, Frances F. Yao:
Approximately optimal trees for group key management with batch updates. Theor. Comput. Sci. 410(11): 1013-1021 (2009) - [j29]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A note on universal composable zero-knowledge in the common reference string model. Theor. Comput. Sci. 410(11): 1099-1108 (2009) - [c41]
- [c40]Minming Li, Peng-Jun Wan, F. Frances Yao:
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. ISAAC 2009: 699-709 - [c39]Peng-Jun Wan, Xiaohua Jia, F. Frances Yao:
Maximum Independent Set of Links under Physical Interference Model. WASA 2009: 169-178 - 2008
- [j28]Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu:
On minimum m -connected k -dominating set problem in unit disc graphs. J. Comb. Optim. 16(2): 99-106 (2008) - [j27]Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Yao:
Optimizing deletion cost for secure multicast key management. Theor. Comput. Sci. 401(1-3): 52-61 (2008) - [j26]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): 511-523 (2008) - [c38]Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei Yi:
On the Longest RNG Edge of Wireless Ad Hoc Networks. ICDCS 2008: 329-336 - [c37]Peng-Jun Wan, Lixin Wang, F. Frances Yao:
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. ICDCS 2008: 337-344 - [c36]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: 131-138 - 2007
- [j25]Shang-Hua Teng, Frances F. Yao:
k-Nearest-Neighbor Clustering and Percolation Theory. Algorithmica 49(3): 192-211 (2007) - [j24]Ronald L. Graham, Minming Li, Frances F. Yao:
Optimal Tree Structures for Group Key Management with Batch Updates. SIAM J. Discrete Math. 21(2): 532-547 (2007) - [j23]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): 241-247 (2007) - [j22]Hai Liu, Xiaohua Jia, Peng-Jun Wan, Xinxin Liu, Frances F. Yao:
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks. IEEE Trans. Parallel Distrib. Syst. 18(5): 658-671 (2007) - [c35]Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu:
Algorithms for Minimum m -Connected k -Dominating Set Problem. COCOA 2007: 182-190 - [c34]
- [c33]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: 366-372 - [c32]Minming Li, Ze Feng, Ronald L. Graham, Frances F. Yao:
Approximately Optimal Trees for Group Key Management with Batch Updates. TAMC 2007: 284-295 - [c31]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A Note on Universal Composable Zero Knowledge in Common Reference String Model. TAMC 2007: 462-473 - [c30]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A Note on the Feasibility of Generalized Universal Composability. TAMC 2007: 474-485 - [i1]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao, Bin B. Zhu:
Deniable Internet Key-Exchange. IACR Cryptology ePrint Archive 2007: 191 (2007) - 2006
- [j21]Minming Li, Becky Jie Liu, Frances F. Yao:
Min-energy voltage allocation for tree-structured tasks. J. Comb. Optim. 11(3): 305-319 (2006) - [c29]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 - [c28]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: 25-36 - 2005
- [j20]Minming Li, F. Frances Yao:
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. SIAM J. Comput. 35(3): 658-671 (2005) - [j19]Frances F. Yao, Yiqun Lisa Yin:
Design and Analysis of Password-Based Key Derivation Functions. IEEE Trans. Information Theory 51(9): 3292-3297 (2005) - [c27]Minming Li, Becky Jie Liu, Frances F. Yao:
Min-Energy Voltage Allocation for Tree-Structured Tasks. COCOON 2005: 283-296 - [c26]Frances F. Yao, Yiqun Lisa Yin:
Design and Analysis of Password-Based Key Derivation Functions. CT-RSA 2005: 245-261 - [c25]
- [c24]Minming Li, Frances F. Yao:
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. MFCS 2005: 652-663 - 2000
- [e1]F. Frances Yao, Eugene M. Luks:
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA. ACM 2000, ISBN 1-58113-184-4 [contents]
1990 – 1999
- 1998
- [c23]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: 508-511 - 1997
- [j18]David Eppstein, Mike Paterson, F. Frances Yao:
On Nearest-Neighbor Graphs. Discrete & Computational Geometry 17(3): 263-282 (1997) - [j17]Andrew Chi-Chih Yao, Frances F. Yao:
Dictionary Look-Up with One Error. J. Algorithms 25(1): 194-202 (1997) - [j16]Shang-Hua Teng, F. Frances Yao:
Approximating Shortest Superstrings. SIAM J. Comput. 26(2): 410-417 (1997) - 1995
- [c22]
- [c21]F. Frances Yao, Alan J. Demers, Scott Shenker:
A Scheduling Model for Reduced CPU Energy. FOCS 1995: 374-382 - 1994
- [c20]Daniel H. Greene, Michal Parnas, F. Frances Yao:
Multi-Index Hashing for Information Retrieval. FOCS 1994: 722-731 - 1993
- [c19]
- 1992
- [j15]Mike Paterson, F. Frances Yao:
Optimal Binary Space Partitions for Orthogonal Objects. J. Algorithms 13(1): 99-113 (1992) - [c18]
- 1991
- [j14]Marshall W. Bern, David Eppstein, F. Frances Yao:
The expected extremes in a Delaunay triangulation. Int. J. Comput. Geometry Appl. 1(1): 79-91 (1991) - [c17]Marshall W. Bern, David Eppstein, F. Frances Yao:
The Expected Extremes in a Delaunay Triangulation. ICALP 1991: 674-685 - [c16]
- [c15]
- 1990
- [j13]Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao:
Computing Euclidean Maximum Spanning Trees. Algorithmica 5(3): 407-419 (1990) - [j12]Mike Paterson, F. Frances Yao:
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling. Discrete & Computational Geometry 5: 485-503 (1990) - [c14]Marshall W. Bern, David Eppstein, Paul E. Plassmann, F. Frances Yao:
Horizon Theorems for Lines and Polygons. Discrete and Computational Geometry 1990: 45-66 - [c13]Mike Paterson, F. Frances Yao:
Optimal Binary Space Partitions for Orthogonal Objects. SODA 1990: 100-106 - [p1]F. Frances Yao:
Computational Geometry. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 343-389
1980 – 1989
- 1989
- [j11]F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson:
Partitioning Space for Range Queries. SIAM J. Comput. 18(2): 371-384 (1989) - [c12]Mike Paterson, F. Frances Yao:
Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. Symposium on Computational Geometry 1989: 23-32 - 1988
- [c11]Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao:
Computing Euclidean Maximum Spanning Trees. Symposium on Computational Geometry 1988: 241-251 - [c10]Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao:
Clustering Algorithms Based on Minimum and Maximum Spanning Trees. Symposium on Computational Geometry 1988: 252-257 - 1986
- [j10]
- [c9]
- 1985
- [j9]Andrew Chi-Chih Yao, F. Frances Yao:
On Fault-Tolerant Networks for Sorting. SIAM J. Comput. 14(1): 120-128 (1985) - [c8]Andrew Chi-Chih Yao, F. Frances Yao:
A General Approach to d-Dimensional Geometric Queries (Extended Abstract). STOC 1985: 163-168 - 1983
- [j8]Ronald L. Graham, F. Frances Yao:
Finding the Convex Hull of a Simple Polygon. J. Algorithms 4(4): 324-331 (1983) - [c7]
- 1982
- [j7]Andrew Chi-Chih Yao, F. Frances Yao:
On the Average-Case Complexity of Selecting the kth Best. SIAM J. Comput. 11(3): 428-447 (1982) - 1980
- [j6]Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao:
Information Bounds Are Weak in the Shortest Distance Problem. J. ACM 27(3): 428-444 (1980) - [j5]Paul K. Stockmeyer, F. Frances Yao:
On the Optimality of Linear Merge. SIAM J. Comput. 9(1): 85-90 (1980) - [j4]Ronald L. Graham, Andrew C. Yao, F. Frances Yao:
Some Monotonicity Properties of Partial Orders. SIAM J. Matrix Analysis Applications 1(3): 251-258 (1980) - [c6]F. Frances Yao:
On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report). FOCS 1980: 301-307 - [c5]
- [c4]
1970 – 1979
- 1979
- [j3]
- 1978
- [j2]Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao:
Addition chains with multiplicative cost. Discrete Mathematics 23(2): 115-119 (1978) - [c3]Andrew Chi-Chih Yao, F. Frances Yao:
On the Average-case Complexity of Selecting k-th Best. FOCS 1978: 280-289 - 1976
- [j1]Andrew Chi-Chih Yao, Foong Frances Yao:
Lower Bounds on Merging Networks. J. ACM 23(3): 566-571 (1976) - [c2]Andrew Chi-Chih Yao, F. Frances Yao:
The Complexity of Searching an Ordered Random Table (Extended Abstract). FOCS 1976: 173-177 - 1973
- [c1]Vaughan R. Pratt, Foong Frances Yao:
On Lower Bounds for Computing the i-th Largest Element. SWAT (FOCS) 1973: 70-81
Coauthor Index
Andrew Chi-Chih Yao
aka: Andrew C. Yao
aka: Andrew C. Yao
maintained by 
at 
at 
last updated on 2018-11-15 21:56 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint