Baruch Awerbuch | Academic Influence

Baruch Awerbuch's AcademicInfluence.com Rankings

Baruch Awerbuch

Computer Science

#1857

World Rank

#1928

Historical Rank

#887

USA Rank

Database

#2819

World Rank

#2944

Historical Rank

#569

USA Rank

computer-science Degrees

Download Badge

Computer Science

Baruch Awerbuch's Degrees

PhD Computer Science Princeton University
Masters Computer Science Princeton University
Bachelors Computer Science Technion – Israel Institute of Technology

Similar Degrees You Can Earn

Why Is Baruch Awerbuch Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Baruch Awerbuch is an Israeli-American computer scientist and a professor of computer science at Johns Hopkins University. He is known for his research on distributed computing. Academic biography Awerbuch was educated at the Technion in Haifa, Israel, earning a bachelor's degree in 1978, a master's degree in 1982, and a Ph.D. in 1984 under the supervision of Shimon Even. He worked at the Massachusetts Institute of Technology as a postdoctoral researcher, faculty member in applied mathematics, and research associate in computer science from 1984 until 1994, when he joined the Johns Hopkins faculty.

(See a Problem?)

Baruch Awerbuch's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Verifiable secret sharing and achieving simultaneity in the presence of faults (1985) (884)
Complexity of network synchronization (1985) (723)
An on-demand secure routing protocol resilient to byzantine failures (2002) (620)
The Price of Routing Unsplittable Flow (2005) (398)
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems (1987) (385)
Throughput-competitive on-line routing (1993) (338)
Self-stabilization by local checking and correction (1991) (320)
Network decomposition and locality in distributed computation (1989) (320)
Sparse partitions (1990) (297)
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches (2004) (251)
High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks (2004) (242)
Concurrent online tracking of mobile users (1991) (235)
The online set cover problem (2003) (228)
ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks (2008) (208)
Atomic shared register access by asynchronous hardware (1986) (196)
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (1994) (188)
Universal-stability results and performance bounds for greedy contention-resolution protocols (2001) (188)
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster (2000) (186)
Online linear optimization and adaptive routing (2008) (183)
Buy-at-bulk network design (1997) (180)
Routing with Polynomial Communication-Space Trade-Off (1992) (180)
Distributed program checking: a paradigm for building self-stabilizing distributed protocols (1991) (177)
Universal stability results for greedy contention-resolution protocols (1996) (176)
A New Distributed Depth-First-Search Algorithm (1985) (164)
A jamming-resistant MAC protocol for single-hop wireless networks (2008) (161)
Online tracking of mobile users (1995) (159)
The Medium Time Metric: High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks (2006) (159)
Competitive non-preemptive call control (1994) (158)
Towards a Scalable and Robust DHT (2006) (156)
Improved Routing Strategies with Succinct Tables (1990) (151)
Time optimal self-stabilizing synchronization (1993) (149)
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (1999) (144)
A simple local-control approximation algorithm for multicommodity flow (1993) (142)
Applying static network protocols to dynamic networks (1987) (138)
Cost-sensitive analysis of communication protocols (1990) (135)
A general approach to online network optimization problems (2004) (134)
Compact distributed data structures for adaptive routing (1989) (132)
A new distributed algorithm to find breadth first search trees (1987) (129)
Network synchronization with polylogarithmic overhead (1990) (124)
Competitive distributed file allocation (1993) (119)
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM (1987) (117)
Fast convergence to nearly optimal solutions in potential games (2008) (113)
A trade-off between information and communication in broadcast protocols (1990) (112)
On-line admission control and circuit routing for high performance computing and communication (1994) (112)
On-line generalized Steiner problem (1996) (109)
Competitive routing of virtual circuits with unknown duration (1994) (108)
Load Balancing in the Lp Norm (1995) (107)
Mitigating Byzantine Attacks in Ad Hoc Wireless Networks (2004) (105)
Piecemeal Graph Exploration by a Mobile Robot (1999) (102)
Near-Linear Time Construction of Sparse Neighborhood Covers (1999) (100)
Group Spreading: A Protocol for Provably Secure Distributed Name Service (2004) (99)
A generic scheme for building overlay networks in adversarial scenarios (2003) (96)
Self-Stabilization by Local Checking and Global Reset (Extended Abstract) (1994) (95)
Tradeoffs in worst-case equilibria (2003) (91)
Minimizing the flow time without migration (1999) (89)
Making commitments in the face of uncertainty: how to pick a winner almost every time (extended abstract) (1996) (89)
Distributed paging for general networks (1996) (88)
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen (1995) (87)
On the Survivability of Routing Protocols in Ad Hoc Wireless Networks (2005) (86)
Distributed control for PARIS (1990) (85)
Dynamic networks are as fast as static networks (1988) (82)
New Connectivity and MSF Algorithms for Ultracomputer and PRAM (1983) (79)
Approximate load balancing on dynamic and asynchronous networks (1993) (78)
Topology aggregation for directed graphs (2001) (78)
Reducing truth-telling online mechanisms to online optimization (2003) (74)
Competitive collaborative learning (2005) (74)
Simple routing strategies for adversarial systems (2001) (73)
The hyperring: a low-congestion deterministic data structure for distributed environments (2004) (72)
A dining philosophers algorithm with polynomial response time (1990) (71)
Robust random number generation for peer-to-peer systems (2006) (69)
Towards Scalable and Robust Overlay Networks (2007) (65)
Fast Distributed Network Decompositions and Covers (1996) (64)
Local management of a global resource in a communication network (1987) (63)
Globalizing business, education, culture through the Internet (1997) (63)
Sparse Partitions (Extended Abstract) (1990) (63)
Reliable broadcast protocols in unreliable networks (1986) (63)
Routing through networks with hierarchical topology aggregation (1998) (62)
On-Line Competitive Algorithms for Call Admission in Optical Networks (1996) (61)
Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation (1994) (61)
Improved recommendation systems (2005) (60)
A cost-benefit framework for online management of a metacomputing system (1998) (59)
An Opportunity Cost Approach for Job Assignment and Reassignment in a Scalable Computing Cluster (2002) (58)
Near-linear cost sequential and distributed constructions of sparse neighborhood covers (1993) (58)
Polynomial end-to-end communication (1989) (56)
Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization (1985) (56)
Stateless distributed gradient descent for positive linear programs (2008) (55)
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. (1984) (55)
"A reliable broadcast protocol" (1983) (54)
Distributed BFS algorithms (1985) (53)
Adapting to asynchronous dynamic networks (extended abstract) (1992) (53)
Finding euler circuits in logarithmic parallel time (1984) (50)
Approximate distributed Bellman-Ford algorithms (1994) (50)
The pulse protocol: energy efficient infrastructure access (2004) (50)
Competitive distributed job scheduling (extended abstract) (1992) (49)
Load balancing in the L/sub p/ norm (1995) (45)
Adapting to Asynchronous Dynamic Networks (1992) (44)
Memory-efficient and self-stabilizing network RESET (extended abstract) (1994) (43)
Communication-optimal maintenance of replicated information (1990) (41)
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework (2007) (38)
Anycasting in Adversarial Systems: Routing and Admission Control (2003) (38)
Greedy distributed optimization of multi-commodity flows (2007) (36)
Converging to approximated max-min flow fairness in logarithmic time (1998) (36)
A Tradeoff between Information and Communication in Broadcast Protocols (1988) (35)
Peer-to-peer systems for prefix search (2003) (35)
Communication-time trade-offs in network synchronization (1985) (35)
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock (2007) (34)
Slide-The Key to Polynomial End-to-End Communication (1997) (33)
Randomized distributed shortest paths algorithms (1989) (33)
Tell Me Who I Am: An Interactive Recommendation System (2006) (32)
Topology aggregation for directed graph (1998) (32)
Self-stabilizing end-to-end communication (1996) (32)
Low-Diameter Graph Decomposition Is in NC (1992) (31)
A Distributed Algorithm for Large-Scale Generalized Matching (2013) (30)
Provably competitive adaptive routing (2005) (30)
Piecemeal graph exploration by a mobile robot (extended abstract) (1995) (29)
A quantitative approach to dynamic networks (1990) (29)
Collaboration of untrusting peers with changing interests (2004) (28)
Collaborate with Strangers to Find Own Preferences (2005) (27)
On buffer-economical store-and-forward deadlock prevention (1991) (27)
Efficient and reliable broadcast is achievable in an eventually connected network(Extended Abstract) (1984) (27)
Optimal maintenance of a spanning tree (2008) (26)
Provably Secure Competitive Routing against Proactive Byzantine Adversaries via Reinforcement Learning (2003) (25)
Heat and Dump: competitive distributed paging (1993) (25)
Fast network decomposition (1992) (24)
The Java Market: Transforming the Internet into a Metacomputer (1998) (23)
The effect of network hierarchy structure on performance of ATM PNNI hierarchical routing (1998) (23)
A Proof Technique for Register Automicity (1988) (22)
Efficient asynchronous distributed symmetry breaking (1994) (22)
Global flow control for wide area overlay networks: a cost-benefit approach (2002) (21)
Competitive multicast routing (1995) (21)
Memory-eecient and Self-stabilizing Network Reset (2007) (20)
Fast load balancing via bounded best response (2008) (20)
The pulse protocol: sensor network routing and power saving (2004) (19)
Bounding the Unbounded. (1994) (18)
Shortest paths and loop-free routing in dynamic networks (1990) (18)
Anycasting and Multicasting in Adversarial Systems : Routing and Admission Control (2002) (18)
Dynamic deadlock resolution protocols (1986) (18)
On the effects of feedback in dynamic network protocols (1988) (18)
Adapting to a reliable network path (2003) (17)
A denial-of-service resistant DHT (2007) (17)
An efficient network synchronization protocol (1984) (16)
Polylogarithmic-overhead piecemeal graph exploration (1998) (16)
The maintenance of common data in a distributed system (1991) (15)
Robust Distributed Name Service (2004) (15)
Multicommodity Flows: A Survey of Recent Research (1993) (15)
Bounding the unbounded [distributed computing protocols] (1994) (14)
ODSBR: An On-Demand Secure Byzantine Routing Protocol (2003) (14)
On proving register atomicity (1987) (14)
Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract) (1986) (14)
Online client-server load balancing without global information (2005) (14)
Efficient deadlock-free routing (1991) (13)
A reliable broadcast protocol (1982) (13)
Swarm intelligence routing resilient to byzantine adversaries (2004) (12)
Packet Routing via Min-Cost Circuit Routing (1996) (12)
Maintaining Database Consistency in Peer to Peer Networks (2002) (11)
Communication complexity of distributed shortest path algorithms (1985) (11)
Proceedings of the 1st annual international conference on Mobile computing and networking (1995) (11)
Effects of Multi-rate in Ad Hoc Wireless Networks (2003) (11)
Online algorithms for selective multicast and maximal dense trees (1997) (10)
Distributed network monitoring and multicommodity flows: a primal-dual approach (2007) (10)
The pulse protocol: mobile ad hoc network performance evaluation (2005) (10)
Adaptive Collaboration in Peer-to-Peer Systems (2005) (10)
A cost-benefit flow control for reliable multicast and unicast in overlay networks (2005) (9)
Flow Control for Many-to-Many Multicast: A Cost-Benefit Approach (2001) (9)
Distributed Shortest Paths Algorithms (Extended Abstract) (1989) (9)
Beacon-Based Routing for Tactical Networks (2007) (9)
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence (2008) (9)
An Efficient Topology Update Protocol for Dynamic Networks (1992) (9)
Principles of Robust Medium Access and an Application to Leader Election (2014) (8)
Optimal Broadcast with Partial Knowledge (1999) (8)
Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) (1989) (7)
Online collaborative filtering with nearly optimal dynamic regret (2007) (7)
Optimal Maintenance of Replicated Information (2004) (7)
Approximate distributed Bellman-Ford algorithms (computer network routing) (1991) (6)
Consistent and compact data management in distributed storage systems (2004) (6)
Broadcast with partial knowledge (preliminary version) (1991) (6)
Errata to "Atomic Shared Register Access by Asynchronous Hardware" (1987) (6)
Analysis of Multiple Trees on Path Discovery for Beacon-Based Routing Protocols (2007) (5)
Self-Stabilization By Local Checking and Correction (Extended Abstract) (1991) (5)
Approximating the size of a dynamically growing asynchronous distributed network (1987) (5)
Fast Network Decomposition (Extended Abstract). (1992) (5)
Gateways for mobile routing in tactical network deployments (2008) (5)
Routing with Polynomial Communication-space Tradeoo Baruch Awerbuch (1993) (5)
Asynchronous Active Recommendation Systems (2007) (4)
Dynamics of Learning Algorithms for the On-Demand Secure Byzantine Routing Protocol (2006) (4)
Maximizing job benefits on-line (2000) (4)
Greedy distributed optimization of unsplittable multicommodity flows (2008) (4)
Independent Study Report on Reputation Systems (2006) (3)
Stars: A Simulator For Performance Study Of Aggregation Based Hierarchical Routing (1998) (3)
Polynomial End-To-End Communication (Extended Abstract) (1989) (2)
Network Decomposition andLocality in Distributed Computation ( Extended Abstract ) (1989) (2)
The Pulse Protocol: Routing and Power Saving Sensor Network (2004) (2)
Local Fail-safe Network Reset Procedure (1987) (2)
A Robust Routing Algorithm for Overlay Networks (2003) (2)
AWERBUCH AND SHAVITT : TOPOLOGY AGGREGATION FOR DIRECTED GRAPHS (2001) (2)
A PROOF TECHNIQUE FOR REGISTER ATOMICITY (Preliminary Version) (2006) (2)
Asynchronous recommendation systems (2007) (2)
Topology Aggregation for Directed (2001) (2)
Brief announcement: Stateless distributed algorithms for generalized packing linear programs (2009) (1)
Online multicast in connection oriented networks (2000) (1)
Cost-Sensitive Analysis of Communication Protocols (Extended Abstract) (1990) (1)
Load Balancing in the Euclidean Norm (1995) (1)
Blindly-competitive Algorithms for Pricing & Bidding (1994) (1)
Collaboration of Untrusting Peers with Changing Interests (Extended Abstract) (2004) (1)
A Reliable Broadcast Algorithm (1982) (1)
Distributed control for PARISExtended AbstractBaruch Awerbuch (1990) (1)
Maximizing job benefits on‐line (2001) (1)
Consistent , Order-Preserving Data Management in Distributed Storage Systems (2004) (1)
Adaptive Collaboration in Peer-to-Peer Systems (Extended Abstract) (2005) (1)
Cost sharing mechanisms for near-optimal traffic aggregation and network design (2008) (1)
Aggregation Query under Presence of Faulty or Malicious Nodes CS 252 Project (2003) (0)
Maximal Dense Trees and Competitive On-line Selective Multicast ( Extended Abstract ) (2007) (0)
Scalable Decentralized Control for Sensor Networks via Distributed Lattices (2003) (0)
Stateless distributed algorithms for near optimal maximum multicommodity flows (2008) (0)
Bounding the Unbounded EXTENDED ABSTRACT (1994) (0)
THE WORLD BECAME A SMALLER PLACE IN THE 20TH CENTURY. TRANS- (1997) (0)
Am : An Interactive Recommendation System (0)
Efficient Asynchronous Distributed (1994) (0)
An Efficient Security Framework for Detection and Isolation of Attackers in Low Rate Wireless Personal Area Networks (2008) (0)
Byzantine survivable routing for mobile ad hoc networks (2007) (0)
Arid Prize-collecting S-aksmen (0)
Dynamic deadlock resolution protocols (Extended Abstract) (1986) (0)
Maximizing gross network product (GNP): resource management on the GII (1996) (0)
On cost sharing mechanisms in the network design game (2007) (0)
Self-Stabilizing End-to-End Communication 0 (1993) (0)
Optimal Broadcast with Partial Knowledge (Extended Abstract) (1995) (0)
Large Algorithmic Methods for Dynamic System Management (2001) (0)
Collaborate With Strangers to Find Own Preferences ∗ Extended Abstract (2005) (0)
Lightweight Unicast and Multicast Routing for (2009) (0)
Blindly-Competitive Algorithms : Pricing & Bidding as a Case Study ( Extended (1995) (0)
Bounding the Unbounded Extended Abstract Lab. for Computer Science Mit (1994) (0)
Selected papers of the 23rd annual ACM symposium on Theory of computing (1995) (0)
Improved Recommendation Systems ∗ Extended (2005) (0)
High performance routing in mobile ad hoc networks (2007) (0)
Resilient to Byzantine Adversaries (2004) (0)
An Online Algorithm for the Dynamic Maximal Dense Tree Problem (2002) (0)
Distributed Broadcast Algorithm in Multihop Aloha Networks (1983) (0)
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach (2007) (0)
Localized Client-Server Load Balancing without Global Information (2007) (0)
Load Balancing in the L p (1995) (0)
Little or No Impact 3 Information Services for Mobile Users (2007) (0)
Lightweight unicast and multicast routing for MANETs (2009) (0)
Mult icommodity Flows : A Survey of Recent Research * ( Extended Abstract ) (0)
Improved Recommendation Systems ∗ Extended Abstract (0)
Competitive On-line Selective Multicast via Dense Trees Construction (extended Abstract) (1994) (0)
Simple Routing Strategies for Adversarial Systems (Extended Abstract) (2002) (0)
VLSI Design, Parallel Computation and Distributed Computing (1991) (0)
On the complexity of computing algebraic functions (1990) (0)
Adaptive Resilient Tactical Network Management (2010) (0)
Competitive Concurrent Distributed DataStructures ( Draft : Do not distribute ) (2007) (0)
Greedy Distributed Optimization of Multi-Commodity Flows Draft---not for distribution (2007) (0)

This paper list is powered by the following services:

Other Resources About Baruch Awerbuch

en.wikipedia.org

What Schools Are Affiliated With Baruch Awerbuch?

Baruch Awerbuch is affiliated with the following schools: