default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBaruch Awerbuch
Person information
- affiliation: Johns Hopkins University, USA
- award (2008): Dijkstra Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2014
[j61]Baruch Awerbuch, Andréa W. Richa, Christian Scheideler, Stefan Schmid
, Jin Zhang:
Principles of Robust Medium Access and an Application to Leader Election. ACM Trans. Algorithms 10(4): 24:1-24:26 (2014)- 2013
- [j60]Faraz Makari Manshadi, Baruch Awerbuch, Rainer Gemulla, Rohit Khandekar, Julián Mestre, Mauro Sozio:
A Distributed Algorithm for Large-Scale Generalized Matching. Proc. VLDB Endow. 6(9): 613-624 (2013) - [j59]Baruch Awerbuch, Yossi Azar, Amir Epstein:
The Price of Routing Unsplittable Flow. SIAM J. Comput. 42(1): 160-177 (2013) - 2012
- [j58]Baruch Awerbuch, Rohit Khandekar, Satish Rao:
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. ACM Trans. Algorithms 9(1): 3:1-3:14 (2012)
2000 – 2009
- 2009
- [j57]Baruch Awerbuch, Rohit Khandekar:
Greedy distributed optimization of multi-commodity flows. Distributed Comput. 21(5): 317-329 (2009) - [j56]Baruch Awerbuch, Christian Scheideler:
Towards a Scalable and Robust DHT. Theory Comput. Syst. 45(2): 234-260 (2009) - [j55]Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir:
Tell Me Who I Am: An Interactive Recommendation System. Theory Comput. Syst. 45(2): 261-279 (2009) - [j54]Baruch Awerbuch, Rohit Khandekar:
Stateless Distributed Gradient Descent for Positive Linear Programs. SIAM J. Comput. 38(6): 2468-2486 (2009) - [j53]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
The Online Set Cover Problem. SIAM J. Comput. 39(2): 361-370 (2009) - [j52]Baruch Awerbuch, Christian Scheideler:
Robust random number generation for peer-to-peer systems. Theor. Comput. Sci. 410(6-7): 453-466 (2009) - [c134]Baruch Awerbuch, Zhenghua Fu, Rohit Khandekar:
Brief announcement: Stateless distributed algorithms for generalized packing linear programs. PODC 2009: 270-271 - 2008
- [j51]Baruch Awerbuch, Israel Cidon, Shay Kutten:
Optimal maintenance of a spanning tree. J. ACM 55(4): 18:1-18:45 (2008) - [j50]Baruch Awerbuch, Robert Kleinberg:
Online linear optimization and adaptive routing. J. Comput. Syst. Sci. 74(1): 97-114 (2008) - [j49]Baruch Awerbuch, Robert Kleinberg:
Competitive collaborative learning. J. Comput. Syst. Sci. 74(8): 1271-1288 (2008) - [j48]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) - [j47]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): 6:1-6:35 (2008) - [c133]Baruch Awerbuch, Rohit Khandekar:
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. LATIN 2008: 580-592 - [c132]Baruch Awerbuch, Andréa W. Richa, Christian Scheideler:
A jamming-resistant MAC protocol for single-hop wireless networks. PODC 2008: 45-54 - [c131]Baruch Awerbuch, Rohit Khandekar:
Greedy distributed optimization of unsplittable multicommodity flows. PODC 2008: 439 - [c130]Baruch Awerbuch, Rohit Khandekar:
Stateless distributed algorithms for near optimal maximum multicommodity flows. PODC 2008: 440 - [c129]Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik:
Fast convergence to nearly optimal solutions in potential games. EC 2008: 264-273 - [c128]Baruch Awerbuch, Yossi Azar, Rohit Khandekar:
Fast load balancing via bounded best response. SODA 2008: 314-322 - [c127]Baruch Awerbuch, Rohit Khandekar:
Cost sharing mechanisms for near-optimal traffic aggregation and network design. SPAA 2008: 85-90 - [c126]Baruch Awerbuch, Rohit Khandekar:
Stateless distributed gradient descent for positive linear programs. STOC 2008: 691-700 - 2007
- [j46]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) - [j45]Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese:
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock. IEEE Trans. Dependable Secur. Comput. 4(3): 180-190 (2007) - [c125]Baruch Awerbuch, Christian Scheideler:
Towards Scalable and Robust Overlay Networks. IPTPS 2007 - [c124]Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir:
Asynchronous Active Recommendation Systems. OPODIS 2007: 48-61 - [c123]Baruch Awerbuch, Rohit Khandekar:
Greedy distributed optimization of multi-commodity flows. PODC 2007: 274-283 - [c122]Baruch Awerbuch, Rohit Khandekar:
Distributed network monitoring and multicommodity flows: a primal-dual approach. PODC 2007: 284-291 - [c121]Baruch Awerbuch, Rohit Khandekar:
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. PODC 2007: 354-355 - [c120]Baruch Awerbuch, Rohit Khandekar:
On cost sharing mechanisms in the network design game. PODC 2007: 364-365 - [c119]Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir:
Asynchronous recommendation systems. PODC 2007: 366-367 - [c118]Baruch Awerbuch, Christian Scheideler:
A denial-of-service resistant DHT. PODC 2007: 370-371 - [c117]Baruch Awerbuch, Rohit Khandekar, Satish Rao:
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA 2007: 949-957 - [c116]Baruch Awerbuch, Thomas P. Hayes:
Online collaborative filtering with nearly optimal dynamic regret. SPAA 2007: 315-319 - [c115]Baruch Awerbuch, Christian Scheideler:
A Denial-of-Service Resistant DHT. DISC 2007: 33-47 - 2006
- [j44]Baruch Awerbuch, David Holmer, Herbert Rubens:
The Medium Time Metric: High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks. Mob. Networks Appl. 11(2): 253-266 (2006) - [j43]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
A general approach to online network optimization problems. ACM Trans. Algorithms 2(4): 640-660 (2006) - [j42]Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur:
Tradeoffs in worst-case equilibria. Theor. Comput. Sci. 361(2-3): 200-209 (2006) - [c114]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 - [c113]Baruch Awerbuch, Christian Scheideler:
Robust Random Number Generation for Peer-to-Peer Systems. OPODIS 2006: 275-289 - [c112]Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir:
Tell me who I am: an interactive recommendation system. SPAA 2006: 1-10 - [c111]Baruch Awerbuch, Christian Scheideler:
Towards a scalable and robust DHT. SPAA 2006: 318-327 - 2005
- [j41]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) - [c110]Baruch Awerbuch, Robert D. Kleinberg:
Competitive Collaborative Learning. COLT 2005: 233-248 - [c109]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle:
Adaptive Collaboration in Peer-to-Peer Systems. ICDCS 2005: 71-80 - [c108]Baruch Awerbuch, David Holmer, Herbert Rubens, Robert D. Kleinberg:
Provably competitive adaptive routing. INFOCOM 2005: 631-641 - [c107]Baruch Awerbuch, Reza Curtmola, David Holmer, Herbert Rubens, Cristina Nita-Rotaru:
On the Survivability of Routing Protocols in Ad Hoc Wireless Networks. SecureComm 2005: 327-338 - [c106]Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Online client-server load balancing without global information. SODA 2005: 197-206 - [c105]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle:
Improved recommendation systems. SODA 2005: 1174-1183 - [c104]Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
Collaborate with strangers to find own preferences. SPAA 2005: 263-269 - [c103]Baruch Awerbuch, Yossi Azar, Amir Epstein:
The Price of Routing Unsplittable Flow. STOC 2005: 57-66 - [c102]Baruch Awerbuch, David Holmer, Herbert Rubens:
The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation. WONS 2005: 206-215 - 2004
- [j40]Baruch Awerbuch, Yossi Azar, Yair Bartal:
On-line generalized Steiner problem. Theor. Comput. Sci. 324(2-3): 313-324 (2004) - [c101]Baruch Awerbuch, Christian Scheideler:
Group Spreading: A Protocol for Provably Secure Distributed Name Service. ICALP 2004: 183-195 - [c100]Baruch Awerbuch, David Holmer, Herbert Rubens:
High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks. WONS 2004: 253-270 - [c99]David Holmer, Herbert Rubens, Baruch Awerbuch:
The Pulse Protocol: Energy Efficient Infrastructure Access. INFOCOM 2004: 1467-1478 - [c98]Baruch Awerbuch, Christian Scheideler:
Robust Distributed Name Service. IPTPS 2004: 237-249 - [c97]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle:
Collaboration of untrusting peers with changing interests. EC 2004: 112-119 - [c96]Baruch Awerbuch, Christian Scheideler:
The hyperring: a low-congestion deterministic data structure for distributed environments. SODA 2004: 318-327 - [c95]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
A general approach to online network optimization problems. SODA 2004: 577-586 - [c94]Baruch Awerbuch, Christian Scheideler:
Consistent and compact data management in distributed storage systems. SPAA 2004: 44-53 - [c93]Baruch Awerbuch, Robert D. Kleinberg:
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. STOC 2004: 45-53 - 2003
- [j39]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Competitive distributed file allocation. Inf. Comput. 185(1): 1-40 (2003) - [c92]Baruch Awerbuch, André Brinkmann, Christian Scheideler:
Anycasting in Adversarial Systems: Routing and Admission Control. ICALP 2003: 1153-1168 - [c91]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 - [c90]Baruch Awerbuch, Jonathan Robert Stanton:
Scalable Decentralized Control for Sensor Networks via Distributed Lattices. IPSN 2003: 365-375 - [c89]Baruch Awerbuch, Christian Scheideler:
Peer-to-peer systems for prefix search. PODC 2003: 123-132 - [c88]Baruch Awerbuch, Yishay Mansour:
Adapting to a reliable network path. PODC 2003: 360-367 - [c87]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
The online set cover problem. STOC 2003: 100-105 - [c86]Baruch Awerbuch, Yossi Azar, Adam Meyerson:
Reducing truth-telling online mechanisms to online optimization. STOC 2003: 503-510 - [c85]Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur:
Tradeoffs in Worst-Case Equilibria. WAOA 2003: 41-52 - 2002
- [j38]Baruch Awerbuch, Tripurari Singh:
An Online Algorithm for the Dynamic Maximal Dense Tree Problem. Algorithmica 32(4): 540-553 (2002) - [j37]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev:
Minimizing the Flow Time Without Migration. SIAM J. Comput. 31(5): 1370-1382 (2002) - [c84]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 - 2001
- [j36]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) - [j35]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) - [j34]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) - [j33]Baruch Awerbuch, Yuval Shavitt:
Topology aggregation for directed graphs. IEEE/ACM Trans. Netw. 9(1): 82-90 (2001) - [c83]Baruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler:
Simple Routing Strategies for Adversarial Systems. FOCS 2001: 158-167 - 2000
- [j32]Baruch Awerbuch, Yi Du, Yuval Shavitt:
The effect of network hierarchy structure on performance of ATM PNNI hierarchical routing. Comput. Commun. 23(10): 980-986 (2000) - [j31]Yair Amir, Baruch Awerbuch, R. Sean Borgstrom:
A Cost-Benefit framework for online management of a metacomputing system. Decis. Support Syst. 28(1-2): 155-164 (2000) - [j30]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 Distributed Syst. 11(7): 760-768 (2000) - [c82]Baruch Awerbuch, Yossi Azar, Oded Regev:
Maximizing job benefits on-line. APPROX 2000: 42-50
1990 – 1999
- 1999
- [j29]Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh:
Piecemeal Graph Exploration by a Mobile Robot. Inf. Comput. 152(2): 155-172 (1999) - [c81]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev:
Minimizing the Flow Time Without Migration. STOC 1999: 198-205 - 1998
- [j28]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Distributed Paging for General Networks. J. Algorithms 28(1): 67-104 (1998) - [j27]Baruch Awerbuch, Yi Du, Bilal Khan, Yuval Shavitt:
Routing through networks with hierarchical topology aggregation. J. High Speed Networks 7(1): 57-73 (1998) - [j26]Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh S. Vempala:
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. SIAM J. Comput. 28(1): 254-262 (1998) - [j25]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Near-Linear Time Construction of Sparse Neighborhood Covers. SIAM J. Comput. 28(1): 263-277 (1998) - [j24]Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg:
Optimal Broadcast with Partial Knowledge. SIAM J. Comput. 28(2): 511-524 (1998) - [c80]Baruch Awerbuch, Stephen G. Kobourov:
Polylogarithmic-Overhead Piecemeal Graph Exploration. COLT 1998: 280-286 - [c79]Baruch Awerbuch, Yi Du, Yuval Shavitt:
The Effect of Network Hierarchy Structure on Performance of ATM PNNI Hierarchical Routing. ICCCN 1998: 73-80 - [c78]Yair Amir, Baruch Awerbuch, R. Sean Borgstrom:
A cost-benefit framework for online management of a metacomputing system. ICE 1998: 140-147 - [c77]Baruch Awerbuch, Yuval Shavitt:
Converging to Approximated Max-Min Flow Fairness in Logarithmic Time. INFOCOM 1998: 1350-1357 - [c76]Baruch Awerbuch, Yuval Shavitt:
Topology aggregation for directed graph. ISCC 1998: 47-52 - [c75]Baruch Awerbuch, Yi Du, Bilal Khan, Yuval Shavitt:
Routing through networks with hierarchical topology aggregation. ISCC 1998: 406-412 - 1997
- [j23]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) - [j22]Baruch Awerbuch, Leonard J. Schulman:
The maintenance of common data in a distributed system. J. ACM 44(1): 86-103 (1997) - [j21]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) - [c74]Baruch Awerbuch, Yossi Azar:
Buy-at-Bulk Network Design. FOCS 1997: 542-547 - [c73]Baruch Awerbuch, Tripurari Singh:
Online Algorithms for Selective Multicast and Maximal Dense Trees. STOC 1997: 354-362 - 1996
- [j20]Baruch Awerbuch:
Maximizing Gross Network Product (GNP): Resource Management on the GII. ACM Comput. Surv. 28(4es): 106 (1996) - [j19]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) - [j18]Baruch Awerbuch, Boaz Patt-Shamir, George Varghese:
Self-stabilizing end-to-end communication. J. High Speed Networks 5(4): 365-381 (1996) - [j17]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Fast Distributed Network Decompositions and Covers. J. Parallel Distributed Comput. 39(2): 105-114 (1996) - [c72]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 - [c71]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 - [c70]Baruch Awerbuch, Yossi Azar, Amos Fiat:
Packet Routing via Min-Cost Circuit Routing. ISTCS 1996: 37-42 - [c69]Baruch Awerbuch, Yossi Azar, Yair Bartal:
On-line Generalized Steiner Problem. SODA 1996: 68-74 - [c68]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Distributed Paging for General Networks. SODA 1996: 574-583 - [c67]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 - 1995
- [j16]Baruch Awerbuch, David Peleg:
Online Tracking of Mobile Users. J. ACM 42(5): 1021-1058 (1995) - [j15]Baruch Awerbuch, Yossi Azar:
Competitive multicast routing. Wirel. Networks 1(1): 107-114 (1995) - [c66]Baruch Awerbuch, Margrit Betke, Ronald L. Rivest, Mona Singh:
Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract). COLT 1995: 321-328 - [c65]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 - [c64]Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh S. Vempala:
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. STOC 1995: 277-283 - [c63]Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg:
Optimal Broadcast with Partial Knowledge (Extended Abstract). WDAG 1995: 116-130 - [e1]Baruch Awerbuch, Dan Duchamp:
MOBICOM '95, Proceedings of the First Annual International Conference on Mobile Computing and Networking, Berkeley, CA, USA, November 13-15, 1995. ACM 1995, ISBN 0-89791-814-2 [contents] - 1994
- [j14]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Low-Diameter Graph Decomposition Is in NC. Random Struct. Algorithms 5(3): 441-452 (1994) - [j13]Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal:
Approximate distributed Bellman-Ford algorithms. IEEE Trans. Commun. 42(8): 2515-2517 (1994) - [j12]Baruch Awerbuch, Shay Kutten, David Peleg:
On buffer-economical store-and-forward deadlock prevention. IEEE Trans. Commun. 42(11): 2934-2937 (1994) - [c62]