Blockchain (and related technologies): promise, potential, problems and progress
Mark Moir, "Spotlight" lecture series at Victoria University of Wellington, New Zealand

Solving the world's problems with good abstrations: How's that going?
Mark Moir, Multicore World 2018

Towards Understandable Smart Contracts
Harold Carr, Davin Fifield, Chris Flemming, Mark Moir, Bill Xie, Slides for Symposium on Distributed Ledger Technology (SDLT2017), Griffiths University, Gold Coast, Australia, June 13, 2017.

Adaptive Integration of Hardware and Software Lock Elision Techniques.
Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir, SPAA 2014

Adaptive integration of hardware and software lock elision techniques.
Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir, SPAA

Adaptive integration of hardware and software lock elision techniques.
Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir, SPAA 2014:188-197

Hardware extensions to make lazy subscription safe
Dave Dice, Tim Harris, Alex Kogan, Yossi Lev, Mark Moir, Extended version of our WTTM 2014 paper.

Hardware extensions to make lazy subscription safe.
Dave Dice, Timothy L. Harris, Alex Kogan, Yossi Lev, Mark Moir, CoRR

Hardware extensions to make lazy subscription safe.
Dave Dice, Timothy L. Harris, Alex Kogan, Yossi Lev, Mark Moir, CoRR abs/1407.6968 (2014)

Pitfalls of lazy subscription
Dave Dice, Tim Harris, Alex Kogan, Yossi Lev, Mark Moir, 6th Workshop on the Theory of Transactional Memory (WTTM 2014)

Towards Whatever-Scale Abstractions for Data-Driven Parallelism
Mark Moir, Maurice Herlihy, Tim Harris, Victor Luchangco, Virendra Marathe, Yossi Lev, Yujie Liu, First Workshop on Rack-Scale Computing

Constrained Data-Driven Parallelism
Tim Harris, Yossi Lev, Victor Luchangco, Virendra Marathe, Mark Moir, In Proceedings, (2013)

Message Passing or Shared Memory - Evaluating the Delegation Abstraction for Multicores.
Irina Calciu, Dave Dice, Tim Harris 0001, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir, OPODIS

Message Passing or Shared Memory - Evaluating the Delegation Abstraction for Multicores.
Irina Calciu, Dave Dice, Tim Harris 0001, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir, PODC

Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores.
Irina Calciu, Dave Dice, Tim Harris, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir, OPODIS 2013:83-97

Scalable statistics counters (Poster)
Dave Dice, Yossi Lev, Mark Moir, PPoPP 2013

Scalable statistics counters.
Dave Dice, Yossi Lev, Mark Moir, SPAA 2013:43-52

Scalable statistics counters.
Dave Dice, Yossi Lev, Mark Moir, SPAA

Scalable statistics counters.
Dave Dice, Yossi Lev, Mark Moir, PPOPP

Towards formally specifying and verifying transactional memory.
Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir, Formal Asp. Comput. (FAC) 25(5):769-799 (2013)

Using hardware transactional memory to correct and simplify and readers-writer lock algorithm.
Dave Dice, Yossi Lev, Yujie Liu, Victor Luchangco, Mark Moir, PPOPP

Using hardware transactional memory to correct and simplify and readers-writer lock algorithm.
Dave Dice, Yossi Lev, Yujie Liu, Victor Luchangco, Mark Moir, PPOPP 2013:261-270

A Framework for Formally Verifying Software Transactional Memory Algorithms.
Mohsen Lesani, Victor Luchangco, Mark Moir, CONCUR 2012:516-530

Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory.
Luke Dalessandro, Francois Carouge, Sean White, Yossi Lev, Mark Moir, Michael Scott, Michael Spear, ASPLOS 2011:39-52

On The Power of Hardware Transactional Memory to Simplify Memory Management
Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir, Conference Publication, (2011)

Towards Formally Specifying and Verifying Transactional Memory
Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir, Article, (2011)

Simplifying concurrent algorithms by exploiting hardware transactional memory.
David Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski, SPAA

Simplifying concurrent algorithms by exploiting hardware transactional memory.
David Dice, Yossi Lev, Virendra Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski, SPAA 2010:325-334

What Kinds of Applications Can Benefit from Transactional Memory?
Mark Moir, Dan Nussbaum, Daniel Nussbaum, In Proceedings, (2010)

Anatomy of a Scalable Software Transactional Memory
Yossi Lev, Victor Luchangco, Marek Olszewski, Virendra Marathe, Mark Moir, Dan Nussbaum, In Proceedings, (2009)

Early Experience with a Commercial Hardware Transactional Memory Implementation
David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum, Marek Olszewski, Technical Report, (2009)

Early experience with a commercial hardware transactional memory implementation.
David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum, ASPLOS 2009:157-168

Early experience with a commercial hardware transactional memory implementation.
David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum, ASPLOS

Exceptions and Transactions in C++
Adam Welc, Ali-Reza Adl-Tabatabai, Dan Nussbaum, Mark Moir, Peng Wu, Ravi Narayanaswamy, Victor Luchangco, Virendra Marathe, Xinmin Tian, Yang Ni, In Proceedings, (2009)

Exceptions and Transactions in C++
Adam Welc, Ali-Reza Adl-Tabatabai, Mark Moir, Mark Moir, Ravi Narayanaswamy, Victor Luchangco, Victor Luchangco, Xinmin Tian, Yang Ni, In Proceedings, (2009)

NZTM: nonblocking zero-indirection transactional memory.
Fuad Tabba, Mark Moir, James Goodman, Andrew Hay, Cong Wang, SPAA 2009:204-213

Nonblocking Algorithms and Backward Simulation.
Simon Doherty, Mark Moir, DISC 2009:274-288

Nonblocking k-Compare-Single-Swap.
Victor Luchangco, Mark Moir, Nir Shavit, In Proceedings, (2009)

The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster).
Mark Moir, Kevin Moore, Daniel Nussbaum, SPAA 2008:362

Toward high performance nonblocking software transactional memory.
Virendra Marathe, Mark Moir, PPOPP 2008:227-236

Wait-Free Synchronization.
Mark Moir, Encyclopedia of Algorithms 2008

A Lazy Concurrent List-Based Set Algorithm.
Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William Scherer III, Nir Shavit, Parallel Processing Letters (PPL) 17(4):411-424 (2007)

Efficient nonblocking software transactional memory.
Virendra Marathe, Mark Moir, PPOPP 2007:136-137

SNZI: Scalable NonZero Indicators.
Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir, PODC 2007:13-22

A dynamic-sized nonblocking work stealing deque.
Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit, Distributed Computing (DC) 18(3):189-207 (2006)

A flexible framework for implementing software transactional memory.
Maurice Herlihy, Victor Luchangco, Mark Moir, OOPSLA 2006:253-262

Composite Abortable Locks.
Virendra Marathe, Mark Moir, Nir Shavit, IPDPS 2006:1-10

Formal Verification of a Lazy Concurrent List-Based Set Algorithm.
Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir, CAV 2006:475-488

Hybrid transactional memory.
Peter Damron, Alexandra Fedorova, Yossi Lev, Victor Luchangco, Mark Moir, Daniel Nussbaum, ASPLOS 2006:336-346

A Lazy Concurrent List-Based Set Algorithm.
Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit, OPODIS 2005:3-16

Concurrency and synchronization in Java programs.
Mark Moir, Nir Shavit, Jan Vitek, Sci. Comput. Program. (SCP) 58(3):291-292 (2005)

Dynamic-Sized Nonblocking Work Stealing Deque, A
Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit, Technical Report, (2005)

Nonblocking memory management support for dynamic-sized data structures.
Maurice Herlihy, Victor Luchangco, Paul Martin, Mark Moir, ACM Trans. Comput. Syst. (TOCS) 23(2):146-196 (2005)

Obstruction-Free Algorithms Can Be Practically Wait-Free.
Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit, DISC 2005:78-92

Obstruction-Free Step Complexity: Lock-Free DCAS as an Example.
Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit, DISC 2005:493-494

Using elimination to implement scalable and lock-free FIFO queues.
Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit, SPAA 2005:253-262

Bringing practical lock-free synchronization to 64-bit applications.
Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir, PODC 2004:31-39

DCAS is not a silver bullet for nonblocking algorithm design.
Simon Doherty, David Detlefs, Lindsay Groves, Christine Flood, Victor Luchangco, Paul Martin, Mark Moir, Nir Shavit, Guy Steele Jr., SPAA 2004:216-224

Formal Verification of a Practical Lock-Free Queue Algorithm.
Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir, FORTE 2004:97-114

Nonblocking k-compare-single-swap.
Victor Luchangco, Mark Moir, Nir Shavit, SPAA 2003:314-323

Obstruction-Free Synchronization: Double-Ended Queues as an Example.
Maurice Herlihy, Victor Luchangco, Mark Moir, ICDCS 2003:522-529

On the Uncontended Complexity of Consensus.
Victor Luchangco, Mark Moir, Nir Shavit, DISC 2003:45-59

Software transactional memory for dynamic-sized data structures.
Maurice Herlihy, Victor Luchangco, Mark Moir, William Scherer III, PODC 2003:92-101

Space and Time Adaptive Non-blocking Algorithms.
Maurice Herlihy, Victor Luchangco, Mark Moir, Electr. Notes Theor. Comput. Sci. (ENTCS) 78:260-280 (2003)

DCAS-Based Concurrent Deques.
Ole Agesen, David Detlefs, Christine Flood, Alexander Garthwaite, Paul Martin, Mark Moir, Nir Shavit, Guy Steele Jr., Theory Comput. Syst. (MST) 35(3):349-386 (2002)

DCAS-based Concurrent Deques Supporting Bulk Allocation
Mark Moir, Guy Steele, Paul Martin, Technical Report, (2002)

Dynamic-sized Lockfree Data Structures
Victor Luchangco, Paul Martin, Mark Moir, Maurice Herlihy, Technical Report, (2002)

Dynamic-sized lock-free data structures.
Maurice Herlihy, Victor Luchangco, Paul Martin, Mark Moir, PODC 2002:131

Lock-free reference counting.
David Detlefs, Paul Martin, Mark Moir, Guy Steele Jr., Distributed Computing (DC) 15(4):255-271 (2002)

Repeat Offender Problem: A Mechanism for Supporting Dynamic-sized Lock-free Data Structures, The
Maurice Herlihy, Victor Luchangco, Mark Moir, Technical Report, (2002)

The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures.
Maurice Herlihy, Victor Luchangco, Mark Moir, DISC 2002:339-353

A General Resource Allocation Synchronization Problem.
Patrick Keane, Mark Moir, ICDCS 2001:557-564

A Simple Local-Spin Group Mutual Exclusion Algorithm.
Patrick Keane, Mark Moir, IEEE Trans. Parallel Distrib. Syst. (TPDS) 12(7):673-685 (2001)

A simple proof technique for priority-scheduled systems.
James Anderson, Mark Moir, Srikanth Ramamurthy, Inf. Process. Lett. (IPL) 77(2-4):63-70 (2001)

Correction: practical implementations of non-blocking synchronization primitives.
Mark Moir, PODC 2001:323

Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions.
Mark Moir, Distributed Computing (DC) 14(4):193-204 (2001)

Lock-free reference counting.
David Detlefs, Paul A. Martin, Mark Moir, Guy L. Steele Jr., PODC 2001:190-199

Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions.
Mark Moir, PODC 2000:61-70

Static-Priority Periodic Scheduling on Multiprocessors.
Srikanth Rarnarnurthy, Mark Moir, RTSS 2000:69-78

Static-Priority Periodic Scheduling on Multiprocessors.
Srikanth Rarnarnurthy, Mark Moir, IEEE Real-Time Systems Symposium 2000:69-78

netnice: nice is not only for CPUs-a simple subnetwork bandwidth management scheme.
Takashi Okumura, Mark Moir, Daniel Mossé, ICCCN 2000:388-395

A Simple Local-Spin Group Mutual Exclusion Algorithm.
Patrick Keane, Mark Moir, PODC 1999:23-32

Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources.
Mark Moir, Srikanth Ramamurthy, RTSS 1999:294-303

Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources.
Mark Moir, Srikanth Ramamurthy, IEEE Real-Time Systems Symposium 1999:294-303

Universal Constructions for Large Objects.
James Anderson, Mark Moir, IEEE Trans. Parallel Distrib. Syst. (TPDS) 10(12):1317-1332 (1999)

Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling.
James Anderson, Mark Moir, PODC 1999:123-132

Fast, Long-Lived Renaming Improved and Simplified.
Mark Moir, Juan Garay, Sci. Comput. Program. (SCP) 30(3):287-308 (1998)

Synchronization Mechanisms for SCRAMNet+ Systems.
Stephen Menke, Mark Moir, Srikanth Ramamurthy, PODC 1998:71-80

Practical Implementations of Non-Blocking Synchronization Primitives.
Mark Moir, PODC 1997:219-228

Transparent Support for Wait-Free Transactions.
Mark Moir, WDAG 1997:305-319

Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations.
James Anderson, Mark Moir, Distributed Computing (DC) 11(1):1-20 (1997)

Fast, Long-Lived Renaming Improved and Simplified (Abstract).
Mark Moir, Juan Garay, PODC 1996:152

Fast, Long-Lived Renaming Improved and Simplified.
Mark Moir, Juan A. Garay, WDAG 1996:287-303

Lock-Free Transactions for Real-Time Systems.
James Anderson, Srikanth Ramamurthy, Mark Moir, Kevin Jeffay, RTDB 1996:103-110

Real-Time Object Sharing with Minimal System Support (Extended Abstract).
Srikanth Ramamurthy, Mark Moir, James Anderson, PODC 1996:233-242

Long-Lived Renaming Made Fast.
Harry Buhrman, Juan Garay, Jaap-Henk Hoepman, Mark Moir, PODC 1995:194-203

Universal Constructions for Large Objects.
James H. Anderson, Mark Moir, WDAG 1995:168-182

Universal Constructions for Multi-Object Operations.
James Anderson, Mark Moir, PODC 1995:184-193

Wait-Free Algorithms for Fast, Long-Lived Renaming.
Mark Moir, James Anderson, Sci. Comput. Program. (SCP) 25(1):1-39 (1995)

Fast, Long-Lived Renaming (Extended Abstract).
Mark Moir, James Anderson, WDAG 1994:141-155

System And Method For Implementing Shared Probabilistic Counters Storing Update Probability Values
(Aug 16, 2016)

System And Method For Implementing Reader-Writer Locks Using Hardware Transactional Memory
(May 17, 2016)

System And Method For Mitigating The Impact Of Branch Misprediction When Exiting Spin Loops
(Apr 5, 2016)

System And Method For Implementing Scalable Contention-Adaptive Statistics Counters
(Nov 10, 2015)

Systems And Methods For Adaptive Integration Of Hardware And Software Lock Elision Techniques
(Nov 10, 2015)

Supporting Targeted Stores In A Shared-Memory Multiprocessor System
(Aug 18, 2015)

System And Method For Performing Memory Management Using Hardware Transactions
(May 26, 2015)

Monitoring Multiple Memory Locations For Targeted Stores In A Shared-Memory Multiprocessor
(Mar 24, 2015)

System And Method For Implementing Numa-Aware Statistics Counters
(Dec 23, 2014)

Method And System For Optimizing Code For A Multi-Threaded Application
(Sep 2, 2014)

System and method for reducing serialization in transactional memory using gang release of blocked threads
(Jul 22, 2014)

Method and system for hardware feedback in transactional memory
(Jul 8, 2014)

System And Method For Performing Dynamic Mixed Mode Read Validation In A Software Transactional Memory
(Nov 26, 2013)

System And Method For Performing Incremental Register Checkpointing In Transactional Memory
(Oct 15, 2013)

System And Method For Utilizing Available Best Effort Hardware Mechanisms For Supporting Transactional Memory
(Sep 10, 2013)

System And Method For Optimizing A Code Section By Forcing A Code Section To Be Executed Atomically
(Sep 10, 2013)

System And Method For Executing A Transaction Using Parallel Co-Transactions
(Jun 11, 2013)

System And Method For Providing Locale-Based Optimizations In A Transactional Memory
(Apr 9, 2013)

Value recycling facility for multithreaded computations
(Apr 2, 2013)

System And Method For Managing Contention In Transactional Memory Using Global Execution Data
(Mar 19, 2013)

System And Method For Committing Results Of A Software Transaction Using A Hardware Transaction
(Mar 19, 2013)

Efficient Implicit Privatization Of Transactional Memory
(Dec 11, 2012)

Watchpoints On Transactional Variables
(Nov 20, 2012)

Atomic Groups For Debugging
(Nov 6, 2012)

Advice-Based Feedback For Transactional Execution
(Oct 2, 2012)

Obstruction-Free Synchronization For Shared Data Structures
(Aug 14, 2012)

System And Method For Performing Visible And Semi-Visible Read Operations In A Software Transactional Memory
(Aug 7, 2012)

Efficient non-blocking K-compare-single-swap operation
(Jul 24, 2012)

Facilitating Transactional Execution Through Feedback About Misspeculation
(Jul 17, 2012)

Systems And Methods For Supporting Software Transactional Memory Using Inconsistency-Aware Compilers And Libraries
(Jul 3, 2012)

Viewing And Modifying Transactional Variables
(May 15, 2012)

Software transactional memory for dynamically sizable shared data structures
(May 8, 2012)

System And Method For Implementing Nonblocking Zero-Indirection Transactional Memory
(Mar 20, 2012)

Method And Apparatus For Improving Transactional Memory Interactions By Tracking Object Visibility
(Feb 14, 2012)

Using Transactional Memory With Early Release To Implement Non-Blocking Dynamic-Sized Data Structure
(Dec 6, 2011)

Globally Incremented Variable Or Clock Based Methods And Apparatus To Implement Parallel Transactions
(Sep 27, 2011)

Space-and time-adaptive nonblocking algorithms
(Sep 13, 2011)

Composite Abortable Locks
(Jul 19, 2011)

System And Method For Supporting Phased Transactional Memory Modes
(Jun 21, 2011)

System And Method For Supporting Multiple Alternative Methods For Executing Transactions
(Apr 5, 2011)

Value Recycling Facility For Multithreaded Computations
(Mar 15, 2011)

Software transactional memory for dynamically sizable shared data structures
(Feb 22, 2011)

Method and apparatus for emulating linked-load/store-conditional synchronization
(Jan 11, 2011)

Efficient non-blocking K-compare-single-swap operation
(Jan 4, 2011)

Replay Debugging
(Dec 7, 2010)

Delayed Breakpoints
(Nov 23, 2010)

Scalable And Lock-Free First-In-First-Out Queue Implementation
(Nov 16, 2010)

Coordinating Accesses To Shared Objects Using Transactional Memory Mechanisms And Non-Transactional Software Mechanisms
(Oct 19, 2010)

Quickly Reacquirable Locks
(Oct 12, 2010)

Code Preparation Technique Employing Lock-Free Pointer Operations
(Sep 28, 2010)

System And Method For Implementing Hybrid Single-Compare-Single-Store Operations
(Sep 7, 2010)

Efficient non-blocking k-compare-single-swap operation
(Sep 7, 2010)

Method And System For Implementing A Concurrent Set Of Objects
(Aug 31, 2010)

Scalable Method For Producer And Consumer Elimination
(Aug 17, 2010)

Lightweight Reference Counting Using Single-Target Synchronization
(Aug 3, 2010)

Read Sharing Using Global Conflict Indication And Semi-Transparent Reading In A Transactional Memory Space
(May 4, 2010)

Technique To Allow A First Transaction To Wait On Condition That Affects Its Working Set
(Apr 20, 2010)

System And Method For Executing Transactions
(Mar 30, 2010)

Obstruction-Free Mechanism For Atomic Update Of Multiple Non-Contiguous Locations In Shared Memory
(Mar 23, 2010)

Instruction Set Architecture Employing Conditional Multistore Synchronization
(Mar 16, 2010)

Practical Implementation Of Arbitrary-Sized Ll/Sc Variables
(Mar 16, 2010)

Methods and apparatus to implement parallel transactions
(Dec 29, 2009)

Breakpoints in a transactional memory-based representation of code
(Nov 17, 2009)

Space-Adaptive Lock-Free Queue Using Pointer-Sized Single-Target Synchronization
(Aug 18, 2009)

Space-Adaptive Lock-Free Free-List Using Pointer-Sized Single-Target Synchronization
(May 12, 2009)

Non-blocking growable arrays
(Mar 10, 2009)

Controlling Contention Via Transactional Timers Among Conflicting Transactions Issued By Processors Operating In Insistent Or Polite Mode
(Feb 24, 2009)

Conditional Synchronization Mechanisms Allowing Multiple Store Operations To Become Visible While A Flagged Memory Location Is Owned And Remains Unchanged
(Jan 20, 2009)

Ensuring Progress In A System That Supports Execution Of Obstruction-Free Operations
(Jan 6, 2009)

Shared Synchronized Skip-List Data Structure And Technique Employing Linearizable Operations
(Sep 9, 2008)

Avoiding locks by transactionally executing critical sections
(Jul 8, 2008)

Space- And Time-Adaptive Nonblocking Algorithms
(Jul 1, 2008)

Hybrid software/hardware transactional memory
(Jul 1, 2008)

Selectively unmarking load-marked cache lines during transactional program execution
(Jun 17, 2008)

Shared Lease Instruction Support For Transient Blocking Synchronization
(Apr 1, 2008)

Exclusive Lease Instruction Support For Transient Blocking Synchronization
(Mar 18, 2008)

Software Transactional Memory For Dynamically Sizable Shared Data Structures
(Feb 5, 2008)

Single-Word Lock-Free Reference Counting
(Nov 20, 2007)

Efficient Non-Blocking K-Compare-Single-Swap Operation
(Nov 6, 2007)

Lock-Free Implementation Of Dynamic-Sized Shared Data Structure
(Aug 7, 2007)

Method And Apparatus For Releasing Memory Locations During Transactional Execution
(Apr 17, 2007)

Non-Blocking Memory Management Mechanism For Supporting Dynamic-Sized Data Structures
(Mar 20, 2007)

Non-Blocking Growable Arrays
(Jan 30, 2007)

Selectively unmarking load-marked cache lines during transactional program execution
(Aug 8, 2006)

Concurrent Shared Object Implemented Using A Linked-List With Amortized Node Allocation
(Mar 21, 2006)

Lock Free Reference Counting
(Jan 31, 2006)

Lock-Free Implementation Of Concurrent Shared Object With Dynamic Node Allocation And Distinguishing Pointer Value
(Nov 30, 2004)