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 72 Citations 17,507 173 World Ranking 707 National Ranking 430

Overview

What is he best known for?

The fields of study he is best known for:

  • Computer network
  • Operating system
  • Algorithm

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.

His most cited work include:

  • Complexity of network synchronization (635 citations)
  • Verifiable secret sharing and achieving simultaneity in the presence of faults (630 citations)
  • An on-demand secure routing protocol resilient to byzantine failures (472 citations)

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

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.

He most often published in these fields:

  • Distributed computing (36.48%)
  • Computer network (25.41%)
  • Mathematical optimization (15.98%)

What were the highlights of his more recent work (between 2006-2014)?

  • Mathematical optimization (15.98%)
  • Distributed algorithm (14.34%)
  • Distributed computing (36.48%)

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

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.

Between 2006 and 2014, his most popular works were:

  • Online linear optimization and adaptive routing (158 citations)
  • ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks (155 citations)
  • A jamming-resistant MAC protocol for single-hop wireless networks (146 citations)

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

  • Computer network
  • Operating system
  • Algorithm

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.

Best Publications

Verifiable secret sharing and achieving simultaneity in the presence of faults

Benny Chor;Shafi Goldwasser;Silvio Micali;Baruch Awerbuch.
foundations of computer science (1985)

1083 Citations

Complexity of network synchronization

Baruch Awerbuch.
Journal of the ACM (1985)

979 Citations

An on-demand secure routing protocol resilient to byzantine failures

Baruch Awerbuch;David Holmer;Cristina Nita-Rotaru;Herbert Rubens.
workshop on wireless security (2002)

723 Citations

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

B. Awerbuch.
symposium on the theory of computing (1987)

465 Citations

Throughput-competitive on-line routing

B. Awerbuch;Y. Azar;S. Plotkin.
foundations of computer science (1993)

465 Citations

Network decomposition and locality in distributed computation

B. Awerbuch;M. Luby;A.V. Goldberg;S.A. Plotkin.
foundations of computer science (1989)

418 Citations

The Price of Routing Unsplittable Flow

Baruch Awerbuch;Yossi Azar;Amir Epstein.
symposium on the theory of computing (2005)

393 Citations

Sparse partitions

B. Awerbuch;D. Peleg.
foundations of computer science (1990)

371 Citations

Self-stabilization by local checking and correction

B. Awerbuch;B. Patt-Shamir;G. Varghese.
foundations of computer science (1991)

345 Citations

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)

269 Citations

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

Contact us

Best Scientists Citing Baruch Awerbuch

David Peleg

David Peleg

Weizmann Institute of Science

Publications: 100

Michael Elkin

Michael Elkin

Ben-Gurion University of the Negev

Publications: 87

Shay Kutten

Shay Kutten

Technion – Israel Institute of Technology

Publications: 83

Christian Scheideler

Christian Scheideler

University of Paderborn

Publications: 70

Roger Wattenhofer

Roger Wattenhofer

ETH Zurich

Publications: 68

Andrzej Pelc

Andrzej Pelc

Université du Québec en Outaouais

Publications: 68

Fabian Kuhn

Fabian Kuhn

University of Freiburg

Publications: 67

Anupam Gupta

Anupam Gupta

Carnegie Mellon University

Publications: 58

Yossi Azar

Yossi Azar

Tel Aviv University

Publications: 58

Boaz Patt-Shamir

Boaz Patt-Shamir

Tel Aviv University

Publications: 57

Stefan Schmid

Stefan Schmid

University of Vienna

Publications: 52

Cyril Gavoille

Cyril Gavoille

University of Bordeaux

Publications: 51

Dariusz R. Kowalski

Dariusz R. Kowalski

Augusta University

Publications: 50

Matthew Andrews

Matthew Andrews

Nokia (United States)

Publications: 48

Shlomi Dolev

Shlomi Dolev

Ben-Gurion University of the Negev

Publications: 48

Gopal Pandurangan

Gopal Pandurangan

University of Houston

Publications: 41

Trending Scientists

Wojciech Rytter

Wojciech Rytter

University of Warsaw

Ali F. Darrat

Ali F. Darrat

Louisiana Tech University

Zhidong Teng

Zhidong Teng

Xinjiang University

Yugang Niu

Yugang Niu

East China University of Science and Technology

Glen J. Anderson

Glen J. Anderson

Intel (United States)

Neil Hall

Neil Hall

Norwich Research Park

Cory C. Cleveland

Cory C. Cleveland

University of Montana

Chae-Ok Yun

Chae-Ok Yun

Hanyang University

Takafumi Tsuboi

Takafumi Tsuboi

Ehime University

Gilbert Féraud

Gilbert Féraud

Université Côte d'Azur

Stefan Van der Stigchel

Stefan Van der Stigchel

Utrecht University

René Mõttus

René Mõttus

University of Edinburgh

Norman Sartorius

Norman Sartorius

World Psychiatric Association

Jörgen A. Engel

Jörgen A. Engel

University of Gothenburg

Allan I. Pack

Allan I. Pack

University of Pennsylvania

Werner Seeger

Werner Seeger

University of Giessen

Something went wrong. Please try again later.