1993 - Fellow of the American Association for the Advancement of Science (AAAS)
F. Frances Yao spends much of his time researching Combinatorics, Scheduling, Discrete mathematics, Job scheduler and Mathematical optimization. His research investigates the connection between Combinatorics and topics such as Solid modeling that intersect with problems in Algorithm, Computational geometry and Visualization. His Scheduling research integrates issues from Distributed computing, Wireless network and Approximation algorithm.
His work on Kruskal's algorithm and Minimum degree spanning tree as part of his general Discrete mathematics study is frequently connected to Random graph, Ball tree and Null graph, thereby bridging the divide between different branches of science. His studies in Job scheduler integrate themes in fields like Binary logarithm, Parallel computing and Dynamic voltage scaling. Dynamic voltage scaling connects with themes related to Power function in his study.
His primary areas of study are Combinatorics, Discrete mathematics, Approximation algorithm, Algorithm and Wireless ad hoc network. His work on Conjecture, Hyperplane and Delaunay triangulation is typically connected to Euclidean shortest path and K shortest path routing as part of general Combinatorics study, connecting several disciplines of science. His work on Shortest-path tree as part of general Discrete mathematics research is often related to Set, thus linking different fields of science.
His Approximation algorithm research is multidisciplinary, incorporating perspectives in Wireless network, Connected dominating set and Topology. His Algorithm research includes themes of Job scheduler and Scheduling. His work deals with themes such as Efficient algorithm, Competitive analysis and Dynamic voltage scaling, which intersect with Job scheduler.
Approximation algorithm, Wireless network, Wireless ad hoc network, Distributed computing and Dominating set are his primary areas of study. His Approximation algorithm research incorporates themes from Algorithm design, Connected dominating set, Key and Topology. F. Frances Yao focuses mostly in the field of Algorithm design, narrowing it down to matters related to Latency and, in some cases, Scheduling.
His biological study spans a wide range of topics, including Optimization problem and Computer network. His studies in Wireless ad hoc network integrate themes in fields like Discrete mathematics, Routing, Mobile ad hoc network and Distributed algorithm. Connected component is the focus of his Combinatorics research.
The scientist’s investigation covers issues in Approximation algorithm, Dominating set, Wireless network, Mathematical optimization and Topology. His Approximation algorithm research incorporates elements of Wireless sensor network, Algorithm design and Scheduling. The concepts of his Scheduling study are interwoven with issues in Throughput and Radio resource management.
His Wireless network study incorporates themes from Computer network and Distributed computing. His Upper and lower bounds study, which is part of a larger body of work in Topology, is frequently linked to Linear approximation, bridging the gap between disciplines. F. Frances Yao has researched Combinatorics in several fields, including Range, Discrete mathematics and Key.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A scheduling model for reduced CPU energy
F. Yao;A. Demers;S. Shenker.
foundations of computer science (1995)
Finding the convex hull of a simple polygon
Ronald L Graham;F Frances Yao.
Journal of Algorithms (1983)
Efficient binary space partitions for hidden-surface removal and solid modeling
Michael S. Paterson;F. Frances Yao.
symposium on computational geometry (1990)
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
S.C.-H. Huang;Peng-Jun Wan;C.T. Vu;Yingshu Li.
ieee international conference computer and communications (2007)
Finite-resolution computational geometry
Daniel H. Greene;F. Frances Yao.
foundations of computer science (1986)
On Nearest-Neighbor Graphs
D. Eppstein;M. S. Paterson;F. F. Yao.
Discrete and Computational Geometry (1997)
Clustering algorithms based on minimum and maximum spanning trees
T. Asano;B. Bhattacharya;M. Keil;F. Yao.
symposium on computational geometry (1988)
Optimal binary space partitions for orthogonal objects
Michael S. Paterson;F. Frances Yao.
Journal of Algorithms (1992)
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks
Hai Liu;Xiaohua Jia;Peng-Jun Wan;Xinxin Liu.
IEEE Transactions on Parallel and Distributed Systems (2007)
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
Minming Li;Frances F. Yao.
SIAM Journal on Computing (2005)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: