What is he best known for?
The fields of study he is best known for:
- Algorithm
- Computer network
- Combinatorics
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 most cited work include:
- A scheduling model for reduced CPU energy (1327 citations)
- Finding the convex hull of a simple polygon (202 citations)
- Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks (184 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (37.18%)
- Discrete mathematics (24.36%)
- Approximation algorithm (20.51%)
What were the highlights of his more recent work (between 2006-2017)?
- Approximation algorithm (20.51%)
- Wireless network (12.82%)
- Wireless ad hoc network (15.38%)
In recent papers he was focusing on the following fields of study:
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.
Between 2006 and 2017, his most popular works were:
- Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks (184 citations)
- Wireless link scheduling under physical interference model (87 citations)
- A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks (81 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Computer network
- Combinatorics
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.
