The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Amotz Bar-Noy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong
    Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement. [Citation Graph (1, 0)][DBLP]
    PODC, 1987, pp:42-51 [Conf]
  2. Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber
    Bandwidth allocation with preemption. [Citation Graph (1, 0)][DBLP]
    STOC, 1995, pp:616-625 [Conf]
  3. Amotz Bar-Noy, Danny Dolev
    Families of Consensus Algorithms. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:380-390 [Conf]
  4. Amotz Bar-Noy, Justin Goshi, Richard E. Ladner, Tammy VanDeGrift
    Stream merging for live continuous broadcast with time-shifting. [Citation Graph (0, 0)][DBLP]
    BROADNETS, 2005, pp:953-962 [Conf]
  5. Amotz Bar-Noy
    Windows scheduling as a paradigm for pushing information in wireless networks. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2003, pp:1- [Conf]
  6. Amotz Bar-Noy, Ari Freund, Joseph Naor
    On-Line Load Banancing in a Hierarchical Server Topology. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:77-88 [Conf]
  7. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
    Sum Multi-coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:390-401 [Conf]
  8. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
    Efficient Minimum Cost Matching Using Quadrangle Inequality [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:583-592 [Conf]
  9. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk
    Achievable Cases in an Asynchronous Environment (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:337-346 [Conf]
  10. Amotz Bar-Noy, Guy Kortsarz
    The Minimum Color Sum of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:738-748 [Conf]
  11. Baruch Awerbuch, Amotz Bar-Noy, Madan Gopal
    Approximate Distributed Bellman-Ford Algorithms. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1991, pp:1206-1213 [Conf]
  12. Amotz Bar-Noy, Ilan Kessler
    Tracking Mobile Users in Wireless Communication Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1993, pp:1232-1239 [Conf]
  13. Amotz Bar-Noy, Ilan Kessler, Shay Kutten, Frank K. Hwang
    A New Competitive Algorithm for Group Testing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1992, pp:786-793 [Conf]
  14. Amotz Bar-Noy, Ilan Kessler, Moshe Sidi
    Mobile Users: To Uptdate or not to Update? [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1994, pp:570-576 [Conf]
  15. Amotz Bar-Noy, Boaz Patt-Shamir, Vladimir Dreizin
    Efficient periodic scheduling by trees. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  16. Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
    Broadcast Disks with Polynomial Cost Functions. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:575-584 [Conf]
  17. Amotz Bar-Noy, Yaron Shilo
    Optimal Broadcasting of Two Files over an Asymmetric Channel. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:267-274 [Conf]
  18. Zohar Naor, Amotz Bar-Noy
    Establishing a Mobile Conference Call Under Delay and Bandwidth Constraints. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  19. Amotz Bar-Noy, Ching-Tien Ho
    Broadcasting Multiple Messages in the Multiport Model. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:781-788 [Conf]
  20. Amotz Bar-Noy, Shlomo Kipnis
    Multiple Message Broadcasting in the Postal Model. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:463-470 [Conf]
  21. Amotz Bar-Noy, Hadas Shachnai, Tami Tamir
    On Chromatic Sums and Distributed Resource Allocation. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:119-128 [Conf]
  22. Amotz Bar-Noy, Joseph Naor, Baruch Schieber
    Pushing dependent data in clients-providers-servers systems. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2000, pp:222-230 [Conf]
  23. Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir
    Nearly optimal perfectly-periodic schedules. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:107-116 [Conf]
  24. Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki
    Fast Deflection Routing for Packets and Worms (Extended Summary). [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:75-86 [Conf]
  25. Hagit Attiya, Amotz Bar-Noy, Danny Dolev
    Sharing Memory Robustly in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:363-375 [Conf]
  26. Amotz Bar-Noy, Michael Ben-Or, Danny Dolev
    Choice Coordination with Bounded Failure (a Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:309-316 [Conf]
  27. Amotz Bar-Noy, Danny Dolev
    Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment. [Citation Graph (0, 0)][DBLP]
    PODC, 1989, pp:307-318 [Conf]
  28. Amotz Bar-Noy, Grzegorz Malewicz
    Establishing wireless conference calls under delay constraints. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:41-50 [Conf]
  29. Amotz Bar-Noy, Yishay Mansour
    Competitive on-line paging strategies for mobile users under delay constraints. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:256-265 [Conf]
  30. Amotz Bar-Noy, Yishay Mansour, Baruch Schieber
    Competitive Dynamic Bandwidth Allocation. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:31-39 [Conf]
  31. Amotz Bar-Noy, Joseph Naor, Moni Naor
    One Bit Algorithms. [Citation Graph (0, 0)][DBLP]
    PODC, 1988, pp:66-76 [Conf]
  32. Amotz Bar-Noy, Madan Gopal
    Topology Distribution Cost vs. Efficient Routing in Large Networks. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 1990, pp:242-252 [Conf]
  33. Amotz Bar-Noy
    Cellular Networks: Where Are the Mobile Users? [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:1- [Conf]
  34. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
    Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:171-181 [Conf]
  35. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
    Efficient Routing and Scheduling Algorithms for Optical Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:412-423 [Conf]
  36. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
    Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:11-20 [Conf]
  37. Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor
    Competitive on-line switching policies. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:525-534 [Conf]
  38. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
    Throughput maximization of real-time scheduling with batching. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:742-751 [Conf]
  39. Amotz Bar-Noy, Richard E. Ladner
    Competitive on-line stream merging algorithms for media-on-demand. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:364-373 [Conf]
  40. Amotz Bar-Noy, Richard E. Ladner
    Windows scheduling problems for broadcast systems. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:433-442 [Conf]
  41. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
    Scheduling techniques for media-on-demand. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:791-80 [Conf]
  42. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
    Windows scheduling as a restricted version of Bin Packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:224-233 [Conf]
  43. Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
    Guaranteeing Fair Service to Persistent Dependent Tasks. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:243-252 [Conf]
  44. Amotz Bar-Noy, Baruch Schieber
    The Canadian Traveller Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:261-270 [Conf]
  45. Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky
    Conflict-free coloring for intervals: from offline to online. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:128-137 [Conf]
  46. Amotz Bar-Noy, Justin Goshi, Richard E. Ladner
    Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:164-173 [Conf]
  47. Amotz Bar-Noy, Shlomo Kipnis
    Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:13-22 [Conf]
  48. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift
    Windows scheduling of arbitrary length jobs on parallel machines. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:56-65 [Conf]
  49. Amotz Bar-Noy, Danny Peleg
    Square Meshes Are Not Always Optimal. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:138-147 [Conf]
  50. Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber
    Computing Global Combine Operations in the Multi-Port Postal Model. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:336-343 [Conf]
  51. Amotz Bar-Noy, Shlomo Kipnis
    Broadcasting Multiple Messages in Simultaneous Send/Receive Systems. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:344-347 [Conf]
  52. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
    On the Complexity of Radio Communication (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:274-285 [Conf]
  53. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
    Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:479-489 [Conf]
  54. Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
    A unified approach to approximating resource allocation and scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:735-744 [Conf]
  55. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Multicasting in Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:448-453 [Conf]
  56. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:622-631 [Conf]
  57. Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang
    Online Dynamic Programming Speedups. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:43-54 [Conf]
  58. Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda
    Optimal Amortized Distributed Consensus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1991, pp:95-107 [Conf]
  59. Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg
    Fault-Tolerant Critical Section Management in Asynchronous Networks. [Citation Graph (0, 0)][DBLP]
    WDAG, 1989, pp:13-23 [Conf]
  60. Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir
    A General Buffer Scheme for the Windows Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:139-151 [Conf]
  61. Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor
    Competitive On-Line Switching Policies. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:3, pp:225-247 [Journal]
  62. Amotz Bar-Noy, Vladimir Dreizin, Boaz Patt-Shamir
    Efficient algorithms for periodic scheduling. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2004, v:45, n:2, pp:155-173 [Journal]
  63. Amotz Bar-Noy, Juan A. Garay, Amir Herzberg
    Sharing Video on Demand. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:1, pp:3-30 [Journal]
  64. Amotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten
    A New Competitive Algorithm for Group Testing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:1, pp:29-38 [Journal]
  65. Amotz Bar-Noy, Shlomo Kipnis
    Broadcasting Multiple Messages in Simultaneous Send/receive Systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:2, pp:95-105 [Journal]
  66. Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
    optimal Computation of Census Functions in the Postal Model. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:58, n:3, pp:213-222 [Journal]
  67. Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
    Optimal multiple message broadcasting in telephone-like communication systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:1-2, pp:1-15 [Journal]
  68. Amotz Bar-Noy, Michael Ben-Or, Danny Dolev
    Choice Coordination with Limited Failure. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1989, v:3, n:2, pp:61-72 [Journal]
  69. Amotz Bar-Noy, Danny Dolev
    Consensus Algorithms with One-Bit Messages. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1991, v:4, n:, pp:105-110 [Journal]
  70. Amotz Bar-Noy, Joseph Naor, Moni Naor
    One-Bit Algorithms. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1990, v:4, n:, pp:3-8 [Journal]
  71. Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir
    Nearly optimal perfectly periodic schedules. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:4, pp:207-220 [Journal]
  72. Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir
    On Chromatic Sums and Distributed Resource Allocation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:2, pp:183-202 [Journal]
  73. Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong
    Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:97, n:2, pp:205-233 [Journal]
  74. Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda
    Optimal Amortized Distributed Consensus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:1, pp:93-100 [Journal]
  75. Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg
    Fault-Tolerant Critical Section Management in Asynchronous Environments [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:95, n:1, pp:1-20 [Journal]
  76. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz
    A Matched Approximation Bound for the Sum of a Greedy Coloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:135-140 [Journal]
  77. Amotz Bar-Noy, Rajeev Motwani, Joseph Naor
    The Greedy Algorithm is Optimal for On-Line Edge Coloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:5, pp:251-253 [Journal]
  78. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
    Efficient Routing in Optical Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:6, pp:973-1001 [Journal]
  79. Hagit Attiya, Amotz Bar-Noy, Danny Dolev
    Sharing Memory Robustly in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:1, pp:124-142 [Journal]
  80. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk
    Renaming in an Asynchronous Environment [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:524-548 [Journal]
  81. Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
    A unified approach to approximating resource allocation and scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:5, pp:1069-1090 [Journal]
  82. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
    Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:116-143 [Journal]
  83. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg
    Improved Routing Strategies with Succinct Tables. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:3, pp:307-341 [Journal]
  84. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
    Single Round Simulation on Radio Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:2, pp:188-210 [Journal]
  85. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
    Sum Multicoloring of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:422-450 [Journal]
  86. Amotz Bar-Noy, Guy Kortsarz
    Minimum Color Sum of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:2, pp:339-365 [Journal]
  87. Amotz Bar-Noy, Richard E. Ladner
    Competitive on-line stream merging algorithms for media-on-demand. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:59-90 [Journal]
  88. Amotz Bar-Noy, Grzegorz Malewicz
    Establishing wireless conference calls under delay constraints. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:51, n:2, pp:145-169 [Journal]
  89. Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
    A Lower Bound for Radio Broadcast. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:2, pp:290-298 [Journal]
  90. Amotz Bar-Noy, Justin Goshi, Richard E. Ladner
    Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:1, pp:72-105 [Journal]
  91. Dan Sadot, Y. Nachmani, Amotz Bar-Noy, Shay Kutten
    Next generation Tbit/sec routers and switches: traffic modeling, scheduling algorithms, and simulations. [Citation Graph (0, 0)][DBLP]
    J. High Speed Networks, 2002, v:11, n:2, pp:89-102 [Journal]
  92. Amotz Bar-Noy, Yaron Shilo
    Optimal Broadcasting of Two Files over an Asymmetric Channel. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:4, pp:474-493 [Journal]
  93. Amotz Bar-Noy, Justin Goshi, Richard E. Ladner, Kenneth Tam
    Comparison of stream merging algorithms for media-on-demand. [Citation Graph (0, 0)][DBLP]
    Multimedia Syst., 2004, v:9, n:5, pp:411-423 [Journal]
  94. Amotz Bar-Noy, Alan A. Bertossi, Maria Cristina Pinotti, Cauligi S. Raghavendra
    Guest Editorial. [Citation Graph (0, 0)][DBLP]
    MONET, 2005, v:10, n:1-2, pp:7-8 [Journal]
  95. Amotz Bar-Noy, Ilan Kessler, Mahmoud Naghshineh
    Topology-Based Tracking Strategies for Personal Communication Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 1996, v:1, n:1, pp:49-56 [Journal]
  96. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
    Minimizing Service and Operation Costs of Periodic Scheduling. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:3, pp:518-544 [Journal]
  97. Amotz Bar-Noy, Danny Dolev
    A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:1, pp:21-39 [Journal]
  98. Amotz Bar-Noy, Shlomo Kipnis
    Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:5, pp:431-452 [Journal]
  99. Amotz Bar-Noy, Shlomo Kipnis
    Multiple message broadcasting in the postal model. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:1-10 [Journal]
  100. Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
    An Optimal Algorithm for computing Census Functions in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:19-23 [Journal]
  101. Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman
    Bounds on Universal Sequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:268-277 [Journal]
  102. Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber
    Bandwidth Allocation with Preemption. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1806-1828 [Journal]
  103. Amotz Bar-Noy, Ari Freund, Joseph Naor
    On-Line Load Balancing in a Hierarchical Server Topology. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:527-549 [Journal]
  104. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Message Multicasting in Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:347-358 [Journal]
  105. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Approximating the Throughput of Multiple Machines in Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:331-352 [Journal]
  106. Amotz Bar-Noy, Richard E. Ladner
    Windows Scheduling Problems for Broadcast Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:4, pp:1091-1113 [Journal]
  107. Amotz Bar-Noy, Richard E. Ladner
    Efficient Algorithms for Optimal Stream Merging for Media-on-Demand. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:5, pp:1011-1034 [Journal]
  108. Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
    Guaranteeing Fair Service to Persistent Dependent Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1168-1189 [Journal]
  109. Amotz Bar-Noy, Joseph Naor
    Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:7-20 [Journal]
  110. Amotz Bar-Noy, Rajeev Motwani, Joseph Naor
    A Linear Time Approach to the Set Maxima Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:1-9 [Journal]
  111. Amotz Bar-Noy, David Peleg
    Square Meshes are not always Optimal. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:2, pp:196-204 [Journal]
  112. Amotz Bar-Noy, Ilan Kessler
    Tracking mobile users in wireless communications networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:6, pp:1877-1886 [Journal]
  113. Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber
    Computing Global Combine Operations in the Multiport Postal Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:8, pp:896-900 [Journal]
  114. Amotz Bar-Noy, Ching-Tien Ho
    Broadcasting Multiple Messages in the Multiport Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:5, pp:500-508 [Journal]
  115. Amotz Bar-Noy, Danny Krizanc, Arunabha Sen
    Introduction: Discrete Algorithms and Methods for Mobility. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2001, v:7, n:6, pp:565-566 [Journal]
  116. Amotz Bar-Noy, Ilan Kessler, Moshe Sidi
    Mobile users: to update or not to update? [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 1995, v:1, n:2, pp:175-185 [Journal]
  117. Amotz Bar-Noy, Joseph Naor, Baruch Schieber
    Pushing Dependent Data in Clients-Providers-Servers Systems. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2003, v:9, n:5, pp:421-430 [Journal]
  118. Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
    Broadcast Disks with Polynomial Cost Functions. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2004, v:10, n:2, pp:157-168 [Journal]
  119. Amotz Bar-Noy, Joanna Klukowska
    Finding Mobile Data: Efficiency vs. Location Inaccuracy. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:111-122 [Conf]
  120. Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
    Online Conflict-Free Colorings for Hypergraphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:219-230 [Conf]
  121. Amotz Bar-Noy, Yi Feng, Mordecai J. Golin
    Paging Mobile Users Efficiently and Optimally. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1910-1918 [Conf]
  122. Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
    Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:194-195 [Conf]
  123. Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
    Windows scheduling as a restricted version of bin packing. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]
  124. Amotz Bar-Noy, Zohar Naor
    Efficient multicast search under delay and bandwidth constraints. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2006, v:12, n:6, pp:747-757 [Journal]

  125. Assigning Sensors to Missions with Demands. [Citation Graph (, )][DBLP]


  126. Frugal Sensor Assignment. [Citation Graph (, )][DBLP]


  127. Cheap or Flexible Sensor Coverage. [Citation Graph (, )][DBLP]


  128. Detection and Localization Sensor Assignment with Exact and Fuzzy Locations. [Citation Graph (, )][DBLP]


  129. Sensor Allocation in Diverse Environments. [Citation Graph (, )][DBLP]


  130. An Ontology-Centric Approach to Sensor-Mission Assignment. [Citation Graph (, )][DBLP]


  131. More is More: The Benefits of Denser Sensor Deployment. [Citation Graph (, )][DBLP]


  132. Online Maximum Directed Cut. [Citation Graph (, )][DBLP]


  133. Brief announcement: pan and scan. [Citation Graph (, )][DBLP]


  134. Finding mobile data under delay constraints with searching costs. [Citation Graph (, )][DBLP]


  135. Ordered Coloring Grids and Related Graphs. [Citation Graph (, )][DBLP]


  136. Brief Announcement: Configuration of Actuated Camera Networks for Multi-target Coverage. [Citation Graph (, )][DBLP]


  137. Peak Shaving through Resource Buffering. [Citation Graph (, )][DBLP]


  138. When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries. [Citation Graph (, )][DBLP]


  139. Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems. [Citation Graph (, )][DBLP]


  140. Assigning Sensors to Competing Missions. [Citation Graph (, )][DBLP]


  141. Broadcasting Info-Pages to Sensors: Efficiency vs. Energy Conservation. [Citation Graph (, )][DBLP]


  142. Scheduling Techniques for Media-on-Demand. [Citation Graph (, )][DBLP]


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