Baruch Awerbuch mostly deals with Distributed computing, Computer network, Mathematical optimization, Distributed algorithm and Combinatorics. Baruch Awerbuch integrates Distributed computing with Synchronization networks in his study. His Computer network study often links to related topics such as Wireless ad hoc network.
His work on Approximation algorithm and Nash equilibrium as part of general Mathematical optimization study is frequently linked to Price of anarchy and Suurballe's algorithm, therefore connecting diverse disciplines of science. The Distributed algorithm study combines topics in areas such as Time complexity, Binary logarithm, Log-log plot and Spanning tree. His Combinatorics study incorporates themes from Routing table and Cover.
Baruch Awerbuch mainly focuses on Distributed computing, Computer network, Mathematical optimization, Distributed algorithm and Theoretical computer science. His work carried out in the field of Distributed computing brings together such families of science as Routing, Telecommunications network, Network topology, Communications protocol and Asynchronous communication. His study in Routing protocol, Dynamic Source Routing, Link-state routing protocol, Wireless Routing Protocol and Optimized Link State Routing Protocol is done as part of Computer network.
His Mathematical optimization study combines topics from a wide range of disciplines, such as Load balancing and Competitive analysis. His work deals with themes such as Algorithm and Exponential function, which intersect with Distributed algorithm. As a member of one scientific family, Baruch Awerbuch mostly works in the field of Theoretical computer science, focusing on Spanning tree and, on occasion, Minimum spanning tree.
Baruch Awerbuch focuses on Mathematical optimization, Distributed algorithm, Distributed computing, Computer network and Flow. His Mathematical optimization research incorporates elements of Graph and Load balancing. As a part of the same scientific family, he mostly works in the field of Load balancing, focusing on Competitive analysis and, on occasion, Online algorithm.
His studies deal with areas such as Theoretical computer science, Approximation algorithm, Path length and Exponential function as well as Distributed algorithm. Baruch Awerbuch does research in Distributed computing, focusing on Mobility model specifically. His study looks at the relationship between Computer network and fields such as Wireless network, as well as how they intersect with chemical problems.
Baruch Awerbuch spends much of his time researching Mathematical optimization, Scalability, Overlay network, Distributed computing and Distributed algorithm. When carried out as part of a general Mathematical optimization research project, his work on Nash equilibrium, Linear programming and Optimization problem is frequently linked to work in Price of anarchy, therefore connecting diverse disciplines of study. Baruch Awerbuch has included themes like Generator, Random number generation, Peer-to-peer, Shortest path problem and Linear combination in his Overlay network study.
His Distributed computing research incorporates themes from Correctness and Data management. His work carried out in the field of Distributed algorithm brings together such families of science as Multi-commodity flow problem, Path length, Speedup and Exponential function. His Quantum Byzantine agreement study combines topics from a wide range of disciplines, such as Wireless Routing Protocol and Computer network.
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.
Verifiable secret sharing and achieving simultaneity in the presence of faults
Benny Chor;Shafi Goldwasser;Silvio Micali;Baruch Awerbuch.
foundations of computer science (1985)
Complexity of network synchronization
Journal of the ACM (1985)
An on-demand secure routing protocol resilient to byzantine failures
Baruch Awerbuch;David Holmer;Cristina Nita-Rotaru;Herbert Rubens.
workshop on wireless security (2002)
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
symposium on the theory of computing (1987)
Throughput-competitive on-line routing
B. Awerbuch;Y. Azar;S. Plotkin.
foundations of computer science (1993)
Network decomposition and locality in distributed computation
B. Awerbuch;M. Luby;A.V. Goldberg;S.A. Plotkin.
foundations of computer science (1989)
The Price of Routing Unsplittable Flow
Baruch Awerbuch;Yossi Azar;Amir Epstein.
symposium on the theory of computing (2005)
B. Awerbuch;D. Peleg.
foundations of computer science (1990)
Self-stabilization by local checking and correction
B. Awerbuch;B. Patt-Shamir;G. Varghese.
foundations of computer science (1991)
High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks
Baruch Awerbuch;David Holmer;Herbert Rubens.
wireless on demand network systems and service (2004)
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: