D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 33 Citations 6,449 67 World Ranking 6583 National Ranking 114

Overview

What is he best known for?

The fields of study he is best known for:

  • Computer network
  • Operating system
  • Discrete mathematics

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.

His most cited work include:

  • Probabilistic approximation of metric spaces and its algorithmic applications (622 citations)
  • On approximating arbitrary metrices by tree metrics (484 citations)
  • New algorithms for an ancient scheduling problem (205 citations)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

  • Combinatorics (45.30%)
  • Discrete mathematics (39.32%)
  • Metric space (32.48%)

What were the highlights of his more recent work (between 2013-2021)?

  • Discrete mathematics (39.32%)
  • Combinatorics (45.30%)
  • Euclidean space (15.38%)

In recent papers he was focusing on the following fields of study:

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.

Between 2013 and 2021, his most popular works were:

  • The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (25 citations)
  • On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion (7 citations)
  • On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp (7 citations)

In his most recent research, the most cited papers focused on:

  • Computer network
  • Operating system
  • Discrete mathematics

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.

Best Publications

Probabilistic approximation of metric spaces and its algorithmic applications

Y. Bartal.
foundations of computer science (1996)

842 Citations

On approximating arbitrary metrices by tree metrics

Yair Bartal.
symposium on the theory of computing (1998)

615 Citations

Firmato: a novel firewall management toolkit

Yair Bartal;Alain Mayer;Kobbi Nissim;Avishai Wool.
ieee symposium on security and privacy (1999)

374 Citations

Multiprocessor Scheduling with Rejection

Yair Bartal;Stefano Leonardi;Alberto Marchetti-Spaccamela;Jirí Sgall.
SIAM Journal on Discrete Mathematics (2000)

338 Citations

New algorithms for an ancient scheduling problem

Yair Bartal;Amos Fiat;Howard Karloff;Rakesh Vohra.
symposium on the theory of computing (1992)

300 Citations

Competitive algorithms for distributed data management

Yair Bartal;Amos Fiat;Yuval Rabani.
symposium on the theory of computing (1995)

284 Citations

Incentive compatible multi unit combinatorial auctions

Yair Bartal;Rica Gonen;Noam Nisan.
theoretical aspects of rationality and knowledge (2003)

233 Citations

Competitive distributed file allocation

Baruch Awerbuch;Yair Bartal;Amos Fiat.
symposium on the theory of computing (1993)

223 Citations

Competitive non-preemptive call control

Baruch Awerbuch;Yair Bartal;Amos Fiat;Adi Rosén.
symposium on discrete algorithms (1994)

222 Citations

On metric ramsey-type phenomena

Yair Bartal;Nathan Linial;Manor Mendel;Assaf Naor.
symposium on the theory of computing (2003)

174 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Yair Bartal

Assaf Naor

Assaf Naor

Princeton University

Publications: 66

Anupam Gupta

Anupam Gupta

Carnegie Mellon University

Publications: 53

Yossi Azar

Yossi Azar

Tel Aviv University

Publications: 48

MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi

University of Maryland, College Park

Publications: 45

Leah Epstein

Leah Epstein

University of Haifa

Publications: 41

James R. Lee

James R. Lee

University of Washington

Publications: 38

Joseph (Seffi) Naor

Joseph (Seffi) Naor

Technion – Israel Institute of Technology

Publications: 34

Fabian Kuhn

Fabian Kuhn

University of Freiburg

Publications: 34

Michael Elkin

Michael Elkin

Ben-Gurion University of the Negev

Publications: 33

Baruch Awerbuch

Baruch Awerbuch

Johns Hopkins University

Publications: 33

Nikhil Bansal

Nikhil Bansal

Eindhoven University of Technology

Publications: 28

Susanne Albers

Susanne Albers

Technical University of Munich

Publications: 27

Robert Krauthgamer

Robert Krauthgamer

Weizmann Institute of Science

Publications: 26

Chandra Chekuri

Chandra Chekuri

University of Illinois at Urbana-Champaign

Publications: 25

Roger Wattenhofer

Roger Wattenhofer

ETH Zurich

Publications: 23

Guy Kortsarz

Guy Kortsarz

Rutgers, The State University of New Jersey

Publications: 23

Something went wrong. Please try again later.