Discrete mathematics, Combinatorics, Distributed computing, Competitive analysis and Security policy are his primary areas of study. His Metric space and Spanning tree study in the realm of Discrete mathematics connects with subjects such as Construction industry. His Combinatorics research incorporates elements of Tree and Computational complexity theory.
His Competitive analysis research is multidisciplinary, incorporating perspectives in Algorithm, Multiprocessor scheduling and Job shop scheduling. His studies in Algorithm integrate themes in fields like Theoretical computer science, Metric, Equivalence of metrics, Convex metric space and K-server problem. His Security policy study combines topics from a wide range of disciplines, such as DMZ, Firewall, Stateful firewall, Context-based access control and Application firewall.
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Metric space, Embedding and Competitive analysis. The study of Combinatorics is intertwined with the study of Distortion in a number of ways. His Discrete mathematics research is multidisciplinary, incorporating elements of Bounded function, Approximation algorithm and Euclidean space.
He interconnects Subspace topology and Metric in the investigation of issues within Metric space. His Competitive analysis research includes elements of Algorithm, Randomized algorithm, Deterministic algorithm and Generalization. The Algorithm study combines topics in areas such as Distributed algorithm, Distributed computing, Line, Scheduling and K-server problem.
Yair Bartal mainly focuses on Discrete mathematics, Combinatorics, Euclidean space, Embedding and Metric. As part of his studies on Discrete mathematics, Yair Bartal often connects relevant areas like Bounded function. As part of his studies on Combinatorics, he often connects relevant subjects like Distortion.
Yair Bartal has researched Metric in several fields, including Theoretical computer science, Approximation algorithm, Online algorithm and Constant. His research integrates issues of Intrinsic metric, Injective metric space, Equivalence of metrics and Convex metric space in his study of Theoretical computer science. His studies deal with areas such as Upper and lower bounds, Competitive analysis, Overhead and Subadditivity as well as Online algorithm.
Yair Bartal focuses on Discrete mathematics, Euclidean space, Combinatorics, Metric space and Embedding. His biological study spans a wide range of topics, including Metric and Search algorithm. His Metric study which covers Cardinality that intersects with Distortion.
His Combinatorics research includes themes of Spanner, Routing and Type. His Metric space study combines topics in areas such as Point and Bounded function. His study in Embedding is interdisciplinary in nature, drawing from both Scaling and Spanning tree.
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.
Probabilistic approximation of metric spaces and its algorithmic applications
foundations of computer science (1996)
On approximating arbitrary metrices by tree metrics
symposium on the theory of computing (1998)
Firmato: a novel firewall management toolkit
Yair Bartal;Alain Mayer;Kobbi Nissim;Avishai Wool.
ieee symposium on security and privacy (1999)
Multiprocessor Scheduling with Rejection
Yair Bartal;Stefano Leonardi;Alberto Marchetti-Spaccamela;Jirí Sgall.
SIAM Journal on Discrete Mathematics (2000)
New algorithms for an ancient scheduling problem
Yair Bartal;Amos Fiat;Howard Karloff;Rakesh Vohra.
symposium on the theory of computing (1992)
Competitive algorithms for distributed data management
Yair Bartal;Amos Fiat;Yuval Rabani.
symposium on the theory of computing (1995)
Incentive compatible multi unit combinatorial auctions
Yair Bartal;Rica Gonen;Noam Nisan.
theoretical aspects of rationality and knowledge (2003)
Competitive distributed file allocation
Baruch Awerbuch;Yair Bartal;Amos Fiat.
symposium on the theory of computing (1993)
Competitive non-preemptive call control
Baruch Awerbuch;Yair Bartal;Amos Fiat;Adi Rosén.
symposium on discrete algorithms (1994)
On metric ramsey-type phenomena
Yair Bartal;Nathan Linial;Manor Mendel;Assaf Naor.
symposium on the theory of computing (2003)
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: