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