F. Frances Yao

Frances F. Yao, Foong Frances Yao

2009
67	EE	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)
66	EE	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)
65	EE	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)
2008
64	EE	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
63	EE	Peng-Jun Wan, Lixin Wang, F. Frances Yao: Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. ICDCS 2008: 337-344
62	EE	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
61	EE	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)
60	EE	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)
59	EE	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)
2007
58	EE	Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu: Algorithms for Minimum m -Connected k -Dominating Set Problem. COCOA 2007: 182-190
57	EE	Frances F. Yao: Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors. CPM 2007: 3
56	EE	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
55	EE	Minming Li, Ze Feng, Ronald L. Graham, Frances F. Yao: Approximately Optimal Trees for Group Key Management with Batch Updates. TAMC 2007: 284-295
54	EE	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
53	EE	Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao: A Note on the Feasibility of Generalized Universal Composability. TAMC 2007: 474-485
52	EE	Shang-Hua Teng, Frances F. Yao: k-Nearest-Neighbor Clustering and Percolation Theory. Algorithmica 49(3): 192-211 (2007)
51	EE	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)
50	EE	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)
49	EE	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)
2006
48	EE	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
47	EE	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
46	EE	Minming Li, Becky Jie Liu, Frances F. Yao: Min-energy voltage allocation for tree-structured tasks. J. Comb. Optim. 11(3): 305-319 (2006)
2005
45	EE	Minming Li, Becky Jie Liu, Frances F. Yao: Min-Energy Voltage Allocation for Tree-Structured Tasks. COCOON 2005: 283-296
44	EE	Frances F. Yao, Yiqun Lisa Yin: Design and Analysis of Password-Based Key Derivation Functions. CT-RSA 2005: 245-261
43	EE	F. Frances Yao: Algorithmic Problems in Wireless Ad Hoc Networks. ISAAC 2005: 1
42	EE	Minming Li, Frances F. Yao: An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. MFCS 2005: 652-663
41	EE	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)
40	EE	Minming Li, F. Frances Yao: An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. SIAM J. Comput. 35(3): 658-671 (2005)
1998
39		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
38	EE	David Eppstein, Mike Paterson, F. Frances Yao: On Nearest-Neighbor Graphs. Discrete & Computational Geometry 17(3): 263-282 (1997)
37		Andrew Chi-Chih Yao, Frances F. Yao: Dictionary Look-Up with One Error. J. Algorithms 25(1): 194-202 (1997)
36		Shang-Hua Teng, F. Frances Yao: Approximating Shortest Superstrings. SIAM J. Comput. 26(2): 410-417 (1997)
1995
35		Andrew Chi-Chih Yao, F. Frances Yao: Dictionary Loop-Up with Small Errors. CPM 1995: 387-394
34		F. Frances Yao, Alan J. Demers, Scott Shenker: A Scheduling Model for Reduced CPU Energy. FOCS 1995: 374-382
1994
33		Daniel H. Greene, Michal Parnas, F. Frances Yao: Multi-Index Hashing for Information Retrieval FOCS 1994: 722-731
1993
32		Shang-Hua Teng, F. Frances Yao: Approximating Shortest Superstrings FOCS 1993: 158-165
1992
31		Mike Paterson, F. Frances Yao: On Nearest-Neighbor Graphs. ICALP 1992: 416-426
30		Mike Paterson, F. Frances Yao: Optimal Binary Space Partitions for Orthogonal Objects. J. Algorithms 13(1): 99-113 (1992)
1991
29		Marshall W. Bern, David Eppstein, F. Frances Yao: The Expected Extremes in a Delaunay Triangulation. ICALP 1991: 674-685
28		F. Frances Yao: Nearest Neighbors Revisited. ISA 1991: 283
27		F. Frances Yao: Neighborhood Graphs and Geometric Embedding. WADS 1991: 201
26		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)
1990
25		Mike Paterson, F. Frances Yao: Optimal Binary Space Partitions for Orthogonal Objects. SODA 1990: 100-106
24		F. Frances Yao: Computational Geometry. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 343-389
23		Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao: Computing Euclidean Maximum Spanning Trees. Algorithmica 5(3): 407-419 (1990)
22		Mike Paterson, F. Frances Yao: Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling. Discrete & Computational Geometry 5: 485-503 (1990)
1989
21	EE	Mike Paterson, F. Frances Yao: Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. Symposium on Computational Geometry 1989: 23-32
20		F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson: Partitioning Space for Range Queries. SIAM J. Comput. 18(2): 371-384 (1989)
1988
19	EE	Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao: Computing Euclidean Maximum Spanning Trees. Symposium on Computational Geometry 1988: 241-251
18	EE	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
17		Daniel H. Greene, F. Frances Yao: Finite-Resolution Computational Geometry FOCS 1986: 143-152
16		Mike Paterson, F. Frances Yao: Point Retrieval for Polygons. J. Algorithms 7(3): 441-447 (1986)
1985
15		Andrew Chi-Chih Yao, F. Frances Yao: A General Approach to d-Dimensional Geometric Queries (Extended Abstract) STOC 1985: 163-168
14		Andrew Chi-Chih Yao, F. Frances Yao: On Fault-Tolerant Networks for Sorting. SIAM J. Comput. 14(1): 120-128 (1985)
1983
13		F. Frances Yao: A 3-Space Partition and Its Applications (Extended Abstract) STOC 1983: 258-263
12		Ronald L. Graham, F. Frances Yao: Finding the Convex Hull of a Simple Polygon. J. Algorithms 4(4): 324-331 (1983)
1982
11		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
10		F. Frances Yao: On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report) FOCS 1980: 301-307
9		Leonidas J. Guibas, F. Frances Yao: On Translating a Set of Rectangles STOC 1980: 154-160
8		F. Frances Yao: Efficient Dynamic Programming Using Quadrangle Inequalities STOC 1980: 429-435
7	EE	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)
6		Paul K. Stockmeyer, F. Frances Yao: On the Optimality of Linear Merge. SIAM J. Comput. 9(1): 85-90 (1980)
1979
5		F. Frances Yao: Graph 2-Isomorphism is NP-Complete. Inf. Process. Lett. 9(2): 68-72 (1979)
1978
4		Andrew Chi-Chih Yao, F. Frances Yao: On the Average-case Complexity of Selecting k-th Best FOCS 1978: 280-289
1976
3		Andrew Chi-Chih Yao, F. Frances Yao: The Complexity of Searching an Ordered Random Table (Extended Abstract) FOCS 1976: 173-177
2	EE	Andrew Chi-Chih Yao, Foong Frances Yao: Lower Bounds on Merging Networks. J. ACM 23(3): 566-571 (1976)
1973
1		Vaughan R. Pratt, Foong Frances Yao: On Lower Bounds for Computing the i-th Largest Element FOCS 1973: 70-81

Coauthor Index

1	Tetsuo Asano	[18]
2	Marshall W. Bern	[26] [29]
3	Binay K. Bhattacharya	[18]
4	Zhi-Zhong Chen	[60]
5	Alan J. Demers	[34]
6	David P. Dobkin	[20]
7	Herbert Edelsbrunner	[20]
8	David Eppstein	[26] [29] [38]
9	Ze Feng	[55] [60] [66]
10	Ronald L. Graham	[7] [12] [50] [55] [66]
11	Daniel H. Greene	[17] [33] [39]
12	Leonidas J. Guibas	[9]
13	Xiao-Dong Hu (Xiaodong Hu)	[49] [58] [61]
14	Scott C.-H. Huang	[56] [59]
15	Xiaohua Jia	[47] [48] [51]
16	J. Mark Keil	[18]
17	Minming Li	[40] [42] [45] [46] [50] [55] [59] [60] [66]
18	Yingshu Li	[56]
19	Becky Jie Liu	[45] [46]
20	Hai Liu	[48] [51]
21	Xinxin Liu	[48] [51]
22	Clyde L. Monma	[19] [23]
23	Michal Parnas	[33]
24	Mike Paterson	[16] [19] [20] [21] [22] [23] [25] [30] [31] [38]
25	Vaughan R. Pratt	[1]
26	Weiping Shang	[49] [58] [61]
27	Scott Shenker	[34]
28	Paul K. Stockmeyer	[6]
29	Subhash Suri	[19] [23]
30	Shang-Hua Teng	[32] [36] [52]
31	Chinh T. Vu	[56]
32	Peng-Jun Wan	[47] [48] [49] [51] [56] [58] [61] [63] [64]
33	Lixin Wang	[62] [63] [64]
34	Weili Wu	[59]
35	Andrew Chi-Chih Yao	[2] [3] [4] [7] [11] [14] [15] [35] [37] [53] [54] [65] [67]
36	Chih-Wei Yi	[47] [62] [64]
37	Yiqun Lisa Yin	[41] [44]
38	Nan Zang	[66]
39	Tong Zhang	[39]
40	Yunlei Zhao	[53] [54] [65] [67]

Colors in the list of coauthors