What is he best known for?
The fields of study he is best known for:
- Computer network
- Algorithm
- Combinatorics
His primary scientific interests are in Load balancing, Competitive analysis, Mathematical optimization, Discrete mathematics and Scheduling.
He has included themes like Machine scheduling, Algorithm, Virtual circuit and Virtual circuit routing in his Load balancing study.
His Competitive analysis study is concerned with the larger field of Upper and lower bounds.
In his research on the topic of Mathematical optimization, Greedy algorithm is strongly related with Server.
His work deals with themes such as Dynamic resource and Combinatorics, which intersect with Discrete mathematics.
His Scheduling research includes themes of Randomized algorithm and Approximation algorithm.
His most cited work include:
- Balanced Allocations (713 citations)
- The Price of Routing Unsplittable Flow (317 citations)
- Throughput-competitive on-line routing (310 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Competitive analysis, Combinatorics, Mathematical optimization, Upper and lower bounds and Online algorithm.
His Competitive analysis research includes elements of Network packet, Scheduling, Algorithm, Randomized algorithm and Load balancing.
His Combinatorics study combines topics in areas such as Discrete mathematics and Sorting.
His biological study spans a wide range of topics, including Logarithm, Server and Combinatorial auction.
His Upper and lower bounds research focuses on Matching and how it relates to Metric space.
His study in Online algorithm is interdisciplinary in nature, drawing from both Theory of computation, Admission control and Parallel computing.
He most often published in these fields:
- Competitive analysis (41.40%)
- Combinatorics (35.35%)
- Mathematical optimization (28.37%)
What were the highlights of his more recent work (between 2013-2021)?
- Upper and lower bounds (26.98%)
- Competitive analysis (41.40%)
- Combinatorics (35.35%)
In recent papers he was focusing on the following fields of study:
Yossi Azar mainly investigates Upper and lower bounds, Competitive analysis, Combinatorics, Mathematical optimization and Online algorithm.
His Upper and lower bounds study incorporates themes from Discrete mathematics, Randomized algorithm and Embedding.
His research in Competitive analysis intersects with topics in Matching, Algorithm, Analysis of algorithms and Metric space.
His Combinatorics research is multidisciplinary, relying on both Function and Cluster analysis.
The Mathematical optimization study combines topics in areas such as Scheduling, Job shop scheduling and Logarithm.
His studies deal with areas such as Job scheduler, Theory of computation and Bin packing problem as well as Online algorithm.
Between 2013 and 2021, his most popular works were:
- Tight Comparison Bounds on the Complexity of Parallel Sorting (37 citations)
- Co-Location-Resistant Clouds (37 citations)
- Truthful Online Scheduling with Commitments (36 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Algorithm
- Combinatorics
His main research concerns Competitive analysis, Upper and lower bounds, Combinatorics, Mathematical optimization and Omega.
His Competitive analysis research integrates issues from Deterministic algorithm, Matching, Metric space, Randomized algorithm and Online algorithm.
His Upper and lower bounds research is multidisciplinary, incorporating perspectives in Binary logarithm and Discrete mathematics.
His work carried out in the field of Discrete mathematics brings together such families of science as Algorithm, Vector packing and Constant.
Yossi Azar has researched Combinatorics in several fields, including Norm, Rounding, Job shop scheduling and Logarithm.
His studies in Mathematical optimization integrate themes in fields like Scheduling, Regret, Scalar and Stochastic game.
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.
