F. Frances Yao

Frances F. Yao, Foong Frances Yao

	2013
j33		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
c45		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
j32		Minming Li, Peng-Jun Wan, F. Frances Yao: Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs. Algorithmica 61(4): 1000-1021 (2011)
c44		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
c43		Peng-Jun Wan, Yu Cheng, Zhu Wang, F. Frances Yao: Multiflows in multi-channel multi-radio multihop wireless networks. INFOCOM 2011: 846-854
	2010
c42		Peng-Jun Wan, Lixin Wang, Ai Huang, Minming Li, F. Frances Yao: Approximate Capacity Subregions of Uniform Multihop Wireless Networks. INFOCOM 2010: 1388-1396
c41		Lixin Wang, Peng-Jun Wan, F. Frances Yao: Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges. WASA 2010: 47-56
	2009
j31		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)
j30		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)
j29		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 Transactions on Communications 57(5): 1433-1443 (2009)
j28		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)
j27		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)
c40		Frances F. Yao: Algorithmic Problems in Computer and Network Power Management. FAW 2009: 3
c39		Minming Li, Peng-Jun Wan, F. Frances Yao: Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. ISAAC 2009: 699-709
c38		Peng-Jun Wan, Xiaohua Jia, F. Frances Yao: Maximum Independent Set of Links under Physical Interference Model. WASA 2009: 169-178
	2008
j26		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)
j25		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)
j24		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)
c37		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
c36		Peng-Jun Wan, Lixin Wang, F. Frances Yao: Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. ICDCS 2008: 337-344
c35		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
j23		Shang-Hua Teng, Frances F. Yao: k-Nearest-Neighbor Clustering and Percolation Theory. Algorithmica 49(3): 192-211 (2007)
j22		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)
j21		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)
j20		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)
c34		Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu: Algorithms for Minimum m -Connected k -Dominating Set Problem. COCOA 2007: 182-190
c33		Frances F. Yao: Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors. CPM 2007: 3
c32		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
c31		Minming Li, Ze Feng, Ronald L. Graham, Frances F. Yao: Approximately Optimal Trees for Group Key Management with Batch Updates. TAMC 2007: 284-295
c30		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
c29		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 Zhu: Deniable Internet Key-Exchange. IACR Cryptology ePrint Archive 2007: 191 (2007)
	2006
j19		Minming Li, Becky Jie Liu, Frances F. Yao: Min-energy voltage allocation for tree-structured tasks. J. Comb. Optim. 11(3): 305-319 (2006)
c28		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
c27		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
j18		Minming Li, F. Frances Yao: An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. SIAM J. Comput. 35(3): 658-671 (2005)
j17		Frances F. Yao, Yiqun Lisa Yin: Design and Analysis of Password-Based Key Derivation Functions. IEEE Transactions on Information Theory 51(9): 3292-3297 (2005)
c26		Minming Li, Becky Jie Liu, Frances F. Yao: Min-Energy Voltage Allocation for Tree-Structured Tasks. COCOON 2005: 283-296
c25		Frances F. Yao, Yiqun Lisa Yin: Design and Analysis of Password-Based Key Derivation Functions. CT-RSA 2005: 245-261
c24		F. Frances Yao: Algorithmic Problems in Wireless Ad Hoc Networks. ISAAC 2005: 1
c23		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 (Eds.): 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
	1998
c22		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
j16		David Eppstein, Mike Paterson, F. Frances Yao: On Nearest-Neighbor Graphs. Discrete & Computational Geometry 17(3): 263-282 (1997)
j15		Andrew Chi-Chih Yao, Frances F. Yao: Dictionary Look-Up with One Error. J. Algorithms 25(1): 194-202 (1997)
j14		Shang-Hua Teng, F. Frances Yao: Approximating Shortest Superstrings. SIAM J. Comput. 26(2): 410-417 (1997)
	1995
c21		Andrew Chi-Chih Yao, F. Frances Yao: Dictionary Loop-Up with Small Errors. CPM 1995: 387-394
c20		F. Frances Yao, Alan J. Demers, Scott Shenker: A Scheduling Model for Reduced CPU Energy. FOCS 1995: 374-382
	1994
c19		Daniel H. Greene, Michal Parnas, F. Frances Yao: Multi-Index Hashing for Information Retrieval. FOCS 1994: 722-731
	1993
c18		Shang-Hua Teng, F. Frances Yao: Approximating Shortest Superstrings. FOCS 1993: 158-165
	1992
j13		Mike Paterson, F. Frances Yao: Optimal Binary Space Partitions for Orthogonal Objects. J. Algorithms 13(1): 99-113 (1992)
c17		Mike Paterson, F. Frances Yao: On Nearest-Neighbor Graphs. ICALP 1992: 416-426
	1991
j12		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)
c16		Marshall W. Bern, David Eppstein, F. Frances Yao: The Expected Extremes in a Delaunay Triangulation. ICALP 1991: 674-685
c15		F. Frances Yao: Nearest Neighbors Revisited. ISA 1991: 283
c14		F. Frances Yao: Neighborhood Graphs and Geometric Embedding. WADS 1991: 201
	1990
j11		Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao: Computing Euclidean Maximum Spanning Trees. Algorithmica 5(3): 407-419 (1990)
j10		Mike Paterson, F. Frances Yao: Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling. Discrete & Computational Geometry 5: 485-503 (1990)
p1		F. Frances Yao: Computational Geometry. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 343-389
c13		Mike Paterson, F. Frances Yao: Optimal Binary Space Partitions for Orthogonal Objects. SODA 1990: 100-106
	1989
j9		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
j8		Mike Paterson, F. Frances Yao: Point Retrieval for Polygons. J. Algorithms 7(3): 441-447 (1986)
c9		Daniel H. Greene, F. Frances Yao: Finite-Resolution Computational Geometry. FOCS 1986: 143-152
	1985
j7		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
j6		Ronald L. Graham, F. Frances Yao: Finding the Convex Hull of a Simple Polygon. J. Algorithms 4(4): 324-331 (1983)
c7		F. Frances Yao: A 3-Space Partition and Its Applications (Extended Abstract). STOC 1983: 258-263
	1982
j5		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
j4		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)
j3		Paul K. Stockmeyer, F. Frances Yao: On the Optimality of Linear Merge. SIAM J. Comput. 9(1): 85-90 (1980)
c6		F. Frances Yao: On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report). FOCS 1980: 301-307
c5		Leonidas J. Guibas, F. Frances Yao: On Translating a Set of Rectangles. STOC 1980: 154-160
c4		F. Frances Yao: Efficient Dynamic Programming Using Quadrangle Inequalities. STOC 1980: 429-435
	1979
j2		F. Frances Yao: Graph 2-Isomorphism is NP-Complete. Inf. Process. Lett. 9(2): 68-72 (1979)
	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

Last update Wed May 22 08:32:25 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page