| Year |
Citation |
Score |
| 2014 |
Awerbuch B, Richa A, Scheideler C, Schmid S, Zhang J. Principles of robust medium access and an application to leader election Acm Transactions On Algorithms. 10. DOI: 10.1145/2635818 |
0.532 |
|
| 2010 |
Cole RG, Kumar S, Mishra A, Awerbuch B. Adaptive resilient tactical network management Johns Hopkins Apl Technical Digest (Applied Physics Laboratory). 28: 284-285. |
0.378 |
|
| 2009 |
Cole RG, Awerbuch B. Lightweight unicast and multicast routing for MANETs Ieee Pacific Rim Conference On Communications, Computers, and Signal Processing - Proceedings. 939-943. DOI: 10.1109/PACRIM.2009.5291243 |
0.389 |
|
| 2009 |
Awerbuch B, Khandekar R. Greedy distributed optimization of multi-commodity flows Distributed Computing. 21: 317-329. DOI: 10.1007/S00446-008-0074-0 |
0.318 |
|
| 2008 |
Awerbuch B, Cidon I, Kutten S. Optimal maintenance of a spanning tree Journal of the Acm. 55. DOI: 10.1145/1391289.1391292 |
0.486 |
|
| 2008 |
Awerbuch B, Curtmola R, Holmer D, Nita-Rotaru C, Rubens H. ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks Acm Transactions On Information and System Security. 10. DOI: 10.1145/1284680.1341892 |
0.813 |
|
| 2008 |
Awerbuch B, Kleinberg R. Online linear optimization and adaptive routing Journal of Computer and System Sciences. 74: 97-114. DOI: 10.1016/J.Jcss.2007.04.016 |
0.38 |
|
| 2008 |
Awerbuch B, Richa A, Scheideler C. A jamming-resistant MAC protocol for single-hop wireless networks Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 45-54. |
0.461 |
|
| 2007 |
Awerbuch B, Hajiaghayi MT, Kleinberg R, Leighton T. Localized client-server load balancing without global information Siam Journal On Computing. 37: 1259-1279. DOI: 10.1137/S009753970444661X |
0.325 |
|
| 2007 |
Awerbuch B, Kutten S, Mansour Y, Patt-Shamir B, Varghese G. A time-optimal self-stabilizing synchronizer using a phase clock Ieee Transactions On Dependable and Secure Computing. 4: 180-190. DOI: 10.1109/Tdsc.2007.1007 |
0.401 |
|
| 2007 |
Awerbuch B, Holmer D, Rubens H, Cole RG. Analysis of multiple trees on path discovery for beacon-based routing protocols Ieee Pacific Rim Conference On Communications, Computers, and Signal Processing - Proceedings. 25-29. DOI: 10.1109/PACRIM.2007.4313168 |
0.779 |
|
| 2007 |
Awerbuch B, Holmer D, Rubens H, Cole RG. Beacon-based routing for tactical networks Proceedings - Ieee Military Communications Conference Milcom. DOI: 10.1109/MILCOM.2007.4455293 |
0.8 |
|
| 2006 |
Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor J. A general approach to online network optimization problems Acm Transactions On Algorithms. 2: 640-660. DOI: 10.1145/1198513.1198522 |
0.351 |
|
| 2006 |
Awerbuch B, Scheideler C. Robust random number generation for peer-to-peer systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4305: 275-289. DOI: 10.1016/J.Tcs.2008.10.003 |
0.391 |
|
| 2006 |
Awerbuch B, Azar Y, Richter Y, Tsur D. Tradeoffs in worst-case equilibria Theoretical Computer Science. 361: 200-209. DOI: 10.1016/J.Tcs.2006.05.010 |
0.35 |
|
| 2006 |
Awerbuch B, Holmer D, Rubens H. The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks Mobile Networks and Applications. 11: 253-266. DOI: 10.1007/S11036-005-4477-X |
0.796 |
|
| 2006 |
Awerbuch B, Scheideler C. Towards a scalable and robust DHT Annual Acm Symposium On Parallelism in Algorithms and Architectures. 2006: 318-327. DOI: 10.1007/S00224-008-9099-9 |
0.31 |
|
| 2006 |
Awerbuch B, Cole RG, Curtmola R, Holmer D, Rubens H. Dynamics of learning algorithms for the On-Demand Secure Byzantine Routing protocol Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4357: 98-112. DOI: 10.1007/11964254_10 |
0.762 |
|
| 2005 |
Amir Y, Awerbuch B, Danilov C, Stanton J. A cost-benefit flow control for reliable multicast and unicast in overlay networks Ieee/Acm Transactions On Networking. 13: 1094-1106. DOI: 10.1109/Tnet.2005.857121 |
0.509 |
|
| 2005 |
Awerbuch B, Curtmola R, Holmer D, Rubens H, Nita-Rotaru C. On the survivability of routing protocols in ad hoc wireless networks Proceedings - First International Conference On Security and Privacy For Emerging Areas in Communications Networks, Securecomm 2005. 2005: 327-338. DOI: 10.1109/SECURECOMM.2005.30 |
0.809 |
|
| 2005 |
Awerbuch B, Holmer D, Rubens H, Kleinberg R. Provably competitive adaptive routing Proceedings - Ieee Infocom. 1: 631-641. DOI: 10.1109/INFCOM.2005.1497929 |
0.759 |
|
| 2004 |
Awerbuch B, Holmer D, Rubens H. The pulse protocol: Mobile ad hoc network performance evaluation 2nd Annual Conference On Wireless On-Demand Network Systems and Services, Wons 2005. 206-215. DOI: 10.1109/WONS.2005.33 |
0.796 |
|
| 2004 |
Awerbuch B, Azar Y, Bartal Y. On-line generalized Steiner problem Theoretical Computer Science. 324: 313-324. DOI: 10.1016/J.Tcs.2004.05.021 |
0.315 |
|
| 2004 |
Awerbuch B, Kleinberg RD. Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 45-53. |
0.3 |
|
| 2004 |
Awerbuch B, Holmer D, Rubens H. The Pulse protocol: Energy efficient infrastructure access Proceedings - Ieee Infocom. 2: 1467-1478. |
0.748 |
|
| 2004 |
Awerbuch B, Holmer D, Rubens H. Swarm intelligence routing resilient to byzantine adversaries International Zurich Seminar On Digital Communications. 160-163. |
0.79 |
|
| 2004 |
Awerbuch B, Holmer D, Rubens H, Chang K, Wang IJ. The Pulse protocol: Sensor network routing and power saving Proceedings - Ieee Military Communications Conference Milcom. 2: 662-667. |
0.781 |
|
| 2003 |
Abraham I, Awerbuch B, Azar Y, Bartal Y, Malkhi D, Pavlov E. A generic scheme for building overlay networks in adversarial scenarios Proceedings - International Parallel and Distributed Processing Symposium, Ipdps 2003. DOI: 10.1109/IPDPS.2003.1213125 |
0.355 |
|
| 2003 |
Awerbuch B, Bartal Y, Fiat A. Competitive distributed file allocation Information and Computation. 185: 1-40. DOI: 10.1016/S0890-5401(03)00055-5 |
0.338 |
|
| 2003 |
Awerbuch B, Mansour Y. Adapting to a Reliable Network Path Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 22: 360-367. |
0.349 |
|
| 2003 |
Awerbuch B, Stanton J. Scalable decentralized control for sensor networks via distributed lattices Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2634: 365-375. |
0.353 |
|
| 2003 |
Awerbuch B, Brinkmann A, Scheideler C. Anycasting in adversarial systems: Routing and admission control Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2719: 1153-1168. |
0.383 |
|
| 2003 |
Awerbuch B, Holmer D, Rubens H. High throughput route selection in multi-rate ad hoc wireless networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2928: 253-270. |
0.799 |
|
| 2002 |
Awerbuch B, Holmer D, Nita-Rotaru C, Rubens H. An on-demand secure routing protocol resilient to byzantine failures Proceedings of the Workshop On Wireless Security. 21-30. |
0.773 |
|
| 2001 |
Andrews M, Awerbuch B, Fernández A, Leighton T, Liu Z, Kleinberg J. Universal-stability results and performance bounds for greedy contention-resolution protocols Journal of the Acm. 48: 39-69. DOI: 10.1145/363647.363677 |
0.538 |
|
| 2001 |
Awerbuch B, Shavitt Y. Topology aggregation for directed graphs Ieee/Acm Transactions On Networking. 9: 82-90. DOI: 10.1109/90.909026 |
0.418 |
|
| 2001 |
Awerbuch B, Azar Y, Fiat A, Leonardi S, Rosén A. On-line competitive algorithms for call admission in optical networks Algorithmica (New York). 31: 29-43. DOI: 10.1007/S00453-001-0039-1 |
0.386 |
|
| 2001 |
Awerbuch B, Azar Y, Plotkin S, Waarts O. Competitive routing of virtual circuits with unknown duration Journal of Computer and System Sciences. 62: 385-397. DOI: 10.1006/Jcss.1999.1662 |
0.308 |
|
| 2001 |
Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple routing strategies for adversarial systems Annual Symposium On Foundations of Computer Science - Proceedings. 158-167. |
0.32 |
|
| 2000 |
Awerbuch B, Du Y, Shavitt Y. Effect of network hierarchy structure on performance of ATM PNNI hierarchical routing Computer Communications. 23: 980-986. DOI: 10.1016/S0140-3664(99)00247-9 |
0.463 |
|
| 1998 |
Awerbuch B, Cidon I, Kutten S, Mansour Y, Peleg D. Optimal Broadcast with Partial Knowledge Siam Journal On Computing. 28: 511-524. DOI: 10.1137/S0097539795279931 |
0.319 |
|
| 1998 |
Awerbuch B, Bartal Y, Fiat A. Distributed paging for general networks Journal of Algorithms. 28: 67-104. DOI: 10.1006/Jagm.1998.0924 |
0.446 |
|
| 1998 |
Awerbuch B, Du Y, Khan B, Shavitt Y. Routing through networks with hierarchical topology aggregation Journal of High Speed Networks. 7: 57-73. |
0.377 |
|
| 1997 |
Awerbuch B, Schulman LJ. The maintenance of common data in a distributed system Journal of the Acm. 44: 86-103. DOI: 10.1145/256292.256298 |
0.437 |
|
| 1997 |
Afek Y, Awerbuch B, Gafni E, Mansour Y, Rosén A, Shavit N. Slide - The Key to Polynomial End-to-End Communication Journal of Algorithms. 22: 158-186. DOI: 10.1006/Jagm.1996.0819 |
0.495 |
|
| 1996 |
Awerbuch B. Maximizing gross network product (GNP): resource management on the GII Acm Computing Surveys. 28: 106. DOI: 10.1145/242224.242361 |
0.374 |
|
| 1996 |
Afek Y, Awerbuch B, Plotkin S, Saks M. Local management of a global resource in a communication network Journal of the Acm. 43: 1-19. DOI: 10.1145/227595.227596 |
0.372 |
|
| 1996 |
Awerbuch B, Berger B, Cowen L, Peleg D. Fast distributed network decompositions and covers Journal of Parallel and Distributed Computing. 39: 105-114. DOI: 10.1006/Jpdc.1996.0159 |
0.423 |
|
| 1995 |
Awerbuch B, Peleg D. Online Tracking of Mobile Users Journal of the Acm (Jacm). 42: 1021-1058. DOI: 10.1145/210118.210132 |
0.444 |
|
| 1995 |
Awerbuch B, Azar Y. Competitive multicast routing Wireless Networks. 1: 107-114. DOI: 10.1007/Bf01196262 |
0.421 |
|
| 1994 |
Awerbuch B, Kutten S, Peleg D. On Buffer-Economical Store-and-Forward Deadlock Prevention Ieee Transactions On Communications. 42: 2934-2937. DOI: 10.1109/26.328973 |
0.447 |
|
| 1994 |
Awerbuch B, Bar-Noy A, Gopal M. Approximate Distributed Bellman-Ford Algorithms Ieee Transactions On Communications. 42: 2515-2517. DOI: 10.1109/26.310604 |
0.354 |
|
| 1992 |
Awerbuch B, Peleg D. Routing with Polynomial Communication-Space Srade-ff Siam Journal On Discrete Mathematics. 5: 151-162. DOI: 10.1137/0405013 |
0.37 |
|
| 1990 |
Awerbuch B, Goldreich O, Vainish R, Peleg D. A Trade-Off Between Information and Communication in Broadcast Protocols Journal of the Acm (Jacm). 37: 238-256. DOI: 10.1145/77600.77618 |
0.485 |
|
| 1990 |
Awerbuch B. On the effects of feedback in dynamic network protocols Journal of Algorithms. 11: 342-373. DOI: 10.1016/0196-6774(90)90018-A |
0.504 |
|
| 1990 |
Awerbuch B, Bar-Noy A, Linial N, Peleg D. Improved routing strategies with succinct tables Journal of Algorithms. 11: 307-341. DOI: 10.1016/0196-6774(90)90017-9 |
0.389 |
|
| 1987 |
Awerbuch B, Gallager RG. A New Distributed Algorithm to Find Breadth First Search Trees Ieee Transactions On Information Theory. 33: 315-322. DOI: 10.1109/TIT.1987.1057314 |
0.312 |
|
| 1986 |
Awerbuch B, Event S. Reliable broadcast protocols in unreliable networks Networks. 16: 381-396. DOI: 10.1002/Net.3230160405 |
0.561 |
|
| 1985 |
Awerbuch B. Complexity of Network Synchronization Journal of the Acm (Jacm). 32: 804-823. DOI: 10.1145/4221.4227 |
0.45 |
|
| 1985 |
Awerbuch B. Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronization Networks. 15: 425-437. DOI: 10.1002/Net.3230150404 |
0.385 |
|
| 1983 |
Segall A, Awerbuch B. A Reliable Broadcast Protocol Ieee Transactions On Communications. 31: 896-901. DOI: 10.1109/Tcom.1983.1095904 |
0.498 |
|
| Low-probability matches (unlikely to be authored by this person) |
| 1998 |
Awerbuch B, Berger B, Cowen L, Peleg D. Near-Linear Time Construction of Sparse Neighborhood Covers Siam Journal On Computing. 28: 263-277. DOI: 10.1137/S0097539794271898 |
0.295 |
|
| 2007 |
Awerbuch B, Khandekar R. Brief announcement: Minimizing the total cost of network measurements in a distributed manner: A primal-dual approach Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 354-355. DOI: 10.1145/1281100.1281170 |
0.285 |
|
| 2008 |
Awerbuch B, Kleinberg R. Competitive collaborative learning Journal of Computer and System Sciences. 74: 1271-1288. DOI: 10.1016/J.Jcss.2007.08.004 |
0.283 |
|
| 2002 |
Awerbuch B, Azar Y, Leonardi S, Regev O. Minimizing the flow time without migration Siam Journal On Computing. 31: 1370-1382. DOI: 10.1137/S009753970037446X |
0.277 |
|
| 2008 |
Awerbuch B, Khandekar R. Cost sharing mechanisms for near-optimal traffic aggregation and network design Annual Acm Symposium On Parallelism in Algorithms and Architectures. 85-90. DOI: 10.1145/1378533.1378546 |
0.274 |
|
| 2007 |
Awerbuch B, Khandekar R. Distributed network monitoring and multicommodity flows: A primal-dual approach Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 284-291. DOI: 10.1145/1281100.1281141 |
0.272 |
|
| 1996 |
Awerbuch B, Patt-Shamir B, Varghese G. Self-stabilizing end-to-end communication Journal of High Speed Networks. 5: 365-381. |
0.27 |
|
| 2012 |
Awerbuch B, Khandekar R, Rao S. Distributed algorithms for multicommodity flow problems via approximate steepest descent framework Acm Transactions On Algorithms. 9. DOI: 10.1145/2390176.2390179 |
0.266 |
|
| 1994 |
Awerbuch B, Berger B, Cowen L, Peleg D. Low-diameter graph decomposition is in NC Random Structures and Algorithms. 5: 441-452. DOI: 10.1002/Rsa.3240050305 |
0.261 |
|
| 1999 |
Awerbuch B, Azar Y, Blum A, Vempala S. New Approximation Guarantees for Minimum-Weight k -Trees and Prize-Collecting Salesmen Siam Journal On Computing. 28: 254-262. DOI: 10.1137/S009753979528826X |
0.261 |
|
| 2009 |
Alon N, Awerbuch B, Azar Y, Patt-Shamir B. Tell me who i am: An interactive recommendation system Theory of Computing Systems. 45: 261-279. DOI: 10.1007/S00224-008-9100-7 |
0.258 |
|
| 2005 |
Awerbuch B, Azar Y, Epstein A. The price of routing unsplittable flow Proceedings of the Annual Acm Symposium On Theory of Computing. 57-66. DOI: 10.1137/070702370 |
0.257 |
|
| 1999 |
Awerbuch B, Betke M, Rivest RL, Singh M. Piecemeal Graph Exploration by a Mobile Robot Information & Computation. 152: 155-172. DOI: 10.1006/Inco.1999.2795 |
0.257 |
|
| 2009 |
Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor J. The online set cover problem Siam Journal On Computing. 39: 361-370. DOI: 10.1137/060661946 |
0.257 |
|
| 2001 |
Awerbuch B, Azar Y, Regev O. Maximizing job benefits on‐line Journal of Scheduling. 4: 287-296. DOI: 10.1002/Jos.84 |
0.256 |
|
| 2005 |
Awerbuch B, Azar Y, Lotker Z, Patt-Shamir B, Tuttle MR. Collaborate with strangers to find own preferences Annual Acm Symposium On Parallelism in Algorithms and Architectures. 263-269. DOI: 10.1007/S00224-007-9016-7 |
0.255 |
|
| 2001 |
Awerbuch B, Azar Y, Regev O. Maximizing job benefits on-line Journal of Scheduling. 4: 287-296. DOI: 10.1007/3-540-44436-X_6 |
0.254 |
|
| 2009 |
Awerbuch B, Khandekar R. Stateless distributed gradient descent for positive linear programs Siam Journal On Computing. 38: 2468-2486. DOI: 10.1137/080717651 |
0.25 |
|
| 1996 |
Afek Y, Awerbuch B, Plotkin S, Saks M. Local management of a global resource in a communication network Journal of the Acm. 43: 1-19. |
0.244 |
|
| 2007 |
Awerbuch B, Khandekar R. Brief announcement: On cost sharing mechanisms in the network design game Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 364-365. DOI: 10.1145/1281100.1281175 |
0.24 |
|
| 2000 |
Amir Y, Awerbuch B, Barak A, Borgstrom RS, Keren A. An opportunity cost approach for job assignment in a scalable computing cluster Ieee Transactions On Parallel and Distributed Systems. 11: 760-768. DOI: 10.1109/71.877834 |
0.238 |
|
| 2004 |
Awerbuch B, Scheideler C. Group spreading: A protocol for provably secure distributed name service Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3142: 183-195. |
0.233 |
|
| 2002 |
Amir Y, Awerbuch B, Danilov C, Stanton J. Global flow control for wide area overlay networks: A cost-benefit approach 2002 Ieee Open Architectures and Network Programming Proceedings, Openarch 2002. 155-166. DOI: 10.1109/OPNARC.2002.1019236 |
0.215 |
|
| 1996 |
Awerbuch B, Patt-Shamir B, Varghese G. Self-stabilizing end-to-end communication Journal of High Speed Networks. 5: 365-381. DOI: 10.3233/Jhs-1996-5404 |
0.208 |
|
| 2000 |
Amir Y, Awerbuch B, Borgstrom RS. Cost-benefit framework for online management of a metacomputing system Decision Support Systems. 28: 155-164. DOI: 10.1016/S0167-9236(99)00081-0 |
0.203 |
|
| 2005 |
Awerbuch B, Hajiaghayi MT, Kleinberg RD, Leighton T. Online client-server load balancing without global information Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 197-206. |
0.202 |
|
| 2007 |
Awerbuch B, Scheideler C. A denial-of-service resistant DHT Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4731: 33-47. |
0.198 |
|
| 1998 |
Awerbuch B. Optimal broadcast with partial knowledge Siam Journal On Computing. 28: 511-524. |
0.187 |
|
| 1987 |
Awerbuch B, Shiloach Y. New Connectivity and MSF Algorithms for Shuffle-Exchange Network and Pram Ieee Transactions On Computers. 1258-1263. DOI: 10.1109/TC.1987.1676869 |
0.186 |
|
| 1997 |
Adam N, Awerbuch B, Slonim J, Wegner P, Yesha Y. Globalizing Business, Education, Culture Through the Internet Communications of the Acm. 40: X-131. DOI: 10.1145/253671.253748 |
0.185 |
|
| 2007 |
Awerbuch B, Nisgav A, Patt-Shamir B. Asynchronous recommendation systems Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 366-367. DOI: 10.1145/1281100.1281176 |
0.179 |
|
| 2007 |
Awerbuch B, Scheideler C. Brief announcement: A denial-of-service resistant DHT Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 370-371. DOI: 10.1145/1281100.1281178 |
0.176 |
|
| 2006 |
Awerbuch B, Scheideler C. Towards a scalable and robust DHT Annual Acm Symposium On Parallelism in Algorithms and Architectures. 2006: 318-327. |
0.176 |
|
| 1985 |
Awerbuch B. A new distributed Depth-First-Search algorithm Information Processing Letters. 20: 147-150. DOI: 10.1016/0020-0190(85)90083-3 |
0.163 |
|
| 1998 |
Awerbuch B, Berger B, Cowen L, Peleg D. Near-Linear Time Construction of Sparse Neighborhood Covers Siam Journal On Computing. 28: 263-277. |
0.155 |
|
| 2005 |
Awerbuch B, Patt-Shamir B, Peleg D, Tuttle M. Adaptive collaboration in peer-to-peer systems Proceedings - International Conference On Distributed Computing Systems. 71-80. |
0.147 |
|
| 2008 |
Awerbuch B, Khandekar R. Brief announcement: Greedy distributed optimization of unsplittable multicommodity flows Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 439. |
0.146 |
|
| 2013 |
Manshadi FM, Awerbuch B, Gemulla R, Khandekar R, Mestre J, Sozio M. A distributed algorithm for large-scale generalized matching Proceedings of the Vldb Endowment. 6: 613-624. |
0.139 |
|
| 2002 |
Awerbuch B, Singh T. An online algorithm for the dynamic maximal dense tree problem Algorithmica (New York). 32: 540-553. |
0.13 |
|
| 2008 |
Awerbuch B, Khandekar R. Brief announcement: Stateless distributed algorithms for near optimal maximum multicommodity flows Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 440. |
0.129 |
|
| 1983 |
Awerbuch B, Shiloach Y. NEW CONNECTIVITY AND MSF ALGORITHMS FOR ULTRACOMPUTER AND PRAM Proceedings of the International Conference On Parallel Processing. 175-179. |
0.126 |
|
| 1995 |
Halpern J, Awerbuch B, Benor M, Chandra A, Feigenbaum J, Vonzurgathen J, Guibas L, Pitt L, Saks M, Shmoys D, Sleator D, Upfal E, Vazirani U, Yao A. Editors′ Foreword Journal of Computer and System Sciences. 50: 189. DOI: 10.1006/jcss.1995.1016 |
0.12 |
|
| 2003 |
Awerbuch B, Scheideler C. Peer-to-Peer Systems for Prefix Search Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 22: 123-132. |
0.117 |
|
| 1999 |
Awerbuch B, Betke M, Rivest RL, Singh M. Piecemeal Graph Exploration by a Mobile Robot Information and Computation. 152: 155-172. |
0.098 |
|
| 2004 |
Awerbuch B, Scheideler C. Robust distributed name service Lecture Notes in Computer Science. 3279: 237-249. |
0.096 |
|
| 2008 |
Awerbuch B, Azar Y, Epstein A, Mirrokni VS, Skopalik A. Fast convergence to nearly optimal solutions in potential games Proceedings of the Acm Conference On Electronic Commerce. 264-273. DOI: 10.1145/1386790.1386832 |
0.082 |
|
| 2008 |
Awerbuch B, Azar Y, Khandekar R. Fast load balancing via bounded best response Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 314-322. |
0.078 |
|
| 2003 |
Awerbuch B, Azar Y, Meyerson A. Reducing truth-telling online mechanisms to online optimization Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 503-510. |
0.073 |
|
| 2004 |
Awerbuch B, Scheideler C. The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 311-320. |
0.061 |
|
| 2004 |
Awerbuch B, Scheideler C. Consistent and compact data management in distributed storage systems Annual Acm Symposium On Parallel Algorithms and Architectures. 16: 44-53. |
0.06 |
|
| 2007 |
Awerbuch B, Hayes TP. Online collaborative filtering with nearly optimal dynamic regret Annual Acm Symposium On Parallelism in Algorithms and Architectures. 315-319. DOI: 10.1145/1248377.1248431 |
0.057 |
|
| 1998 |
Awerbuch B, Azar Y, Blum A, Vempala S. New approximation guarantees for minimum-weight κ-trees and prize-collecting salesmen Siam Journal On Computing. 28: 254-262. |
0.054 |
|
| 2004 |
Awerbuch B, Patt-Shamir B, Peleg D, Tuttle M. Collaboration of untrusting peers with changing interests Proceedings of the Acm Conference On Electronic Commerce. 5: 112-119. |
0.052 |
|
| 2009 |
Awerbuch B, Fu Z, Khandekar R. Brief announcement: Stateless distributed algorithms for generalized packing linear programs Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 270-271. DOI: 10.1145/1582716.1582759 |
0.051 |
|
| 2008 |
Awerbuch B, Khandekar R. Stateless near optimal flow control with poly-logarithmic convergence Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4957: 580-592. |
0.048 |
|
| 1996 |
Adam N, Yesha Y, Awerbuch B, Bennet K, Blaustein B, Brodsky A, Chen R, Dogramaci O, Grossman B, Holowczak R, Johnson J, Kalpakis K, McCollum C, Neches AL, Neches B, et al. Strategic directions in electronic commerce and digital libraries: Towards a digital agora Acm Computing Surveys. 28: 818-835. |
0.011 |
|
| 2007 |
Awerbuch B, Nisgav A, Patt-Shamir B. Asynchronous active recommendation systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4878: 48-61. |
0.01 |
|
| 2005 |
Awerbuch B, Patt-Shamir B, Peleg D, Tuttle M. Improved recommendation systems Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1174-1183. |
0.01 |
|
| Hide low-probability matches. |