Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt, Mark Tuttle, "Collaborate
with Strangers to find your
preferences", 2005 ACM-SPAA..
Baruch Awerbuch, Robert Kleinberg, Collaborative learning, ACM COLT (Computational Learning Theory) 2005.
Baruch Awerbuch, David Holmer; Herbert Rubens; Robert
Kleinberg, "Provably Competitive Adaptive Routing", IEEE Infocom
2005.
Baruch Awerbuch, David Holmer, Herbert Rubens: The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation. WONS 2005, 206-215
Yair Amir, Baruch Awerbuch, Claudiu Danilov, Jonathan Stanton, "A
Cost-Benefit Flow Control for Application Level Multicast and
Unicast in Overlay Networks ", ACM Transaction on Networks, to
appear, 2005.
Baruch Awerbuch, Yossi Azar
and A. Epstein, "The Price of Routing Unsplittable Flow", ACM STOC, May 2005.
Baruch Awerbuch and Mohammad T. Hajiaghayi and Robert Kleinberg and Tom
Leighton, "Online Client-Server Load Balancing Without Global
Information", ACM-SIAM Symposium on Discrete Algorithms, January
2005.
Baruch Awerbuch and Boaz Patt-Shamir and David Peleg and Mark Tuttle,
"Improved Recommendation Systems"
ACM-SIAM Symposium on Discrete Algorithms, January
2005.
Baruch Awerbuch and Boaz Patt-Shamir and David Peleg and
Mark Tuttle, "Adaptive Collaboration in Peer-to-Peer Systems",
25th IEEE International Conference on Distributed Computing Systems (ICDCS)},
June 2005.
Baruch Awerbuch and Boaz Patt-Shamir and David Peleg and Mark Tuttle,
Collaboration of Untrusting Peers, Proc. of ACM conference on Electronic
Commerce
(EC), may, 2004. .(pdf)
Tradeoffs in worst-case equilibria, Baruch Awerbuch and
Yossi Azar and Yossi Richter and Dekel Tsur, WAOA 2004.(pdf)
Baruch Awerbuch, Christian Scheideler: Group Spreading: A Protocol for Provably Secure Distributed Name Service. ICALP 2004: 183-195
Baruch Awerbuch and Christian Scheideler, Robust Distributed Name Service, Proc.
of International Peer-to-Peer Symposium (IPTPS) February 2004.
(pdf)
Baruch Awerbuch and Christian Scheideler. The Hyperring: A Low-Congestion
Deterministic Data Structure
for Distributed Environments, ACM-SIAM Symposium on Discrete Algorithms,
January
11-13, 2004 New Orleans.
(pdf)
Noga Alon and Baruch Awerbuch and Yossi Azar and Niv Buchbinder
and Joseph (Seffi) Naor. A General Approach to Online Network Optimization
Problems.
ACM-SIAM Symposium on Discrete Algorithms, January 11-13, 2004 New Orleans .(pdf)
Baruch Awerbuch and Christian Scheideler, Consistent and Compact Data Management
in Distributed Storage Systems, SPAA 2004.(pdf)
Baruch Awerbuch and Robert Kleinberg, Adaptive Routing with End-to-End
feedback:
Distributed Learning and Geometric Approaches, Proc. of 2004 ACM STOC, 2004.
(pdf)
Baruch Awerbuch and Dave Holmer and Herb Rubens, High Throughput Route Selection
in Multi-Rate Ad Hoc Wireless Networks, Wireless On-demand Network Systems, jan,
2004.
Invited for for a possible publication on Kluwer MONET, Special Issue on
"Internet
Wireless Access: 802.11 and Beyond"
(pdf)
Baruch Awerbuch and Dave Holmer and Herb Rubens, The Pulse Protocol: Energy
Efficient Infrastructure Access, Proc. of IEEE Infocom, march, 2004.
(pdf)
Baruch Awerbuch, Yossi Azar, Yair Bartal: On-line generalized Steiner problem. Theor. Comput. Sci. 324(2-3): 313-324 (2004)
Baruch Awerbuch Andr\'{e} Brinkmann and Christian
Scheideler, Anycasting in Adversarial Systems: Routing and
Admission Control, ICALP 2003.
Online learning of network paths, Baruch Awerbuch and Yishay
Mansour, Proceedings of PODC, July 2003.
Baruch Awerbuch and Christian Scheideler", "Peer-to-Peer Systems for Prefix
Search",
Proceedings of PODC, July 2003.
Reducing Truth-telling Online Mechanisms to Online
Optimization Baruch Awerbuch, Yossi Azar, and Adam Meyerson,
Proceedings of ACM STOC 2003.(pdf)
The Online Set Cover Problem Noga Alon and Baruch Awerbuch
and Yossi Azar and Niv Buchbinder and Joseph (Seffi) Naor,
Proceedings of ACM STOC 2003.
(pdf)
Scalable Decentralized Control for Sensor Networks via
Distributed Lattices., Baruch Awerbuch and Jonathan Stanton
Information Processing in Sensor Networks: IPSN03 at the Palo Alto
Research Center (PARC), April 2003, Palo Alto, CA.
A Generic Scheme for Building Overlay Networks in
Adversarial Scenarios.
I. Abraham, B. Awerbuch, Y.
Azar, Y. Bartal, D. Malkhi and E. Pavlov.
In Proceedings of the International Parallel and Distributed Processing
Symposium
(IPDPS 2003).
April 2003, Nice, France.
[abstract]
[IPDPS version
pdf]
Baruch Awerbuch, Dave Holmer, Cristina Nita-Rotaru, and Herbert Rubens. An
On-Demand Secure
Routing Protocol Resilient to Byzantine Failures. In ACM Workshop on Wireless
Security
(WiSe),Atlanta, Georgia, September 28, 2002.
Yair Amir, Baruch Awerbuch, Claudiu Danilov, Jonathan Stanton. Global Flow
Control for Wide
Area Overlay Networks: A Cost-Benefit Approach In the Proceedings of IEEE Open
Architectures and
Network Programming (Openarch), pp 155-166, New York, New York, June 2002.
Baruch Awerbuch, Tripurari Singh: An Online Algorithm for the Dynamic Maximal
Dense Tree Problem. Algorithmica 32(4): 540-553 (2002)
Baruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler:
Simple Routing
Strategies for Adversarial Systems. In: Proc. 42 IEEE Symposium on Foundations
of Computer Science
(FOCS), pp. 158-167, 2001.
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)
Baruch Awerbuch, Yuval Shavitt: Topology aggregation for directed
graphs. IEEE/ACM Transactions on Networking 9(1): 82-90 (2001)
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. JACM 48(1):
39-69 (2001)
Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration. JCSS 62(3):
385-397 (2001)
Baruch Awerbuch, Yossi Azar, Oded Regev: Maximizing job benefits on-line.
APPROX 2000: 42-50
Baruch Awerbuch, Stephen G. Kobourov: Polylogarithmic-Overhead
Piecemeal Graph Exploration. COLT 1998: 280-286
Yair Amir, Baruch Awerbuch, and Ryan S. Borgstrom. A Cost-Benefit Framework
for Online
Management of a Metacomputing System The International Journal for Decision
Support Systems,
Elsevier Science, 28(1-2), pages 155-164, April 2000.
Yair Amir, Baruch Awerbuch, Amnon Barak, R. Sean Borgstrom, Arie Keren: An
Opportunity Cost
Approach for Job Assignment in a Scalable Computing Cluster. IEEE Transactions
on Parallel and
Distributed Systems 11(7): 760-768 (2000).
Yair Amir, Baruch Awerbuch, and Ryan S. Borgstrom. A Cost-Benefit Framework for
Online
Management of a Metacomputing System The International Journal for Decision
Support Systems,
Elsevier Science, 28(1-2), pages 155-164, April 2000.
Yair Amir, Baruch Awerbuch, Amnon Barak, R. Sean Borgstrom, Arie Keren: An
Opportunity Cost
Approach for Job Assignment in a Scalable Computing Cluster. IEEE Transactions
on Parallel and
Distributed Systems 11(7): 760-768 (2000).
Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh: Piecemeal Graph
Exploration by a Mobile Robot. Information and Computation 152(2): 155-172
(1999)
B. Awerbuch, Y. Azar, A. Blum and S. Vempala, "New approximation guarantees
for
minimum-weight k-trees and prize-collecting salesmen," SIAM J. Computing 28(1)
(1999) pp. 254-262.
Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev: Minimizing the
Flow Time Without
Migration. STOC 1999: 198-205.
Baruch Awerbuch, Yair Bartal, Amos Fiat: Distributed Paging for General
Networks. J.
Algorithms 28(1): 67-104 (1998)
\item 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)
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg: Near-Linear Time
Construction of
Sparse Neighborhood Covers. SIAM J. Comput. 28(1): 263-277 (1998)
Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg: Optimal
Broadcast
with Partial Knowledge. SIAM J. Comput. 28(2): 511-524 (1998)
N. Adam, B.Awerbuch, J.Slonim, P.Wegner, and Y.Yesha, "Globalizing Business,
Education,
Culture Through the Internet", {\em Communications of the ACM}, Invited paper
for the 50
Anniversary Jubilee Issue, February 1997, pp. 115-121.
Yehuda Afek, Baruch Awerbuch, Eli Gagni, Yishay Mansour, Adi Rosén, Nir
Shavit: Slide-The Key to Polynomial End-to-End Communication. J.
Algorithms 22(1): 158-186 (1997)
Baruch Awerbuch, Leonard J. Schulman: The maintenance of common data
in a distributed system. JACM 44(1): 86-103 (1997)
N. Adam, B.Awerbuch, J.Slonim, P.Wegner, and Y.Yesha, "Globalizing Business,
Education,
Culture Through the Internet", Communications of the ACM, Invited paper for the
50
Anniversary Jubilee Issue, February 1997, pp. 115-121.
Yehuda Afek, Baruch Awerbuch, Eli Gagni, Yishay Mansour, Adi Rosén, Nir
Shavit: Slide-The Key to Polynomial End-to-End Communication. J.
Algorithms 22(1): 158-186 (1997)
Baruch Awerbuch, Leonard J. Schulman: The maintenance of common data
in a distributed system. JACM 44(1): 86-103 (1997)
B.Awerbuch and Y. Azar, ``Buy-At-Bulk Network Design'', 38'th IEEE Symposium on
Found. of
Computer Science, November 1997, Miami Beach, Florida, pp. 542-547.
B.Awerbuch and T.Singh, ``Online Algorithms for Multicast and Maximal dense
Trees'', 29'th ACM
Symposium on Theory of Computing, May 1997, El Paso, TX, pp. 354-362.
N. Adam, B. Awerbuch et al, "Strategic Directions in Electronic Commerce and
Digital
Libraries", ACM Computing Surveys, Volume 28, No. 4, December 1996, pp. 818-835.
Baruch Awerbuch: Maximizing Gross Network Product (GNP): Resource Management on
the GII. ACM
Computing Surveys 28(4es): 106 (1996)
Y. Afek, B.Awerbuch, S.Plotkin, and M.Saks, ``Local Management of a
Global Resource in a Communication Network'', Journal of the ACM, Vol.
43(1), 1996, pp. 1-19.
B.Awerbuch, B.Berger, L.Cowen, and D.Peleg, ``Fast Distributed Network
Decompositions and
Journal of Parallel and distributed computing, Vol. 39, 1996, pp. 105-114.
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg: Fast
Distributed Network Decompositions and Covers. Journal of Parallel and
Distributed Computing 39(2): 105-114 (1996)
B.Awerbuch, Y.Bartal, and A.Fiat, ``Distributed Paging for General
Networks'',
7'th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 1996, San
Francisco, CA.
B.Awerbuch, Y.Azar, and Y. Bartal, ``Online Generalized Steiner Problem'',
7'th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 1996, San
Francisco, CA.
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
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
Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh: Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract). COLT 1995: 321-328
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
Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala: Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. STOC 1995: 277-283
Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg: Optimal Broadcast with Partial Knowledge (Extended Abstract). WDAG 1995: 116-130
Baruch Awerbuch, David Peleg: Online Tracking of Mobile Users. J. ACM 42(5): 1021-1058 (1995)
Baruch Awerbuch, Yossi Azar: Competitive multicast routing. Wireless Networks 1(1): 107-114 (1995)
Baruch Awerbuch, Yossi Azar: Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation FOCS 1994: 240-249
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
Baruch Awerbuch, Boaz Patt-Shamir, George Varghese: Bounding the Unbounded. INFOCOM 1994: 776-783
Baruch Awerbuch, Rafail Ostrovsky: Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract). PODC 1994: 254-263
Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén: Competitive Non-Preemptive Call Control. SODA 1994: 312-320
Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts: Competitive Routing of Virtual Circuits with Unknown Duration. SODA 1994: 321-327
EE Baruch Awerbuch, Lenore Cowen, Mark A. Smith: Efficient asynchronous distributed symmetry breaking. STOC 1994: 214-223
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
Baruch Awerbuch, Boaz Patt-Shamir, George Varghese, Shlomi Dolev: Self-Stabilization by Local Checking and Global Reset (Extended Abstract). WDAG 1994: 326-339
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg: Low-Diameter Graph Decomposition Is in NC. Random Struct. Algorithms 5(3): 441-452 (1994)
Dr. Awerbuch's homepage