World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
81
Citations
20246
World Ranking
1042
National Ranking
554

Overview

Baruch Awerbuch is a researcher affiliated with Johns Hopkins University in the United States. Their work is situated within an academic environment known for extensive research activity, although specific details regarding their publications, co-authors, and fields of study are not documented here.

Awerbuch's profile does not list recent papers or specific research topics, which limits insights into particular contributions or thematic areas of expertise. Likewise, information about frequent collaborators and common publication venues is not available, making it difficult to trace patterns in their research network or dissemination channels.

There are no records of book publications or awards attributed to Awerbuch. This absence of additional documentation suggests the profile focuses exclusively on their association with Johns Hopkins University without further elaboration on academic outputs or recognitions.

The lack of detailed subfields and main topics of study indicates that the exact scope of Awerbuch's research interests and specialization cannot be outlined from the provided data.

Best Publications

  • Verifiable secret sharing and achieving simultaneity in the presence of faults

    Benny Chor;Shafi Goldwasser;Silvio Micali;Baruch Awerbuch

  • Complexity of network synchronization

    Baruch Awerbuch

  • An on-demand secure routing protocol resilient to byzantine failures

    Baruch Awerbuch;David Holmer;Cristina Nita-Rotaru;Herbert Rubens

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

    B. Awerbuch

  • Throughput-competitive on-line routing

    B. Awerbuch;Y. Azar;S. Plotkin

  • The Price of Routing Unsplittable Flow

    Baruch Awerbuch;Yossi Azar;Amir Epstein

  • Sparse partitions

    B. Awerbuch;D. Peleg

  • Network decomposition and locality in distributed computation

    B. Awerbuch;M. Luby;A.V. Goldberg;S.A. Plotkin

  • Self-stabilization by local checking and correction

    B. Awerbuch;B. Patt-Shamir;G. Varghese

  • New Approximation Guarantees for Minimum-Weight k -Trees and Prize-Collecting Salesmen

    Baruch Awerbuch;Yossi Azar;Avrim Blum;Santosh Vempala

  • Compact distributed data structures for adaptive routing

    B. Awerbuch;Amotz Bar-Noy;Nathan Linial;D. Peleg

  • Concurrent online tracking of mobile users

    Baruch Awerbuch;David Peleg

  • Adaptive routing with end-to-end feedback: distributed learning and geometric approaches

    Baruch Awerbuch;Robert D. Kleinberg

  • Routing with polynomial communication-space trade-off

    Baruch Awerbuch;David Peleg

  • High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks

    Baruch Awerbuch;David Holmer;Herbert Rubens

  • ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks

    Baruch Awerbuch;Reza Curtmola;David Holmer;Cristina Nita-Rotaru

  • Atomic shared register access by asynchronous hardware

    Paul M. B. Vitanyi;Baruch Awerbuch

  • Buy-at-bulk network design

    B. Awerbuch;Y. Azar

  • Competitive distributed file allocation

    Baruch Awerbuch;Yair Bartal;Amos Fiat

  • An opportunity cost approach for job assignment in a scalable computing cluster

    Y. Amir;B. Awerbuch;A. Barak;R.S. Borgstrom

  • Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)

    Benny Chor;Shafi Goldwasser;Silvio Micali;Baruch Awerbuch

  • Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary)

    Baruch Awerbuch

Frequent Co-Authors

Yossi Azar
Yossi Azar Tel Aviv University
David Peleg
David Peleg Weizmann Institute of Science
Boaz Patt-Shamir
Boaz Patt-Shamir Tel Aviv University
Christian Scheideler
Christian Scheideler University of Paderborn
Shay Kutten
Shay Kutten Technion – Israel Institute of Technology
Yishay Mansour
Yishay Mansour Tel Aviv University
Amos Fiat
Amos Fiat Tel Aviv University
Yair Bartal
Yair Bartal Hebrew University of Jerusalem
Paul M. B. Vitányi
Paul M. B. Vitányi Centrum Wiskunde & Informatica

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

Report an issue

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:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA can open doors to a wide range of high-demand careers. Many students look for short careers that pay well after graduating, and computer science consistently ranks as a rewarding and fast-paced field.

For those interested in specialized areas, the best online ai degree programs provide innovative options to build expertise in artificial intelligence, a field seeing rapid growth and strong earning potential. Online learning offers flexibility for working professionals and international students alike.

When planning your educational path, consider exploring the top degrees for the future to align your studies with industries projected for sustained growth and technological advancement.

Graduate degrees can further boost career prospects, but it’s important to select a program that matches your goals and lifestyle. If you prefer a streamlined route, research what is the easiest masters degree to get for practical options that don’t compromise on value or outcomes.

Best Scientists Citing Baruch Awerbuch

Recently Published Articles