Остановите войну!
for scientists:
default search action
F. Frances Yao
- > Home > Persons > F. Frances Yao
Publications
- 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) - 2011
- [j35]Minming Li, Peng-Jun Wan, F. Frances Yao:
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs. Algorithmica 61(4): 1000-1021 (2011) - 2010
- [c44]Peng-Jun Wan, Lixin Wang, Ai Huang, Minming Li, F. Frances Yao:
Approximate Capacity Subregions of Uniform Multihop Wireless Networks. INFOCOM 2010: 1388-1396 - 2009
- [j31]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) - [c41]Minming Li, Peng-Jun Wan, F. Frances Yao:
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. ISAAC 2009: 699-709 - 2008
- [j28]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) - [j27]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
- [j25]Ronald L. Graham, Minming Li, Frances F. Yao:
Optimal Tree Structures for Group Key Management with Batch Updates. SIAM J. Discret. Math. 21(2): 532-547 (2007) - [c33]Minming Li, Ze Feng, Ronald L. Graham, Frances F. Yao:
Approximately Optimal Trees for Group Key Management with Batch Updates. TAMC 2007: 284-295 - 2006
- [j22]Minming Li, Becky Jie Liu, Frances F. Yao:
Min-energy voltage allocation for tree-structured tasks. J. Comb. Optim. 11(3): 305-319 (2006) - [j21]Minming Li, Andrew C. Yao, Frances F. Yao:
Discrete and continuous min-energy schedules for variable voltage processors. Proc. Natl. Acad. Sci. USA 103(11): 3983-3987 (2006) - 2005
- [j20]Minming Li, F. Frances Yao:
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. SIAM J. Comput. 35(3): 658-671 (2005) - [c28]Minming Li, Becky Jie Liu, Frances F. Yao:
Min-Energy Voltage Allocation for Tree-Structured Tasks. COCOON 2005: 283-296 - [c25]Minming Li, Frances F. Yao:
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. MFCS 2005: 652-663
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-04-25 01:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint