**Nir Shavit’s Publications:**

**- Asynchronous Computability and Complexity**

**- Concurrent Data Structures and Synchronization Algorithms**

**- Transactional Memory Algorithms**

**- Computational Neurobiology**

**Asynchronous Computability and Complexity:**

**Gelashvili, R., Ghaffari, M., Li, J., and Nir Shavit. On the Importance of Registers for Computability**. Proc. of the 18th International Conference on Principles of Distributed Systems (OPODIS 2014), Cortina d’Amprezzo, Italy (December 16-19, 2014).

** Alistarh, Dan, Denysyuk, O., Luis Rodrigues, L. and Nir Shavit. Balls-into-Leaves: Sub-logarithmic Renaming in Synchronous Message-Passing Systems**. Proc. of the 33rd Annual ACM Symposium on Principles of Distributed Computing (PoDC 2014), pp. 232-241, Paris, France (July 2014).

** Alistarh, D., Censor-Hillel, K. and Nir Shavit. Are Lock-Free Concurrent Algorithms Practically Wait-Free?**. Proc. of the ACM 46th Annual Symposium on the Theory of Computing (SToC 2014), pp. 714-723, New York, New York (June 2014).

** Hendler, D. and Nir Shavit. Solo-valency and the Cost of Coordination**. Distributed Computing, Vol. 21(1), pp. 43-54 (June 2008).

** Hoest, G. and Nir Shavit. Towards a Topological Characterization of Asynchronous Complexity**. SIAM Journal on Comnputing. 36(2), pp. 457-497 (2006). A preliminary version appeared in Proc. of the 16th Annual ACM Symposium on Principles of Distributed Computing (PoDC 1997), Santa Barbara, California, pp. 199-208 (1997).

** Faith, E., Hendler, D. and Nir Shavit. Linear Lower Bounds on Real-World Implementations of Concurrent Objects.**. Proc. of the 46th Annual Symposium on Foundations of Computer Science (FoCS 2005), pp. 165-173, Pittsburgh, Pennsylvania (October 2005).

** Faith, E., Luchangco, V., Moir, M. and Nir Shavit. Obstruction-Free Step Complexity: Lock-Free DCAS as an Example (Brief announcement)**. Proc. of the 19th International Symposium on Distributed Computing (DISC 2005), pp. 493-494, Krakow, Poland (September 2005).

** Faith, E., Luchangco, V., Moir, M. and Nir Shavit. Obstruction-Free Algorithms Can Be Practically Wait-Free**. Proc. of the 19th International Symposium on Distributed Computing (DISC 2005), pp. 78-92, Krakow, Poland (September 2005).

** S. Doherty, D. Detlefs, L. Groves, C. H. Flood, V. Luchangco, P. A. Martin, M. Moir, N. Shavit, G. L. Steele Jr.. DCAS Is Not a Silver Bullet for Nonblocking Algorithm Design**. Proc. of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), pp. 216-224, Barcelona, Spain (June 2004).

** Luchangco, V., Moir, M. and Nir Shavit. On the Uncontended Complexity of Consensus**. Proc. of the 17th International Conference on Distributed Computing (DISC 2003), pp. 45-59, Sorrento, Italy (October 2003).

** Hendler, D. and Nir Shavit. Operation-Valency and the Cost of Coordination**. Proc. of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PoDC 2003), pp. 84-91, Boston, Massachusetts (July 2003).

** Agesen, O., Detlefs, D., Flood, C.H., Garthwaite, A., Martin, P., Shavit, N., and G.L. Steele Jr. DCAS-Based Concurrent Deques**. Theory of Computing Systems, Special Issue 35(3), pp. 349-386 (2002). A preliminary version appeared in Proc. of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000), pp. 137-146 Bar Harbor, Maine (August 2000).

** Herlihy, M.P. and Nir Shavit. The Topological Structure of Asynchronous Computability**. Journal of the ACM (1999), pp. 858-923. This work combines two preliminary papers, titled: The Asynchronous Computability Theorem for t-Resilient Tasks, which appeared in Proc. of the 25th Annual Symposium on Theory of Computing (SToC 1993), San-Diego, California, pp. 111-120 (1993), and A Simple Constructive Computability Theorem for Wait-free Computation, which appeared in Proc. of the 26th Annual Symposium on Theory of Computing (SToC 1994), pp. 243-252 (1994).

** N. Lynch, N. Shavit, A. Shvartzman, and D. Touitou. Timing Conditions for Linearizability in Uniform Counting Networks**. Theoretical Computer Science, Special Issue (1999), Vol. 220 (1), pp. 67-91. A preliminary version, titled: Counting Networks are Practically Linearizable, appeared in the Proc. of the 15th Annual ACM Symposium on Principles of Distributed Computing (PoDC 1996) pp. 280-289, Philadelphia, Pennsylvania (1996).

**Shavit, N., Upfal, E. and A. Zemach. A Steady State Analysis of Diffracting Trees**. Theory of Computing Systems, Special Issue, No. 31 (1998), pp. 403-424. A preliminary version appeared in the Proc. of the 8th Annual Symposium on Parallel Algorithms and Architectures (SPAA 1996), pp. 33-41, Padova, Italy (1996).

**Faith, E., Herlihy, M.P. and Nir Shavit. On the Space Complexity of Randomized Synchronization**. Journal of the ACM, 45:5 (1998), pp. 843-862. A preliminary version appeared in the Proc. of the Annual ACM Symposium on Principles of Distributed Computing (PoDC 1993), pp. 241-249, Ithaca, New York (1993).

** Dolev, D. and Nir Shavit. Bounded Concurrent Time-stamping**. SIAM Journal on Computing, Vol. 26, No. 2 (April 1997), pp. 418-455. A preliminary version, titled: Bounded Concurrent Time Stamp Systems Are Constructible, appeared in the Proc. of the 21st Annual ACM Symposium on Theory of Computing (SToC 1989), pp. 454-466, Seattle, Washington (1989).

** Herlihy, M.P., Shavit, N. and O. Waarts. Linearizable Counting Networks**. Distributed Computing, 9, (1996), pp. 193-203. A preliminary version, titled: Low Contention Linearizable Counting, appeared in the Proc. of the 32nd Annual Symposium on the Foundations of Computer Science (FoCS 1991), pp. 526-535, San Juan, Puerto Rico (1991).

** Attiya, H., Lynch, N. and Nir Shavit. Are Wait-Free Algorithms Fast?**. Journal of the ACM, Vol. 41, No. 4 (July 1994), pp. 725-763. A preliminary version appeared in Proc. of the 31st Annual Symposium on the Foundations of Computer Science (FoCS 1990), pp. 55-64, St. Louis, Missouri (1990).

** Afek, Y., Dolev, D., Gafni, E., Merritt, M. and Nir Shavit. A Bounded first-in, first-enabled solution to the l-exclusion problem**. ACM Transactions on Programming Languages and Systems, (16)3, pp. 939-953 (May 1994). A preliminary version appeared in the Proc. of the 4th Workshop on Distributed Algorithms (WDAG), pp. 422-431, Bari, Italy (1990).

** Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M. and Nir Shavit. Atomic Snapshots of Shared Memory**. Journal of the ACM Vol. 40, No. 4, pp. 873-890 (September 1993). A preliminary version appeared in the Proc. of the 9th Annual ACM Symposium on Principles of Distributed Computing (PoDC 1990), pp.1-14, Quebec City, Quebec, Canada (1990).

** Lynch, N. and Nir Shavit. Timing Based Mutual Exclusion**. Proc. of the Annual Real-Time Symposium (RTSS 1992), pp. 2-11, Phoenix, Arizona (1992).

** Gawlick, R., Lynch, N. and Nir Shavit. Concurrent Time-Stamping Made Simple**. Proc. of the Annual Israel Symposium on Theory and Computing Systems (ISTCS), pp. 171-183, Haifa, Israel (1992).

** Saks, M., Shavit, N. and H. Woll. Optimal Time Randomized Consensus – Making Resilient Algorithms Fast in Practice**. Proc. of the 2nd ACM Symposium on Discrete Algorithms (SoDA 1991), pp. 351-362, San Francisco, California (1991).

** Attiya, H., Dolev, D., and Nir Shavit. Bounded Polynomial Randomized Consensus**. Proc. of the 8th Annual ACM Symposium on Principles of Distributed Computing (PoDC 1989), pp. 281-293, Edmonton, Alberta, Canada (1989).

** D. Dolev, E. Gafni, and N. Shavit. Toward a Non-Atomic Era: L-Exclusion as a Test Case**. Proc. of the 20th Annual ACM Symposium on Theory of Computing (SToC 1988), Chicago, IL, 78-92 (1988).

** N. Francez, N. Shavit. A New Approach to Detection of Locally Indicative Stability**. Proc. of the 13th International Colloquium on Automata Languages and Programming (ICALP 1986), Rennes, France, 344-358, Springer-Verlag (1986).

**Concurrent Data-Structures and Synchronization Algorithms:**

** Shavit, N. and Gadi Taubenfeld. The computability of relaxed data structures: queues and stacks as examples**. Structural Information and Communication Complexity, in the series Lecture Notes in Computer Science, Volume 9439, pp. 414-428 (2015) Springer DOI 10.1007/s00446-016-0272-0.

** Matveev, A., Shavit, N., Felber, P., and Patrick Marlier. Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming**. Proc. of the 25th ACM Symposium on Operating Systems Principles (SOSP 2015), pp. 168-183, October 4-7, 2015, Monterey, California, USA.

** Alistarh, D., Leiserson, W., Matveev, A., and Nir Shavit. ThreadScan: Automatic and Scalable Memory Reclamation**. Proc. of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2015), pp. 123-132, June 13-15, 2015, Portland, Oregon, USA.

** Dice, D., Marathe, V.J. and Nir Shavit. Lock Cohorting: A General Technique for Designing NUMA Locks**. ACM Trans. Parallel Comput. Vol. 1, Issue 2, Article 13 (February 2015), 42 pages.

** Alistarh, D., Kopinsky, J., Li, J., and Nir Shavit. The SprayList: A Scalable Relaxed Priority Queue**. Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2015), pp. 11-20, February 7-8, 2015, San Francisco, California.

** Alistarh, D., Kopinsky, J., Matveev, A. and Nir Shavit. The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm**. Proc. of the 34th Annual International Conference on Distributed Computing Systems (ICDCS 2014), Madrid, Spain (July 2014).

** Dice, D., Marathe, V.J., and Nir Shavit. Persistent Unfairness Arising From Cache Residency Imbalance (Brief Announcement)**. Proc. of the 26th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2014), pp. 82-83, Prague, Czech Republic (June 2014).

** Oshman, R. and Nir Shavit. The SkipTrie: Low-Depth Concurrent Search without Rebalancing**. Proc. of the 32nd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PoDC 2013), pp. 23-32, Montreal, Canada (July 2013).

** Calciu, I., Dice, D., Lev, Y., Luchangco, V., Marathe, V.J. and Nir Shavit. NUMA-aware reader-writer locks**. Proc. of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2013), pp. 157-166, Shenzhen, China (February 2013).

** Faith, E., Hendler, D. and Nir Shavit. On the Inherent Sequentiality of Concurrent Objects**. SIAM J Computing, Volume 41(3), pp. 519-536 (2012).

** Dice, D., Marathe, V.J. and Nir Shavit. Lock Cohorting: A General Technique for Designing NUMA locks**. Proc. of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2012), pp. 247-256, New Orleans, Louisiana (February 2012).

** Afek, Y., Avni, H. and Nir Shavit. Towards Consistency Oblivious Programming**. Proc. of the 15th International Conference on Principles of Distributed Systems (OPoDIS 2011), pp. 65-79, Toulouse, France (December 2011).

** Herlihy, M. and Nir Shavit. On the Nature of Progress**. Proc. of the 15th International Conference on Principles of Distributed Systems (OPoDIS 2011), pp. 313-328, Toulouse, France (December 2011).

** Shavit, N. Data structures in the multicore age**. Communications of the ACM 54(3): pp. 76-84 (2011).

** Dice, D., Marathe, V.J. and Nir Shavit. Flat-combining NUMA locks**. Proc. of the 24rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2011), pp. 65-74, San Jose, California (June 2011).

** Hendler, D., Incze, I., Shavit, N. and M. Tzafrir. Scalable Flat-Combining Based Synchronous Queues**. Proc. of the 23rd International Symposium on Distributed Computing (DISC 2010), pp. 79-93, Boston, MA (September 2010).

** Afek, Y., Korland, G., Natanzon, M. and Nir Shavit. Scalable Producer-Consumer Queues based on Elimination-Diffraction Trees**. Proc. of the European Conference on Parallel Computing (EuroPar), pp. 151-162, Sachia, Naples, Italy (August 2010).

** Hendler, D., Incze, I., Shavit, N. and M. Tzafrir. Flat-Combining and the Synchronization Parallelism Tradeoff**. Proc. of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 355-364, Santorini, Greece (June 2010).

** Afek, Y., Shavit, N. and M. Tzafrir. Interrupting Snapshots and the JavaTM Size() Method**. Proc. of the 23rd International Symposium on Distributed Computing (DISC 2009), pp. 78-92, Elche, Spain (September 2009).

** Herlihy, M., Shavit, N. and M. Tzafrir. Hopscotch Hashing**. Proc. of the 22nd International Symposium on Distributed Computing (DISC 2008), pp. 350-364, Arcachon, France (September 2008).

** Luchangco, V., Moir, M. and Nir Shavit. Nonblocking K-Compare-Single-Swap**. Theory of Computing Systems, vol. 44, no. 1, pp. 39-66 (January 2008).

** Hoffman, M., Shalev, O. and Nir Shavit. The Baskets Queue**. Proc. of the 11th International Conference on Principles of Distributed Systems (OPoDIS 2007), pp. 401-414, Guadeloupe, West Indies (December 2007).

** Herlihy, M., Lev, Y., Luchangco, V. and Nir Shavit. A Simple Optimistic Skip-list Algorithm**. Proceedings of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 124-138, Castiglioncello, Italy (June 2007). Also appears as a Brief Announcement in the Proc. of the 10th International Conference on Principles of Distributed Systems (OPoDIS 2006), Bordeaux, France, (December 2006).

** Moir, M. and Nir Shavit. Concurrent Data Structures (Book Chapter)**. In Handbook of Data Structures and Applications, D. Metha and S.Sahni Editors, Chapman and Hall/CRC Press, Chapter 47, pp. 47-1 to 47-30 (2004).

** Lev, Y., Herlihy, M., Luchangco, V. and Nir Shavit. A Provably Correct Scalable Skiplist (Brief Announcement)**. Proc. of the 10th International Conference On Principles of Distributed Systems (OPoDIS 2006), Bordeaux, France (December 2006). Also in Parallel Computing (EuroPar 2006), pp. 801-810, Dresden, Germany (September 2006).

** Luchangco, V., Nussbaum, D. and Nir Shavit. A Hierarchical CLH Queue Lock**. Proc. of the European Conference on Parallel Computing (EuroPar 2006), pp. 801-810, Dresden, Germany (September 2006).

** Dvir, O., Herlihy, M. and Nir Shavit. Virtual Leashing: Creating a Computational Foundation for Software Protection**. Journal of Parallel and Distributed Computing (Special Issue) 66(9), pp. 1233-1240 (September 2006). A preliminary version, titled: Virtual leashing: Internet-Based Software Protection, appeared in the Proc. of the 18th International Conference on Distributed Computing Systems (ICDCS 2005), pp. 283-292, Columbus, Ohio (2005).

** Shalev, O. and Nir Shavit. Split-Ordered Lists – Lock-free Extensible Hash Tables**. Journal of the ACM 53(3), pp. 379-405 (2006). A preliminary version appeared in the Proc. of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PoDC 2003), pp. 102-111, Boston, Massachusetts (July 2003).

** Marathe, V., Moir, M. and Nir Shavit. Composite Abortable Locks**. Proc. of the 20th IEEE International Parallel & Distributed Processing Symposium, pp. 1-10, Rhodes, Greece (April 2006).

** Hendler, D., Lev, Y., Moir, M. and Nir Shavit. A Dynamic-Sized Nonblocking Work Stealing Deque**. Distributed Computing (Special Issue), 18(3), pp. 189-207 (2006). A preliminary version, titled: Dynamic Memory ABP Work-Stealing, appeared in the Proc. of the 18th International Conference on Distributed Computing, pp. 188-200, Amsterdam, The Netherlands (October 2004).

** Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer, W. and Nir Shavit. A Lazy Concurrent List-Based Set Algorithm**. Proc. of the 9th International Conference On Principles of Distributed Systems (OPoDIS 2005), pp. 3-16, Pisa, Italy (December 2005).

** Moir, M., Nussbaum, D., Shalev, O. and Nir Shavit. Using Elimination to Implement Scalable and Lock-Free FIFO Queues**. Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 253-262, Las Vegas, Nevada (July 2005).

** Ladan-Mozes, E. and Nir Shavit. An Optimistic Approach to Lock-Free FIFO Queues**. Proc. of the 18th International Conference on Distributed Computing, pp. 117-131, Amsterdam, The Netherlands (October 2004).

** Hendler, D., N. Shavit, N. and L. Yerushalmi. A Scalable Lock-Free Stack Algorithm**. Proc. of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), pp. 206-215, Barcelona, Spain (June 2004). Submitted to the Journal of Parallel and Distributed Computing.

** Hendler, D. and Nir Shavit. Work Dealing**. Proc. of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), pp. 164 – 172, Winnipeg, Manitoba, Canada (August 2002).

** Hendler, D. and Nir Shavit. Non-Blocking Steal-half Work Queues**. Proc. of the 21st Annual ACM Symposium on Principles of Distributed Computing (PoDC 2002), pp. 280-289, Monterey, California (July 2002).

** Detlefs, D., Flood, C., Shavit, N. and X. Zhang,. Parallel Garbage Collection for Shared Memory Multiprocessors**. Proc. of the Java TM Virtual Machine Research and Technology Symposium, Monterey, California (April 2001).

** Lotan, I. and Nir Shavit. Skiplist-Based Concurrent Priority Queues.**. Proc. of the 14th International Parallel and Distributed Processing Symposium (IPDPS 2000), pp. 263-268, Cancun, Mexico (2000).

** Detlefs, D., Flood, C.H., Garthwaite, A., Martin, P., Shavit, N. and G. L. Steele Jr. Even Better DCAS-Based Concurrent Deques.**. Proc. of the 14th International Symposium on Distributed Computing (DISC 2000), Springer-Verlag, pp. 59-73, Toledo, Spain (2000).

** Aiello, W., Busch, C., Herlihy, M., Mavronicolas, M., Shavit, N. and D. Touitou. Supporting Increment and Decrement Operations in Balancing Networks**. Chicago Journal of Theoretical Computer Science, 4, MIT Press (December 2000). A preliminary version appeared in the Proc. of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS 1999), pp. 393-403, Trier, Germany (March 1999).

** Shavit, N. and A. Zemach. Scalable Concurrent Priority Queue Algorithms**. Proc. of the 18th Annual ACM Symposium on Principals of Distributed Computing (PoDC 1999), pp. 113-122, Atlanta, Georgia (1999).

** N. Shavit, E. Upfal, and A. Zemach. A Wait-free Sorting Algorithm**. Theory of Computer Systems, Vol. 34 No. 36, pp. 519-544 (November/December 2001). A preliminary version appeared in the Proc. of the 16th Annual ACM Symposium on Principles of Distributed Computing (PoDC 1997), pp. 121-128, Santa Barbara, California (1997).

** Shavit, N. and A. Zemach. Combining Funnels: A Dynamic Approach to Software Combining**. Journal of Parallel and Distributed Computing 60:11, pp. 1355-1387 (2000). A preliminary version, titled: Combining Funnels, appeared in the Proc. of the 17th Annual ACM Symposium on Principles of Distributed Computing (PoDC 1998), Puerto Vallarta, Mexico, pp. 61-70 (1998).

** Della-Libera, G. and Nir Shavit. Reactive Diffracting Trees**. Journal of Parallel and Distributed Computing 60:7, pp. 853-890 (2000). A preliminary version appeared in the Proc. of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1997), Newport, Rhode Island, pp. 24-32 (1997).

** Riany, Y., Shavit, N. and D. Touitou. Towards a Practical Snapshot Algorithm**. Theoretical Computer Science 269, pp. 163-201 (2001). A preliminary version appeared in the Proc. of the 3rd Israel Symposium on Theory and Computing Systems (ISTCS 1995), Tel Aviv, Israel, pp. 121-129 (1995).

** Shavit, N. and D. Touitou. Elimination Trees and the Construction of Pools and Stacks**. Theory of Computing Systems, Special Issue, No. 30, pp. 645-670 (1997). A preliminary version appeared in the Proc. of the Annual Symposium on Parallel Algorithms and Architectures (SPAA 1995), pp. 54-63, Santa Barbara, California (1995).

** Shavit, N. and A. Zemach. Diffracting Trees**. ACM Transactions on Computer Systems, 14:4, pp. 385-428 (1996). A preliminary version appeared in the Proc. of the Annual Symposium on Parallel Algorithms and Architectures (SPAA 1994), pp. 167-176 (1994).

** Afek, Y., Awerbuch, B., Gafni, E., Mansour, Y., Rosen, A. and Nir Shavit. Slide: the Key to Polynomial End-to-end Communication**. Journal of Algorithms, 22, pp. 158-186 (1997). Based on a paper, titled: Polynomial End-to-End Communication, which appeared in the Proc. of the 30th Annual Symposium on Foundations of Computer Science (FoCS 1989), pp. 358-363 (1989), and also on a PoDC paper by Y. Afek, E. Gafni and A. Rosen.

** Herlihy, M.P. and Nir Shavit. Applications of Algebraic Topology to Concurrent Computation**. In Applications on Advanced Architecture Computers (IAAC), Chapter 23, pp. 255-263. Greg Astfalk, editor. SIAM Press (1996). Also appeared, in slightly edited form, in Siam News, pp. 27-10 (December 1994).

** Herlihy, M.P., Lim, B.H. and Nir Shavit. Scalable Concurrent Counting**. ACM Transactions on Computer Systems, 13:4, pp. 343-364 (1995). A preliminary version, titled: Low contention load balancing on large scale multiprocessors, appeared in the Proc. of the Annual Symposium on Parallel Algorithms and Architectures (SPAA 1992), pp. 219-227, San Diego, California (1992).

** Aspnes, J., Herlihy, M.P. and Nir Shavit. Counting Networks**. Journal of the ACM, Vol. 41, No. 5, pp. 1020-1048 (September 1994). A preliminary version, titled: Counting Networks and Multi-Processor Coordination, appeared in the Proc. of the 23rd Annual Symposium on Theory of Computing (SToC 1991), pp. 348-358, New Orleans, Louisiana (1991).

**Transactional Memory Algorithms:**

** Alistarh, D., Kopinsky, J., Kuznetsov, P., Ravi, S. and Nir Shavit. Inherent Limitations of Hybrid Transactional Memory**. Proc. of the 29th International Symposium on Distributed Computing (DISC 2015), pp. 185-199, May 2015, Tokyo, Japan.

** Afek, Y., Matveev, A., Moll, O. and Nir Shavit. Amalgamated Lock-Elision**. Proc. of the 29th International Symposium on Distributed Computing (DISC 2015), pp. 309-324, May 2015, Tokyo, Japan.

** Matveev, A. and Nir Shavit. Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory**. Proc. of the 20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2015), pp. 59-71, March 14-18, 2015, Istanbul, Turkey.

** Alistarh, D., Eugster, P., Herlihy, M., Matveev, A. and Nir Shavit. StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation**. Proc. of the 9th European Conference on Computer Systems (EuroSys 2014), Article No. 25, Amsterdam, The Netherlands (April 2014).

** Afek, Y., Matveev, A. and Nir Shavit. Amalgamated Transactions: Executing Long Transactions Mostly in Hardware**. Compiler, Architecture and Tools Conference, Haifa, Israel, unpublished (November 2013).

** Avni, H., Shavit, N. and A. Suissa. Leaplist: Lessons Learned in Designing TM-Supported Range Queries**. Proc. of the 32nd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PoDC 2013), pp. 299-308, Montreal, Canada (July 2013).

** Matveev, A. and Nir Shavit. Reduced Hardware Transactions: A New Approach to Hybrid Transactional Memory**. Proc. of the 25th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2013), pp. 11-22, (March 2013).

** Herlihy, M. and Nir Shavit. Transactional memory: beyond the first two decades**. SIGACT News, Volume 43, pp. 101-103 (December 2012).

** Afek, Y., Matveev, A. and Nir Shavit. Pessimistic Software Lock-Elision**. Proc. of the 26th Annual International Symposium on Distributed Computing (DISC 2012), pp. 297-311, Salvador, Brazil (October 2012).

** Adrian Cristal, Ulrich Drepper, Stephan Diestelhorst, Alexander Dragojevic, Christoph Fetzer, Pascal Felber, Vincent Gramoli, Rachid Guerraoui, Derin Harmanci, Michael Hohmuth, Ibrahim Hur, Michal Kapalka, Guy Korland, Walther Maldonado, Patrick Marlier, Martin Nowack, Martin Pohlack, Torvald Riegel, Etienne Rivi`ere, Nir Shavit, Per Stenström, Saˇsa Tomi´c, Osman Unsal. The VELOX Transactional Memory Stack**. IEEE Micro 30(5), pp. 76-87 (September 2010).

** Dalessandro, L., Dice, D., Scott, M., Shavit, N. and M. Spear. Transactional Mutex Locks**. Proc. of the European Conference on Parallel Computing (EuroPar), 10 Pages, Sachia, Naples, Italy (August 2010).

** Dice, D. and Nir Shavit. TLRW Bytelock: Return of the Read-Write Lock**. Proc. of the Twenty Third ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 284-293, Santorini, Greece (June 2010).

** Dice, D., Matveev, A. and Nir Shavit. Implicit Privatization Using Private Transactions**. Proc. of the Transact 2010 Workshop, 10 pages, Paris, France, (April 2010).

** Korland, G., N. Shavit, and P. Felber. Noninvasive Concurrency with Java STM**. IEEE Transactions on High-Performance Embedded Architectures and Compilers, 19 pages (2010).

** Felber, P., Korland, G. and Nir Shavit. Deuce: Noninvasive concurrency with a Java STM**. Proc. of the Workshop on Programmability Issues for Multi-Core Computers (MULTIPROG), 10 pages, Pisa, Italy (March 2010).

** Avni, H. and Nir Shavit. Maintaining Consistent Transactional States without a Global Clock**. Proc. of 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 131-140, Villars-sur-Ollon, Switzerland (July 2008).

** Matveev, A., Shalev, O. and Nir Shavit. Dynamic Identification of Transactional Memory Locations**. Technical Report (2007).

** Dice, D. and Nir Shavit. Understanding Tradeoffs in Software Transactional Memory**. Proc. of the 2007 International Symposium on Code Generation and Optimization (CGO), San Jose, California (March 2007).

** Dice, D., Shalev, O. and Nir Shavit. Transactional Locking II**. Proc. of the 20th International Symposium on Distributed Computing (DISC 2006), pp. 194-208, Stockholm, Sweden (September 2006).

** Shalev, O. and Nir Shavit. Predictive Log Synchronization**. Proc. of EuroSys 2006, pp. 305-315, Leuven, Belgium (April 2006).

** Dice, D. and Nir Shavit. What Really Makes Transactions Faster?**. Proc. of the 1st TRANSACT 2006 Workshop (Transact06), Ottawa, Canada (March 2006).

** Faith, E., Hendler, D. and Nir Shavit. On the Inherent Weakness of Conditional Primitives**. Distributed Computing, 18(4), pp. 267-277 (2006). A preliminary version, titled: On the Inherent Weakness of Conditional Synchronization Primitives, appeared in the Proc. of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PoDC 2004), pp. 80-87, Saint Johns, Newfoundland, Canada (July 2004).

** Moir, M., Luchangco, F. and Nir Shavit. Non-blocking K-Compare Single Swap**. Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2003), pp. 314-323, San-Diego, California (June 2003).

** Shalev, Ori and Nir Shavit. Transient Blocking Synchronization**. Technical Report of Sun Microsystems, Inc. Mountain View, CA (2005).

** Shavit, N. and D. Touitou. Software Transactional Memory**. Distributed Computing, Special Issue, 10, pp. 99-116 (1997). A preliminary version appeared in the Proc. of the 12th Annual ACM Symposium on Principles of Distributed Computing (PoDC 1995), pp. 204-213, Ottawa, Canada (1995).

**Computational Neurobiology:**

** Lichtman, J., Pfister, H., and Shavit, N. The big data challenges of connectomics**. Nature Neuroscience, 17, pp. 1448-1454 (November 2014).

** Zeyuan Allen-Zhu, Rati Gelashvili, Silvio Micali, and Nir Shavit. Sparse sign-consistent Johnson-Lindenstrauss matrices: Compression with neuroscience-based constraints**. Proceedings of the National Academy of Sciences USA; 111(47), pp. 16872-16876 (October 2014).