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
Journal Articles
- 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) - 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) - 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) - 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) - 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) - 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) - 2004
- [j40]Baruch Awerbuch, Yossi Azar, Yair Bartal:
On-line generalized Steiner problem. Theor. Comput. Sci. 324(2-3): 313-324 (2004) - 2003
- [j39]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Competitive distributed file allocation. Inf. Comput. 185(1): 1-40 (2003) - 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) - 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) - 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) - 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) - 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) - 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) - 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) - 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) - 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) - 1992
- [j11]Baruch Awerbuch, David Peleg:
Routing with Polynomial Communication-Space Trade-Off. SIAM J. Discret. Math. 5(2): 151-162 (1992) - 1990
- [j10]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) - [j9]Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg:
Improved Routing Strategies with Succinct Tables. J. Algorithms 11(3): 307-341 (1990) - [j8]Baruch Awerbuch:
On the Effects of Feedback in Dynamic Network Protocols. J. Algorithms 11(3): 342-373 (1990) - 1987
- [j7]Baruch Awerbuch, Yossi Shiloach:
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM. IEEE Trans. Computers 36(10): 1258-1263 (1987) - [j6]Baruch Awerbuch, Robert G. Gallager:
A new distributed algorithm to find breadth first search trees. IEEE Trans. Inf. Theory 33(3): 315-322 (1987) - 1986
- [j5]Baruch Awerbuch, Shilmon Event:
Reliable broadcast protocols in unreliable networks. Networks 16(4): 381-396 (1986) - 1985
- [j4]Baruch Awerbuch:
A New Distributed Depth-First-Search Algorithm. Inf. Process. Lett. 20(3): 147-150 (1985) - [j3]Baruch Awerbuch:
Complexity of Network Synchronization. J. ACM 32(4): 804-823 (1985) - [j2]Baruch Awerbuch:
Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization. Networks 15(4): 425-437 (1985) - 1983
- [j1]Adrian Segall, Baruch Awerbuch:
A Reliable Broadcast Protocol. IEEE Trans. Commun. 31(7): 896-901 (1983)
Conference and Workshop Papers
- 2009
- [c134]Baruch Awerbuch, Zhenghua Fu, Rohit Khandekar:
Brief announcement: Stateless distributed algorithms for generalized packing linear programs. PODC 2009: 270-271 - 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
- [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
- [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
- [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
- [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
- [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
- [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
- [c83]Baruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler:
Simple Routing Strategies for Adversarial Systems. FOCS 2001: 158-167 - 2000
- [c82]Baruch Awerbuch, Yossi Azar, Oded Regev:
Maximizing job benefits on-line. APPROX 2000: 42-50 - 1999
- [c81]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev:
Minimizing the Flow Time Without Migration. STOC 1999: 198-205 - 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
- [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
- [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
- [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 - 1994
- [c62]Baruch Awerbuch, Yossi Azar:
Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation. FOCS 1994: 240-249 - [c61]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 - [c60]Baruch Awerbuch, Boaz Patt-Shamir, George Varghese:
Bounding the Unbounded. INFOCOM 1994: 776-783 - [c59]Baruch Awerbuch, Rafail Ostrovsky:
Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract). PODC 1994: 254-263 - [c58]Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén:
Competitive Non-Preemptive Call Control. SODA 1994: 312-320 - [c57]Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration. SODA 1994: 321-327 - [c56]Baruch Awerbuch, Lenore Cowen, Mark A. Smith:
Efficient asynchronous distributed symmetry breaking. STOC 1994: 214-223 - [c55]Baruch Awerbuch, Tom Leighton:
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. STOC 1994: 487-496 - [c54]Baruch Awerbuch, Boaz Patt-Shamir, George Varghese, Shlomi Dolev:
Self-Stabilization by Local Checking and Global Reset (Extended Abstract). WDAG 1994: 326-339 - 1993
- [c53]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Heat & Dump: Competitive Distributed Paging. FOCS 1993: 22-31 - [c52]Baruch Awerbuch, Yossi Azar, Serge A. Plotkin:
Throughput-Competitive On-Line Routing. FOCS 1993: 32-40 - [c51]Baruch Awerbuch, Frank Thomson Leighton:
A Simple Local-Control Approximation Algorithm for Multicommodity Flow. FOCS 1993: 459-468 - [c50]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers. FOCS 1993: 638-647 - [c49]Baruch Awerbuch, Frank Thomson Leighton:
Multicommodity Flows: A Survey of Recent Research. ISAAC 1993: 297-302 - [c48]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Competitive distributed file allocation. STOC 1993: 164-173 - [c47]William Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao:
Approximate load balancing on dynamic and asynchronous networks. STOC 1993: 632-641 - [c46]Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese:
Time optimal self-stabilizing synchronization. STOC 1993: 652-661 - 1992
- [c45]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Fast Network Decomposition (Extended Abstract). PODC 1992: 169-177 - [c44]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks:
Adapting to Asynchronous Dynamic Networks (Extended Abstract). STOC 1992: 557-570 - [c43]Baruch Awerbuch, Shay Kutten, David Peleg:
Competitive Distributed Job Scheduling (Extended Abstract). STOC 1992: 571-580 - [c42]Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Low-Diameter Graph Decomposition is in NC. SWAT 1992: 83-93 - [c41]Baruch Awerbuch, Yishay Mansour:
An Efficient Topology Update Protocol for Dynamic Networks. WDAG 1992: 185-202 - 1991
- [c40]Baruch Awerbuch, George Varghese:
Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols (Extended Abstract). FOCS 1991: 258-267 - [c39]Baruch Awerbuch, Boaz Patt-Shamir, George Varghese:
Self-Stabilization By Local Checking and Correction (Extended Abstract). FOCS 1991: 268-277 - [c38]Baruch Awerbuch, Leonard J. Schulman:
The Maintenance of Common Data in a Distributed System. FOCS 1991: 505-514 - [c37]Baruch Awerbuch, Shay Kutten, David Peleg:
On Buffer-Economical Store-and-Forward Deadlock Prevention. INFOCOM 1991: 410-414 - [c36]Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal:
Approximate Distributed Bellman-Ford Algorithms. INFOCOM 1991: 1206-1213 - [c35]Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg:
Broadcast with Partial Knowledge (Preliminary Version). PODC 1991: 153-163 - [c34]Baruch Awerbuch, Shay Kutten, David Peleg:
Efficient Deadlock-Free Routing. PODC 1991: 177-188 - [c33]Baruch Awerbuch, David Peleg:
Concurrent Online Tracking of Mobile Users. SIGCOMM 1991: 221-233 - 1990
- [c32]Baruch Awerbuch, Michael E. Saks:
A Dining Philosophers Algorithm with Polynomial Response Time. FOCS 1990: 65-74 - [c31]Baruch Awerbuch, Israel Cidon, Shay Kutten:
Communication-Optimal Maintenance of Replicated Information. FOCS 1990: 492-502 - [c30]Baruch Awerbuch, David Peleg:
Sparse Partitions (Extended Abstract). FOCS 1990: 503-513 - [c29]Baruch Awerbuch, David Peleg:
Network Synchronization with Polylogarithmic Overhead. FOCS 1990: 514-522 - [c28]Baruch Awerbuch, Israel Cidon, Inder S. Gopal, Marc A. Kaplan, Shay Kutten:
Distributed Control for PARIS. PODC 1990: 145-159 - [c27]Baruch Awerbuch, Alan E. Baratz, David Peleg:
Cost-Sensitive Analysis of Communication Protocols. PODC 1990: 177-187 - [c26]Baruch Awerbuch, Oded Goldreich, Amir Herzberg:
A Quantitative Approach to Dynamic Networks. PODC 1990: 189-203 - [c25]Baruch Awerbuch:
Shortest Paths and Loop-Free Routing in Dynamic Networks. SIGCOMM 1990: 177-187 - 1989
- [c24]Baruch Awerbuch, Yishay Mansour, Nir Shavit:
Polynomial End-To-End Communication (Extended Abstract). FOCS 1989: 358-363 - [c23]Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin:
Network Decomposition and Locality in Distributed Computation. FOCS 1989: 364-369 - [c22]Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg:
Compact Distributed Data Structures for Adaptive Routing (Extended Abstract). STOC 1989: 479-489 - [c21]Baruch Awerbuch:
Distributed Shortest Paths Algorithms (Extended Abstract). STOC 1989: 490-500 - 1988
- [c20]Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish:
A Tradeoff between Information and Communication in Broadcast Protocols. AWOC 1988: 369-379 - [c19]Baruch Awerbuch, Michael Sipser:
Dynamic Networks Are as Fast as Static Networks (Preliminary Version). FOCS 1988: 206-220 - [c18]Baruch Awerbuch:
On the Effects of Feedback in Dynamic Network Protocols (Preliminary Version). FOCS 1988: 231-245 - [c17]Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi:
A Proof Technique for Register Automicity. FSTTCS 1988: 286-303 - 1987
- [c16]Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks:
Local Management of a Global Resource in a Communication Network. FOCS 1987: 347-357 - [c15]Yehuda Afek, Baruch Awerbuch, Eli Gafni:
Applying Static Network Protocols to Dynamic Networks. FOCS 1987: 358-370 - [c14]Paul M. B. Vitányi, Baruch Awerbuch:
Errata to "Atomic Shared Register Access by Asynchronous Hardware". FOCS 1987: 487 - [c13]Baruch Awerbuch:
Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary). STOC 1987: 230-240 - [c12]Yehuda Afek, Baruch Awerbuch, Eli Gafni:
Local Fail-safe Network Reset Procedure. WDAG 1987: 197-211 - 1986
- [c11]Baruch Awerbuch, Silvio Micali:
Dynamic deadlock resolution protocols (Extended Abstract). FOCS 1986: 196-207 - [c10]Paul M. B. Vitányi, Baruch Awerbuch:
Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract). FOCS 1986: 233-243 - 1985
- [c9]Baruch Awerbuch, Robert G. Gallager:
Distributed BFS Algorithms. FOCS 1985: 250-256 - [c8]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 - [c7]Baruch Awerbuch:
Communication-Time Trade-Offs in Network Synchronization. PODC 1985: 272-276 - 1984
- [c6]Baruch Awerbuch, Shimon Even:
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. PODC 1984: 278-281 - [c5]Baruch Awerbuch, Amos Israeli, Yossi Shiloach:
Finding Euler Circuits in Logarithmic Parallel Time. STOC 1984: 249-257 - [c4]Baruch Awerbuch:
An Efficient Network Synchronization Protocol. STOC 1984: 522-525 - 1983
- [c3]Baruch Awerbuch, Tripurari Singh:
New Connectivity and MSF Algorithms for Ultracomputer and PRAM. ICPP 1983: 175-179 - [c2]Baruch Awerbuch:
Distributed Broadcast Algorithm in Multihop Aloha Networks. INFOCOM 1983: 66-71 - [c1]Adrian Segall, Baruch Awerbuch:
A Reliable Broadcast Protocol. INFOCOM 1983: 103-106
Editorship
- 1995
- [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]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
