default search action
F. Frances Yao
Person information
- affiliation: City University of Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c48]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
- [j36]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
- [c47]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
- [j35]Minming Li
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs. Algorithmica 61(4): 1000-1021 (2011) - [c46]Peng-Jun Wan, Ophir Frieder, Xiaohua Jia
Wireless link scheduling under physical interference model. INFOCOM 2011: 838-845 - [c45]Peng-Jun Wan, Yu Cheng
Multiflows in multi-channel multi-radio multihop wireless networks. INFOCOM 2011: 846-854 - 2010
- [c44]Peng-Jun Wan, Lixin Wang, Ai Huang, Minming Li
Approximate Capacity Subregions of Uniform Multihop Wireless Networks. INFOCOM 2010: 1388-1396 - [c43]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
- [j34]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): 25-44 (2009) - [j33]Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A note on the feasibility of generalised universal composability. Math. Struct. Comput. Sci. 19(1): 193-205 (2009) - [j32]Peng-Jun Wan, Chih-Wei Yi
Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks. IEEE Trans. Commun. 57(5): 1433-1443 (2009) - [j31]Minming Li
Approximately optimal trees for group key management with batch updates. Theor. Comput. Sci. 410(11): 1013-1021 (2009) - [j30]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) - [c42]Frances F. Yao:
Algorithmic Problems in Computer and Network Power Management. FAW 2009: 3 - [c41]Minming Li
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. ISAAC 2009: 699-709 - [c40]Peng-Jun Wan, Xiaohua Jia
Maximum Independent Set of Links under Physical Interference Model. WASA 2009: 169-178 - 2008
- [j29]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) - [j28]Zhi-Zhong Chen, Ze Feng, Minming Li
Optimizing deletion cost for secure multicast key management. Theor. Comput. Sci. 401(1-3): 52-61 (2008) - [j27]Scott C.-H. Huang, F. Frances Yao, Minming Li
Lower bounds and new constructions on secure group communication schemes. Theor. Comput. Sci. 407(1-3): 511-523 (2008) - [c39]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 - [c38]Peng-Jun Wan, Lixin Wang, F. Frances Yao:
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. ICDCS 2008: 337-344 - [c37]Lixin Wang, Chih-Wei Yi
Improved asymptotic bounds on critical transmission radius for greedy forward routing in wireless ad hoc networks. MobiHoc 2008: 131-138 - 2007
- [j26]Shang-Hua Teng, Frances F. Yao:
k-Nearest-Neighbor Clustering and Percolation Theory. Algorithmica 49(3): 192-211 (2007) - [j25]Ronald L. Graham, Minming Li
Optimal Tree Structures for Group Key Management with Batch Updates. SIAM J. Discret. Math. 21(2): 532-547 (2007) - [j24]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) - [j23]Hai Liu, Xiaohua Jia
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks. IEEE Trans. Parallel Distributed Syst. 18(5): 658-671 (2007) - [c36]Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu:
Algorithms for Minimum m -Connected k -Dominating Set Problem. COCOA 2007: 182-190 - [c35]Frances F. Yao:
Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors. CPM 2007: 3 - [c34]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 - [c33]Minming Li
Approximately Optimal Trees for Group Key Management with Batch Updates. TAMC 2007: 284-295 - [c32]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 - [c31]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 Cryptol. ePrint Arch. 2007: 191 (2007) - 2006
- [j22]Minming Li
Min-energy voltage allocation for tree-structured tasks. J. Comb. Optim. 11(3): 305-319 (2006) - [j21]Minming Li
Discrete and continuous min-energy schedules for variable voltage processors. Proc. Natl. Acad. Sci. USA 103(11): 3983-3987 (2006) - [c30]Hai Liu, Peng-Jun Wan, Xiaohua Jia
Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks. INFOCOM 2006 - [c29]Peng-Jun Wan, Chih-Wei Yi
Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks. MobiHoc 2006: 25-36 - 2005
- [j20]Minming Li
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. Inf. Theory 51(9): 3292-3297 (2005) - [c28]Minming Li, Becky Jie Liu, Frances F. Yao:
Min-Energy Voltage Allocation for Tree-Structured Tasks. COCOON 2005: 283-296 - [c27]Frances F. Yao, Yiqun Lisa Yin:
Design and Analysis of Password-Based Key Derivation Functions. CT-RSA 2005: 245-261 - [c26]F. Frances Yao:
Algorithmic Problems in Wireless Ad Hoc Networks. ISAAC 2005: 1 - [c25]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
- [c24]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. Discret. Comput. Geom. 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) - [c23]Daniel Greene, Mohan Vishwanath, F. Frances Yao, Tong Zhang:
A progressive Ziv-Lempel algorithm for image compression. SEQUENCES 1997: 136-144 - 1995
- [c22]Andrew Chi-Chih Yao, F. Frances Yao:
Dictionary Loop-Up with Small Errors. CPM 1995: 387-394 - [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]Shang-Hua Teng, F. Frances Yao:
Approximating Shortest Superstrings. FOCS 1993: 158-165 - 1992
- [j15]Mike Paterson, F. Frances Yao:
Optimal Binary Space Partitions for Orthogonal Objects. J. Algorithms 13(1): 99-113 (1992) - [c18]Mike Paterson, F. Frances Yao:
On Nearest-Neighbor Graphs. ICALP 1992: 416-426 - 1991
- [j14]Marshall W. Bern, David Eppstein, F. Frances Yao:
The expected extremes in a Delaunay triangulation. Int. J. Comput. Geom. 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]F. Frances Yao:
Nearest Neighbors Revisited. ISA 1991: 283 - [c15]F. Frances Yao:
Neighborhood Graphs and Geometric Embedding. WADS 1991: 201 - 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. Discret. Comput. Geom. 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. SCG 1989: 23-32 - 1988
- [c11]Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao:
Computing Euclidean Maximum Spanning Trees. SCG 1988: 241-251 - [c10]Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao:
Clustering Algorithms Based on Minimum and Maximum Spanning Trees. SCG 1988: 252-257 - 1986
- [j10]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
- [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]F. Frances Yao:
A 3-Space Partition and Its Applications (Extended Abstract). STOC 1983: 258-263 - 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. Algebraic Discret. Methods 1(3): 251-258 (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
1970 – 1979
- 1979
- [j3]F. Frances Yao:
Graph 2-Isomorphism is NP-Complete. Inf. Process. Lett. 9(2): 68-72 (1979) - 1978
- [j2]Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao:
Addition chains with multiplicative cost. Discret. Math. 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 1973: 70-81
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: