default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmotz Bar-Noy
Amotz Barnoy
Person information
- affiliation: Brooklyn College, New York City, USA
- award (2011): Dijkstra Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j112]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate realizations for outerplanaric degree sequences. J. Comput. Syst. Sci. 148: 103588 (2025)- 2024
- [j111]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted microscopic image reconstruction. Discret. Appl. Math. 345: 17-33 (2024) - [j110]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Graph realization of distance sets. Theor. Comput. Sci. 1019: 114810 (2024) - [c161]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. IWOCA 2024: 98-110 - [c160]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). MFCS 2024: 1:1-1:16 - [c159]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Sparse Graphic Degree Sequences Have Planar Realizations. MFCS 2024: 18:1-18:17 - [i13]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. CoRR abs/2405.03278 (2024) - 2023
- [j109]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Composed Degree-Distance Realizations of Graphs. Algorithmica 85(3): 665-687 (2023) - [j108]Yitzchak Novick
, Amotz Bar-Noy:
Inclusive random sampling in graphs and networks. Appl. Netw. Sci. 8(1): 56 (2023) - [j107]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Forcibly bipartite and acyclic (uni-)graphic sequences. Discret. Math. 346(7): 113460 (2023) - [j106]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph realizations: Maximum degree in vertex neighborhoods. Discret. Math. 346(9): 113483 (2023) - [c158]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Degree Realization by Bipartite Multigraphs. SIROCCO 2023: 3-17 - 2022
- [j105]Yitzchak Novick, Amotz Bar-Noy:
Cost-based analyses of random neighbor and derived sampling methods. Appl. Netw. Sci. 7(1): 34 (2022) - [j104]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The generalized microscopic image reconstruction problem. Discret. Appl. Math. 321: 402-416 (2022) - [j103]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On vertex-weighted realizations of acyclic and general graphs. Theor. Comput. Sci. 922: 81-95 (2022) - [c157]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Graph Realization of Distance Sets. MFCS 2022: 13:1-13:14 - [c156]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. MFCS 2022: 14:1-14:15 - [c155]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper). SWAT 2022: 1:1-1:17 - [c154]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Vertex-Weighted Graphs: Realizable and Unrealizable Domains. WALCOM 2022: 315-327 - 2021
- [j102]Amotz Bar-Noy, Thomas Erlebach, Dror Rawitz, Peter Terlecky:
"Green" barrier coverage with mobile sensors. Theor. Comput. Sci. 860: 117-134 (2021) - [c153]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Vertex-Weighted Graph Realizations. CIAC 2021: 90-102 - [c152]Yitzchak Novick, Amotz Bar-Noy:
A Fair-Cost Analysis of the Random Neighbor Sampling Method. COMPLEX NETWORKS 2021: 3-15 - [c151]Amotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel:
Selected Neighbor Degree Forest Realization. ISAAC 2021: 27:1-27:15 - [c150]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz:
Relaxed and Approximate Graph Realizations. IWOCA 2021: 3-19 - [c149]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Composed Degree-Distance Realizations of Graphs. IWOCA 2021: 63-77 - [c148]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted Microscopic Image Reconstruction. SOFSEM 2021: 373-386 - 2020
- [j101]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. SIAM J. Discret. Math. 34(4): 2318-2337 (2020) - [j100]Amotz Bar-Noy, David Peleg, Dror Rawitz:
Vertex-weighted realizations of graphs. Theor. Comput. Sci. 807: 56-72 (2020) - [c147]Yitzchak Novick, Amotz Bar-Noy:
Finding High-Degree Vertices with Inclusive Random Sampling. COMPLEX NETWORKS (1) 2020: 319-329 - [c146]Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz:
Minimum Neighboring Degree Realization in Graphs and Trees. ESA 2020: 10:1-10:15 - [c145]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Realizations: Maximum Degree in Vertex Neighborhoods. SWAT 2020: 10:1-10:17
2010 – 2019
- 2019
- [j99]Siddharth Pal, Feng Yu, Yitzchak Novick, Ananthram Swami, Amotz Bar-Noy:
A study on the friendship paradox - quantitative analysis and relationship with assortative mixing. Appl. Netw. Sci. 4(1): 71 (2019) - [j98]Jung-Eun Kim, Tarek F. Abdelzaher, Lui Sha, Amotz Bar-Noy, Reginald L. Hobbs, William Dron:
Decision-driven scheduling. Real Time Syst. 55(3): 514-551 (2019) - [c144]Simon Shamoun, Tarek F. Abdelzaher, Amotz Bar-Noy:
Dynamic sensor selection for path coverage. ICDCN 2019: 277-281 - [c143]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The Generalized Microscopic Image Reconstruction Problem. ISAAC 2019: 42:1-42:15 - [c142]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. ISAAC 2019: 47:1-47:15 - [c141]Simon Shamoun, Tarek F. Abdelzaher, Amotz Bar-Noy:
Maximum Gaps in Path Coverage. MSWiM 2019: 109-112 - [c140]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Profile Realizations and Applications to Social Networks. WALCOM 2019: 3-14 - [i12]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods. CoRR abs/1912.13286 (2019) - [i11]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. CoRR abs/1912.13287 (2019) - 2018
- [j97]Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan:
Improved approximation algorithms for weighted 2-path partitions. Discret. Appl. Math. 239: 15-37 (2018) - [j96]Jongdeog Lee, Kelvin Marcus, Tarek F. Abdelzaher, Md. Tanvir Al Amin, Amotz Bar-Noy, William Dron, Ramesh Govindan, Reginald L. Hobbs, Shaohan Hu, Jung-Eun Kim, Lui Sha, Shuochao Yao, Yiran Zhao:
Athena: Towards Decision-Centric Anticipatory Sensor Information Delivery. J. Sens. Actuator Networks 7(1): 5 (2018) - [c139]Siddharth Pal, Feng Yu, Yitzchak Novick, Ananthram Swami, Amotz Bar-Noy:
Quantifying the Strength of the Friendship Paradox. COMPLEX NETWORKS (2) 2018: 460-472 - [c138]Simon Shamoun, Jie Mei, Tarek F. Abdelzaher, Amotz Bar-Noy:
Leveraging Knowledge for Path Exposure. DCOSS 2018: 103-110 - [c137]Simon Shamoun, Tianyi Tu, Amotz Bar-Noy, Tarek F. Abdelzaher:
Poster: Local Algorithms for Sensor Selection. EWSN 2018: 179-180 - [c136]Simon Shamoun, Tianyi Tu, Tarek F. Abdelzaher, Amotz Bar-Noy:
Local Algorithms for Sensor Selection. PE-WASUN 2018: 84-91 - [c135]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Realizability of Graph Specifications: Characterizations and Algorithms. SIROCCO 2018: 3-13 - 2017
- [j95]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Set It and Forget It: Approximating the Set Once Strip Cover Problem. Algorithmica 79(2): 368-386 (2017) - [j94]Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun:
On sensor selection in linked information networks. Comput. Networks 126: 100-113 (2017) - [j93]Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. SIAM J. Discret. Math. 31(1): 573-596 (2017) - [j92]Matthew P. Johnson, Brian Phelan, Amotz Bar-Noy, Prithwish Basu, Ram Ramanathan:
Minimum-Cost Network-Wide Broadcast over Reliable MAC-Layer Multicast. IEEE Trans. Mob. Comput. 16(12): 3390-3402 (2017) - [c134]Simon Shamoun, Tarek F. Abdelzaher, Amotz Bar-Noy:
Sensor Selection for Heterogeneous Coverage Measures. DCOSS 2017: 93-98 - [c133]Tarek F. Abdelzaher, Md. Tanvir Al Amin, Amotz Bar-Noy, William Dron, Ramesh Govindan, Reginald L. Hobbs, Shaohan Hu, Jung-Eun Kim, Jongdeog Lee, Kelvin Marcus, Shuochao Yao, Yiran Zhao:
Decision-Driven Execution: A Distributed Resource Management Paradigm for the Age of IoT. ICDCS 2017: 1825-1835 - [c132]Alexey Nikolaev, Saad Mneimneh, Amotz Bar-Noy, Ram Ramanathan:
Controlled growth of simplicial complex networks. INFOCOM Workshops 2017: 934-939 - [c131]Elahe Vahdani, Amotz Bar-Noy, Matthew P. Johnson, Tarek F. Abdelzaher:
Gathering Information in Sensor Networks for Synchronized Freshness. SECON 2017: 1-9 - [i10]Siddharth Pal, Feng Yu, Terrence J. Moore, Ram Ramanathan, Amotz Bar-Noy, Ananthram Swami:
An efficient alternative to Ollivier-Ricci curvature based on the Jaccard metric. CoRR abs/1710.01724 (2017) - 2016
- [j91]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Changing of the guards: Strip cover with duty cycling. Theor. Comput. Sci. 610: 135-148 (2016) - [j90]Yanting Wu, Bhaskar Krishnamachari, George Rabanca, Amotz Bar-Noy:
Efficient Mechanism Design for Competitive Carrier Selection and Rate Allocation. IEEE Trans. Veh. Technol. 65(12): 10222-10226 (2016) - [c130]Jason Radford, Amotz Barnoy, Alexey Nikolaev, Saad Mneimneh, David Lazer, Ram Ramanathan:
Testing Higher-Order Network Structures in an Online Experiment. CSCW Companion 2016: 377-380 - [c129]Jung-Eun Kim, Tarek F. Abdelzaher, Lui Sha, Amotz Bar-Noy, Reginald L. Hobbs, William Dron:
On Maximizing Quality of Information for the Internet of Things: A Real-Time Scheduling Perspective (Invited Paper). RTCSA 2016: 202-211 - [c128]Jung-Eun Kim, Tarek F. Abdelzaher, Lui Sha, Amotz Bar-Noy, Reginald L. Hobbs:
Sporadic Decision-Centric Data Scheduling with Normally-off Sensors. RTSS 2016: 135-145 - [c127]Amotz Bar-Noy, George Rabanca:
Tight Approximation Bounds for the Seminar Assignment Problem. WAOA 2016: 170-182 - [i9]Amotz Bar-Noy, George Rabanca:
Tight Approximation Bounds for the Seminar Assignment Problem. CoRR abs/1610.04785 (2016) - 2015
- [j89]Amotz Bar-Noy, Ben Baumer:
Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges. Algorithmica 72(1): 148-166 (2015) - [j88]Jianhang Gao, Qing Zhao, Wei Ren, Ananthram Swami, Ram Ramanathan, Amotz Bar-Noy:
Dynamic Shortest Path Algorithms for Hypergraphs. IEEE/ACM Trans. Netw. 23(6): 1805-1817 (2015) - [j87]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. Wirel. Networks 21(5): 1683-1698 (2015) - [c126]Ben Baumer, George Rabanca, Amotz Bar-Noy, Prithwish Basu:
Star Search: Effective Subgroups in Collaborative Social Networks. ASONAM 2015: 729-736 - [c125]Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
"Green" Barrier Coverage with Mobile Sensors. CIAC 2015: 33-46 - [c124]Amotz Bar-Noy, Matthew P. Johnson, Nooreddin Naghibolhosseini, Dror Rawitz, Simon Shamoun:
The Price of Incorrectly Aggregating Coverage Values in Sensor Selection. DCOSS 2015: 98-107 - [c123]Amotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan:
Improved Approximation Algorithms for Weighted 2-Path Partitions. ESA 2015: 953-964 - [c122]Ali Assarpour, Saman Farhat, Ou Liu, Alexey Nikolaev, Amotz Bar-Noy, Prithwish Basu, Saad Mneimneh, Ram Ramanathan:
Measuring the strength of networks of teams: Metrics and properties. INFOCOM Workshops 2015: 414-419 - [c121]Shaohan Hu, Shuochao Yao, Haiming Jin, Yiran Zhao, Yitao Hu, Xiaochen Liu, Nooreddin Naghibolhosseini, Shen Li, Akash Kapoor, William Dron, Lu Su, Amotz Bar-Noy, Pedro A. Szekely, Ramesh Govindan, Reginald L. Hobbs, Tarek F. Abdelzaher:
Data Acquisition for Real-Time Decision-Making under Freshness Constraints. RTSS 2015: 185-194 - [i8]Ali Assarpour, Amotz Barnoy, Ou Liu:
Counting the Number of Langford Skolem Pairings. CoRR abs/1507.00315 (2015) - [i7]Mohammad Hosseini, Nooreddin Naghibolhosseini, Amotz Barnoy, Peter Terlecky, Hengchang Liu, Shaohan Hu, Shiguang Wang, Md. Tanvir Al Amin, Lu Su, Dong Wang, Ramesh Govindan, Raghu K. Ganti, Mudhakar Srivatsa, Charu C. Aggarwal, Tarek F. Abdelzaher, Siyu Gu, Chenji Pan:
Joint Source Selection and Data Extrapolation in Social Sensing for Disaster Response. CoRR abs/1512.00500 (2015) - 2014
- [j86]Peter Terlecky, Brian Phelan, Amotz Bar-Noy, Theodore Brown, Dror Rawitz:
Should I stay or should I go? Maximizing lifetime with relays. Comput. Networks 70: 210-224 (2014) - [j85]Amotz Bar-Noy, Thomas Erlebach, Magnús M. Halldórsson, Sotiris E. Nikoletseas, Pekka Orponen:
Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. Theor. Comput. Sci. 553: 1 (2014) - [j84]Yosef Alayev, Fangfei Chen, Yun Hou, Matthew P. Johnson, Amotz Bar-Noy, Thomas F. La Porta, Kin K. Leung:
Throughput Maximization in Mobile WSN Scheduling With Power Control and Rate Selection. IEEE Trans. Wirel. Commun. 13(7): 4066-4079 (2014) - [j83]Bin Liu, Peter Terlecky, Xing Xu, Amotz Bar-Noy, Ramesh Govindan, Dror Rawitz:
Peer-Assisted Timely Report Delivery in Social Swarming Applications. IEEE Trans. Wirel. Commun. 13(10): 5826-5838 (2014) - [c120]Siyu Gu, Chenji Pan, Hengchang Liu, Shen Li, Shaohan Hu, Lu Su, Shiguang Wang, Dong Wang, Md. Tanvir Al Amin, Ramesh Govindan, Charu C. Aggarwal, Raghu K. Ganti, Mudhakar Srivatsa, Amotz Barnoy, Peter Terlecky, Tarek F. Abdelzaher:
Data Extrapolation in Social Sensing for Disaster Response. DCOSS 2014: 119-126 - [c119]Prithwish Basu, Feng Yu, Matthew P. Johnson, Amotz Bar-Noy:
Low Expected Latency Routing in Dynamic Networks. MASS 2014: 267-271 - [c118]Prithwish Basu, Feng Yu, Amotz Bar-Noy, Dror Rawitz:
To Sample or To Smash? Estimating reachability in large time-varying graphs. SDM 2014: 983-991 - [c117]Peter Terlecky, Yurong Jiang, Xing Xu, Amotz Bar-Noy, Ramesh Govindan:
Maximizing the Relevant Diversity of Social Swarming Information. SENSORNETS 2014: 365-372 - 2013
- [j82]Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Mordecai J. Golin:
Paging mobile users in cellular networks: Optimality versus complexity and simplicity. Theor. Comput. Sci. 470: 23-35 (2013) - [j81]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. Wirel. Networks 19(6): 1121-1133 (2013) - [c116]Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. ESA 2013: 97-108 - [c115]Yurong Jiang, Xing Xu, Peter Terlecky, Tarek F. Abdelzaher, Amotz Bar-Noy, Ramesh Govindan:
MediaScope: selective on-demand media retrieval from mobile devices. IPSN 2013: 289-300 - [c114]Xing Xu, Yurong Jiang, Peter Terlecky, Tarek F. Abdelzaher, Amotz Bar-Noy, Ramesh Govindan:
Demo abstract: mediascope: selective on-demand media retrieval from mobile devices. IPSN 2013: 313-314 - [c113]Philippe Nain, Don Towsley, Amotz Bar-Noy, Prithwish Basu, Matthew P. Johnson, Feng Yu:
Estimating end-to-end delays under changing conditions. CHANTS@MobiCom 2013: 1-6 - [c112]Feng Yu, Amotz Bar-Noy, Prithwish Basu, Ram Ramanathan:
Algorithms for channel assignment in mobile wireless networks using temporal coloring. MSWiM 2013: 49-58 - [c111]Petko Bogdanov, Ben Baumer, Prithwish Basu, Amotz Bar-Noy, Ambuj K. Singh:
As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs. ECML/PKDD (1) 2013: 525-540 - [c110]Hengchang Liu, Siyu Gu, Chenji Pan, Wei Zheng, Shen Li, Shaohan Hu, Shiguang Wang, Dong Wang, Md. Tanvir Al Amin, Lu Su, Zhiheng Xie, Ramesh Govindan, Amotz Barnoy, Tarek F. Abdelzaher:
Extrapolation from participatory sensing data. SenSys 2013: 84:1-84:2 - [c109]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Brief announcement: set it and forget it - approximating the set once strip cover problem. SPAA 2013: 105-107 - [e1]Amotz Bar-Noy, Magnús M. Halldórsson:
Algorithms for Sensor Systems, 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012, Ljubljana, Slovenia, September 13-14, 2012. Revised Selected Papers. Lecture Notes in Computer Science 7718, Springer 2013, ISBN 978-3-642-36091-6 [contents] - [i6]Philippe Nain, Don Towsley, Matthew P. Johnson, Prithwish Basu, Amotz Bar-Noy, Feng Yu:
Computing Traversal Times on Dynamic Markovian Paths. CoRR abs/1303.3660 (2013) - [i5]Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. CoRR abs/1304.6358 (2013) - 2012
- [j80]Amotz Bar-Noy, Michael Lampis:
Online maximum directed cut. J. Comb. Optim. 24(1): 52-64 (2012) - [j79]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift:
Windows scheduling of arbitrary-length jobs on multiple machines. J. Sched. 15(2): 141-155 (2012) - [j78]Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
Ordered coloring of grids and related graphs. Theor. Comput. Sci. 444: 40-51 (2012) - [j77]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) - [j76]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. ACM Trans. Sens. Networks 8(3): 22:1-22:19 (2012) - [j75]Bin Liu, Peter Terlecky, Amotz Bar-Noy, Ramesh Govindan, Michael J. Neely, Dror Rawitz:
Optimizing Information Credibility in Social Swarming Applications. IEEE Trans. Parallel Distributed Syst. 23(6): 1147-1158 (2012) - [j74]Amotz Bar-Noy, Theodore Brown, Simon Shamoun:
Sensor allocation in diverse environments. Wirel. Networks 18(6): 697-711 (2012) - [j73]Fangfei Chen, Matthew P. Johnson, Amotz Bar-Noy, Thomas F. La Porta:
Proactive data dissemination to mission sites. Wirel. Networks 18(7): 749-762 (2012) - [c108]Brian Phelan, Peter Terlecky, Amotz Bar-Noy, Theodore Brown, Dror Rawitz:
Should I Stay or Should I Go? Maximizing Lifetime with Relays. DCOSS 2012: 1-8 - [c107]Yosef Alayev, Fangfei Chen, Yun Hou, Matthew P. Johnson, Amotz Bar-Noy, Tom La Porta, Kin K. Leung:
Throughput Maximization in Mobile WSN Scheduling with Power Control and Rate Selection. DCOSS 2012: 33-40 - [c106]Bin Liu, Peter Terlecky, Xing Xu, Amotz Bar-Noy, Ramesh Govindan, Dror Rawitz:
Timely Report Delivery in Social Swarming Applications. DCOSS 2012: 75-82 - [c105]Yanting Wu, George Rabanca, Bhaskar Krishnamachari, Amotz Bar-Noy:
A Competitive Rate Allocation Game. GAMENETS 2012: 16-30 - [c104]Fangfei Chen, Matthew P. Johnson, Amotz Bar-Noy, Thomas F. La Porta:
Convergecast with aggregatable data classes. SECON 2012: 148-156 - [c103]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Changing of the Guards: Strip Cover with Duty Cycling. SIROCCO 2012: 36-47 - [c102]Amotz Bar-Noy, Yi Gai, Matthew P. Johnson, Bhaskar Krishnamachari, George Rabanca:
Funding Games: The Truth but Not the Whole Truth. WINE 2012: 128-141 - [c101]Jianhang Gao, Qing Zhao, Wei Ren, Ananthram Swami, Ram Ramanathan, Amotz Bar-Noy:
Dynamic shortest path algorithms for hypergraphs. WiOpt 2012: 238-245 - [i4]Jianhang Gao, Qing Zhao, Wei Ren, Ananthram Swami, Ram Ramanathan, Amotz Bar-Noy:
Dynamic Shortest Path Algorithms for Hypergraphs. CoRR abs/1202.0082 (2012) - [i3]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Set It and Forget It: Approximating the Set Once Strip Cover Problem. CoRR abs/1204.1082 (2012) - 2011
- [j72]Matthew P. Johnson, Amotz Bar-Noy, Ou Liu, Yi Feng:
Energy peak shaving with local storage. Sustain. Comput. Informatics Syst. 1(3): 177-188 (2011) - [j71]Yosef Alayev, Amotz Bar-Noy, Thomas F. La Porta:
Broadcasting info-pages to sensors: efficiency versus energy conservation. Wirel. Networks 17(6): 1529-1542 (2011) - [c100]Amotz Bar-Noy, Ben Baumer:
Maximizing Network Lifetime on the Line with Adjustable Sensing Ranges. ALGOSENSORS 2011: 28-41 - [c99]Amotz Bar-Noy, Prithwish Basu, Matthew P. Johnson, Ram Ramanathan:
Minimum-Cost Broadcast through Varying-Size Neighborcast. ALGOSENSORS 2011: 173-187 - [c98]Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun:
On sensor selection in linked information networks. DCOSS 2011: 1-8 - [c97]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 - [c96]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 - [c95]Bin Liu, Peter Terlecky, Amotz Bar-Noy, Ramesh Govindan, Michael J. Neely:
Optimizing information credibility in social swarming applications. INFOCOM 2011: 556-560 - [c94]Matthew P. Johnson, Amotz Bar-Noy:
Pan and scan: Configuring cameras for coverage. INFOCOM 2011: 1071-1079 - [c93]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 - [c92]Ben Baumer, Prithwish Basu, Amotz Bar-Noy:
Modeling and analysis of composite network embeddings. MSWiM 2011: 341-350 - [c91]Amotz Bar-Noy, Greg Cirincione, Ramesh Govindan, Srikanth V. Krishnamurthy, T. F. LaPorta, Prasant Mohapatra, Michael J. Neely, Aylin Yener:
Quality-of-information aware networking for tactical military networks. PerCom Workshops 2011: 2-7 - [i2]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) - 2010
- [j70]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Online Conflict-Free Colouring for Hypergraphs. Comb. Probab. Comput. 19(4): 493-516 (2010) - [j69]Hosam Rowaihy, Matthew P. Johnson, Ou Liu, Amotz Bar-Noy, Theodore Brown, Thomas La Porta:
Sensor-mission assignment in wireless sensor networks. ACM Trans. Sens. Networks 6(4): 36:1-36:33 (2010) - [j68]Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart W. Chalmers, Thomas La Porta, Alun D. Preece:
Sensor-Mission Assignment in Constrained Environments. IEEE Trans. Parallel Distributed Syst. 21(11): 1692-1705 (2010) - [c90]Amotz Bar-Noy, Theodore Brown, Simon Shamoun:
Sensor Allocation in Diverse Environments. DCOSS 2010: 379-392 - [c89]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 - [c88]Matthew P. Johnson, Amotz Bar-Noy:
Brief announcement: pan and scan. PODC 2010: 120-121 - [c87]Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin:
Finding mobile data under delay constraints with searching costs. PODC 2010: 297-304 - [c86]Matthew P. Johnson, Amotz Bar-Noy, Mani B. Srivastava:
Brief Announcement: Configuration of Actuated Camera Networks for Multi-target Coverage. SSS 2010: 282-284 - [c85]Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng:
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems. SEA 2010: 361-372 - [i1]Prithwish Basu, Amotz Bar-Noy, Ram Ramanathan, Matthew P. Johnson:
Modeling and Analysis of Time-Varying Graphs. CoRR abs/1012.0260 (2010)
2000 – 2009
- 2009
- [j67]Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang:
Online Dynamic Programming Speedups. Theory Comput. Syst. 45(3): 429-445 (2009) - [j66]Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms 5(2): 18:1-18:17 (2009) - [c84]Hosam Rowaihy, Matthew P. Johnson, Diego Pizzocaro, Amotz Bar-Noy, Lance M. Kaplan, Thomas La Porta, Alun D. Preece:
Detection and Localization Sensor Assignment with Exact and Fuzzy Locations. DCOSS 2009: 28-43 - [c83]Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Ou Liu:
Cheap or Flexible Sensor Coverage. DCOSS 2009: 245-258 - [c82]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 - [c81]Amotz Bar-Noy, Michael Lampis:
Online Maximum Directed Cut. ISAAC 2009: 1124-1133 - [c80]Dinesh C. Verma, Chai Wah Wu, Theodore Brown, Amotz Bar-Noy, Simon Shamoun, Mark S. Nixon:
Application of Halftoning Algorithms to Location Dependent Sensor Placement. ISCAS 2009: 161-164 - [c79]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 - [c78]Fangfei Chen, Matthew P. Johnson, Amotz Bar-Noy, Iris Fermin, Tom La Porta:
Proactive Data Dissemination to Mission Sites. SECON 2009: 1-9 - [c77]Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
Ordered Coloring Grids and Related Graphs. SIROCCO 2009: 30-43 - 2008
- [j65]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Scheduling Techniques for Media-on-Demand. Algorithmica 52(4): 413-439 (2008) - [j64]Amotz Bar-Noy, Richard E. Ladner, Jacob Christensen, Tami Tamir:
A general buffer scheme for the windows scheduling problem. ACM J. Exp. Algorithmics 13 (2008) - [j63]Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky:
Deterministic conflict-free coloring for intervals: From offline to online. ACM Trans. Algorithms 4(4): 44:1-44:18 (2008) - [j62]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) - [c76]Hosam Rowaihy, Matthew P. Johnson, Sharanya Eswaran, Diego Pizzocaro, Amotz Bar-Noy, Thomas La Porta, Archan Misra, Alun D. Preece:
Utility-based joint sensor selection and congestion control for task-oriented WSNs. ACSCC 2008: 1165-1169 - [c75]Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart W. Chalmers, Thomas La Porta, Alun D. Preece:
Frugal Sensor Assignment. DCOSS 2008: 219-236 - [c74]Mario Gomez, Alun D. Preece, Matthew P. Johnson, Geeth de Mel, Wamberto Weber Vasconcelos, Christopher Gibson, Amotz Bar-Noy, Konrad Borowiecki, Thomas La Porta, Diego Pizzocaro, Hosam Rowaihy, Gavin Pearson, Tien Pham:
An Ontology-Centric Approach to Sensor-Mission Assignment. EKAW 2008: 347-363 - [c73]Hosam Rowaihy, Matthew P. Johnson, Amotz Bar-Noy, Theodore Brown, Thomas La Porta:
Assigning Sensors to Competing Missions. GLOBECOM 2008: 44-49 - [c72]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 - [c71]Yosef Alayev, Amotz Bar-Noy, Thomas F. La Porta:
Broadcasting Info-Pages to Sensors: Efficiency vs. Energy Conservation. SECON 2008: 368-376 - [c70]Amotz Bar-Noy, Matthew P. Johnson, Ou Liu:
Peak Shaving through Resource Buffering. WAOA 2008: 147-159 - [c69]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 - 2007
- [j61]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Windows scheduling as a restricted version of bin packing. ACM Trans. Algorithms 3(3): 28 (2007) - [c68]Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Thomas La Porta, Ou Liu, Hosam Rowaihy:
Assigning Sensors to Missions with Demands. ALGOSENSORS 2007: 114-125 - [c67]Douglas L. Moody, Amotz Bar-Noy, Graham Kendall:
Construction of Initial Neighborhoods for a Course Scheduling Problem Using Tiling. CISched 2007: 187-191 - [c66]Amotz Bar-Noy, Joanna Klukowska:
Finding Mobile Data: Efficiency vs. Location Inaccuracy. ESA 2007: 111-122 - [c65]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Online Conflict-Free Colorings for Hypergraphs. ICALP 2007: 219-230 - [c64]Amotz Bar-Noy, Yi Feng, Mordecai J. Golin:
Paging Mobile Users Efficiently and Optimally. INFOCOM 2007: 1910-1918 - [c63]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 - 2006
- [j60]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) - [j59]Amotz Bar-Noy, Zohar Naor:
Efficient multicast search under delay and bandwidth constraints. Wirel. Networks 12(6): 747-757 (2006) - [c62]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. SIROCCO 2006: 171-181 - [c61]Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky:
Conflict-free coloring for intervals: from offline to online. SPAA 2006: 128-137 - [c60]Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang:
Online Dynamic Programming Speedups. WAOA 2006: 43-54 - 2005
- [j58]Amotz Bar-Noy, Alan A. Bertossi, Maria Cristina Pinotti, Cauligi S. Raghavendra:
Guest Editorial. Mob. Networks Appl. 10(1-2): 7-8 (2005) - [c59]Amotz Bar-Noy, Justin Goshi, Richard E. Ladner, Tammy VanDeGrift:
Stream merging for live continuous broadcast with time-shifting. BROADNETS 2005: 953-962 - [c58]Amotz Bar-Noy:
Cellular Networks: Where Are the Mobile Users? SIROCCO 2005: 1 - [c57]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift:
Windows scheduling of arbitrary length jobs on parallel machines. SPAA 2005: 56-65 - [c56]Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir:
A General Buffer Scheme for the Windows Scheduling Problem. WEA 2005: 139-151 - 2004
- [j57]Amotz Bar-Noy, Vladimir Dreizin, Boaz Patt-Shamir:
Efficient algorithms for periodic scheduling. Comput. Networks 45(2): 155-173 (2004) - [j56]Amotz Bar-Noy, Grzegorz Malewicz:
Establishing wireless conference calls under delay constraints. J. Algorithms 51(2): 145-169 (2004) - [j55]Amotz Bar-Noy, Justin Goshi, Richard E. Ladner, Kenneth Tam:
Comparison of stream merging algorithms for media-on-demand. Multim. Syst. 9(5): 411-423 (2004) - [j54]Amotz Bar-Noy, Richard E. Ladner:
Efficient Algorithms for Optimal Stream Merging for Media-on-Demand. SIAM J. Comput. 33(5): 1011-1034 (2004) - [j53]Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper:
Broadcast Disks with Polynomial Cost Functions. Wirel. Networks 10(2): 157-168 (2004) - [c55]Zohar Naor, Amotz Bar-Noy:
Establishing a Mobile Conference Call Under Delay and Bandwidth Constraints. INFOCOM 2004 - [c54]Amotz Bar-Noy, Yishay Mansour:
Competitive on-line paging strategies for mobile users under delay constraints. PODC 2004: 256-265 - [c53]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Windows scheduling as a restricted version of Bin Packing. SODA 2004: 224-233 - 2003
- [j52]Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor:
Competitive On-Line Switching Policies. Algorithmica 36(3): 225-247 (2003) - [j51]Amotz Bar-Noy, Juan A. Garay, Amir Herzberg:
Sharing Video on Demand. Discret. Appl. Math. 129(1): 3-30 (2003) - [j50]Amotz Bar-Noy, Richard E. Ladner:
Competitive on-line stream merging algorithms for media-on-demand. J. Algorithms 48(1): 59-90 (2003) - [j49]Amotz Bar-Noy, Richard E. Ladner:
Windows Scheduling Problems for Broadcast Systems. SIAM J. Comput. 32(4): 1091-1113 (2003) - [j48]Amotz Bar-Noy, Joseph Naor, Baruch Schieber:
Pushing Dependent Data in Clients-Providers-Servers Systems. Wirel. Networks 9(5): 421-430 (2003) - [c52]Amotz Bar-Noy:
Windows scheduling as a paradigm for pushing information in wireless networks. DIALM-POMC 2003: 1 - [c51]Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Scheduling techniques for media-on-demand. SODA 2003: 791-80 - [c50]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 - 2002
- [j47]Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir:
Nearly optimal perfectly periodic schedules. Distributed Comput. 15(4): 207-220 (2002) - [j46]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) - [j45]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) - [c49]Amotz Bar-Noy, Boaz Patt-Shamir, Vladimir Dreizin:
Efficient periodic scheduling by trees. INFOCOM 2002: 791-800 - [c48]Amotz Bar-Noy, Grzegorz Malewicz:
Establishing wireless conference calls under delay constraints. PODC 2002: 41-50 - [c47]Amotz Bar-Noy, Richard E. Ladner:
Windows scheduling problems for broadcast systems. SODA 2002: 433-442 - [c46]Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor:
Competitive on-line switching policies. SODA 2002: 525-534 - [c45]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 - 2001
- [j44]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) - [j43]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) - [j42]Amotz Bar-Noy, Ari Freund, Joseph Naor:
On-Line Load Balancing in a Hierarchical Server Topology. SIAM J. Comput. 31(2): 527-549 (2001) - [j41]Amotz Bar-Noy, Danny Krizanc, Arunabha Sen:
Introduction: Discrete Algorithms and Methods for Mobility. Wirel. Networks 7(6): 565-566 (2001) - [c44]Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir:
Nearly optimal perfectly-periodic schedules. PODC 2001: 107-116 - [c43]Amotz Bar-Noy, Richard E. Ladner:
Competitive on-line stream merging algorithms for media-on-demand. SODA 2001: 364-373 - 2000
- [j40]Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
Optimal multiple message broadcasting in telephone-like communication systems. Discret. Appl. Math. 100(1-2): 1-15 (2000) - [j39]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) - [j38]Amotz Bar-Noy, Yaron Shilo:
Optimal Broadcasting of Two Files over an Asymmetric Channel. J. Parallel Distributed Comput. 60(4): 474-493 (2000) - [j37]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Message Multicasting in Heterogeneous Networks. SIAM J. Comput. 30(2): 347-358 (2000) - [c42]Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper:
Broadcast Disks with Polynomial Cost Functions. INFOCOM 2000: 575-584 - [c41]Amotz Bar-Noy, Joseph Naor, Baruch Schieber:
Pushing dependent data in clients-providers-servers systems. MobiCom 2000: 222-230 - [c40]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
1990 – 1999
- 1999
- [j36]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) - [j35]Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber:
Bandwidth Allocation with Preemption. SIAM J. Comput. 28(5): 1806-1828 (1999) - [j34]Amotz Bar-Noy, Ching-Tien Ho:
Broadcasting Multiple Messages in the Multiport Model. IEEE Trans. Parallel Distributed Syst. 10(5): 500-508 (1999) - [c39]Amotz Bar-Noy, Ari Freund, Joseph Naor:
On-Line Load Banancing in a Hierarchical Server Topology. ESA 1999: 77-88 - [c38]Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai:
Sum Multi-coloring of Graphs. ESA 1999: 390-401 - [c37]Amotz Bar-Noy, Yaron Shilo:
Optimal Broadcasting of Two Files over an Asymmetric Channel. INFOCOM 1999: 267-274 - [c36]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. STOC 1999: 622-631 - 1998
- [j33]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) - [j32]Amotz Bar-Noy, Guy Kortsarz:
Minimum Color Sum of Bipartite Graphs. J. Algorithms 28(2): 339-365 (1998) - [j31]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) - [c35]Amotz Bar-Noy, Yishay Mansour, Baruch Schieber:
Competitive Dynamic Bandwidth Allocation. PODC 1998: 31-39 - [c34]Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber:
Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). SODA 1998: 11-20 - [c33]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Multicasting in Heterogeneous Networks. STOC 1998: 448-453 - 1997
- [j30]Amotz Bar-Noy, Shlomo Kipnis:
Multiple message broadcasting in the postal model. Networks 29(1): 1-10 (1997) - [c32]Amotz Bar-Noy, Guy Kortsarz:
The Minimum Color Sum of Bipartite Graphs. ICALP 1997: 738-748 - 1996
- [j29]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) - [j28]Amotz Bar-Noy, Ilan Kessler, Mahmoud Naghshineh:
Topology-Based Tracking Strategies for Personal Communication Networks. Mob. Networks Appl. 1(1): 49-56 (1996) - [c31]Amotz Bar-Noy, Ching-Tien Ho:
Broadcasting Multiple Messages in the Multiport Model. IPPS 1996: 781-788 - [c30]Amotz Bar-Noy, Hadas Shachnai, Tami Tamir:
On Chromatic Sums and Distributed Resource Allocation. ISTCS 1996: 119-128 - 1995
- [j27]Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
optimal Computation of Census Functions in the Postal Model. Discret. Appl. Math. 58(3): 213-222 (1995) - [j26]Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda:
Optimal Amortized Distributed Consensus. Inf. Comput. 120(1): 93-100 (1995) - [j25]Hagit Attiya, Amotz Bar-Noy, Danny Dolev:
Sharing Memory Robustly in Message-Passing Systems. J. ACM 42(1): 124-142 (1995) - [j24]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) - [j23]Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber:
Computing Global Combine Operations in the Multiport Postal Model. IEEE Trans. Parallel Distributed Syst. 6(8): 896-900 (1995) - [j22]Amotz Bar-Noy, Ilan Kessler, Moshe Sidi:
Mobile users: to update or not to update? Wirel. Networks 1(2): 175-185 (1995) - [c29]Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan:
Guaranteeing Fair Service to Persistent Dependent Tasks. SODA 1995: 243-252 - [c28]Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber:
Bandwidth allocation with preemption. STOC 1995: 616-625 - 1994
- [j21]Amotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten:
A New Competitive Algorithm for Group Testing. Discret. Appl. Math. 52(1): 29-38 (1994) - [j20]Amotz Bar-Noy, Shlomo Kipnis:
Broadcasting Multiple Messages in Simultaneous Send/receive Systems. Discret. Appl. Math. 55(2): 95-105 (1994) - [j19]Amotz Bar-Noy, Shlomo Kipnis:
Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. Math. Syst. Theory 27(5): 431-452 (1994) - [j18]Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal:
Approximate distributed Bellman-Ford algorithms. IEEE Trans. Commun. 42(8): 2515-2517 (1994) - [c27]Amotz Bar-Noy, Ilan Kessler, Moshe Sidi:
Mobile Users: To Uptdate or not to Update? INFOCOM 1994: 570-576 - [c26]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 - [c25]Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
Optimal multiple message broadcasting in telephone-like communication systems. SPDP 1994: 216-223 - 1993
- [j17]Amotz Bar-Noy, Danny Dolev:
A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment. Math. Syst. Theory 26(1): 21-39 (1993) - [j16]Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
An Optimal Algorithm for computing Census Functions in Message-Passing Systems. Parallel Process. Lett. 3: 19-23 (1993) - [j15]Amotz Bar-Noy, Ilan Kessler:
Tracking mobile users in wireless communications networks. IEEE Trans. Inf. Theory 39(6): 1877-1886 (1993) - [c24]Amotz Bar-Noy, Ilan Kessler:
Tracking Mobile Users in Wireless Communication Networks. INFOCOM 1993: 1232-1239 - [c23]Amotz Bar-Noy, Shlomo Kipnis:
Multiple Message Broadcasting in the Postal Model. IPPS 1993: 463-470 - [c22]Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki:
Fast Deflection Routing for Packets and Worms (Extended Summary). PODC 1993: 75-86 - [c21]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 - [c20]Amotz Bar-Noy, Shlomo Kipnis:
Broadcasting Multiple Messages in Simultaneous Send/Receive Systems. SPDP 1993: 344-347 - 1992
- [j14]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) - [j13]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) - [j12]Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg:
Single Round Simulation on Radio Networks. J. Algorithms 13(2): 188-210 (1992) - [j11]Amotz Bar-Noy, Rajeev Motwani, Joseph Naor:
A Linear Time Approach to the Set Maxima Problem. SIAM J. Discret. Math. 5(1): 1-9 (1992) - [c19]Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber:
Efficient Minimum Cost Matching Using Quadrangle Inequality. FOCS 1992: 583-592 - [c18]Amotz Bar-Noy, Ilan Kessler, Shay Kutten, Frank K. Hwang:
A New Competitive Algorithm for Group Testing. INFOCOM 1992: 786-793 - [c17]Amotz Bar-Noy, Shlomo Kipnis:
Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. SPAA 1992: 13-22 - 1991
- [j10]Amotz Bar-Noy, Danny Dolev:
Consensus Algorithms with One-Bit Messages. Distributed Comput. 4: 105-110 (1991) - [j9]Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg:
Fault-Tolerant Critical Section Management in Asynchronous Environments. Inf. Comput. 95(1): 1-20 (1991) - [j8]Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg:
A Lower Bound for Radio Broadcast. J. Comput. Syst. Sci. 43(2): 290-298 (1991) - [j7]Amotz Bar-Noy, David Peleg:
Square Meshes are not always Optimal. IEEE Trans. Computers 40(2): 196-204 (1991) - [c16]Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal:
Approximate Distributed Bellman-Ford Algorithms. INFOCOM 1991: 1206-1213 - [c15]Amotz Bar-Noy, Baruch Schieber:
The Canadian Traveller Problem. SODA 1991: 261-270 - [c14]Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda:
Optimal Amortized Distributed Consensus (Extended Abstract). WDAG 1991: 95-107 - 1990
- [j6]Amotz Bar-Noy, Joseph Naor, Moni Naor:
One-Bit Algorithms. Distributed Comput. 4: 3-8 (1990) - [j5]Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk:
Renaming in an Asynchronous Environment. J. ACM 37(3): 524-548 (1990) - [j4]Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg:
Improved Routing Strategies with Succinct Tables. J. Algorithms 11(3): 307-341 (1990) - [j3]Amotz Bar-Noy, Joseph Naor:
Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments. SIAM J. Discret. Math. 3(1): 7-20 (1990) - [c13]Hagit Attiya, Amotz Bar-Noy, Danny Dolev:
Sharing Memory Robustly in Message-Passing Systems. PODC 1990: 363-375 - [c12]Amotz Bar-Noy, Madan Gopal:
Topology Distribution Cost vs. Efficient Routing in Large Networks. SIGCOMM 1990: 242-252
1980 – 1989
- 1989
- [j2]Amotz Bar-Noy, Michael Ben-Or, Danny Dolev:
Choice Coordination with Limited Failure. Distributed Comput. 3(2): 61-72 (1989) - [j1]Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman:
Bounds on Universal Sequences. SIAM J. Comput. 18(2): 268-277 (1989) - [c11]Amotz Bar-Noy, Danny Dolev:
Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment. PODC 1989: 307-318 - [c10]Amotz Bar-Noy, Danny Peleg:
Square Meshes Are Not Always Optimal. SPAA 1989: 138-147 - [c9]Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg:
On the Complexity of Radio Communication (Extended Abstract). STOC 1989: 274-285 - [c8]Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg:
Compact Distributed Data Structures for Adaptive Routing (Extended Abstract). STOC 1989: 479-489 - [c7]Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg:
Fault-Tolerant Critical Section Management in Asynchronous Networks. WDAG 1989: 13-23 - 1988
- [c6]Amotz Bar-Noy, Danny Dolev:
Families of Consensus Algorithms. AWOC 1988: 380-390 - [c5]Amotz Bar-Noy, Danny Dolev, Dragutin Petkovic:
Robust multi-agent decision making in faulty environment. ICPR 1988: 966-970 - [c4]Amotz Bar-Noy, Joseph Naor, Moni Naor:
One Bit Algorithms. PODC 1988: 66-76 - 1987
- [b1]Amotz Bar-Noy:
אלגוריתמים במערכת מבוזרת לא אמינה (Algorithms in an unreliable distributed system.). Hebrew University of Jerusalem, Israel, 1987 - [c3]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 - [c2]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
- [c1]Amotz Bar-Noy, Michael Ben-Or, Danny Dolev:
Choice Coordination with Bounded Failure (a Preliminary Version). PODC 1985: 309-316
Coauthor Index
David Peleg
aka: Danny Peleg
aka: Danny Peleg
[j112] [j111] [j110] [c161] [c160] [c159] [i13] [j109] [j107] [j106] [c158] [j104] [j103] [c157] [c156] [c155] [c154] [j102] [c153] [c151] [c150] [c149] [c148] [j101] [j100] [c146] [c145] [c143] [c142] [c140] [i12] [i11] [c135] [j95] [j93] [j91] [c125] [c124] [j86] [j83] [c118] [c116] [c109] [i5] [j75] [c108] [c106] [c103] [i3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-15 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
