Baruch Awerbuch

According to our database, Baruch Awerbuch authored at least 168 papers between 1983 and 2014.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2014

Principles of Robust Medium Access and an Application to Leader Election.

Baruch Awerbuch, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang

ACM Trans. Algorithms, 2014

2013

The Price of Routing Unsplittable Flow.

Baruch Awerbuch, Yossi Azar, Amir Epstein

SIAM J. Comput., 2013

A Distributed Algorithm for Large-Scale Generalized Matching.

Faraz Makari Manshadi, Baruch Awerbuch, Rainer Gemulla, Rohit Khandekar, Julián Mestre, Mauro Sozio

Proc. VLDB Endow., 2013

2012

Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.

Baruch Awerbuch, Rohit Khandekar, Satish Rao

ACM Trans. Algorithms, 2012

2009

Robust random number generation for peer-to-peer systems.

Baruch Awerbuch, Christian Scheideler

Theor. Comput. Sci., 2009

Stateless Distributed Gradient Descent for Positive Linear Programs.

Baruch Awerbuch, Rohit Khandekar

SIAM J. Comput., 2009

The Online Set Cover Problem.

Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor

SIAM J. Comput., 2009

Towards a Scalable and Robust DHT.

Baruch Awerbuch, Christian Scheideler

Theory Comput. Syst., 2009

Tell Me Who I Am: An Interactive Recommendation System.

Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir

Theory Comput. Syst., 2009

Greedy distributed optimization of multi-commodity flows.

Baruch Awerbuch, Rohit Khandekar

Distributed Comput., 2009

Brief announcement: Stateless distributed algorithms for generalized packing linear programs.

Baruch Awerbuch, Zhenghua Fu, Rohit Khandekar

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

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

Baruch Awerbuch, Reza Curtmola, David Holmer, Cristina Nita-Rotaru, Herbert Rubens

ACM Trans. Inf. Syst. Secur., 2008

Collaborate with Strangers to Find Own Preferences.

Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle

Theory Comput. Syst., 2008

Competitive collaborative learning.

Baruch Awerbuch, Robert Kleinberg

J. Comput. Syst. Sci., 2008

Online linear optimization and adaptive routing.

Baruch Awerbuch, Robert Kleinberg

J. Comput. Syst. Sci., 2008

Optimal maintenance of a spanning tree.

Baruch Awerbuch, Israel Cidon, Shay Kutten

J. ACM, 2008

Cost sharing mechanisms for near-optimal traffic aggregation and network design.

Baruch Awerbuch, Rohit Khandekar

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Fast load balancing via bounded best response.

Baruch Awerbuch, Yossi Azar, Rohit Khandekar

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Fast convergence to nearly optimal solutions in potential games.

Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

A jamming-resistant MAC protocol for single-hop wireless networks.

Baruch Awerbuch, Andréa W. Richa, Christian Scheideler

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Stateless distributed algorithms for near optimal maximum multicommodity flows.

Baruch Awerbuch, Rohit Khandekar

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Greedy distributed optimization of unsplittable multicommodity flows.

Baruch Awerbuch, Rohit Khandekar

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.

Baruch Awerbuch, Rohit Khandekar

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock.

Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese

IEEE Trans. Dependable Secur. Comput., 2007

Localized Client-Server Load Balancing without Global Information.

Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton

SIAM J. Comput., 2007

Online collaborative filtering with nearly optimal dynamic regret.

Baruch Awerbuch, Thomas P. Hayes

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

A denial-of-service resistant DHT.

Baruch Awerbuch, Christian Scheideler

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Asynchronous recommendation systems.

Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

On cost sharing mechanisms in the network design game.

Baruch Awerbuch, Rohit Khandekar

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach.

Baruch Awerbuch, Rohit Khandekar

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Distributed network monitoring and multicommodity flows: a primal-dual approach.

Baruch Awerbuch, Rohit Khandekar

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Asynchronous Active Recommendation Systems.

Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Towards Scalable and Robust Overlay Networks.

Baruch Awerbuch, Christian Scheideler

Proceedings of the 6th International workshop on Peer-To-Peer Systems, 2007

2006

Tradeoffs in worst-case equilibria.

Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur

Theor. Comput. Sci., 2006

A general approach to online network optimization problems.

Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor

ACM Trans. Algorithms, 2006

The Medium Time Metric: High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks.

Baruch Awerbuch, David Holmer, Herbert Rubens

Mob. Networks Appl., 2006

Dynamics of Learning Algorithms for the On-Demand Secure Byzantine Routing Protocol.

Baruch Awerbuch, Robert G. Cole, Reza Curtmola, David Holmer, Herbert Rubens

Proceedings of the Security and Privacy in Ad-Hoc and Sensor Networks, 2006

2005

A cost-benefit flow control for reliable multicast and unicast in overlay networks.

Yair Amir, Baruch Awerbuch, Claudiu Danilov, Jonathan Robert Stanton

IEEE/ACM Trans. Netw., 2005

The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation.

Baruch Awerbuch, David Holmer, Herbert Rubens

Proceedings of the 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 2005

Improved recommendation systems.

Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Online client-server load balancing without global information.

Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

On the Survivability of Routing Protocols in Ad Hoc Wireless Networks.

Baruch Awerbuch, Reza Curtmola, David Holmer, Herbert Rubens, Cristina Nita-Rotaru

Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks, 2005

Provably competitive adaptive routing.

Baruch Awerbuch, David Holmer, Herbert Rubens, Robert D. Kleinberg

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Adaptive Collaboration in Peer-to-Peer Systems.

Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle

Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

2004

On-line generalized Steiner problem.

Baruch Awerbuch, Yossi Azar, Yair Bartal

Theor. Comput. Sci., 2004

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

Baruch Awerbuch, Robert D. Kleinberg

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Consistent and compact data management in distributed storage systems.

Baruch Awerbuch, Christian Scheideler

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

The hyperring: a low-congestion deterministic data structure for distributed environments.

Baruch Awerbuch, Christian Scheideler

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Collaboration of untrusting peers with changing interests.

Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle

Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Robust Distributed Name Service.

Baruch Awerbuch, Christian Scheideler

Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

The Pulse Protocol: Energy Efficient Infrastructure Access.

David Holmer, Herbert Rubens, Baruch Awerbuch

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

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

Baruch Awerbuch, David Holmer, Herbert Rubens

Proceedings of the Wireless On-Demand Network Systems, First IFIP TC6 Working Conference, 2004

Group Spreading: A Protocol for Provably Secure Distributed Name Service.

Baruch Awerbuch, Christian Scheideler

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Competitive distributed file allocation.

Baruch Awerbuch, Yair Bartal, Amos Fiat

Inf. Comput., 2003

Reducing truth-telling online mechanisms to online optimization.

Baruch Awerbuch, Yossi Azar, Adam Meyerson

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Peer-to-peer systems for prefix search.

Baruch Awerbuch, Christian Scheideler

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Adapting to a reliable network path.

Baruch Awerbuch, Yishay Mansour

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Scalable Decentralized Control for Sensor Networks via Distributed Lattices.

Baruch Awerbuch, Jonathan Robert Stanton

Proceedings of the Information Processing in Sensor Networks, 2003

A Generic Scheme for Building Overlay Networks in Adversarial Scenarios.

Ittai Abraham, Baruch Awerbuch, Yossi Azar, Yair Bartal, Dahlia Malkhi, Elan Pavlov

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Anycasting in Adversarial Systems: Routing and Admission Control.

Baruch Awerbuch, André Brinkmann, Christian Scheideler

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Minimizing the Flow Time Without Migration.

Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev

SIAM J. Comput., 2002

An Online Algorithm for the Dynamic Maximal Dense Tree Problem.

Baruch Awerbuch, Tripurari Singh

Algorithmica, 2002

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

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

Proceedings of the 2002 ACM Workshop on Wireless Security, 2002

2001

Topology aggregation for directed graphs.

Baruch Awerbuch, Yuval Shavitt

IEEE/ACM Trans. Netw., 2001

Competitive Routing of Virtual Circuits with Unknown Duration.

Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts

J. Comput. Syst. Sci., 2001

Universal-stability results and performance bounds for greedy contention-resolution protocols.

Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Frank Thomson Leighton, Zhiyong Liu, Jon M. Kleinberg

J. ACM, 2001

On-Line Competitive Algorithms for Call Admission in Optical Networks.

Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén

Algorithmica, 2001

Simple Routing Strategies for Adversarial Systems.

Baruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster.

Yair Amir, Baruch Awerbuch, Amnon Barak, R. Sean Borgstrom, Arie Keren

IEEE Trans. Parallel Distributed Syst., 2000

A Cost-Benefit framework for online management of a metacomputing system.

Yair Amir, Baruch Awerbuch, R. Sean Borgstrom

Decis. Support Syst., 2000

The effect of network hierarchy structure on performance of ATM PNNI hierarchical routing.

Baruch Awerbuch, Yi Du, Yuval Shavitt

Comput. Commun., 2000

Maximizing job benefits on-line.

Baruch Awerbuch, Yossi Azar, Oded Regev

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Piecemeal Graph Exploration by a Mobile Robot.

Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh

Inf. Comput., 1999

1998

Optimal Broadcast with Partial Knowledge.

Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg

SIAM J. Comput., 1998

Near-Linear Time Construction of Sparse Neighborhood Covers.

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg

SIAM J. Comput., 1998

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

Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh S. Vempala

SIAM J. Comput., 1998

Routing through networks with hierarchical topology aggregation.

Baruch Awerbuch, Yi Du, Bilal Khan, Yuval Shavitt

J. High Speed Networks, 1998

Distributed Paging for General Networks.

Baruch Awerbuch, Yair Bartal, Amos Fiat

J. Algorithms, 1998

Topology aggregation for directed graph.

Baruch Awerbuch, Yuval Shavitt

Proceedings of the Third IEEE Symposium on Computers and Communications (ISCC 1998), June 30, 1998

Converging to Approximated Max-Min Flow Fairness in Logarithmic Time.

Baruch Awerbuch, Yuval Shavitt

Proceedings of the Proceedings IEEE INFOCOM '98, The Conference on Computer Communications, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, Gateway to the 21st Century, San Francisco, CA, USA, March 29, 1998

Polylogarithmic-Overhead Piecemeal Graph Exploration.

Baruch Awerbuch, Stephen G. Kobourov

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

1997

Slide-The Key to Polynomial End-to-End Communication.

Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, Nir Shavit

J. Algorithms, 1997

The maintenance of common data in a distributed system.

Baruch Awerbuch, Leonard J. Schulman

J. ACM, 1997

Globalizing Business, Education, Culture Through the Internet.

Nabil R. Adam, Baruch Awerbuch, Jacob Slonim, Peter Wegner, Yelena Yesha

Commun. ACM, 1997

Online Algorithms for Selective Multicast and Maximal Dense Trees.

Baruch Awerbuch, Tripurari Singh

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Buy-at-Bulk Network Design.

Baruch Awerbuch, Yossi Azar

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Fast Distributed Network Decompositions and Covers.

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg

J. Parallel Distributed Comput., 1996

Self-stabilizing end-to-end communication.

Baruch Awerbuch, Boaz Patt-Shamir, George Varghese

J. High Speed Networks, 1996

Local Management of a Global Resource in a Communication Network.

Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks

J. ACM, 1996

Maximizing Gross Network Product (GNP): Resource Management on the GII.

Baruch Awerbuch

ACM Comput. Surv., 1996

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).

Baruch Awerbuch, Yossi Azar, Amos Fiat, Frank Thomson Leighton

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Packet Routing via Min-Cost Circuit Routing.

Baruch Awerbuch, Yossi Azar, Amos Fiat

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Universal Stability Results for Greedy Contention-Resolution Protocols.

Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

On-line Competive Algorithms for Call Admission in Optical Networks.

Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén

Proceedings of the Algorithms, 1996

1995

Competitive multicast routing.

Baruch Awerbuch, Yossi Azar

Wirel. Networks, 1995

Online Tracking of Mobile Users.

Baruch Awerbuch, David Peleg

J. ACM, 1995

Optimal Broadcast with Partial Knowledge (Extended Abstract).

Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Improved approximation guarantees for minimum-weight <i>k</i>-trees and prize-collecting salesmen.

Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh S. Vempala

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Load Balancing in the L_p Norm.

Baruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract).

Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

On buffer-economical store-and-forward deadlock prevention.

Baruch Awerbuch, Shay Kutten, David Peleg

IEEE Trans. Commun., 1994

Approximate distributed Bellman-Ford algorithms.

Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal

IEEE Trans. Commun., 1994

Low-Diameter Graph Decomposition Is in NC.

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg

Random Struct. Algorithms, 1994

Self-Stabilization by Local Checking and Global Reset (Extended Abstract).

Baruch Awerbuch, Boaz Patt-Shamir, George Varghese, Shlomi Dolev

Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks.

Baruch Awerbuch, Tom Leighton

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Efficient asynchronous distributed symmetry breaking.

Baruch Awerbuch, Lenore Cowen, Mark A. Smith

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Competitive Non-Preemptive Call Control.

Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract).

Baruch Awerbuch, Rafail Ostrovsky

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Bounding the Unbounded.

Baruch Awerbuch, Boaz Patt-Shamir, George Varghese

Proceedings of the Proceedings IEEE INFOCOM '94, 1994

On-line Admission Control and Circuit Routing for High Performance Computing and Communication

Baruch Awerbuch, Rainer Gawlick, Frank Thomson Leighton, Yuval Rabani

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation

Baruch Awerbuch, Yossi Azar

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Time optimal self-stabilizing synchronization.

Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Approximate load balancing on dynamic and asynchronous networks.

William Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Multicommodity Flows: A Survey of Recent Research.

Baruch Awerbuch, Frank Thomson Leighton

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

A Simple Local-Control Approximation Algorithm for Multicommodity Flow

Baruch Awerbuch, Frank Thomson Leighton

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Heat & Dump: Competitive Distributed Paging

Baruch Awerbuch, Yair Bartal, Amos Fiat

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Throughput-Competitive On-Line Routing

Baruch Awerbuch, Yossi Azar, Serge A. Plotkin

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Routing with Polynomial Communication-Space Trade-Off.

Baruch Awerbuch, David Peleg

SIAM J. Discret. Math., 1992

An Efficient Topology Update Protocol for Dynamic Networks.

Baruch Awerbuch, Yishay Mansour

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Adapting to Asynchronous Dynamic Networks (Extended Abstract)

Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Competitive Distributed Job Scheduling (Extended Abstract)

Baruch Awerbuch, Shay Kutten, David Peleg

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Fast Network Decomposition (Extended Abstract).

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991

Concurrent Online Tracking of Mobile Users.

Baruch Awerbuch, David Peleg

Proceedings of the Conference on Communications Architecture & Protocols, 1991

Efficient Deadlock-Free Routing.

Baruch Awerbuch, Shay Kutten, David Peleg

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Broadcast with Partial Knowledge (Preliminary Version).

Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols (Extended Abstract)

Baruch Awerbuch, George Varghese

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Self-Stabilization By Local Checking and Correction (Extended Abstract)

Baruch Awerbuch, Boaz Patt-Shamir, George Varghese

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

A Trade-Off between Information and Communication in Broadcast Protocols

Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish

J. ACM, April, 1990

Improved Routing Strategies with Succinct Tables.

Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg

J. Algorithms, 1990

On the Effects of Feedback in Dynamic Network Protocols.

Baruch Awerbuch

J. Algorithms, 1990

Shortest Paths and Loop-Free Routing in Dynamic Networks.

Baruch Awerbuch

Proceedings of the ACM Symposium on Communications Architectures & Protocols, 1990

A Quantitative Approach to Dynamic Networks.

Baruch Awerbuch, Oded Goldreich, Amir Herzberg

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

Cost-Sensitive Analysis of Communication Protocols.

Baruch Awerbuch, Alan E. Baratz, David Peleg

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

Distributed Control for PARIS.

Baruch Awerbuch, Israel Cidon, Inder S. Gopal, Marc A. Kaplan, Shay Kutten

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

A Dining Philosophers Algorithm with Polynomial Response Time

Baruch Awerbuch, Michael E. Saks

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Network Synchronization with Polylogarithmic Overhead

Baruch Awerbuch, David Peleg

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Sparse Partitions (Extended Abstract)

Baruch Awerbuch, David Peleg

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Communication-Optimal Maintenance of Replicated Information

Baruch Awerbuch, Israel Cidon, Shay Kutten

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Compact Distributed Data Structures for Adaptive Routing (Extended Abstract)

Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Distributed Shortest Paths Algorithms (Extended Abstract)

Baruch Awerbuch

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Polynomial End-To-End Communication (Extended Abstract)

Baruch Awerbuch, Yishay Mansour, Nir Shavit

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Network Decomposition and Locality in Distributed Computation

Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

A Proof Technique for Register Automicity.

Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

Dynamic Networks Are as Fast as Static Networks (Preliminary Version)

Baruch Awerbuch, Michael Sipser

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

On the Effects of Feedback in Dynamic Network Protocols (Preliminary Version)

Baruch Awerbuch

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

A Tradeoff between Information and Communication in Broadcast Protocols.

Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

A new distributed algorithm to find breadth first search trees.

Baruch Awerbuch, Robert G. Gallager

IEEE Trans. Inf. Theory, 1987

New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM.

Baruch Awerbuch, Yossi Shiloach

IEEE Trans. Computers, 1987

Local Fail-safe Network Reset Procedure.

Yehuda Afek, Baruch Awerbuch, Eli Gafni

Proceedings of the Distributed Algorithms, 1987

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

Baruch Awerbuch

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Errata to "Atomic Shared Register Access by Asynchronous Hardware"

Paul M. B. Vitányi, Baruch Awerbuch

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

Applying Static Network Protocols to Dynamic Networks

Yehuda Afek, Baruch Awerbuch, Eli Gafni

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Reliable broadcast protocols in unreliable networks.

Baruch Awerbuch, Shilmon Event

Networks, 1986

Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract)

Paul M. B. Vitányi, Baruch Awerbuch

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Dynamic deadlock resolution protocols (Extended Abstract)

Baruch Awerbuch, Silvio Micali

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Complexity of Network Synchronization

Baruch Awerbuch

J. ACM, October, 1985

Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization.

Baruch Awerbuch

Networks, 1985

A New Distributed Depth-First-Search Algorithm.

Baruch Awerbuch

Inf. Process. Lett., 1985

Communication-Time Trade-Offs in Network Synchronization.

Baruch Awerbuch

Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

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

Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Distributed BFS Algorithms

Baruch Awerbuch, Robert G. Gallager

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

Finding Euler Circuits in Logarithmic Parallel Time

Baruch Awerbuch, Amos Israeli, Yossi Shiloach

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

An Efficient Network Synchronization Protocol

Baruch Awerbuch

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network.

Baruch Awerbuch, Shimon Even

Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

1983

A Reliable Broadcast Protocol.

Adrian Segall, Baruch Awerbuch

IEEE Trans. Commun., 1983

Distributed Broadcast Algorithm in Multihop Aloha Networks.

Baruch Awerbuch

Proceedings of the Proceedings IEEE INFOCOM 83, San Diego, CA, USA, April 18-21, 1983, 1983

New Connectivity and MSF Algorithms for Ultracomputer and PRAM.

Baruch Awerbuch, Tripurari Singh

Proceedings of the International Conference on Parallel Processing, 1983