Baruch Awerbuch

14.0k citations
192 papers · 7.4k indexed · h-index 49

Baruch Awerbuch

189 papers receiving 6.7k citations

Peers

Baruch Awerbuch
Comparison fields: 5 of 93
  • Computer Networks and Communications 5.9k
  • Computational Theory and Mathematics 2.1k
  • Hardware and Architecture 552
  • Management Science and Operations Research 813
  • Computer Graphics and Computer-Aided Design 187
Replace Allan Borodin with:
Allan Borodin Canada
Clifford Stein United States
Daniel D. Sleator United States
Shimon Even Israel
Sanjeev Khanna United States
David Peleg Israel
Zvi Galil United States
Nikhil Bansal United States
Alon Itai Israel
Yossi Azar Israel
Baruch Awerbuch relative to Allan Borodin Canada Allan Borodin's profile →
Citations per field
00.5×1.5×2.0×
Allan Borodin · 1×
Citations per year

Countries citing papers authored by Baruch Awerbuch

Since Specialization
Citations

This map shows the geographic impact of Baruch Awerbuch's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Baruch Awerbuch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Baruch Awerbuch more than expected).

Fields of papers citing papers by Baruch Awerbuch

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Baruch Awerbuch. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Baruch Awerbuch. The network helps show where Baruch Awerbuch may publish in the future.

Co-authorship network

The 25 scholars most cited alongside Baruch Awerbuch, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Baruch Awerbuch Line = papers co-authored together Baruch Awerbuch links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1
Fast load balancing via bounded best response
20089
2 200864
3 2005157
4 200426
5 20043
6 200456
7 200114
8 199617
9 199454
10 199488
11
Bounding the Unbounded.
19946
12
Fast Network Decomposition (Extended Abstract).
19922
13
Distributed Shortest Paths Algorithms (Extended Abstract)
19891
14
Compact distributed data structures for adaptive routing
198947
15
Approximating the size of a dynamically growing asynchronous distributed network
19871
16
Errata to "Atomic Shared Register Access by Asynchronous Hardware"
19871
17
Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract)
19865
18 198533
19
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network.
198422
20
New Connectivity and MSF Algorithms for Ultracomputer and PRAM.
198340

About Baruch Awerbuch

Baruch Awerbuch is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Hardware and Architecture, having authored 192 papers that have together received 7.4k indexed citations. Recurring topics across this work include Optimization and Search Problems (86 papers), Distributed systems and fault tolerance (59 papers), Complexity and Algorithms in Graphs (44 papers), Interconnection Networks and Systems (33 papers), Mobile Ad Hoc Networks (25 papers), Peer-to-Peer Network Technologies (21 papers), Caching and Content Delivery (20 papers) and Advanced Graph Theory Research (20 papers). The work is most often cited by research in Computer Networks and Communications (5.9k citations), Computational Theory and Mathematics (2.1k citations) and Hardware and Architecture (552 citations). Baruch Awerbuch has collaborated with scholars based in United States, Israel and Germany. Frequent co-authors include David Peleg, Yossi Azar, Herbert Rubens, David Holmer, Christian Scheideler, Cristina Nita-Rotaru, Serge Plotkin, Robert Kleinberg, Silvio Micali and Benny Chor. Their work appears in journals such as IEEE Transactions on Information Theory, Communications of the ACM and Optics Letters.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026