| 2009 |
|---|
| 174 | EE | Baruch Awerbuch,
Rohit Khandekar:
Stateless Distributed Gradient Descent for Positive Linear Programs.
SIAM J. Comput. 38(6): 2468-2486 (2009) |
| 173 | EE | Baruch Awerbuch,
Christian Scheideler:
Robust random number generation for peer-to-peer systems.
Theor. Comput. Sci. 410(6-7): 453-466 (2009) |
| 2008 |
|---|
| 172 | EE | Baruch Awerbuch,
Yossi Azar,
Amir Epstein,
Vahab S. Mirrokni,
Alexander Skopalik:
Fast convergence to nearly optimal solutions in potential games.
ACM Conference on Electronic Commerce 2008: 264-273 |
| 171 | EE | Baruch Awerbuch,
Rohit Khandekar:
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.
LATIN 2008: 580-592 |
| 170 | EE | Baruch Awerbuch,
Rohit Khandekar:
Greedy distributed optimization of unsplittable multicommodity flows.
PODC 2008: 439 |
| 169 | EE | Baruch Awerbuch,
Rohit Khandekar:
Stateless distributed algorithms for near optimal maximum multicommodity flows.
PODC 2008: 440 |
| 168 | EE | Baruch Awerbuch,
Andréa W. Richa,
Christian Scheideler:
A jamming-resistant MAC protocol for single-hop wireless networks.
PODC 2008: 45-54 |
| 167 | EE | Baruch Awerbuch,
Yossi Azar,
Rohit Khandekar:
Fast load balancing via bounded best response.
SODA 2008: 314-322 |
| 166 | EE | Baruch Awerbuch,
Rohit Khandekar:
Cost sharing mechanisms for near-optimal traffic aggregation and network design.
SPAA 2008: 85-90 |
| 165 | EE | Baruch Awerbuch,
Rohit Khandekar:
Stateless distributed gradient descent for positive linear programs.
STOC 2008: 691-700 |
| 164 | EE | Baruch Awerbuch,
Reza Curtmola,
David Holmer,
Cristina Nita-Rotaru,
Herbert Rubens:
ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks.
ACM Trans. Inf. Syst. Secur. 10(4): (2008) |
| 163 | EE | Baruch Awerbuch,
Israel Cidon,
Shay Kutten:
Optimal maintenance of a spanning tree.
J. ACM 55(4): (2008) |
| 162 | EE | Baruch Awerbuch,
Robert Kleinberg:
Online linear optimization and adaptive routing.
J. Comput. Syst. Sci. 74(1): 97-114 (2008) |
| 161 | EE | Baruch Awerbuch,
Robert Kleinberg:
Competitive collaborative learning.
J. Comput. Syst. Sci. 74(8): 1271-1288 (2008) |
| 160 | EE | Baruch Awerbuch,
Yossi Azar,
Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Collaborate with Strangers to Find Own Preferences.
Theory Comput. Syst. 42(1): 27-41 (2008) |
| 2007 |
|---|
| 159 | EE | Baruch Awerbuch,
Christian Scheideler:
A Denial-of-Service Resistant DHT.
DISC 2007: 33-47 |
| 158 | EE | Baruch Awerbuch,
Aviv Nisgav,
Boaz Patt-Shamir:
Asynchronous Active Recommendation Systems.
OPODIS 2007: 48-61 |
| 157 | EE | Baruch Awerbuch,
Rohit Khandekar:
Greedy distributed optimization of multi-commodity flows.
PODC 2007: 274-283 |
| 156 | EE | Baruch Awerbuch,
Rohit Khandekar:
Distributed network monitoring and multicommodity flows: a primal-dual approach.
PODC 2007: 284-291 |
| 155 | EE | Baruch Awerbuch,
Rohit Khandekar:
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach.
PODC 2007: 354-355 |
| 154 | EE | Baruch Awerbuch,
Rohit Khandekar:
On cost sharing mechanisms in the network design game.
PODC 2007: 364-365 |
| 153 | EE | Baruch Awerbuch,
Aviv Nisgav,
Boaz Patt-Shamir:
Asynchronous recommendation systems.
PODC 2007: 366-367 |
| 152 | EE | Baruch Awerbuch,
Christian Scheideler:
A denial-of-service resistant DHT.
PODC 2007: 370-371 |
| 151 | EE | Baruch Awerbuch,
Rohit Khandekar,
Satish Rao:
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.
SODA 2007: 949-957 |
| 150 | EE | Baruch Awerbuch,
Thomas P. Hayes:
Online collaborative filtering with nearly optimal dynamic regret.
SPAA 2007: 315-319 |
| 149 | EE | Baruch Awerbuch,
Shay Kutten,
Yishay Mansour,
Boaz Patt-Shamir,
George Varghese:
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock.
IEEE Trans. Dependable Sec. Comput. 4(3): 180-190 (2007) |
| 148 | EE | Baruch Awerbuch,
Mohammad Taghi Hajiaghayi,
Robert Kleinberg,
Tom Leighton:
Localized Client-Server Load Balancing without Global Information.
SIAM J. Comput. 37(4): 1259-1279 (2007) |
| 2006 |
|---|
| 147 | EE | Baruch Awerbuch,
Robert G. Cole,
Reza Curtmola,
David Holmer,
Herbert Rubens:
Dynamics of Learning Algorithms for the On-Demand Secure Byzantine Routing Protocol.
ESAS 2006: 98-112 |
| 146 | EE | Baruch Awerbuch,
Christian Scheideler:
Robust Random Number Generation for Peer-to-Peer Systems.
OPODIS 2006: 275-289 |
| 145 | EE | Noga Alon,
Baruch Awerbuch,
Yossi Azar,
Boaz Patt-Shamir:
Tell me who I am: an interactive recommendation system.
SPAA 2006: 1-10 |
| 144 | EE | Baruch Awerbuch,
Christian Scheideler:
Towards a scalable and robust DHT.
SPAA 2006: 318-327 |
| 143 | EE | Noga Alon,
Baruch Awerbuch,
Yossi Azar,
Niv Buchbinder,
Joseph Naor:
A general approach to online network optimization problems.
ACM Transactions on Algorithms 2(4): 640-660 (2006) |
| 142 | EE | Baruch Awerbuch,
David Holmer,
Herbert Rubens:
The Medium Time Metric: High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks.
MONET 11(2): 253-266 (2006) |
| 141 | EE | Baruch Awerbuch,
Yossi Azar,
Yossi Richter,
Dekel Tsur:
Tradeoffs in worst-case equilibria.
Theor. Comput. Sci. 361(2-3): 200-209 (2006) |
| 2005 |
|---|
| 140 | EE | Baruch Awerbuch,
Robert D. Kleinberg:
Competitive Collaborative Learning.
COLT 2005: 233-248 |
| 139 | EE | Baruch Awerbuch,
Boaz Patt-Shamir,
David Peleg,
Mark R. Tuttle:
Adaptive Collaboration in Peer-to-Peer Systems.
ICDCS 2005: 71-80 |
| 138 | EE | Baruch Awerbuch,
David Holmer,
Herbert Rubens,
Robert D. Kleinberg:
Provably competitive adaptive routing.
INFOCOM 2005: 631-641 |
| 137 | EE | Baruch Awerbuch,
Boaz Patt-Shamir,
David Peleg,
Mark R. Tuttle:
Improved recommendation systems.
SODA 2005: 1174-1183 |
| 136 | EE | Baruch Awerbuch,
Mohammad Taghi Hajiaghayi,
Robert D. Kleinberg,
Tom Leighton:
Online client-server load balancing without global information.
SODA 2005: 197-206 |
| 135 | EE | Baruch Awerbuch,
Yossi Azar,
Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Collaborate with strangers to find own preferences.
SPAA 2005: 263-269 |
| 134 | EE | Baruch Awerbuch,
Yossi Azar,
Amir Epstein:
Large the price of routing unsplittable flow.
STOC 2005: 57-66 |
| 133 | EE | Baruch Awerbuch,
David Holmer,
Herbert Rubens:
The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation.
WONS 2005: 206-215 |
| 132 | EE | Yair Amir,
Baruch Awerbuch,
Claudiu Danilov,
Jonathan Robert Stanton:
A cost-benefit flow control for reliable multicast and unicast in overlay networks.
IEEE/ACM Trans. Netw. 13(5): 1094-1106 (2005) |
| 2004 |
|---|
| 131 | EE | Baruch Awerbuch,
Boaz Patt-Shamir,
David Peleg,
Mark R. Tuttle:
Collaboration of untrusting peers with changing interests.
ACM Conference on Electronic Commerce 2004: 112-119 |
| 130 | EE | Baruch Awerbuch,
Christian Scheideler:
Group Spreading: A Protocol for Provably Secure Distributed Name Service.
ICALP 2004: 183-195 |
| 129 | EE | David Holmer,
Herbert Rubens,
Baruch Awerbuch:
The Pulse Protocol: Energy Efficient Infrastructure Access.
INFOCOM 2004 |
| 128 | EE | Baruch Awerbuch,
Christian Scheideler:
Robust Distributed Name Service.
IPTPS 2004: 237-249 |
| 127 | EE | Baruch Awerbuch,
Christian Scheideler:
The hyperring: a low-congestion deterministic data structure for distributed environments.
SODA 2004: 318-327 |
| 126 | EE | Noga Alon,
Baruch Awerbuch,
Yossi Azar,
Niv Buchbinder,
Joseph Naor:
A general approach to online network optimization problems.
SODA 2004: 577-586 |
| 125 | EE | Baruch Awerbuch,
Christian Scheideler:
Consistent and compact data management in distributed storage systems.
SPAA 2004: 44-53 |
| 124 | EE | Baruch Awerbuch,
Robert D. Kleinberg:
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches.
STOC 2004: 45-53 |
| 123 | EE | Baruch Awerbuch,
David Holmer,
Herbert Rubens:
High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks.
WONS 2004: 253-270 |
| 122 | EE | Baruch Awerbuch,
Yossi Azar,
Yair Bartal:
On-line generalized Steiner problem.
Theor. Comput. Sci. 324(2-3): 313-324 (2004) |
| 2003 |
|---|
| 121 | EE | Baruch Awerbuch,
André Brinkmann,
Christian Scheideler:
Anycasting in Adversarial Systems: Routing and Admission Control.
ICALP 2003: 1153-1168 |
| 120 | EE | Ittai Abraham,
Baruch Awerbuch,
Yossi Azar,
Yair Bartal,
Dahlia Malkhi,
Elan Pavlov:
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios.
IPDPS 2003: 40 |
| 119 | EE | Baruch Awerbuch,
Jonathan Robert Stanton:
Scalable Decentralized Control for Sensor Networks via Distributed Lattices.
IPSN 2003: 365-375 |
| 118 | EE | Baruch Awerbuch,
Christian Scheideler:
Peer-to-peer systems for prefix search.
PODC 2003: 123-132 |
| 117 | EE | Baruch Awerbuch,
Yishay Mansour:
Adapting to a reliable network path.
PODC 2003: 360-367 |
| 116 | EE | Noga Alon,
Baruch Awerbuch,
Yossi Azar,
Niv Buchbinder,
Joseph Naor:
The online set cover problem.
STOC 2003: 100-105 |
| 115 | EE | Baruch Awerbuch,
Yossi Azar,
Adam Meyerson:
Reducing truth-telling online mechanisms to online optimization.
STOC 2003: 503-510 |
| 114 | EE | Baruch Awerbuch,
Yossi Azar,
Yossi Richter,
Dekel Tsur:
Tradeoffs in Worst-Case Equilibria.
WAOA 2003: 41-52 |
| 113 | EE | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Competitive distributed file allocation.
Inf. Comput. 185(1): 1-40 (2003) |
| 2002 |
|---|
| 112 | EE | Baruch Awerbuch,
David Holmer,
Cristina Nita-Rotaru,
Herbert Rubens:
An on-demand secure routing protocol resilient to byzantine failures.
Workshop on Wireless Security 2002: 21-30 |
| 111 | EE | Baruch Awerbuch,
Tripurari Singh:
An Online Algorithm for the Dynamic Maximal Dense Tree Problem.
Algorithmica 32(4): 540-553 (2002) |
| 110 | EE | Baruch Awerbuch,
Yossi Azar,
Stefano Leonardi,
Oded Regev:
Minimizing the Flow Time Without Migration.
SIAM J. Comput. 31(5): 1370-1382 (2002) |
| 2001 |
|---|
| 109 | | Baruch Awerbuch,
Petra Berenbrink,
André Brinkmann,
Christian Scheideler:
Simple Routing Strategies for Adversarial Systems.
FOCS 2001: 158-167 |
| 108 | EE | Baruch Awerbuch,
Yossi Azar,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On-Line Competitive Algorithms for Call Admission in Optical Networks.
Algorithmica 31(1): 29-43 (2001) |
| 107 | EE | Baruch Awerbuch,
Yuval Shavitt:
Topology aggregation for directed graphs.
IEEE/ACM Trans. Netw. 9(1): 82-90 (2001) |
| 106 | EE | Matthew Andrews,
Baruch Awerbuch,
Antonio Fernández,
Frank Thomson Leighton,
Zhiyong Liu,
Jon M. Kleinberg:
Universal-stability results and performance bounds for greedy contention-resolution protocols.
J. ACM 48(1): 39-69 (2001) |
| 105 | | Baruch Awerbuch,
Yossi Azar,
Serge A. Plotkin,
Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration.
J. Comput. Syst. Sci. 62(3): 385-397 (2001) |
| 2000 |
|---|
| 104 | EE | Baruch Awerbuch,
Yossi Azar,
Oded Regev:
Maximizing job benefits on-line.
APPROX 2000: 42-50 |
| 103 | EE | Baruch Awerbuch,
Yi Du,
Yuval Shavitt:
The effect of network hierarchy structure on performance of ATM PNNI hierarchical routing.
Computer Communications 23(10): 980-986 (2000) |
| 102 | EE | Yair Amir,
Baruch Awerbuch,
R. Sean Borgstrom:
A Cost-Benefit framework for online management of a metacomputing system.
Decision Support Systems 28(1-2): 155-164 (2000) |
| 101 | EE | Yair Amir,
Baruch Awerbuch,
Amnon Barak,
R. Sean Borgstrom,
Arie Keren:
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster.
IEEE Trans. Parallel Distrib. Syst. 11(7): 760-768 (2000) |
| 1999 |
|---|
| 100 | EE | Baruch Awerbuch,
Yossi Azar,
Stefano Leonardi,
Oded Regev:
Minimizing the Flow Time Without Migration.
STOC 1999: 198-205 |
| 99 | | Baruch Awerbuch,
Margrit Betke,
Ronald L. Rivest,
Mona Singh:
Piecemeal Graph Exploration by a Mobile Robot.
Inf. Comput. 152(2): 155-172 (1999) |
| 1998 |
|---|
| 98 | EE | Baruch Awerbuch,
Stephen G. Kobourov:
Polylogarithmic-Overhead Piecemeal Graph Exploration.
COLT 1998: 280-286 |
| 97 | EE | Baruch Awerbuch,
Yi Du,
Yuval Shavitt:
The Effect of Network Hierarchy Structure on Performance of ATM PNNI Hierarchical Routing.
ICCCN 1998: 73-80 |
| 96 | | Baruch Awerbuch,
Yuval Shavitt:
Converging to Approximated Max-Min Flow Fairness in Logarithmic Time.
INFOCOM 1998: 1350-1357 |
| 95 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Distributed Paging for General Networks.
J. Algorithms 28(1): 67-104 (1998) |
| 94 | | Baruch Awerbuch,
Yossi Azar,
Avrim Blum,
Santosh Vempala:
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen.
SIAM J. Comput. 28(1): 254-262 (1998) |
| 93 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Near-Linear Time Construction of Sparse Neighborhood Covers.
SIAM J. Comput. 28(1): 263-277 (1998) |
| 92 | | Baruch Awerbuch,
Israel Cidon,
Shay Kutten,
Yishay Mansour,
David Peleg:
Optimal Broadcast with Partial Knowledge.
SIAM J. Comput. 28(2): 511-524 (1998) |
| 1997 |
|---|
| 91 | EE | Baruch Awerbuch,
Yossi Azar:
Buy-at-Bulk Network Design.
FOCS 1997: 542-547 |
| 90 | EE | Baruch Awerbuch,
Tripurari Singh:
Online Algorithms for Selective Multicast and Maximal Dense Trees.
STOC 1997: 354-362 |
| 89 | | Nabil R. Adam,
Baruch Awerbuch,
Jacob Slonim,
Peter Wegner,
Yelena Yesha:
Globalizing Business, Education, Culture Through the Internet.
Commun. ACM 40(2): 115-121 (1997) |
| 88 | EE | Baruch Awerbuch,
Leonard J. Schulman:
The maintenance of common data in a distributed system.
J. ACM 44(1): 86-103 (1997) |
| 87 | | Yehuda Afek,
Baruch Awerbuch,
Eli Gafni,
Yishay Mansour,
Adi Rosén,
Nir Shavit:
Slide-The Key to Polynomial End-to-End Communication.
J. Algorithms 22(1): 158-186 (1997) |
| 1996 |
|---|
| 86 | | Baruch Awerbuch,
Yossi Azar,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On-line Competive Algorithms for Call Admission in Optical Networks.
ESA 1996: 431-444 |
| 85 | | Matthew Andrews,
Baruch Awerbuch,
Antonio Fernández,
Jon M. Kleinberg,
Frank Thomson Leighton,
Zhiyong Liu:
Universal Stability Results for Greedy Contention-Resolution Protocols.
FOCS 1996: 380-389 |
| 84 | | Baruch Awerbuch,
Yossi Azar,
Amos Fiat:
Packet Routing via Min-Cost Circuit Routing.
ISTCS 1996: 37-42 |
| 83 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Distributed Paging for General Networks.
SODA 1996: 574-583 |
| 82 | | Baruch Awerbuch,
Yossi Azar,
Yair Bartal:
On-line Generalized Steiner Problem.
SODA 1996: 68-74 |
| 81 | EE | Baruch Awerbuch,
Yossi Azar,
Amos Fiat,
Frank Thomson Leighton:
Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).
STOC 1996: 519-530 |
| 80 | | Baruch Awerbuch:
Maximizing Gross Network Product (GNP): Resource Management on the GII.
ACM Comput. Surv. 28(4es): 106 (1996) |
| 79 | EE | Yehuda Afek,
Baruch Awerbuch,
Serge A. Plotkin,
Michael E. Saks:
Local Management of a Global Resource in a Communication Network.
J. ACM 43(1): 1-19 (1996) |
| 78 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Fast Distributed Network Decompositions and Covers.
J. Parallel Distrib. Comput. 39(2): 105-114 (1996) |
| 1995 |
|---|
| 77 | EE | Baruch Awerbuch,
Margrit Betke,
Ronald L. Rivest,
Mona Singh:
Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract).
COLT 1995: 321-328 |
| 76 | | Baruch Awerbuch,
Yossi Azar,
Edward F. Grove,
Ming-Yang Kao,
P. Krishnan,
Jeffrey Scott Vitter:
Load Balancing in the Lp Norm.
FOCS 1995: 383-391 |
| 75 | EE | Baruch Awerbuch,
Yossi Azar,
Avrim Blum,
Santosh Vempala:
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen.
STOC 1995: 277-283 |
| 74 | | Baruch Awerbuch,
Shay Kutten,
Yishay Mansour,
David Peleg:
Optimal Broadcast with Partial Knowledge (Extended Abstract).
WDAG 1995: 116-130 |
| 73 | EE | Baruch Awerbuch,
David Peleg:
Online Tracking of Mobile Users.
J. ACM 42(5): 1021-1058 (1995) |
| 72 | | Baruch Awerbuch,
Yossi Azar:
Competitive multicast routing.
Wireless Networks 1(1): 107-114 (1995) |
| 1994 |
|---|
| 71 | | Baruch Awerbuch,
Yossi Azar:
Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation
FOCS 1994: 240-249 |
| 70 | | Baruch Awerbuch,
Rainer Gawlick,
Frank Thomson Leighton,
Yuval Rabani:
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
FOCS 1994: 412-423 |
| 69 | | Baruch Awerbuch,
Boaz Patt-Shamir,
George Varghese:
Bounding the Unbounded.
INFOCOM 1994: 776-783 |
| 68 | | Baruch Awerbuch,
Rafail Ostrovsky:
Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract).
PODC 1994: 254-263 |
| 67 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat,
Adi Rosén:
Competitive Non-Preemptive Call Control.
SODA 1994: 312-320 |
| 66 | | Baruch Awerbuch,
Yossi Azar,
Serge A. Plotkin,
Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration.
SODA 1994: 321-327 |
| 65 | EE | Baruch Awerbuch,
Lenore Cowen,
Mark A. Smith:
Efficient asynchronous distributed symmetry breaking.
STOC 1994: 214-223 |
| 64 | EE | Baruch Awerbuch,
Tom Leighton:
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks.
STOC 1994: 487-496 |
| 63 | | Baruch Awerbuch,
Boaz Patt-Shamir,
George Varghese,
Shlomi Dolev:
Self-Stabilization by Local Checking and Global Reset (Extended Abstract).
WDAG 1994: 326-339 |
| 62 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Low-Diameter Graph Decomposition Is in NC.
Random Struct. Algorithms 5(3): 441-452 (1994) |
| 1993 |
|---|
| 61 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Heat & Dump: Competitive Distributed Paging
FOCS 1993: 22-31 |
| 60 | | Baruch Awerbuch,
Yossi Azar,
Serge A. Plotkin:
Throughput-Competitive On-Line Routing
FOCS 1993: 32-40 |
| 59 | | Baruch Awerbuch,
Frank Thomson Leighton:
A Simple Local-Control Approximation Algorithm for Multicommodity Flow
FOCS 1993: 459-468 |
| 58 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers
FOCS 1993: 638-647 |
| 57 | | Baruch Awerbuch,
Frank Thomson Leighton:
Multicommodity Flows: A Survey of Recent Research.
ISAAC 1993: 297-302 |
| 56 | EE | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Competitive distributed file allocation.
STOC 1993: 164-173 |
| 55 | EE | William Aiello,
Baruch Awerbuch,
Bruce M. Maggs,
Satish Rao:
Approximate load balancing on dynamic and asynchronous networks.
STOC 1993: 632-641 |
| 54 | EE | Baruch Awerbuch,
Shay Kutten,
Yishay Mansour,
Boaz Patt-Shamir,
George Varghese:
Time optimal self-stabilizing synchronization.
STOC 1993: 652-661 |
| 1992 |
|---|
| 53 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Fast Network Decomposition (Extended Abstract).
PODC 1992: 169-177 |
| 52 | | Baruch Awerbuch,
Boaz Patt-Shamir,
David Peleg,
Michael E. Saks:
Adapting to Asynchronous Dynamic Networks (Extended Abstract)
STOC 1992: 557-570 |
| 51 | | Baruch Awerbuch,
Shay Kutten,
David Peleg:
Competitive Distributed Job Scheduling (Extended Abstract)
STOC 1992: 571-580 |
| 50 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Low-Diameter Graph Decomposition is in NC.
SWAT 1992: 83-93 |
| 49 | | Baruch Awerbuch,
Yishay Mansour:
An Efficient Topology Update Protocol for Dynamic Networks.
WDAG 1992: 185-202 |
| 48 | | Baruch Awerbuch,
David Peleg:
Routing with Polynomial Communication-Space Trade-Off.
SIAM J. Discrete Math. 5(2): 151-162 (1992) |
| 1991 |
|---|
| 47 | | Baruch Awerbuch,
George Varghese:
Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols (Extended Abstract)
FOCS 1991: 258-267 |
| 46 | | Baruch Awerbuch,
Boaz Patt-Shamir,
George Varghese:
Self-Stabilization By Local Checking and Correction (Extended Abstract)
FOCS 1991: 268-277 |
| 45 | | Baruch Awerbuch,
Leonard J. Schulman:
The Maintenance of Common Data in a Distributed System
FOCS 1991: 505-514 |
| 44 | | Baruch Awerbuch,
Amotz Bar-Noy,
Madan Gopal:
Approximate Distributed Bellman-Ford Algorithms.
INFOCOM 1991: 1206-1213 |
| 43 | | Baruch Awerbuch,
Shay Kutten,
David Peleg:
On Buffer-Economical Store-and-Forward Deadlock Prevention.
INFOCOM 1991: 410-414 |
| 42 | | Baruch Awerbuch,
Israel Cidon,
Shay Kutten,
Yishay Mansour,
David Peleg:
Broadcast with Partial Knowledge (Preliminary Version).
PODC 1991: 153-163 |
| 41 | | Baruch Awerbuch,
Shay Kutten,
David Peleg:
Efficient Deadlock-Free Routing.
PODC 1991: 177-188 |
| 40 | EE | Baruch Awerbuch,
David Peleg:
Concurrent Online Tracking of Mobile Users.
SIGCOMM 1991: 221-233 |
| 1990 |
|---|
| 39 | | Baruch Awerbuch,
Israel Cidon,
Shay Kutten:
Communication-Optimal Maintenance of Replicated Information
FOCS 1990: 492-502 |
| 38 | | Baruch Awerbuch,
David Peleg:
Sparse Partitions (Extended Abstract)
FOCS 1990: 503-513 |
| 37 | | Baruch Awerbuch,
David Peleg:
Network Synchronization with Polylogarithmic Overhead
FOCS 1990: 514-522 |
| 36 | | Baruch Awerbuch,
Michael E. Saks:
A Dining Philosophers Algorithm with Polynomial Response Time
FOCS 1990: 65-74 |
| 35 | EE | Baruch Awerbuch,
Israel Cidon,
Inder S. Gopal,
Marc Kaplan,
Shay Kutten:
Distributed Control for PARIS.
PODC 1990: 145-159 |
| 34 | EE | Baruch Awerbuch,
Alan E. Baratz,
David Peleg:
Cost-Sensitive Analysis of Communication Protocols.
PODC 1990: 177-187 |
| 33 | EE | Baruch Awerbuch,
Oded Goldreich,
Amir Herzberg:
A Quantitative Approach to Dynamic Networks.
PODC 1990: 189-203 |
| 32 | EE | Baruch Awerbuch:
Shortest Paths and Loop-Free Routing in Dynamic Networks.
SIGCOMM 1990: 177-187 |
| 31 | EE | Baruch Awerbuch,
Oded Goldreich,
David Peleg,
Ronen Vainish:
A Trade-Off between Information and Communication in Broadcast Protocols
J. ACM 37(2): 238-256 (1990) |
| 30 | | Baruch Awerbuch,
Amotz Bar-Noy,
Nathan Linial,
David Peleg:
Improved Routing Strategies with Succinct Tables.
J. Algorithms 11(3): 307-341 (1990) |
| 29 | | Baruch Awerbuch:
On the Effects of Feedback in Dynamic Network Protocols.
J. Algorithms 11(3): 342-373 (1990) |
| 1989 |
|---|
| 28 | | Baruch Awerbuch,
Yishay Mansour,
Nir Shavit:
Polynomial End-To-End Communication (Extended Abstract)
FOCS 1989: 358-363 |
| 27 | | Baruch Awerbuch,
Andrew V. Goldberg,
Michael Luby,
Serge A. Plotkin:
Network Decomposition and Locality in Distributed Computation
FOCS 1989: 364-369 |
| 26 | | Baruch Awerbuch,
Amotz Bar-Noy,
Nathan Linial,
David Peleg:
Compact Distributed Data Structures for Adaptive Routing (Extended Abstract)
STOC 1989: 479-489 |
| 25 | | Baruch Awerbuch:
Distributed Shortest Paths Algorithms (Extended Abstract)
STOC 1989: 490-500 |
| 1988 |
|---|
| 24 | | Baruch Awerbuch,
Oded Goldreich,
David Peleg,
Ronen Vainish:
A Tradeoff between Information and Communication in Broadcast Protocols.
AWOC 1988: 369-379 |
| 23 | | Baruch Awerbuch,
Michael Sipser:
Dynamic Networks Are as Fast as Static Networks (Preliminary Version)
FOCS 1988: 206-220 |
| 22 | | Baruch Awerbuch:
On the Effects of Feedback in Dynamic Network Protocols (Preliminary Version)
FOCS 1988: 231-245 |
| 21 | | Baruch Awerbuch,
Lefteris M. Kirousis,
Evangelos Kranakis,
Paul M. B. Vitányi:
A Proof Technique for Register Automicity.
FSTTCS 1988: 286-303 |
| 1987 |
|---|
| 20 | | Yehuda Afek,
Baruch Awerbuch,
Serge A. Plotkin,
Michael E. Saks:
Local Management of a Global Resource in a Communication Network
FOCS 1987: 347-357 |
| 19 | | Yehuda Afek,
Baruch Awerbuch,
Eli Gafni:
Applying Static Network Protocols to Dynamic Networks
FOCS 1987: 358-370 |
| 18 | | Paul M. B. Vitányi,
Baruch Awerbuch:
Errata to ``Atomic Shared Register Access by Asynchronous Hardware''
FOCS 1987: 487 |
| 17 | | Baruch Awerbuch:
Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary)
STOC 1987: 230-240 |
| 16 | | Yehuda Afek,
Baruch Awerbuch,
Eli Gafni:
Local Fail-safe Network Reset Procedure.
WDAG 1987: 197-211 |
| 15 | | Baruch Awerbuch,
Yossi Shiloach:
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM.
IEEE Trans. Computers 36(10): 1258-1263 (1987) |
| 14 | | Baruch Awerbuch,
Robert G. Gallager:
A new distributed algorithm to find breadth first search trees.
IEEE Transactions on Information Theory 33(3): 315-322 (1987) |
| 1986 |
|---|
| 13 | | Baruch Awerbuch,
Silvio Micali:
Dynamic deadlock resolution protocols (Extended Abstract)
FOCS 1986: 196-207 |
| 12 | | Paul M. B. Vitányi,
Baruch Awerbuch:
Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract)
FOCS 1986: 233-243 |
| 1985 |
|---|
| 11 | | Baruch Awerbuch,
Robert G. Gallager:
Distributed BFS Algorithms
FOCS 1985: 250-256 |
| 10 | | Benny Chor,
Shafi Goldwasser,
Silvio Micali,
Baruch Awerbuch:
Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)
FOCS 1985: 383-395 |
| 9 | | Baruch Awerbuch:
Communication-Time Trade-Offs in Network Synchronization.
PODC 1985: 272-276 |
| 8 | | Baruch Awerbuch:
A New Distributed Depth-First-Search Algorithm.
Inf. Process. Lett. 20(3): 147-150 (1985) |
| 7 | EE | Baruch Awerbuch:
Complexity of Network Synchronization
J. ACM 32(4): 804-823 (1985) |
| 1984 |
|---|
| 6 | | Baruch Awerbuch,
Shimon Even:
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network.
PODC 1984: 278-281 |
| 5 | | Baruch Awerbuch,
Amos Israeli,
Yossi Shiloach:
Finding Euler Circuits in Logarithmic Parallel Time
STOC 1984: 249-257 |
| 4 | | Baruch Awerbuch:
An Efficient Network Synchronization Protocol
STOC 1984: 522-525 |
| 1983 |
|---|
| 3 | | Baruch Awerbuch,
Tripurari Singh:
New Connectivity and MSF Algorithms for Ultracomputer and PRAM.
ICPP 1983: 175-179 |
| 2 | | Adrian Segall,
Baruch Awerbuch:
A Reliable Broadcast Protocol.
INFOCOM 1983: 103-106 |
| 1 | | Baruch Awerbuch:
Distributed Broadcast Algorithm in Multihop Aloha Networks.
INFOCOM 1983: 66-71 |
