Amotz Bar-Noy

Loading Google Thumbnails...
2011
74Demo: A distributed architecture for heterogeneous multi sensor-task allocation. Diego Pizzocaro, Alun D. Preece, Fangfei Chen, Tom La Porta, Amotz Bar-Noy. DCOSS 2011, 1-2. Web SearchBibTeXDownload
73A distributed architecture for heterogeneous multi sensor-task allocation. Diego Pizzocaro, Alun D. Preece, Fangfei Chen, Tom La Porta, Amotz Bar-Noy. DCOSS 2011, 1-8. Web SearchBibTeXDownload
72On sensor selection in linked information networks. Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun. DCOSS 2011, 1-8. Web SearchBibTeXDownload
71Optimizing information credibility in social swarming applications. Bin Liu, Peter Terlecky, Amotz Bar-Noy, Ramesh Govindan, Michael J. Neely. INFOCOM 2011, 556-560. Web SearchBibTeXDownload
70Quality-of-information aware networking for tactical military networks. Amotz Bar-Noy, Greg Cirincione, Ramesh Govindan, S. Krishnamurthy, T. F. LaPorta, P. Mohapatra, Michael J. Neely, Aylin Yener. PerCom Workshops 2011, 2-7. Web SearchBibTeXDownload
2010
69Sensor-Mission Assignment in Constrained Environments. Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart Chalmers, Thomas F. La Porta, Alun D. Preece. IEEE Trans. Parallel Distrib. Syst. (21): 1692-1705 (2010). Web SearchBibTeXDownload
2009
68Throughput maximization of real-time scheduling with batching. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai. ACM Transactions on Algorithms (5) (2009). Cited by 25Web SearchBibTeXDownload
67Detection and Localization Sensor Assignment with Exact and Fuzzy Locations. Hosam Rowaihy, Matthew P. Johnson, Diego Pizzocaro, Amotz Bar-Noy, Lance M. Kaplan, Thomas F. La Porta, Alun D. Preece. DCOSS 2009, 28-43. Web SearchBibTeXDownload
66Online Dynamic Programming Speedups. Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang. Theory Comput. Syst. (45): 429-445 (2009). Web SearchBibTeXDownload
2008
65A general buffer scheme for the windows scheduling problem. Amotz Bar-Noy, Richard E. Ladner, Jacob Christensen, Tami Tamir. ACM Journal of Experimental Algorithmics (13) (2008). Web SearchBibTeXDownload
64Scheduling Techniques for Media-on-Demand. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir. Algorithmica (52): 413-439 (2008). Web SearchBibTeXDownload
63Frugal Sensor Assignment. Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart Chalmers, Thomas F. La Porta, Alun D. Preece. DCOSS 2008, 219-236. Web SearchBibTeXDownload
62An Ontology-Centric Approach to Sensor-Mission Assignment. 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. EKAW 2008, 347-363. Web SearchBibTeXDownload
61Optimal delay for media-on-demand with pre-loading and pre-buffering. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir. Theor. Comput. Sci. (399): 3-11 (2008). Web SearchBibTeXDownload
2007
60Windows scheduling as a restricted version of bin packing. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
2006
59Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging. Amotz Bar-Noy, Justin Goshi, Richard E. Ladner. J. Discrete Algorithms (4): 72-105 (2006). Web SearchBibTeXDownload
58Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir. SIROCCO 2006, 171-181. Web SearchBibTeXDownload
57Online Dynamic Programming Speedups. Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang. WAOA 2006, 43-54. Web SearchBibTeXDownload
2005
56Stream merging for live continuous broadcast with time-shifting. Amotz Bar-Noy, Justin Goshi, Richard E. Ladner, Tammy VanDeGrift. BROADNETS 2005, 953-962. Web SearchBibTeX
55Guest Editorial. Darrell Conklin, Tadeusz A. Wysocki, Hamid Sharif, L. C. Gundersen, P. P. Leahy, W. Hill, Jyh-Horng Wen, Shiuh-Jeng Wang, Yuh-Ren Tsai, Keh-Ming Lu. MONET (10): 7-8 (2005). Cited by 2Web SearchBibTeXDownload
54Windows scheduling of arbitrary length jobs on parallel machines. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift. SPAA 2005, 56-65. Web SearchBibTeXDownload
53A General Buffer Scheme for the Windows Scheduling Problem. Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir. WEA 2005, 139-151. Web SearchBibTeXDownload
2004
52Establishing wireless conference calls under delay constraints. Amotz Bar-Noy, Grzegorz Malewicz. J. Algorithms (51): 145-169 (2004). Web SearchBibTeXDownload
51Comparison of stream merging algorithms for media-on-demand. Amotz Bar-Noy, Justin Goshi, Richard E. Ladner, Kenneth Tam. Multimedia Syst. (9): 411-423 (2004). Web SearchBibTeXDownload
50Efficient Algorithms for Optimal Stream Merging for Media-on-Demand. Amotz Bar-Noy, Richard E. Ladner. SIAM J. Comput. (33): 1011-1034 (2004). Web SearchBibTeXDownload
49Windows scheduling as a restricted version of Bin Packing. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir. SODA 2004, 224-233. Web SearchBibTeXDownload
2003
48Competitive on-line stream merging algorithms for media-on-demand. Amotz Bar-Noy, Richard E. Ladner. J. Algorithms (48): 59-90 (2003). Web SearchBibTeXDownload
47Windows Scheduling Problems for Broadcast Systems. Amotz Bar-Noy, Richard E. Ladner. SIAM J. Comput. (32): 1091-1113 (2003). Web SearchBibTeXDownload
46Scheduling techniques for media-on-demand. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir. SODA 2003, 791-80. Web SearchBibTeXDownload
45Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. Amotz Bar-Noy, Justin Goshi, Richard E. Ladner. SPAA 2003, 164-173. Web SearchBibTeXDownload
2002
44Minimizing Service and Operation Costs of Periodic Scheduling. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber. Math. Oper. Res. (27): 518-544 (2002). Web SearchBibTeXDownload
43Establishing wireless conference calls under delay constraints. Amotz Bar-Noy, Grzegorz Malewicz. PODC 2002, 41-50. Web SearchBibTeXDownload
42Throughput maximization of real-time scheduling with batching. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai. SODA 2002, 742-751. Cited by 25Web SearchBibTeXDownload
41Windows scheduling problems for broadcast systems. Amotz Bar-Noy, Richard E. Ladner. SODA 2002, 433-442. Web SearchBibTeXDownload
2001
40Approximating the Throughput of Multiple Machines in Real-Time Scheduling. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber. SIAM J. Comput. (31): 331-352 (2001). Cited by 2Web SearchBibTeXDownload
39Competitive on-line stream merging algorithms for media-on-demand. Amotz Bar-Noy, Richard E. Ladner. SODA 2001, 364-373. Web SearchBibTeXDownload
2000
38Sum Multicoloring of Graphs. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai. J. Algorithms (37): 422-450 (2000). Web SearchBibTeXDownload
37Message Multicasting in Heterogeneous Networks. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber. SIAM J. Comput. (30): 347-358 (2000). Cited by 1Web SearchBibTeXDownload
1999
36Sum Multi-coloring of Graphs. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai. ESA 1999, 390-401. Web SearchBibTeXDownload
35Broadcasting Multiple Messages in the Multiport Model. Amotz Bar-Noy, Ching-Tien Ho. IEEE Trans. Parallel Distrib. Syst. (10): 500-508 (1999). Cited by 11Web SearchBibTeXDownload
34Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber. STOC 1999, 622-631. Cited by 99Web SearchBibTeXDownload
1998
33On Chromatic Sums and Distributed Resource Allocation. Amotz Bar-Noy, Hadas Shachnai, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir. Inf. Comput. (140): 183-202 (1998). Web SearchBibTeXDownload
32Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber. SODA 1998, 11-20. Web SearchBibTeXDownload
31Multicasting in Heterogeneous Networks. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber. STOC 1998, 448-453. Cited by 81Web SearchBibTeXDownload
1996
30Broadcasting Multiple Messages in the Multiport Model. Amotz Bar-Noy, Ching-Tien Ho. IPPS 1996, 781-788. Cited by 11Web SearchBibTeXDownload
29On Chromatic Sums and Distributed Resource Allocation. Amotz Bar-Noy, Hadas Shachnai, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir. ISTCS 1996, 119-128. Web SearchBibTeX
1995
28Computing Global Combine Operations in the Multiport Postal Model. Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber. IEEE Trans. Parallel Distrib. Syst. (6): 896-900 (1995). Cited by 25Web SearchBibTeXDownload
27Optimal Amortized Distributed Consensus. Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda. Inf. Comput. (120): 93-100 (1995). Web SearchBibTeXDownload
26Sharing Memory Robustly in Message-Passing Systems. Hagit Attiya, Amotz Bar-Noy, Danny Dolev. J. ACM (42): 124-142 (1995). Web SearchBibTeXDownload
25Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber. J. Algorithms (19): 116-143 (1995). Web SearchBibTeXDownload
1993
24A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment. Amotz Bar-Noy, Danny Dolev. Mathematical Systems Theory (26): 21-39 (1993). Web SearchBibTeXDownload
23Fast Deflection Routing for Packets and Worms (Extended Summary). Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki. PODC 1993, 75-86. Cited by 64Web SearchBibTeX
22Computing Global Combine Operations in the Multi-Port Postal Model. Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber. SPDP 1993, 336-343. Web SearchBibTeX
1992
21Efficient Minimum Cost Matching Using Quadrangle Inequality. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber. FOCS 1992, 583-592. Web SearchBibTeXDownload
20Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement. Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong. Inf. Comput. (97): 205-233 (1992). Web SearchBibTeXDownload
19The Greedy Algorithm is Optimal for On-Line Edge Coloring. Amotz Bar-Noy, Rajeev Motwani, Joseph Naor. Inf. Process. Lett. (44): 251-253 (1992). Cited by 31Web SearchBibTeXDownload
18Single Round Simulation on Radio Networks. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg. J. Algorithms (13): 188-210 (1992). Web SearchBibTeXDownload
17A Linear Time Approach to the Set Maxima Problem. Amotz Bar-Noy, Rajeev Motwani, Joseph Naor. SIAM J. Discrete Math. (5): 1-9 (1992). Web SearchBibTeXDownload
1991
16Consensus Algorithms with One-Bit Messages. Amotz Bar-Noy, Danny Dolev. Distributed Computing (4): 105-110 (1991). Web SearchBibTeXDownload
15Fault-Tolerant Critical Section Management in Asynchronous Environments. Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg. Inf. Comput. (95): 1-20 (1991). Web SearchBibTeXDownload
14A Lower Bound for Radio Broadcast. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg. J. Comput. Syst. Sci. (43): 290-298 (1991). Web SearchBibTeXDownload
13Optimal Amortized Distributed Consensus (Extended Abstract). Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda. WDAG 1991, 95-107. Web SearchBibTeXDownload
1990
12One-Bit Algorithms. Amotz Bar-Noy, Joseph Naor, Moni Naor. Distributed Computing (4): 3-8 (1990). Web SearchBibTeXDownload
11Renaming in an Asynchronous Environment. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk. J. ACM (37): 524-548 (1990). Web SearchBibTeXDownload
10Sharing Memory Robustly in Message-Passing Systems. Hagit Attiya, Amotz Bar-Noy, Danny Dolev. PODC 1990, 363-375. Web SearchBibTeXDownload
1989
9Choice Coordination with Limited Failure. Amotz Bar-Noy, Michael Ben-Or, Danny Dolev. Distributed Computing (3): 61-72 (1989). Web SearchBibTeXDownload
8Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment. Amotz Bar-Noy, Danny Dolev. PODC 1989, 307-318. Web SearchBibTeX
7On the Complexity of Radio Communication (Extended Abstract). Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg. STOC 1989, 274-285. Web SearchBibTeXDownload
6Fault-Tolerant Critical Section Management in Asynchronous Networks. Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg. WDAG 1989, 13-23. Web SearchBibTeXDownload
1988
5Families of Consensus Algorithms. Amotz Bar-Noy, Danny Dolev. AWOC 1988, 380-390. Web SearchBibTeXDownload
4One Bit Algorithms. Amotz Bar-Noy, Joseph Naor, Moni Naor. PODC 1988, 66-76. Web SearchBibTeXDownload
1987
3Achievable Cases in an Asynchronous Environment (Extended Abstract). Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk. FOCS 1987, 337-346. Web SearchBibTeXDownload
2Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement. Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong. PODC 1987, 42-51. Web SearchBibTeX
1985
1Choice Coordination with Bounded Failure (a Preliminary Version). Amotz Bar-Noy, Michael Ben-Or, Danny Dolev. PODC 1985, 309-316. Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research