The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nir Shavit: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Dice, Nir Shavit
    Understanding Tradeoffs in Software Transactional Memory. [Citation Graph (0, 0)][DBLP]
    CGO, 2007, pp:21-33 [Conf]
  2. Victor Luchangco, Daniel Nussbaum, Nir Shavit
    A Hierarchical CLH Queue Lock. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2006, pp:801-810 [Conf]
  3. Hagit Attiya, Nancy A. Lynch, Nir Shavit
    Are Wait-Free Algorithms Fast? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:55-64 [Conf]
  4. Baruch Awerbuch, Yishay Mansour, Nir Shavit
    Polynomial End-To-End Communication (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:358-363 [Conf]
  5. Faith Ellen Fich, Danny Hendler, Nir Shavit
    Linear Lower Bounds on Real-World Implementations of Concurrent Objects. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:165-173 [Conf]
  6. Maurice Herlihy, Nir Shavit, Orli Waarts
    Low Contention Linearizable Counting [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:526-535 [Conf]
  7. Nir Shavit, Nissim Francez
    A New Approach to Detection of Locally Indicative Stability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:344-358 [Conf]
  8. Ori Dvir, Maurice Herlihy, Nir Shavit
    Virtual Leashing: Internet-Based Software Piracy Protection. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2005, pp:283-292 [Conf]
  9. Nir Shavit, Itay Lotan
    Skiplist-Based Concurrent Priority Queues. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:263-268 [Conf]
  10. Virendra J. Marathe, Mark Moir, Nir Shavit
    Composite Abortable Locks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:1-10 [Conf]
  11. Yaron Riany, Nir Shavit, Dan Touitou
    Towards A Practical Snapshot Algorithm. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:121-129 [Conf]
  12. Rainer Gawlick, Nancy A. Lynch, Nir Shavit
    Concurrent Timestamping Made Simple. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:171-183 [Conf]
  13. Christine H. Flood, David Detlefs, Nir Shavit, Xiolan Zhang
    Parallel Garbage Collection for Shared Memory Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Java™ Virtual Machine Research and Technology Symposium, 2001, pp:- [Conf]
  14. Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer, Nir Shavit
    A Lazy Concurrent List-Based Set Algorithm. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:3-16 [Conf]
  15. Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit
    Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:1-13 [Conf]
  16. Hagit Attiya, Danny Dolev, Nir Shavit
    Bounded Polynomial Randomized Consensus. [Citation Graph (0, 0)][DBLP]
    PODC, 1989, pp:281-293 [Conf]
  17. Faith Ellen Fich, Danny Hendler, Nir Shavit
    On the inherent weakness of conditional synchronization primitives. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:80-87 [Conf]
  18. Faith Ellen Fich, Maurice Herlihy, Nir Shavit
    On the Space Complexity of Randomized Synchronization. [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:241-249 [Conf]
  19. Danny Hendler, Nir Shavit
    Non-blocking steal-half work queues. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:280-289 [Conf]
  20. Danny Hendler, Nir Shavit
    Operation-valency and the cost of coordination. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:84-91 [Conf]
  21. Gunnar Hoest, Nir Shavit
    Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:199-208 [Conf]
  22. Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou
    Counting Networks are Practically Linearizable. [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:280-289 [Conf]
  23. Ori Shalev, Nir Shavit
    Split-ordered lists: lock-free extensible hash tables. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:102-111 [Conf]
  24. Nir Shavit, Dan Touitou
    Software Transactional Memory. [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:204-213 [Conf]
  25. Nir Shavit, Eli Upfal, Asaph Zemach
    A Wait-Free Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:121-128 [Conf]
  26. Nir Shavit, Asaph Zemach
    Combining Funnels: A New Twist on an Old Tale... [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:61-70 [Conf]
  27. Nir Shavit, Asaph Zemach
    Scalable Concurrent Priority Queue Algorithms. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:113-122 [Conf]
  28. Ali-Reza Adl-Tabatabai, David Dice, Maurice Herlihy, Nir Shavit, Christos Kozyrakis, Christoph von Praun, Michael Scott
    Potential show-stoppers for transactional synchronization. [Citation Graph (0, 0)][DBLP]
    PPOPP, 2007, pp:55- [Conf]
  29. Nancy A. Lynch, Nir Shavit
    Timing-Based Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
    IEEE Real-Time Systems Symposium, 1992, pp:2-11 [Conf]
  30. Michael E. Saks, Nir Shavit, Heather Woll
    Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:351-362 [Conf]
  31. Ole Agesen, David Detlefs, Christine H. Flood, Alex Garthwaite, Paul A. Martin, Nir Shavit, Guy L. Steele Jr.
    DCAS-based concurrent deques. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:137-146 [Conf]
  32. Giovanni Della-Libera, Nir Shavit
    Reactive Diffracting Trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:24-32 [Conf]
  33. Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul A. Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.
    DCAS is not a silver bullet for nonblocking algorithm design. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:216-224 [Conf]
  34. Danny Hendler, Nir Shavit
    Work dealing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:164-172 [Conf]
  35. Danny Hendler, Nir Shavit, Lena Yerushalmi
    A scalable lock-free stack algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:206-215 [Conf]
  36. Maurice Herlihy, Beng-Hong Lim, Nir Shavit
    Low Contention Load Balancing on Large-Scale Multiprocessors. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:219-227 [Conf]
  37. Victor Luchangco, Mark Moir, Nir Shavit
    Nonblocking k-compare-single-swap. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:314-323 [Conf]
  38. Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit
    Using elimination to implement scalable and lock-free FIFO queues. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:253-262 [Conf]
  39. Nir Shavit, Dan Touitou
    Elimination Trees and the Construction of Pools and Stacks (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:54-63 [Conf]
  40. Nir Shavit, Eli Upfal, Asaph Zemach
    A Steady State Analysis of Diffracting Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:33-41 [Conf]
  41. Nir Shavit, Asaph Zemach
    Diffracting Trees (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:167-176 [Conf]
  42. William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
    Supporting Increment and Decrement Operations in Balancing Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:393-403 [Conf]
  43. James Aspnes, Maurice Herlihy, Nir Shavit
    Counting Networks and Multi-Processor Coordination [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:348-358 [Conf]
  44. Danny Dolev, Eli Gafni, Nir Shavit
    Toward a Non-Atomic Era: \ell-Exclusion as a Test Case [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:78-92 [Conf]
  45. Danny Dolev, Nir Shavit
    Bounded Concurrent Time-Stamp Systems Are Constructible [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:454-466 [Conf]
  46. Maurice Herlihy, Nir Shavit
    The asynchronous computability theorem for t-resilient tasks. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:111-120 [Conf]
  47. Maurice Herlihy, Nir Shavit
    A simple constructive computability theorem for wait-free computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:243-252 [Conf]
  48. David Detlefs, Christine H. Flood, Alex Garthwaite, Paul A. Martin, Nir Shavit, Guy L. Steele Jr.
    Even Better DCAS-Based Concurrent Deques. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:59-73 [Conf]
  49. Danny Hendler, Yossi Lev, Nir Shavit
    Dynamic Memory ABP Work-Stealing. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:188-200 [Conf]
  50. Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
    Obstruction-Free Algorithms Can Be Practically Wait-Free. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:78-92 [Conf]
  51. Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
    Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:493-494 [Conf]
  52. Edya Ladan-Mozes, Nir Shavit
    An Optimistic Approach to Lock-Free FIFO Queues. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:117-131 [Conf]
  53. Victor Luchangco, Mark Moir, Nir Shavit
    On the Uncontended Complexity of Consensus. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:45-59 [Conf]
  54. David Dice, Ori Shalev, Nir Shavit
    Transactional Locking II. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:194-208 [Conf]
  55. Nir Shavit, Asaph Zemach
    Concurrent Priority Queue Algorithms. [Citation Graph (0, 0)][DBLP]
    WDAS, 1999, pp:107-132 [Conf]
  56. Ori Shalev, Nir Shavit
    Predictive log-synchronization. [Citation Graph (0, 0)][DBLP]
    EuroSys, 2006, pp:305-315 [Conf]
  57. William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
    Supporting Increment and Decrement Operations in Balancing Networks. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 2000, v:2000, n:, pp:- [Journal]
  58. Faith Ellen Fich, Danny Hendler, Nir Shavit
    On the inherent weakness of conditional primitives. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:4, pp:267-277 [Journal]
  59. Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit
    A dynamic-sized nonblocking work stealing deque. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:189-207 [Journal]
  60. Maurice Herlihy, Nir Shavit, Orli Waarts
    Linearizable Counting Networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1996, v:9, n:4, pp:193-203 [Journal]
  61. Nir Shavit
    Introduction. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:4, pp:191-191 [Journal]
  62. Nir Shavit, Dan Touitou
    Software Transactional Memory. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1997, v:10, n:2, pp:99-116 [Journal]
  63. Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit
    Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:4, pp:873-890 [Journal]
  64. James Aspnes, Maurice Herlihy, Nir Shavit
    Counting Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:5, pp:1020-1048 [Journal]
  65. Hagit Attiya, Nancy A. Lynch, Nir Shavit
    Are Wait-Free Algorithms Fast? [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:4, pp:725-763 [Journal]
  66. Faith Ellen Fich, Maurice Herlihy, Nir Shavit
    On the Space Complexity of Randomized Synchronization. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:5, pp:843-862 [Journal]
  67. Maurice Herlihy, Nir Shavit
    The topological structure of asynchronous computability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:6, pp:858-923 [Journal]
  68. Ori Shalev, Nir Shavit
    Split-ordered lists: Lock-free extensible hash tables. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:3, pp:379-405 [Journal]
  69. Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, Nir Shavit
    Slide-The Key to Polynomial End-to-End Communication. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:158-186 [Journal]
  70. Giovanni Della-Libera, Nir Shavit
    Reactive Diffracting Trees. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:7, pp:853-890 [Journal]
  71. Nir Shavit, Asaph Zemach
    Combining Funnels: A Dynamic Approach to Software Combining. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:11, pp:1355-1387 [Journal]
  72. Ori Dvir, Maurice Herlihy, Nir Shavit
    Virtual Leashing: Creating a computational foundation for software protection. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:9, pp:1233-1240 [Journal]
  73. Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul A. Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.
    DCAS-Based Concurrent Deques. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:3, pp:349-386 [Journal]
  74. Nir Shavit, Dan Touitou
    Elimination Trees and the Construction of Pools and Stacks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:6, pp:645-670 [Journal]
  75. Nir Shavit, Eli Upfal, Asaph Zemach
    A Steady State Analysis of Diffracting Trees. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:4, pp:403-423 [Journal]
  76. Mark Moir, Nir Shavit, Jan Vitek
    Concurrency and synchronization in Java programs. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2005, v:58, n:3, pp:291-292 [Journal]
  77. Danny Dolev, Nir Shavit
    Bounded Concurrent Time-Stamping. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:418-455 [Journal]
  78. Gunnar Hoest, Nir Shavit
    Toward a Topological Characterization of Asynchronous Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:457-497 [Journal]
  79. Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou
    Timing Conditions for Linearizability in Uniform Counting Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:1, pp:67-91 [Journal]
  80. Yaron Riany, Nir Shavit, Dan Touitou
    Towards a practical snapshot algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:269, n:1-2, pp:163-201 [Journal]
  81. Maurice Herlihy, Beng-Hong Lim, Nir Shavit
    Scalable Concurrent Counting. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 1995, v:13, n:4, pp:343-364 [Journal]
  82. Nir Shavit, Asaph Zemach
    Diffracting Trees. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 1996, v:14, n:4, pp:385-428 [Journal]
  83. Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit
    A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:939-953 [Journal]
  84. Nir Shavit, Nicolas Schabanel, Pascal Felber, Christos Kaklamanis
    Topic 12 Theory and Algorithms for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2007, pp:793- [Conf]
  85. Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit
    A Simple Optimistic Skiplist Algorithm. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:124-138 [Conf]

  86. Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees. [Citation Graph (, )][DBLP]


  87. Transactional Mutex Locks. [Citation Graph (, )][DBLP]


  88. Software transactional memory: Where do we come from? What are we? Where are we going? [Citation Graph (, )][DBLP]


  89. The Baskets Queue. [Citation Graph (, )][DBLP]


  90. Maintaining Consistent Transactional States without a Global Clock. [Citation Graph (, )][DBLP]


  91. TLRW: return of the read-write lock. [Citation Graph (, )][DBLP]


  92. Flat combining and the synchronization-parallelism tradeoff. [Citation Graph (, )][DBLP]


  93. Hopscotch Hashing. [Citation Graph (, )][DBLP]


  94. Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method. [Citation Graph (, )][DBLP]


  95. Scalable Flat-Combining Based Synchronous Queues. [Citation Graph (, )][DBLP]


  96. An optimistic approach to lock-free FIFO queues. [Citation Graph (, )][DBLP]


  97. Solo-valency and the cost of coordination. [Citation Graph (, )][DBLP]


Search in 2.320secs, Finished in 2.324secs
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