The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Boaz Patt-Shamir: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Karl J. Lieberherr, Boaz Patt-Shamir
    The Refinement Relation of Graph-Based Generic Programs. [Citation Graph (0, 0)][DBLP]
    Generic Programming, 1998, pp:40-52 [Conf]
  2. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir
    Buffer Overflows of Merging Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:349-360 [Conf]
  3. Jens Palsberg, Boaz Patt-Shamir, Karl J. Lieberherr
    A New Approach to Compiling Adaptive Programs. [Citation Graph (0, 0)][DBLP]
    ESOP, 1996, pp:280-295 [Conf]
  4. Baruch Awerbuch, Boaz Patt-Shamir, George Varghese
    Self-Stabilization By Local Checking and Correction (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:268-277 [Conf]
  5. Yishay Mansour, Boaz Patt-Shamir
    Jitter Control in QoS Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:50-59 [Conf]
  6. Shay Kutten, Boaz Patt-Shamir
    Adaptive Stabilization of Reactive Protocols. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:396-407 [Conf]
  7. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle
    Adaptive Collaboration in Peer-to-Peer Systems. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2005, pp:71-80 [Conf]
  8. Baruch Awerbuch, Boaz Patt-Shamir, George Varghese
    Bounding the Unbounded. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1994, pp:776-783 [Conf]
  9. Amotz Bar-Noy, Boaz Patt-Shamir, Vladimir Dreizin
    Efficient periodic scheduling by trees. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  10. 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]
  11. Zvika Brakerski, Boaz Patt-Shamir
    Jitter-Approximation Tradeoff for Periodic Scheduling. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  12. Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir
    The Las-Vegas Processor Identity Problem (How and When to Be Unique). [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:150-159 [Conf]
  13. Janna Burman, Ted Herman, Shay Kutten, Boaz Patt-Shamir
    Asynchronous and Fully Self-stabilizing Time-Adaptive Majority Consensus. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:146-160 [Conf]
  14. Gregory Chockler, Seth Gilbert, Boaz Patt-Shamir
    Communication-Efficient Probabilistic Quorum Systems for Sensor Networks. [Citation Graph (0, 0)][DBLP]
    PerCom Workshops, 2006, pp:111-117 [Conf]
  15. Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir
    Nearly optimal perfectly-periodic schedules. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:107-116 [Conf]
  16. Yossi Azar, Shay Kutten, Boaz Patt-Shamir
    Distributed error confinement. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:33-42 [Conf]
  17. Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir
    General perfectly periodic scheduling. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:163-172 [Conf]
  18. Shay Kutten, Boaz Patt-Shamir
    Time-Adaptive Self Stabilization. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:149-158 [Conf]
  19. Shay Kutten, Boaz Patt-Shamir
    Asynchronous Time-Adaptive Self Stabilization. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:319- [Conf]
  20. Zvi Lotker, Boaz Patt-Shamir
    Average-case analysis of greedy packet scheduling (extended astract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:31-40 [Conf]
  21. Zvi Lotker, Boaz Patt-Shamir
    Nearly optimal FIFO buffer management for DiffServ. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:134-142 [Conf]
  22. Zvi Lotker, Boaz Patt-Shamir, David Peleg
    Distributed MST for constant diameter graphs. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:63-71 [Conf]
  23. Yishay Mansour, Boaz Patt-Shamir
    Greedy Packet Scheduling on Shortest Paths (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:165-175 [Conf]
  24. Yishay Mansour, Boaz Patt-Shamir, Ofer Lapid
    Optimal smoothing schedules for real-time streams (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:21-29 [Conf]
  25. Rafail Ostrovsky, Boaz Patt-Shamir
    Optimal and Efficient Clock Synchronization Under Drifting Clocks. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:3-12 [Conf]
  26. Boaz Patt-Shamir
    A note on efficient aggregate queries in sensor networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:283-289 [Conf]
  27. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle
    Collaboration of untrusting peers with changing interests. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:112-119 [Conf]
  28. Boaz Patt-Shamir, Allon Shafrir
    Approximate Top-k Queries in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:319-333 [Conf]
  29. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle
    Improved recommendation systems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1174-1183 [Conf]
  30. Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle
    Collaborate with strangers to find own preferences. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:263-269 [Conf]
  31. Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir
    Tell me who I am: an interactive recommendation system. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:1-10 [Conf]
  32. Alexander Kesselman, Yishay Mansour, Zvi Lotker, Boaz Patt-Shamir
    Buffer overflows of merging streams. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:244-245 [Conf]
  33. Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg
    MST construction in O(log log n) communication rounds. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:94-100 [Conf]
  34. Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
    New stability results for adversarial queuing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:192-199 [Conf]
  35. Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle
    Publish and perish: definition and analysis of an n-person publication impact game. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:11-18 [Conf]
  36. Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese
    Time optimal self-stabilizing synchronization. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:652-661 [Conf]
  37. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks
    Adapting to Asynchronous Dynamic Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:557-570 [Conf]
  38. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
    Buffer overflow management in QoS switches. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:520-529 [Conf]
  39. Yishay Mansour, Boaz Patt-Shamir
    Many-to-one packet routing on grids (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:258-267 [Conf]
  40. Boaz Patt-Shamir, Sergio Rajsbaum
    A theory of clock synchronization (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:810-819 [Conf]
  41. Baruch Awerbuch, Boaz Patt-Shamir, George Varghese, Shlomi Dolev
    Self-Stabilization by Local Checking and Global Reset (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1994, pp:326-339 [Conf]
  42. Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle
    Timing Games and Shared Memory. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:507-508 [Conf]
  43. Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir
    General Perfectly Periodic Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:183-208 [Journal]
  44. 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]
  45. Zvi Lotker, Boaz Patt-Shamir
    Nearly optimal FIFO buffer management for two packet classes. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2003, v:42, n:4, pp:481-492 [Journal]
  46. 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]
  47. Zvi Lotker, Boaz Patt-Shamir, David Peleg
    Distributed MST for constant diameter graphs. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:6, pp:453-460 [Journal]
  48. Yishay Mansour, Boaz Patt-Shamir, Ofer Lapid
    Optimal smoothing schedules for real-time streams. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2004, v:17, n:1, pp:77-89 [Journal]
  49. Zvi Lotker, Boaz Patt-Shamir
    A Note on Randomized Mutual Search. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:5-6, pp:187-191 [Journal]
  50. Zvika Brakerski, Vladimir Dreizin, Boaz Patt-Shamir
    Dispatching in perfectly-periodic schedules. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:2, pp:219-239 [Journal]
  51. Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir
    The Las-Vegas Processor Identity Problem (How and When to Be Unique). [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:468-494 [Journal]
  52. Yishay Mansour, Boaz Patt-Shamir
    Greedy Packet Scheduling on Shortest Paths. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:449-465 [Journal]
  53. Zvi Lotker, Boaz Patt-Shamir
    Average-Case Analysis of Greedy Packet Scheduling. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:6, pp:667-683 [Journal]
  54. Jens Palsberg, Boaz Patt-Shamir, Karl J. Lieberherr
    A New Approach to Compiling Adaptive Programs. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1997, v:29, n:3, pp:303-326 [Journal]
  55. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
    Buffer Overflow Management in QoS Switches. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:563-583 [Journal]
  56. Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, David Peleg
    Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:120-131 [Journal]
  57. Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
    New stability results for adversarial queuing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:286-303 [Journal]
  58. Boaz Patt-Shamir, Yiannis Tsiounis, Yair Frankel
    Exact Analysis of Exact Change: The k-Payment Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:4, pp:436-453 [Journal]
  59. Shay Kutten, Boaz Patt-Shamir
    Stabilizing Time-Adaptive Protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:1, pp:93-111 [Journal]
  60. Boaz Patt-Shamir, David Peleg
    Time-Space Tradeoffs for Set Operations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:110, n:1, pp:99-129 [Journal]
  61. Boaz Patt-Shamir
    A note on efficient aggregate queries in sensor networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:254-264 [Journal]
  62. Yishay Mansour, Boaz Patt-Shamir
    Jitter control in QoS networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2001, v:9, n:4, pp:492-502 [Journal]
  63. Karl J. Lieberherr, Boaz Patt-Shamir, Doug Orleans
    Traversals of object structures: Specification and Efficient Implementation. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2004, v:26, n:2, pp:370-412 [Journal]
  64. 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]
  65. Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin
    High Entropy Random Selection Protocols. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:366-379 [Conf]
  66. Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir
    Asynchronous recommendation systems. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:366-367 [Conf]
  67. Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
    Distributed approximate matching. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:167-174 [Conf]
  68. Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese
    A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Dependable Sec. Comput., 2007, v:4, n:3, pp:180-190 [Journal]
  69. Zvika Brakerski, Boaz Patt-Shamir
    Jitter-approximation tradeoff for periodic scheduling. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2006, v:12, n:6, pp:723-731 [Journal]

  70. High Entropy Random Selection Protocols. [Citation Graph (, )][DBLP]


  71. Sparse Reliable Graph Backbones. [Citation Graph (, )][DBLP]


  72. Video Distribution Under Multiple Constraints. [Citation Graph (, )][DBLP]


  73. A Note on Distributed Stable Matching. [Citation Graph (, )][DBLP]


  74. Competitive buffer management with packet dependencies. [Citation Graph (, )][DBLP]


  75. Asynchronous Active Recommendation Systems. [Citation Graph (, )][DBLP]


  76. Distributed Approximation of Cellular Coverage. [Citation Graph (, )][DBLP]


  77. Distributed discovery of large near-cliques. [Citation Graph (, )][DBLP]


  78. Brief announcement: a note on distributed stable matching. [Citation Graph (, )][DBLP]


  79. Online set packing and competitive scheduling of multi-part tasks. [Citation Graph (, )][DBLP]


  80. Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems. [Citation Graph (, )][DBLP]


  81. Improved distributed approximate matching. [Citation Graph (, )][DBLP]


  82. Finding similar users in social networks: extended abstract. [Citation Graph (, )][DBLP]


  83. Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental. [Citation Graph (, )][DBLP]


  84. Vector Bin Packing with Multiple-Choice. [Citation Graph (, )][DBLP]


  85. Distributed Discovery of Large Near-Cliques. [Citation Graph (, )][DBLP]


  86. Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental [Citation Graph (, )][DBLP]


  87. Distributed Discovery of Large Near-Cliques [Citation Graph (, )][DBLP]


  88. Vector Bin Packing with Multiple-Choice [Citation Graph (, )][DBLP]


  89. Approximate distributed top- k queries. [Citation Graph (, )][DBLP]


Search in 0.080secs, Finished in 0.082secs
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