The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Baruch Awerbuch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  157. Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. [Citation Graph (, )][DBLP]


  158. Asynchronous Active Recommendation Systems. [Citation Graph (, )][DBLP]


  159. Greedy distributed optimization of unsplittable multicommodity flows. [Citation Graph (, )][DBLP]


  160. Stateless distributed algorithms for near optimal maximum multicommodity flows. [Citation Graph (, )][DBLP]


  161. A jamming-resistant MAC protocol for single-hop wireless networks. [Citation Graph (, )][DBLP]


  162. Brief announcement: Stateless distributed algorithms for generalized packing linear programs. [Citation Graph (, )][DBLP]


  163. Fast convergence to nearly optimal solutions in potential games. [Citation Graph (, )][DBLP]


  164. Fast load balancing via bounded best response. [Citation Graph (, )][DBLP]


  165. Cost sharing mechanisms for near-optimal traffic aggregation and network design. [Citation Graph (, )][DBLP]


  166. Stateless distributed gradient descent for positive linear programs. [Citation Graph (, )][DBLP]


  167. An on-demand secure routing protocol resilient to byzantine failures. [Citation Graph (, )][DBLP]


  168. Greedy distributed optimization of multi-commodity flows. [Citation Graph (, )][DBLP]


Search in 0.073secs, Finished in 0.081secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002