Maurice Herlihy

Tony Hoare

Marc Shapiro

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2006

The art of multiprocessor programming.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Towards a theory of transactional contention managers.

[BibT_eX]

[DOI]

Rachid Guerraoui

Bastian Pochon

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

A flexible framework for implementing software transactional memory.

[BibT_eX]

[DOI]

Proceedings of the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2006

2005

Nonblocking memory management support for dynamic-sized data structures.

[BibT_eX]

[DOI]

ACM Trans. Comput. Syst., 2005

Snapshots and software transactional memory.

[BibT_eX]

[DOI]

Christopher Cole

Sci. Comput. Program., 2005

Tight bounds for <i>k</i>-set agreement with limited-scope failure detectors.

[BibT_eX]

[DOI]

Lucia Draque Penso

Distributed Comput., 2005

Polymorphic Contention Management.

[BibT_eX]

[DOI]

Rachid Guerraoui

Bastian Pochon

Proceedings of the Distributed Computing, 19th International Conference, 2005

Toward a theory of transactional contention managers.

[BibT_eX]

[DOI]

Rachid Guerraoui

Bastian Pochon

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

The transactional manifesto: software engineering and non-blocking synchronization.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation, 2005

Optimal Randomized Fair Exchange with Secret Shared Coins.

[BibT_eX]

[DOI]

Felix C. Freiling

Lucia Draque Penso

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Energy reduction in multiprocessor systems using transactional memory.

[BibT_eX]

[DOI]

Tali Moreshet

R. Iris Bahar

Proceedings of the 2005 International Symposium on Low Power Electronics and Design, 2005

Virtualizing Transactional Memory.

[BibT_eX]

[DOI]

Ravi Rajwar

Konrad K. Lai

Proceedings of the 32st International Symposium on Computer Architecture (ISCA 2005), 2005

Virtual Leashing: Internet-Based Software Piracy Protection.

[BibT_eX]

[DOI]

Ori Dvir

Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

2004

An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems.

[BibT_eX]

[DOI]

Proceedings of the Workshops on Geometric and Topological Methods in Concurrency Theory, 2004

Read-modify-write networks.

[BibT_eX]

[DOI]

Panagiota Fatourou

Distributed Comput., 2004

Bringing practical lock-free synchronization to 64-bit applications.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

A classification of wait-free loop agreement tasks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Space and Time Adaptive Non-blocking Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

tight bounds for k-set agreement with limited-scope failure detectors.

[BibT_eX]

[DOI]

Lucia Draque Penso

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Software transactional memory for dynamic-sized data structures.

[BibT_eX]

[DOI]

William N. Scherer III

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Self-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura.

[BibT_eX]

[DOI]

Srikanta Tirthapura

Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

Obstruction-Free Synchronization: Double-Ended Queues as an Example.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2002

Threshold counters with increments and decrements.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Sorting and Counting Networks of Arbitrary Width and Small Depth.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2002

The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 16th International Conference, 2002

Dynamic-sized lock-free data structures.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001

Ordered Multicast and Distributed Swap.

[BibT_eX]

[DOI]

Srikanta Tirthapura

ACM SIGOPS Oper. Syst. Rev., 2001

A New Synchronous Lower Bound for Set Agreement.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 15th International Conference, 2001

Adding Networks.

[BibT_eX]

[DOI]

Panagiota Fatourou

Proceedings of the Distributed Computing, 15th International Conference, 2001

Routing without flow control.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Competitive concurrent distributed queuing.

[BibT_eX]

[DOI]

Srikanta Tirthapura

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

On beyond registers: wait-free readable objects.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000

Review of Distributed Computing by Attiya and Welch.

[BibT_eX]

[DOI]

SIGACT News, 2000

Algebraic spans.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2000

Tight bounds for <i>k</i>-set agreement.

[BibT_eX]

[DOI]

J. ACM, 2000

An Overview of Synchronous Message-Passing and Topology.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on Geometry and Topology in Concurrency theory, 2000

A Combinatorial Characterization of Properties Preserved by Antitokens.

[BibT_eX]

Bull. EATCS, 2000

A tale of two directories: implementing distributed shared objects in Java.

[BibT_eX]

[DOI]

Michael P. Warres

Concurr. Pract. Exp., 2000

Supporting Increment and Decrement Operations in Balancing Networks.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2000

Hard-Potato routing.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Randomized greedy hot-potato routing.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On the Existence of Booster Types.

[BibT_eX]

[DOI]

Eric Ruppert

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Wait-Free Implementations in Message-Passing Systems.

[BibT_eX]

[DOI]

Soma Chaudhuri

Theor. Comput. Sci., 1999

Time-Lapse Snapshots.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

The topological structure of asynchronous computability.

[BibT_eX]

[DOI]

J. ACM, 1999

Sorting and Counting Networks of Small Depth and Arbitrary Width.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

New Perspectives in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

The Aleph Toolkit: Support for Scalable Distributed Shared Objects.

[BibT_eX]

[DOI]

Proceedings of the Network-Based Parallel Computing: Communication, 1999

1998

On the Space Complexity of Randomized Synchronization.

[BibT_eX]

[DOI]

Faith E. Fich

J. ACM, 1998

A Survey on Counting Networks.

[BibT_eX]

Proceedings of the Distributed Data & Structures, 1998

A Wait-Free Classification of Loop Agreement Tasks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 12th International Symposium, 1998

The Arrow Distributed Directory Protocol.

[BibT_eX]

[DOI]

Michael J. Demmer

Proceedings of the Distributed Computing, 12th International Symposium, 1998

Unifying Synchronous and Asynchronous Message-Passing Models.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997

Contention in shared memory algorithms.

[BibT_eX]

[DOI]

Cynthia Dwork

J. ACM, 1997

The Decidability of Distributed Decision Tasks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Linearizable Counting Networks.

[BibT_eX]

[DOI]

Distributed Comput., 1996

On the Decidability of Distributed Decision Tasks (Brief Announcement).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Applications of Algebraic Topology to Concurrent Computation.

[BibT_eX]

[DOI]

Proceedings of the Applications on Advanced Architecture Computers, 1996

1995

Scalable Concurrent Counting.

[BibT_eX]

[DOI]

Beng-Hong Lim

ACM Trans. Comput. Syst., 1995

Atomic Snapshots Using Lattice Agreement.

[BibT_eX]

[DOI]

Hagit Attiya

Ophir Rachman

Distributed Comput., 1995

Algebraic Spans (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Algebraic Topology and Distributed Computing: A Primer.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

A Tight Lower Bound for Processor Coordination.

[BibT_eX]

[DOI]

Proceedings of the Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems, 1995

1994

Counting Networks.

[BibT_eX]

[DOI]

J. ACM, 1994

A simple constructive computability theorem for wait-free computation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Set Consensus Using Arbitrary Objects (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993

A Methodology for Implementing Highly Concurrent Objects.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1993

The asynchronous computability theorem for t-resilient tasks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Bounded Round Numbers.

[BibT_eX]

[DOI]

Cynthia Dwork

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

Transactional Memory: Architectural Support for Lock-Free Data Structures.

[BibT_eX]

[DOI]

J. Eliot B. Moss

Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993

A Tight Lower Bound for k-Set Agreement

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Lock-Free Garbage Collection for Multiprocessors.

[BibT_eX]

[DOI]

J. Eliot B. Moss

IEEE Trans. Parallel Distributed Syst., 1992

A Methodology for Implementing Highly Concurrent Data Objects (Abstract).

[BibT_eX]

[DOI]

ACM SIGOPS Oper. Syst. Rev., 1992

On the Correctness of Orphan Management Algorithms.

[BibT_eX]

[DOI]

J. ACM, 1992

Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract).

[BibT_eX]

[DOI]

Hagit Attiya

Ophir Rachman

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Low Contention Load Balancing on Large-Scale Multiprocessors.

[BibT_eX]

[DOI]

Beng-Hong Lim

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1991

Specifying Graceful Degradation.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1991

Wait-Free Synchronization.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1991

Hybrid Concurrency Control for Abstract Data Types.

[BibT_eX]

[DOI]

William E. Weihl

J. Comput. Syst. Sci., 1991

Counting Networks and Multi-Processor Coordination

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Impossibility Results for Asynchronous PRAM (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Randomized Wait-Free Concurrent Objects (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Low Contention Linearizable Counting

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Concurrency and Availability as Dual Properties of Replicated Atomic Data

[BibT_eX]

[DOI]

J. ACM, April, 1990

Linearizability: A Correctness Condition for Concurrent Objects.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1990

Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1990

Fast Randomized Consensus Using Shared Memory.

[BibT_eX]

[DOI]

J. Algorithms, 1990

Position Statement: Type Specific Replication for Multiprocessors.

[BibT_eX]

Proceedings of the First Workshop on the Management of Replicated Data, 1990

Wait-Free Data Structures in the Asynchronous PRAM Model.

[BibT_eX]

[DOI]

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

A Methodology for Implementing Highly Concurrent Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Second ACM SIGPLAN Symposium on Princiles & Practice of Parallel Programming (PPOPP), 1990

Lower Bounds for Wait-Free Computation in Message-Passing Systems.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

1989

Timestamp-Based Orphan Elimination.

[BibT_eX]

[DOI]

Martin S. McKendry

IEEE Trans. Software Eng., 1989

Specifying Security Constraints with Relaxation Lattices.

[BibT_eX]

[DOI]

Proceedings of the Second IEEE Computer Security Foundations Workshop, 1989

1988

Linearizable concurrent objects.

[BibT_eX]

[DOI]

Proceedings of the 1988 ACM SIGPLAN Workshop on Object-based Concurrent Programming, 1988

Taking concurrency seriously (position paper).

[BibT_eX]

[DOI]

Proceedings of the 1988 ACM SIGPLAN Workshop on Object-based Concurrent Programming, 1988

Inheritance of Synchronization and Recovery Properties in Avalon/C++.

[BibT_eX]

[DOI]

David Detlefs

Computer, 1988

Impossibility and Universality Results for Wait-Free Synchronization.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

Reasoning about Atomic Objects.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1988

1987

Dynamic Quorum Adjustment for Partitioned Data.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1987

Concurrency versus Availability: Atomic Mechanisms for Replicated Data.

[BibT_eX]

[DOI]

ACM Trans. Comput. Syst., 1987

Extending Multiversion Time-Stamping Protocols to Exploit Type Information.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1987

Optimistic Concurrency Control for Abstract Data Types.

[BibT_eX]

[DOI]

ACM SIGOPS Oper. Syst. Rev., 1987

Axioms for Concurrent Objects.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

Specifying Graceful Degradation in Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

How to Make Replicated Data Secure.

[BibT_eX]

[DOI]

J. D. Tygar

Proceedings of the Advances in Cryptology, 1987

Avalon/C++.

[BibT_eX]

Proceedings of the C++ Workshop. Santa Fe, NM, USA, November 1987, 1987

1986

A Quorum-Consensus Replication Method for Abstract Data Types.

[BibT_eX]

[DOI]

ACM Trans. Comput. Syst., 1986

Comparing How Atomicity Mechanisms Support Replication.

[BibT_eX]

[DOI]

ACM SIGOPS Oper. Syst. Rev., 1986

Time-Driven Orphan Elimination.

[BibT_eX]

Martin S. McKendry

Proceedings of the Fifth Symposium on Reliability in Distributed Software and Database Systems, 1986

Limitations of Synchronous Communication with Static Process Structure in Languages for Distributed Computing.

[BibT_eX]

[DOI]

Barbara Liskov

Lucy Gilbert

Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986

1983

Issues Process and Communication Structure for Distributed Programs.

[BibT_eX]

Barbara Liskov

Proceedings of the Third Symposium on Reliability in Distributed Software and Database Systems, 1983

1982

A Value Transmission Method for Abstract Data Types.

[BibT_eX]

[DOI]