| 2012 | ||
|---|---|---|
| 174 | Jianhang Gao, Qing Zhao, Wei Ren, Ananthram Swami, Ram Ramanathan, Amotz Bar-Noy: Dynamic Shortest Path Algorithms for Hypergraphs CoRR abs/1202.0082: (2012) | |
| 173 | Amotz Bar-Noy, Ben Baumer, Dror Rawitz: Set It and Forget It: Approximating the Set Once Strip Cover Problem CoRR abs/1204.1082: (2012) | |
| 172 | Fangfei Chen, Matthew P. Johnson, Yosef Alayev, Amotz Bar-Noy, Thomas F. La Porta: Who, When, Where: Timeslot Assignment to Mobile Clients. IEEE Trans. Mob. Comput. 11(1): 73-85 (2012) | |
| 171 | Bin Liu, Peter Terlecky, Amotz Bar-Noy, Ramesh Govindan, Michael J. Neely, Dror Rawitz: Optimizing Information Credibility in Social Swarming Applications. IEEE Trans. Parallel Distrib. Syst. 23(6): 1147-1158 (2012) | |
| 170 | Amotz Bar-Noy, Michael Lampis: Online maximum directed cut. J. Comb. Optim. 24(1): 52-64 (2012) | |
| 169 | Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift: Windows scheduling of arbitrary-length jobs on multiple machines. J. Scheduling 15(2): 141-155 (2012) | |
| 2011 | ||
| 168 | Amotz Bar-Noy, Prithwish Basu, Matthew P. Johnson, Ram Ramanathan: Minimum-Cost Broadcast through Varying-Size Neighborcast. ALGOSENSORS 2011: 173-187 | |
| 167 | Amotz Bar-Noy, Ben Baumer: Maximizing Network Lifetime on the Line with Adjustable Sensing Ranges. ALGOSENSORS 2011: 28-41 | |
| 166 | Diego Pizzocaro, Alun D. Preece, Fangfei Chen, Tom La Porta, Amotz Bar-Noy: Demo: A distributed architecture for heterogeneous multi sensor-task allocation. DCOSS 2011: 1-2 | |
| 165 | Diego Pizzocaro, Alun D. Preece, Fangfei Chen, Tom La Porta, Amotz Bar-Noy: A distributed architecture for heterogeneous multi sensor-task allocation. DCOSS 2011: 1-8 | |
| 164 | Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun: On sensor selection in linked information networks. DCOSS 2011: 1-8 | |
| 163 | Matthew P. Johnson, Amotz Bar-Noy: Pan and scan: Configuring cameras for coverage. INFOCOM 2011: 1071-1079 | |
| 162 | Bin Liu, Peter Terlecky, Amotz Bar-Noy, Ramesh Govindan, Michael J. Neely: Optimizing information credibility in social swarming applications. INFOCOM 2011: 556-560 | |
| 161 | Wei Ren, Qing Zhao, Ram Ramanathan, Jianhang Gao, Ananthram Swami, Amotz Bar-Noy, Matthew P. Johnson, Prithwish Basu: Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes. MASS 2011: 660-665 | |
| 160 | Ben Baumer, Prithwish Basu, Amotz Bar-Noy: Modeling and analysis of composite network embeddings. MSWiM 2011: 341-350 | |
| 159 | Amotz Bar-Noy, Greg Cirincione, Ramesh Govindan, S. Krishnamurthy, T. F. LaPorta, P. Mohapatra, Michael J. Neely, Aylin Yener: Quality-of-information aware networking for tactical military networks. PerCom Workshops 2011: 2-7 | |
| 158 | Amotz Bar-Noy, Yi Gai, Matthew P. Johnson, Bhaskar Krishnamachari, George Rabanca: Knapsack Games and the Truth but not the Whole Truth CoRR abs/1107.2432: (2011) | |
| 157 | Yosef Alayev, Amotz Bar-Noy, Thomas F. La Porta: Broadcasting info-pages to sensors: efficiency versus energy conservation. Wireless Networks 17(6): 1529-1542 (2011) | |
| 2010 | ||
| 156 | Amotz Bar-Noy, Theodore Brown, Simon Shamoun: Sensor Allocation in Diverse Environments. DCOSS 2010: 379-392 | |
| 155 | Yosef Alayev, Amotz Bar-Noy, Matthew P. Johnson, Lance M. Kaplan, Thomas F. La Porta: You can't get there from here: Sensor scheduling with refocusing delays. MASS 2010: 462-471 | |
| 154 | Matthew P. Johnson, Amotz Bar-Noy: Brief announcement: pan and scan. PODC 2010: 120-121 | |
| 153 | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin: Finding mobile data under delay constraints with searching costs. PODC 2010: 297-304 | |
| 152 | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng: Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems. SEA 2010: 361-372 | |
| 151 | Matthew P. Johnson, Amotz Bar-Noy, Mani Srivastava: Brief Announcement: Configuration of Actuated Camera Networks for Multi-target Coverage. SSS 2010: 282-284 | |
| 150 | Prithwish Basu, Amotz Bar-Noy, Ram Ramanathan, Matthew P. Johnson: Modeling and Analysis of Time-Varying Graphs CoRR abs/1012.0260: (2010) | |
| 149 | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Online Conflict-Free Colouring for Hypergraphs. Combinatorics, Probability & Computing 19(4): 493-516 (2010) | |
| 148 | Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart Chalmers, Thomas F. La Porta, Alun D. Preece: Sensor-Mission Assignment in Constrained Environments. IEEE Trans. Parallel Distrib. Syst. 21(11): 1692-1705 (2010) | |
| 147 | Hosam Rowaihy, Matthew P. Johnson, Ou Liu, Amotz Bar-Noy, Theodore Brown, Thomas F. La Porta: Sensor-mission assignment in wireless sensor networks. TOSN 6(4): (2010) | |
| 2009 | ||
| 146 | Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Ou Liu: Cheap or Flexible Sensor Coverage. DCOSS 2009: 245-258 | |
| 145 | Hosam Rowaihy, Matthew P. Johnson, Diego Pizzocaro, Amotz Bar-Noy, Lance M. Kaplan, Thomas F. La Porta, Alun D. Preece: Detection and Localization Sensor Assignment with Exact and Fuzzy Locations. DCOSS 2009: 28-43 | |
| 144 | Matthew P. Johnson, Deniz Sariöz, Amotz Bar-Noy, Theodore Brown, Dinesh C. Verma, Chai Wah Wu: More is More: The Benefits of Denser Sensor Deployment. INFOCOM 2009: 379-387 | |
| 143 | Amotz Bar-Noy, Michael Lampis: Online Maximum Directed Cut. ISAAC 2009: 1124-1133 | |
| 142 | Dinesh C. Verma, Chai Wah Wu, Theodore Brown, Amotz Bar-Noy, Simon Shamoun, Mark Nixon: Application of Halftoning Algorithms to Location Dependent Sensor Placement. ISCAS 2009: 161-164 | |
| 141 | Fangfei Chen, Matthew P. Johnson, Yosef Alayev, Amotz Bar-Noy, Tom La Porta: Who, When, Where: Timeslot Assignment to Mobile Clients. MASS 2009: 90-99 | |
| 140 | Fangfei Chen, Matthew P. Johnson, Amotz Bar-Noy, Iris Fermin, Tom La Porta: Proactive Data Dissemination to Mission Sites. SECON 2009: 1-9 | |
| 139 | Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos: Ordered Coloring Grids and Related Graphs. SIROCCO 2009: 30-43 | |
| 138 | Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai: Throughput maximization of real-time scheduling with batching. ACM Transactions on Algorithms 5(2): (2009) | |
| 137 | Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang: Online Dynamic Programming Speedups. Theory Comput. Syst. 45(3): 429-445 (2009) | |
| 2008 | ||
| 136 | Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart Chalmers, Thomas F. La Porta, Alun D. Preece: Frugal Sensor Assignment. DCOSS 2008: 219-236 | |
| 135 | Mario Gomez, Alun D. Preece, Matthew P. Johnson, Geeth de Mel, Wamberto Weber Vasconcelos, Christopher Gibson, Amotz Bar-Noy, Konrad Borowiecki, Thomas F. La Porta, Diego Pizzocaro, Hosam Rowaihy, Gavin Pearson, Tiem Pham: An Ontology-Centric Approach to Sensor-Mission Assignment. EKAW 2008: 347-363 | |
| 134 | Hosam Rowaihy, Matthew P. Johnson, Amotz Bar-Noy, Theodore Brown, Thomas F. La Porta: Assigning Sensors to Competing Missions. GLOBECOM 2008: 44-49 | |
| 133 | Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Deniz Sariöz, Dinesh C. Verma, Chai Wah Wu: More is more: The benefits of dense sensor deployment. MASS 2008: 514-515 | |
| 132 | Yosef Alayev, Amotz Bar-Noy, Thomas F. La Porta: Broadcasting Info-Pages to Sensors: Efficiency vs. Energy Conservation. SECON 2008: 368-376 | |
| 131 | Amotz Bar-Noy, Matthew P. Johnson, Ou Liu: Peak Shaving through Resource Buffering. WAOA 2008: 147-159 | |
| 130 | Amotz Bar-Noy, Yi Feng, Matthew P. Johnson, Ou Liu: When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries. WEA 2008: 194-207 | |
| 129 | Amotz Bar-Noy, Richard E. Ladner, Jacob Christensen, Tami Tamir: A general buffer scheme for the windows scheduling problem. ACM Journal of Experimental Algorithmics 13: (2008) | |
| 128 | Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky: Deterministic conflict-free coloring for intervals: From offline to online. ACM Transactions on Algorithms 4(4): (2008) | |
| 127 | Amotz Bar-Noy, Richard E. Ladner, Tami Tamir: Scheduling Techniques for Media-on-Demand. Algorithmica 52(4): 413-439 (2008) | |
| 126 | Amotz Bar-Noy, Richard E. Ladner, Tami Tamir: Optimal delay for media-on-demand with pre-loading and pre-buffering. Theor. Comput. Sci. 399(1-2): 3-11 (2008) | |
| 2007 | ||
| 125 | Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Thomas F. La Porta, Ou Liu, Hosam Rowaihy: Assigning Sensors to Missions with Demands. ALGOSENSORS 2007: 114-125 | |
| 124 | Amotz Bar-Noy, Joanna Klukowska: Finding Mobile Data: Efficiency vs. Location Inaccuracy. ESA 2007: 111-122 | |
| 123 | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Online Conflict-Free Colorings for Hypergraphs. ICALP 2007: 219-230 | |
| 122 | Amotz Bar-Noy, Yi Feng, Mordecai J. Golin: Paging Mobile Users Efficiently and Optimally. INFOCOM 2007: 1910-1918 | |
| 121 | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. SPAA 2007: 194-195 | |
| 120 | Amotz Bar-Noy, Richard E. Ladner, Tami Tamir: Windows scheduling as a restricted version of bin packing. ACM Transactions on Algorithms 3(3): (2007) | |
| 2006 | ||
| 119 | Amotz Bar-Noy, Richard E. Ladner, Tami Tamir: Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. SIROCCO 2006: 171-181 | |
| 118 | Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky: Conflict-free coloring for intervals: from offline to online. SPAA 2006: 128-137 | |
| 117 | Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang: Online Dynamic Programming Speedups. WAOA 2006: 43-54 | |
| 116 | Amotz Bar-Noy, Justin Goshi, Richard E. Ladner: Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging. J. Discrete Algorithms 4(1): 72-105 (2006) | |
| 115 | Amotz Bar-Noy, Zohar Naor: Efficient multicast search under delay and bandwidth constraints. Wireless Networks 12(6): 747-757 (2006) | |
| 2005 | ||
| 114 | Amotz Bar-Noy, Justin Goshi, Richard E. Ladner, Tammy VanDeGrift: Stream merging for live continuous broadcast with time-shifting. BROADNETS 2005: 953-962 | |
| 113 | Amotz Bar-Noy: Cellular Networks: Where Are the Mobile Users? SIROCCO 2005: 1 | |
| 112 | Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift: Windows scheduling of arbitrary length jobs on parallel machines. SPAA 2005: 56-65 | |
| 111 | Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir: A General Buffer Scheme for the Windows Scheduling Problem. WEA 2005: 139-151 | |
| 110 | Amotz Bar-Noy, Alan A. Bertossi, Maria Cristina Pinotti, Cauligi S. Raghavendra: Guest Editorial. MONET 10(1-2): 7-8 (2005) | |
| 2004 | ||
| 109 | Zohar Naor, Amotz Bar-Noy: Establishing a Mobile Conference Call Under Delay and Bandwidth Constraints. INFOCOM 2004 | |
| 108 | Amotz Bar-Noy, Yishay Mansour: Competitive on-line paging strategies for mobile users under delay constraints. PODC 2004: 256-265 | |
| 107 | Amotz Bar-Noy, Richard E. Ladner, Tami Tamir: Windows scheduling as a restricted version of Bin Packing. SODA 2004: 224-233 | |
| 106 | Amotz Bar-Noy, Vladimir Dreizin, Boaz Patt-Shamir: Efficient algorithms for periodic scheduling. Computer Networks 45(2): 155-173 (2004) | |
| 105 | Amotz Bar-Noy, Grzegorz Malewicz: Establishing wireless conference calls under delay constraints. J. Algorithms 51(2): 145-169 (2004) | |
| 104 | Amotz Bar-Noy, Justin Goshi, Richard E. Ladner, Kenneth Tam: Comparison of stream merging algorithms for media-on-demand. Multimedia Syst. 9(5): 411-423 (2004) | |
| 103 | Amotz Bar-Noy, Richard E. Ladner: Efficient Algorithms for Optimal Stream Merging for Media-on-Demand. SIAM J. Comput. 33(5): 1011-1034 (2004) | |
| 102 | Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper: Broadcast Disks with Polynomial Cost Functions. Wireless Networks 10(2): 157-168 (2004) | |
| 2003 | ||
| 101 | Amotz Bar-Noy: Windows scheduling as a paradigm for pushing information in wireless networks. DIALM-POMC 2003: 1 | |
| 100 | Amotz Bar-Noy, Richard E. Ladner, Tami Tamir: Scheduling techniques for media-on-demand. SODA 2003: 791-80 | |
| 99 | Amotz Bar-Noy, Justin Goshi, Richard E. Ladner: Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. SPAA 2003: 164-173 | |
| 98 | Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor: Competitive On-Line Switching Policies. Algorithmica 36(3): 225-247 (2003) | |
| 97 | Amotz Bar-Noy, Juan A. Garay, Amir Herzberg: Sharing Video on Demand. Discrete Applied Mathematics 129(1): 3-30 (2003) | |
| 96 | Amotz Bar-Noy, Richard E. Ladner: Competitive on-line stream merging algorithms for media-on-demand. J. Algorithms 48(1): 59-90 (2003) | |
| 95 | Amotz Bar-Noy, Richard E. Ladner: Windows Scheduling Problems for Broadcast Systems. SIAM J. Comput. 32(4): 1091-1113 (2003) | |
| 94 | Amotz Bar-Noy, Joseph Naor, Baruch Schieber: Pushing Dependent Data in Clients-Providers-Servers Systems. Wireless Networks 9(5): 421-430 (2003) | |
| 2002 | ||
| 93 | Amotz Bar-Noy, Boaz Patt-Shamir, Vladimir Dreizin: Efficient periodic scheduling by trees. INFOCOM 2002 | |
| 92 | Amotz Bar-Noy, Grzegorz Malewicz: Establishing wireless conference calls under delay constraints. PODC 2002: 41-50 | |
| 91 | Amotz Bar-Noy, Richard E. Ladner: Windows scheduling problems for broadcast systems. SODA 2002: 433-442 | |
| 90 | Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor: Competitive on-line switching policies. SODA 2002: 525-534 | |
| 89 | Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai: Throughput maximization of real-time scheduling with batching. SODA 2002: 742-751 | |
| 88 | Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir: Nearly optimal perfectly periodic schedules. Distributed Computing 15(4): 207-220 (2002) | |
| 87 | Dan Sadot, Y. Nachmani, Amotz Bar-Noy, Shay Kutten: Next generation Tbit/sec routers and switches: traffic modeling, scheduling algorithms, and simulations. J. High Speed Networks 11(2): 89-102 (2002) | |
| 86 | Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber: Minimizing Service and Operation Costs of Periodic Scheduling. Math. Oper. Res. 27(3): 518-544 (2002) | |
| 2001 | ||
| 85 | Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir: Nearly optimal perfectly-periodic schedules. PODC 2001: 107-116 | |
| 84 | Amotz Bar-Noy, Richard E. Ladner: Competitive on-line stream merging algorithms for media-on-demand. SODA 2001: 364-373 | |
| 83 | Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber: A unified approach to approximating resource allocation and scheduling. J. ACM 48(5): 1069-1090 (2001) | |
| 82 | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber: Approximating the Throughput of Multiple Machines in Real-Time Scheduling. SIAM J. Comput. 31(2): 331-352 (2001) | |
| 81 | Amotz Bar-Noy, Ari Freund, Joseph Naor: On-Line Load Balancing in a Hierarchical Server Topology. SIAM J. Comput. 31(2): 527-549 (2001) | |
| 80 | Amotz Bar-Noy, Danny Krizanc, Arunabha Sen: Introduction: Discrete Algorithms and Methods for Mobility. Wireless Networks 7(6): 565-566 (2001) | |
| 2000 | ||
| 79 | Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper: Broadcast Disks with Polynomial Cost Functions. INFOCOM 2000: 575-584 | |
| 78 | Amotz Bar-Noy, Joseph Naor, Baruch Schieber: Pushing dependent data in clients-providers-servers systems. MOBICOM 2000: 222-230 | |
| 77 | Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber: A unified approach to approximating resource allocation and scheduling. STOC 2000: 735-744 | |
| 76 | Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber: Optimal multiple message broadcasting in telephone-like communication systems. Discrete Applied Mathematics 100(1-2): 1-15 (2000) | |
| 75 | Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai: Sum Multicoloring of Graphs. J. Algorithms 37(2): 422-450 (2000) | |
| 74 | Amotz Bar-Noy, Yaron Shilo: Optimal Broadcasting of Two Files over an Asymmetric Channel. J. Parallel Distrib. Comput. 60(4): 474-493 (2000) | |
| 73 | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber: Message Multicasting in Heterogeneous Networks. SIAM J. Comput. 30(2): 347-358 (2000) | |
| 1999 | ||
| 72 | Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai: Sum Multi-coloring of Graphs. ESA 1999: 390-401 | |
| 71 | Amotz Bar-Noy, Ari Freund, Joseph Naor: On-Line Load Banancing in a Hierarchical Server Topology. ESA 1999: 77-88 | |
| 70 | Amotz Bar-Noy, Yaron Shilo: Optimal Broadcasting of Two Files over an Asymmetric Channel. INFOCOM 1999: 267-274 | |
| 69 | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber: Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. STOC 1999: 622-631 | |
| 68 | Amotz Bar-Noy, Ching-Tien Ho: Broadcasting Multiple Messages in the Multiport Model. IEEE Trans. Parallel Distrib. Syst. 10(5): 500-508 (1999) | |
| 67 | Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz: A Matched Approximation Bound for the Sum of a Greedy Coloring. Inf. Process. Lett. 71(3-4): 135-140 (1999) | |
| 66 | Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber: Bandwidth Allocation with Preemption. SIAM J. Comput. 28(5): 1806-1828 (1999) | |
| 1998 | ||
| 65 | Amotz Bar-Noy, Yishay Mansour, Baruch Schieber: Competitive Dynamic Bandwidth Allocation. PODC 1998: 31-39 | |
| 64 | Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber: Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). SODA 1998: 11-20 | |
| 63 | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber: Multicasting in Heterogeneous Networks. STOC 1998: 448-453 | |
| 62 | Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir: On Chromatic Sums and Distributed Resource Allocation. Inf. Comput. 140(2): 183-202 (1998) | |
| 61 | Amotz Bar-Noy, Guy Kortsarz: Minimum Color Sum of Bipartite Graphs. J. Algorithms 28(2): 339-365 (1998) | |
| 60 | Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan: Guaranteeing Fair Service to Persistent Dependent Tasks. SIAM J. Comput. 27(4): 1168-1189 (1998) | |
| 1997 | ||
| 59 | Amotz Bar-Noy, Guy Kortsarz: The Minimum Color Sum of Bipartite Graphs. ICALP 1997: 738-748 | |
| 58 | Amotz Bar-Noy, Shlomo Kipnis: Multiple message broadcasting in the postal model. Networks 29(1): 1-10 (1997) | |
| 1996 | ||
| 57 | Amotz Bar-Noy, Ching-Tien Ho: Broadcasting Multiple Messages in the Multiport Model. IPPS 1996: 781-788 | |
| 56 | Amotz Bar-Noy, Hadas Shachnai, Tami Tamir: On Chromatic Sums and Distributed Resource Allocation. ISTCS 1996: 119-128 | |
| 55 | Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan: Efficient Routing in Optical Networks. J. ACM 43(6): 973-1001 (1996) | |
| 54 | Amotz Bar-Noy, Ilan Kessler, Mahmoud Naghshineh: Topology-Based Tracking Strategies for Personal Communication Networks. MONET 1(1): 49-56 (1996) | |
| 1995 | ||
| 53 | Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan: Guaranteeing Fair Service to Persistent Dependent Tasks. SODA 1995: 243-252 | |
| 52 | Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber: Bandwidth allocation with preemption. STOC 1995: 616-625 | |
| 51 | Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber: optimal Computation of Census Functions in the Postal Model. Discrete Applied Mathematics 58(3): 213-222 (1995) | |
| 50 | Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber: Computing Global Combine Operations in the Multiport Postal Model. IEEE Trans. Parallel Distrib. Syst. 6(8): 896-900 (1995) | |
| 49 | Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda: Optimal Amortized Distributed Consensus Inf. Comput. 120(1): 93-100 (1995) | |
| 48 | Hagit Attiya, Amotz Bar-Noy, Danny Dolev: Sharing Memory Robustly in Message-Passing Systems. J. ACM 42(1): 124-142 (1995) | |
| 47 | Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber: Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. J. Algorithms 19(1): 116-143 (1995) | |
| 46 | Amotz Bar-Noy, Ilan Kessler, Moshe Sidi: Mobile users: to update or not to update? Wireless Networks 1(2): 175-185 (1995) | |
| 1994 | ||
| 45 | Amotz Bar-Noy, Ilan Kessler, Moshe Sidi: Mobile Users: To Uptdate or not to Update? INFOCOM 1994: 570-576 | |
| 44 | Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan: Efficient Routing and Scheduling Algorithms for Optical Networks. SODA 1994: 412-423 | |
| 43 | Amotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten: A New Competitive Algorithm for Group Testing. Discrete Applied Mathematics 52(1): 29-38 (1994) | |
| 42 | Amotz Bar-Noy, Shlomo Kipnis: Broadcasting Multiple Messages in Simultaneous Send/receive Systems. Discrete Applied Mathematics 55(2): 95-105 (1994) | |
| 41 | Amotz Bar-Noy, Shlomo Kipnis: Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. Mathematical Systems Theory 27(5): 431-452 (1994) | |
| 1993 | ||
| 40 | Amotz Bar-Noy, Ilan Kessler: Tracking Mobile Users in Wireless Communication Networks. INFOCOM 1993: 1232-1239 | |
| 39 | Amotz Bar-Noy, Shlomo Kipnis: Multiple Message Broadcasting in the Postal Model. IPPS 1993: 463-470 | |
| 38 | Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki: Fast Deflection Routing for Packets and Worms (Extended Summary). PODC 1993: 75-86 | |
| 37 | Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber: Computing Global Combine Operations in the Multi-Port Postal Model. SPDP 1993: 336-343 | |
| 36 | Amotz Bar-Noy, Shlomo Kipnis: Broadcasting Multiple Messages in Simultaneous Send/Receive Systems. SPDP 1993: 344-347 | |
| 35 | Amotz Bar-Noy, Ilan Kessler: Tracking mobile users in wireless communications networks. IEEE Transactions on Information Theory 39(6): 1877-1886 (1993) | |
| 34 | Amotz Bar-Noy, Danny Dolev: A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment. Mathematical Systems Theory 26(1): 21-39 (1993) | |
| 33 | Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber: An Optimal Algorithm for computing Census Functions in Message-Passing Systems. Parallel Processing Letters 3: 19-23 (1993) | |
| 1992 | ||
| 32 | Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber: Efficient Minimum Cost Matching Using Quadrangle Inequality FOCS 1992: 583-592 | |
| 31 | Amotz Bar-Noy, Ilan Kessler, Shay Kutten, Frank K. Hwang: A New Competitive Algorithm for Group Testing. INFOCOM 1992: 786-793 | |
| 30 | Amotz Bar-Noy, Shlomo Kipnis: Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. SPAA 1992: 13-22 | |
| 29 | Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong: Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement Inf. Comput. 97(2): 205-233 (1992) | |
| 28 | Amotz Bar-Noy, Rajeev Motwani, Joseph Naor: The Greedy Algorithm is Optimal for On-Line Edge Coloring. Inf. Process. Lett. 44(5): 251-253 (1992) | |
| 27 | Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg: Single Round Simulation on Radio Networks. J. Algorithms 13(2): 188-210 (1992) | |
| 26 | Amotz Bar-Noy, Rajeev Motwani, Joseph Naor: A Linear Time Approach to the Set Maxima Problem. SIAM J. Discrete Math. 5(1): 1-9 (1992) | |
| 1991 | ||
| 25 | Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal: Approximate Distributed Bellman-Ford Algorithms. INFOCOM 1991: 1206-1213 | |
| 24 | Amotz Bar-Noy, Baruch Schieber: The Canadian Traveller Problem. SODA 1991: 261-270 | |
| 23 | Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda: Optimal Amortized Distributed Consensus (Extended Abstract). WDAG 1991: 95-107 | |
| 22 | Amotz Bar-Noy, Danny Dolev: Consensus Algorithms with One-Bit Messages. Distributed Computing 4: 105-110 (1991) | |
| 21 | Amotz Bar-Noy, David Peleg: Square Meshes are not always Optimal. IEEE Trans. Computers 40(2): 196-204 (1991) | |
| 20 | Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg: Fault-Tolerant Critical Section Management in Asynchronous Environments Inf. Comput. 95(1): 1-20 (1991) | |
| 19 | Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg: A Lower Bound for Radio Broadcast. J. Comput. Syst. Sci. 43(2): 290-298 (1991) | |
| 1990 | ||
| 18 | Hagit Attiya, Amotz Bar-Noy, Danny Dolev: Sharing Memory Robustly in Message-Passing Systems. PODC 1990: 363-375 | |
| 17 | Amotz Bar-Noy, Madan Gopal: Topology Distribution Cost vs. Efficient Routing in Large Networks. SIGCOMM 1990: 242-252 | |
| 16 | Amotz Bar-Noy, Joseph Naor, Moni Naor: One-Bit Algorithms. Distributed Computing 4: 3-8 (1990) | |
| 15 | Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk: Renaming in an Asynchronous Environment J. ACM 37(3): 524-548 (1990) | |
| 14 | Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg: Improved Routing Strategies with Succinct Tables. J. Algorithms 11(3): 307-341 (1990) | |
| 13 | Amotz Bar-Noy, Joseph Naor: Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments. SIAM J. Discrete Math. 3(1): 7-20 (1990) | |
| 1989 | ||
| 12 | Amotz Bar-Noy, Danny Dolev: Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment. PODC 1989: 307-318 | |
| 11 | Amotz Bar-Noy, Danny Peleg: Square Meshes Are Not Always Optimal. SPAA 1989: 138-147 | |
| 10 | Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg: On the Complexity of Radio Communication (Extended Abstract) STOC 1989: 274-285 | |
| 9 | Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg: Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) STOC 1989: 479-489 | |
| 8 | Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg: Fault-Tolerant Critical Section Management in Asynchronous Networks. WDAG 1989: 13-23 | |
| 7 | Amotz Bar-Noy, Michael Ben-Or, Danny Dolev: Choice Coordination with Limited Failure. Distributed Computing 3(2): 61-72 (1989) | |
| 6 | Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman: Bounds on Universal Sequences. SIAM J. Comput. 18(2): 268-277 (1989) | |
| 1988 | ||
| 5 | Amotz Bar-Noy, Danny Dolev: Families of Consensus Algorithms. AWOC 1988: 380-390 | |
| 4 | Amotz Bar-Noy, Joseph Naor, Moni Naor: One Bit Algorithms. PODC 1988: 66-76 | |
| 1987 | ||
| 3 | Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk: Achievable Cases in an Asynchronous Environment (Extended Abstract) FOCS 1987: 337-346 | |
| 2 | Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong: Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement. PODC 1987: 42-51 | |
| 1985 | ||
| 1 | Amotz Bar-Noy, Michael Ben-Or, Danny Dolev: Choice Coordination with Bounded Failure (a Preliminary Version). PODC 1985: 309-316 | |
Colors in the list of coauthors
Last update Thu May 24 01:13:30 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page