| 2009 | PODC | Brief announcement: Stateless distributed algorithms for generalized packing linear programs. | Baruch Awerbuch, Zhenghua Fu, Rohit Khandekar |
| 2008 | LATIN | Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. | Baruch Awerbuch, Rohit Khandekar |
| 2008 | PODC | Greedy distributed optimization of unsplittable multicommodity flows. | Baruch Awerbuch, Rohit Khandekar |
| 2008 | PODC | Stateless distributed algorithms for near optimal maximum multicommodity flows. | Baruch Awerbuch, Rohit Khandekar |
| 2008 | PODC | A jamming-resistant MAC protocol for single-hop wireless networks. | Baruch Awerbuch, Andra W. Richa, Christian Scheideler |
| 2008 | SODA | Fast load balancing via bounded best response. | Baruch Awerbuch, Yossi Azar, Rohit Khandekar |
| 2008 | STOC | Stateless distributed gradient descent for positive linear programs. | Baruch Awerbuch, Rohit Khandekar |
| 2008 | SPAA | Cost sharing mechanisms for near-optimal traffic aggregation and network design. | Baruch Awerbuch, Rohit Khandekar |
| 2007 | OPODIS | Asynchronous Active Recommendation Systems. | Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir |
| 2007 | PODC | Greedy distributed optimization of multi-commodity flows. | Baruch Awerbuch, Rohit Khandekar |
| 2007 | PODC | Distributed network monitoring and multicommodity flows: a primal-dual approach. | Baruch Awerbuch, Rohit Khandekar |
| 2007 | PODC | Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. | Baruch Awerbuch, Rohit Khandekar |
| 2007 | PODC | On cost sharing mechanisms in the network design game. | Baruch Awerbuch, Rohit Khandekar |
| 2007 | PODC | Asynchronous recommendation systems. | Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir |
| 2007 | PODC | A denial-of-service resistant DHT. | Baruch Awerbuch, Christian Scheideler |
| 2007 | SODA | Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. | Baruch Awerbuch, Rohit Khandekar, Satish Rao |
| 2007 | SPAA | Online collaborative filtering with nearly optimal dynamic regret. | Baruch Awerbuch, Thomas P. Hayes |
| 2006 | OPODIS | Robust Random Number Generation for Peer-to-Peer Systems. | Baruch Awerbuch, Christian Scheideler |
| 2006 | SPAA | Tell me who I am: an interactive recommendation system. | Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir |
| 2006 | SPAA | Towards a scalable and robust DHT. | Baruch Awerbuch, Christian Scheideler |
| 2005 | COLT | Competitive Collaborative Learning. | Baruch Awerbuch, Robert D. Kleinberg |
| 2005 | ICDCS | Adaptive Collaboration in Peer-to-Peer Systems. | Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle |
| 2005 | INFOCOM | Provably competitive adaptive routing. | Baruch Awerbuch, David Holmer, Herbert Rubens, Robert D. Kleinberg |
| 2005 | SODA | Online client-server load balancing without global information. | Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton |
| 2005 | SODA | Improved recommendation systems. | Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle |
| 2005 | STOC | The Price of Routing Unsplittable Flow. | Baruch Awerbuch, Yossi Azar, Amir Epstein |
| 2005 | SPAA | Collaborate with strangers to find own preferences. | Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle |
| 2005 | SecureComm | On the Survivability of Routing Protocols in Ad Hoc Wireless Networks. | Baruch Awerbuch, Reza Curtmola, David Holmer, Herbert Rubens, Cristina Nita-Rotaru |
| 2004 | ICALP | Group Spreading: A Protocol for Provably Secure Distributed Name Service. | Baruch Awerbuch, Christian Scheideler |
| 2004 | INFOCOM | The Pulse Protocol: Energy Efficient Infrastructure Access. | David Holmer, Herbert Rubens, Baruch Awerbuch |
| 2004 | SODA | A general approach to online network optimization problems. | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
| 2004 | SODA | The hyperring: a low-congestion deterministic data structure for distributed environments. | Baruch Awerbuch, Christian Scheideler |
| 2004 | STOC | Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. | Baruch Awerbuch, Robert D. Kleinberg |
| 2004 | SPAA | Consistent and compact data management in distributed storage systems. | Baruch Awerbuch, Christian Scheideler |
| 2003 | ICALP | Anycasting in Adversarial Systems: Routing and Admission Control. | Baruch Awerbuch, Andr Brinkmann, Christian Scheideler |
| 2003 | PODC | Adapting to a reliable network path. | Baruch Awerbuch, Yishay Mansour |
| 2003 | PODC | Peer-to-peer systems for prefix search. | Baruch Awerbuch, Christian Scheideler |
| 2003 | STOC | The online set cover problem. | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
| 2003 | STOC | Reducing truth-telling online mechanisms to online optimization. | Baruch Awerbuch, Yossi Azar, Adam Meyerson |
| 2003 | WAOA | Tradeoffs in Worst-Case Equilibria. | Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur |
| 2001 | FOCS | Simple Routing Strategies for Adversarial Systems. | Baruch Awerbuch, Petra Berenbrink, Andr Brinkmann, Christian Scheideler |
| 1999 | STOC | Minimizing the Flow Time Without Migration. | Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev |
| 1998 | COLT | Polylogarithmic-Overhead Piecemeal Graph Exploration. | Baruch Awerbuch, Stephen G. Kobourov |
| 1998 | ICCCN | The Effect of Network Hierarchy Structure on Performance of ATM PNNI Hierarchical Routing. | Baruch Awerbuch, Yi Du, Yuval Shavitt |
| 1998 | INFOCOM | Converging to Approximated Max-Min Flow Fairness in Logarithmic Time. | Baruch Awerbuch, Yuval Shavitt |
| 1998 | ISCC | Routing through networks with hierarchical topology aggregation. | Baruch Awerbuch, Yi Du, Bilal Khan, Yuval Shavitt |
| 1998 | ISCC | Topology aggregation for directed graph. | Baruch Awerbuch, Yuval Shavitt |
| 1997 | FOCS | Buy-at-Bulk Network Design. | Baruch Awerbuch, Yossi Azar |
| 1997 | STOC | Online Algorithms for Selective Multicast and Maximal Dense Trees. | Baruch Awerbuch, Tripurari Singh |
| 1996 | ESA | On-line Competive Algorithms for Call Admission in Optical Networks. | Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosn |
| 1996 | FOCS | Universal Stability Results for Greedy Contention-Resolution Protocols. | Matthew Andrews, Baruch Awerbuch, Antonio Fernndez, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu |
| 1996 | SODA | On-line Generalized Steiner Problem. | Baruch Awerbuch, Yossi Azar, Yair Bartal |
| 1996 | SODA | Distributed Paging for General Networks. | Baruch Awerbuch, Yair Bartal, Amos Fiat |
| 1996 | STOC | 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 |
| 1995 | COLT | Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract). | Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh |
| 1995 | FOCS | Load Balancing in the L | Baruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter |
| 1995 | STOC | Improved approximation guarantees for minimum-weight | Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh S. Vempala |
| 1994 | FOCS | Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation | Baruch Awerbuch, Yossi Azar |
| 1994 | FOCS | On-line Admission Control and Circuit Routing for High Performance Computing and Communication | Baruch Awerbuch, Rainer Gawlick, Frank Thomson Leighton, Yuval Rabani |
| 1994 | INFOCOM | Bounding the Unbounded. | Baruch Awerbuch, Boaz Patt-Shamir, George Varghese |
| 1994 | PODC | Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract). | Baruch Awerbuch, Rafail Ostrovsky |
| 1994 | SODA | Competitive Routing of Virtual Circuits with Unknown Duration. | Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts |
| 1994 | SODA | Competitive Non-Preemptive Call Control. | Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosn |
| 1994 | STOC | Efficient asynchronous distributed symmetry breaking. | Baruch Awerbuch, Lenore Cowen, Mark A. Smith |
| 1994 | STOC | Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. | Baruch Awerbuch, Tom Leighton |
| 1993 | FOCS | Throughput-Competitive On-Line Routing | Baruch Awerbuch, Yossi Azar, Serge A. Plotkin |
| 1993 | FOCS | Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers | Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg |
| 1993 | FOCS | Heat & Dump: Competitive Distributed Paging | Baruch Awerbuch, Yair Bartal, Amos Fiat |
| 1993 | FOCS | A Simple Local-Control Approximation Algorithm for Multicommodity Flow | Baruch Awerbuch, Frank Thomson Leighton |
| 1993 | ISAAC | Multicommodity Flows: A Survey of Recent Research. | Baruch Awerbuch, Frank Thomson Leighton |
| 1993 | STOC | Approximate load balancing on dynamic and asynchronous networks. | William Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao |
| 1993 | STOC | Competitive distributed file allocation. | Baruch Awerbuch, Yair Bartal, Amos Fiat |
| 1993 | STOC | Time optimal self-stabilizing synchronization. | Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese |
| 1992 | PODC | Fast Network Decomposition (Extended Abstract). | Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg |
| 1992 | STOC | Competitive Distributed Job Scheduling (Extended Abstract) | Baruch Awerbuch, Shay Kutten, David Peleg |
| 1992 | STOC | Adapting to Asynchronous Dynamic Networks (Extended Abstract) | Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks |
| 1991 | FOCS | Self-Stabilization By Local Checking and Correction (Extended Abstract) | Baruch Awerbuch, Boaz Patt-Shamir, George Varghese |
| 1991 | FOCS | The Maintenance of Common Data in a Distributed System | Baruch Awerbuch, Leonard J. Schulman |
| 1991 | FOCS | Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols (Extended Abstract) | Baruch Awerbuch, George Varghese |
| 1991 | INFOCOM | Approximate Distributed Bellman-Ford Algorithms. | Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal |
| 1991 | INFOCOM | On Buffer-Economical Store-and-Forward Deadlock Prevention. | Baruch Awerbuch, Shay Kutten, David Peleg |
| 1991 | PODC | Broadcast with Partial Knowledge (Preliminary Version). | Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg |
| 1991 | PODC | Efficient Deadlock-Free Routing. | Baruch Awerbuch, Shay Kutten, David Peleg |
| 1991 | SIGCOMM | Concurrent Online Tracking of Mobile Users. | Baruch Awerbuch, David Peleg |
| 1990 | FOCS | Communication-Optimal Maintenance of Replicated Information | Baruch Awerbuch, Israel Cidon, Shay Kutten |
| 1990 | FOCS | Sparse Partitions (Extended Abstract) | Baruch Awerbuch, David Peleg |
| 1990 | FOCS | Network Synchronization with Polylogarithmic Overhead | Baruch Awerbuch, David Peleg |
| 1990 | FOCS | A Dining Philosophers Algorithm with Polynomial Response Time | Baruch Awerbuch, Michael E. Saks |
| 1990 | PODC | Distributed Control for PARIS. | Baruch Awerbuch, Israel Cidon, Inder S. Gopal, Marc A. Kaplan, Shay Kutten |
| 1990 | PODC | Cost-Sensitive Analysis of Communication Protocols. | Baruch Awerbuch, Alan E. Baratz, David Peleg |
| 1990 | PODC | A Quantitative Approach to Dynamic Networks. | Baruch Awerbuch, Oded Goldreich, Amir Herzberg |
| 1990 | SIGCOMM | Shortest Paths and Loop-Free Routing in Dynamic Networks. | Baruch Awerbuch |
| 1989 | FOCS | Network Decomposition and Locality in Distributed Computation | Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin |
| 1989 | FOCS | Polynomial End-To-End Communication (Extended Abstract) | Baruch Awerbuch, Yishay Mansour, Nir Shavit |
| 1989 | STOC | Distributed Shortest Paths Algorithms (Extended Abstract) | Baruch Awerbuch |
| 1989 | STOC | Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) | Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg |
| 1988 | FOCS | On the Effects of Feedback in Dynamic Network Protocols (Preliminary Version) | Baruch Awerbuch |
| 1988 | FOCS | Dynamic Networks Are as Fast as Static Networks (Preliminary Version) | Baruch Awerbuch, Michael Sipser |
| 1987 | FOCS | Applying Static Network Protocols to Dynamic Networks | Yehuda Afek, Baruch Awerbuch, Eli Gafni |
| 1987 | FOCS | Local Management of a Global Resource in a Communication Network | Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks |
| 1987 | FOCS | Errata to "Atomic Shared Register Access by Asynchronous Hardware" | Paul M. B. Vitnyi, Baruch Awerbuch |
| 1987 | STOC | Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary) | Baruch Awerbuch |
| 1986 | FOCS | Dynamic deadlock resolution protocols (Extended Abstract) | Baruch Awerbuch, Silvio Micali |
| 1986 | FOCS | Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract) | Paul M. B. Vitnyi, Baruch Awerbuch |
| 1985 | FOCS | Distributed BFS Algorithms | Baruch Awerbuch, Robert G. Gallager |
| 1985 | FOCS | Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) | Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch |
| 1985 | PODC | Communication-Time Trade-Offs in Network Synchronization. | Baruch Awerbuch |
| 1984 | PODC | Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. | Baruch Awerbuch, Shimon Even |
| 1984 | STOC | An Efficient Network Synchronization Protocol | Baruch Awerbuch |
| 1984 | STOC | Finding Euler Circuits in Logarithmic Parallel Time | Baruch Awerbuch, Amos Israeli, Yossi Shiloach |
| 1983 | ICPP | New Connectivity and MSF Algorithms for Ultracomputer and PRAM. | Baruch Awerbuch, Tripurari Singh |
| 1983 | INFOCOM | Distributed Broadcast Algorithm in Multihop Aloha Networks. | Baruch Awerbuch |
| 1983 | INFOCOM | A Reliable Broadcast Protocol. | Adrian Segall, Baruch Awerbuch |