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.
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.
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.
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.
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)
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)
HotStuff: BFT Consensus with Linearity and Responsiveness
Maofan Yin;Dahlia Malkhi;Michael K. Reiter;Guy Golan Gueta.
principles of distributed computing (2019)
HotStuff: BFT Consensus with Linearity and Responsiveness
Maofan Yin;Dahlia Malkhi;Michael K. Reiter;Guy Golan Gueta.
principles of distributed computing (2019)
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)
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)
Highway dimension, shortest paths, and provably efficient algorithms
Ittai Abraham;Amos Fiat;Andrew V. Goldberg;Renato F. Werneck.
symposium on discrete algorithms (2010)
Highway dimension, shortest paths, and provably efficient algorithms
Ittai Abraham;Amos Fiat;Andrew V. Goldberg;Renato F. Werneck.
symposium on discrete algorithms (2010)
Hierarchical hub labelings for shortest paths
Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck.
european symposium on algorithms (2012)
Hierarchical hub labelings for shortest paths
Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck.
european symposium on algorithms (2012)
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:
Diem Association
Hebrew University of Jerusalem
University of Bordeaux
Hebrew University of Jerusalem
Amazon (United States)
Apple (United States)
Microsoft (United States)
Bar-Ilan University
Cornell University
Duke University
Texas A&M University
East China University of Science and Technology
University of Illinois at Chicago
Kyushu University
University of Helsinki
Cincinnati Children's Hospital Medical Center
Universidade Federal de Minas Gerais
Thomas Jefferson University
University of North Carolina at Charlotte
Johns Hopkins University
Spanish National Research Council
Lanzhou University
Medical College of Wisconsin
National Institutes of Health
King's College London
Stanford University