D-Index & Metrics Best Publications

D-Index & Metrics 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.

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 46 Citations 6,611 152 World Ranking 4458 National Ranking 2232

Overview

What is he best known for?

The fields of study he is best known for:

  • Computer network
  • Operating system
  • Algorithm

His main research concerns Combinatorics, Discrete mathematics, K shortest path routing, Theoretical computer science and Shortest path problem. His Combinatorics study combines topics in areas such as Embedding, Distortion and Metric. His study focuses on the intersection of Discrete mathematics and fields such as Bounded function with connections in the field of Computational complexity theory and Cheap talk.

His K shortest path routing study combines topics from a wide range of disciplines, such as Routing table, Equal-cost multi-path routing, Path vector protocol and Routing Information Protocol. In his research on the topic of Theoretical computer science, Online advertising and Information asymmetry is strongly related with Nash equilibrium. His work on Constrained Shortest Path First, Euclidean shortest path and Shortest Path Faster Algorithm as part of his general Shortest path problem study is frequently connected to Yen's algorithm, thereby bridging the divide between different branches of science.

His most cited work include:

  • Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation (315 citations)
  • A hub-based labeling algorithm for shortest paths in road networks (181 citations)
  • Hierarchical hub labelings for shortest paths (155 citations)

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

Ittai Abraham mainly investigates Combinatorics, Discrete mathematics, Computer network, Theoretical computer science and Byzantine fault tolerance. His study in Combinatorics is interdisciplinary in nature, drawing from both Routing and Bounded function. His studies deal with areas such as Embedding and Polynomial as well as Discrete mathematics.

Ittai Abraham has researched Computer network in several fields, including Tree structure and Commit. His Theoretical computer science research integrates issues from Upper and lower bounds, Constant and Public key infrastructure. His Byzantine fault tolerance research is multidisciplinary, incorporating perspectives in Liveness, State machine replication and Asynchronous communication.

He most often published in these fields:

  • Combinatorics (26.94%)
  • Discrete mathematics (22.80%)
  • Computer network (17.62%)

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

  • Computer network (17.62%)
  • Upper and lower bounds (9.33%)
  • State machine replication (8.81%)

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

His primary areas of study are Computer network, Upper and lower bounds, State machine replication, Protocol and Byzantine architecture. In his work, Node is strongly intertwined with Buffer, which is a subfield of Computer network. His State machine replication research includes elements of Byzantine fault tolerance, Latency and Commit.

His Protocol study incorporates themes from Theoretical computer science, Public key infrastructure, Verifiable secret sharing, Asynchronous communication and Anonymity. Ittai Abraham undertakes interdisciplinary study in the fields of sync and Discrete mathematics through his works. His research in Discrete mathematics intersects with topics in Measure and Current.

Between 2019 and 2021, his most popular works were:

  • Sync HotStuff: Simple and Practical Synchronous State Machine Replication (24 citations)
  • On the Optimality of Optimistic Responsiveness (10 citations)
  • Aggregatable Subvector Commitments for Stateless Cryptocurrencies (6 citations)

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

  • Computer network
  • Operating system
  • Algorithm

Computer network, State machine replication, Latency, Communication source and Commit are his primary areas of study. His research combines Scalability and Computer network. As part of his studies on State machine replication, Ittai Abraham often connects relevant areas like Byzantine fault tolerance.

He conducted interdisciplinary study in his works that combined Byzantine fault tolerance and Throughput. Ittai Abraham merges many fields, such as Latency and Byzantine architecture, in his writings. As part of his studies on Communication source, he often connects relevant subjects like Upper and lower bounds.

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

Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation

Ittai Abraham;Danny Dolev;Rica Gonen;Joe Halpern.
principles of distributed computing (2006)

439 Citations

Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation

Ittai Abraham;Danny Dolev;Rica Gonen;Joe Halpern.
principles of distributed computing (2006)

439 Citations

HotStuff: BFT Consensus with Linearity and Responsiveness

Maofan Yin;Dahlia Malkhi;Michael K. Reiter;Guy Golan Gueta.
principles of distributed computing (2019)

348 Citations

HotStuff: BFT Consensus with Linearity and Responsiveness

Maofan Yin;Dahlia Malkhi;Michael K. Reiter;Guy Golan Gueta.
principles of distributed computing (2019)

348 Citations

A hub-based labeling algorithm for shortest paths in road networks

Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck.
symposium on experimental and efficient algorithms (2011)

306 Citations

A hub-based labeling algorithm for shortest paths in road networks

Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck.
symposium on experimental and efficient algorithms (2011)

306 Citations

Highway dimension, shortest paths, and provably efficient algorithms

Ittai Abraham;Amos Fiat;Andrew V. Goldberg;Renato F. Werneck.
symposium on discrete algorithms (2010)

285 Citations

Highway dimension, shortest paths, and provably efficient algorithms

Ittai Abraham;Amos Fiat;Andrew V. Goldberg;Renato F. Werneck.
symposium on discrete algorithms (2010)

285 Citations

Hierarchical hub labelings for shortest paths

Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck.
european symposium on algorithms (2012)

225 Citations

Hierarchical hub labelings for shortest paths

Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck.
european symposium on algorithms (2012)

225 Citations

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

Contact us

Best Scientists Citing Ittai Abraham

Daniel Delling

Daniel Delling

Apple (United States)

Publications: 36

Roger Wattenhofer

Roger Wattenhofer

ETH Zurich

Publications: 32

Renato F. Werneck

Renato F. Werneck

Microsoft (United States)

Publications: 31

Andrew V. Goldberg

Andrew V. Goldberg

Amazon (United States)

Publications: 27

Rachid Guerraoui

Rachid Guerraoui

École Polytechnique Fédérale de Lausanne

Publications: 25

Dorothea Wagner

Dorothea Wagner

Karlsruhe Institute of Technology

Publications: 24

Michael Elkin

Michael Elkin

Ben-Gurion University of the Negev

Publications: 24

Joseph Y. Halpern

Joseph Y. Halpern

Cornell University

Publications: 23

Nitin H. Vaidya

Nitin H. Vaidya

Georgetown University

Publications: 20

Fabian Kuhn

Fabian Kuhn

University of Freiburg

Publications: 19

Michel Raynal

Michel Raynal

Institut de Recherche en Informatique et Systèmes Aléatoires

Publications: 18

Jonathan Katz

Jonathan Katz

University of Maryland, College Park

Publications: 18

Robert Krauthgamer

Robert Krauthgamer

Weizmann Institute of Science

Publications: 18

David Peleg

David Peleg

Weizmann Institute of Science

Publications: 17

Idit Keidar

Idit Keidar

Technion – Israel Institute of Technology

Publications: 17

Yair Bartal

Yair Bartal

Hebrew University of Jerusalem

Publications: 17

Trending Scientists

Meikang Qiu

Meikang Qiu

Texas A&M University

Yanqin Wang

Yanqin Wang

East China University of Science and Technology

Lester F. Lau

Lester F. Lau

University of Illinois at Chicago

Hiroyuki Sasaki

Hiroyuki Sasaki

Kyushu University

Miska Luoto

Miska Luoto

University of Helsinki

Thomas R. Korfhagen

Thomas R. Korfhagen

Cincinnati Children's Hospital Medical Center

Anderson Miyoshi

Anderson Miyoshi

Universidade Federal de Minas Gerais

Jesse Roman

Jesse Roman

Thomas Jefferson University

Ian Marriott

Ian Marriott

University of North Carolina at Charlotte

Lawrence A. Hardie

Lawrence A. Hardie

Johns Hopkins University

Bernd Funke

Bernd Funke

Spanish National Research Council

Jianping Huang

Jianping Huang

Lanzhou University

Bryon D. Johnson

Bryon D. Johnson

Medical College of Wisconsin

Joseph K. Haseman

Joseph K. Haseman

National Institutes of Health

G. James Rubin

G. James Rubin

King's College London

Eric Bettinger

Eric Bettinger

Stanford University

Something went wrong. Please try again later.