Maurice Herlihy

According to our database1, Maurice Herlihy authored at least 251 papers between 1982 and 2019.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Bounds on the Step and Namespace Complexity of Renaming.
SIAM J. Comput., 2019

Cross-chain Deals and Adversarial Commerce.
PVLDB, 2019

Encrypted Databases for Differential Privacy.
PoPETs, 2019

Clairvoyant State Machine Replication.
CoRR, 2019

An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts.
CoRR, 2019

Blockchains from a distributed computing perspective.
Commun. ACM, 2019

Concurrent Data Structures with Near-Data-Processing: an Architecture-Aware Implementation.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

CUDA-DTM: Distributed Transactional Memory for GPU Clusters.
Proceedings of the Networked Systems - 7th International Conference, 2019

Attacking memory-hard scrypt with near-data-processing.
Proceedings of the International Symposium on Memory Systems, 2019

Conflict Abstractions and Shadow Speculation for Optimistic Transactional Objects.
Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018
Improving Parallelism in Hardware Transactional Memory.
TACO, 2018

An algorithmic approach to the asynchronous computability theorem.
J. Appl. Comput. Topol., 2018

Hardware Transactional Memory Exploration in Coherence-Free Many-Core Architectures.
International Journal of Parallel Programming, 2018

Adding Concurrency to Smart Contracts.
Bulletin of the EATCS, 2018

Time-communication impossibility results for distributed transactional memory.
Distributed Computing, 2018

SuperNeurons: FFT-based Gradient Sparsification in the Distributed Training of Deep Neural Networks.
CoRR, 2018

Load Balanced Distributed Directories.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Clairvoyant State Machine Replications.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

A persistent lock-free queue for non-volatile memory.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Atomic Cross-Chain Swaps.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Authenticated modular maps in Haskell.
Proceedings of the 3rd ACM SIGPLAN International Workshop on Type-Driven Development, 2018

Proof-Carrying Smart Contracts.
Proceedings of the Financial Cryptography and Data Security, 2018

2017
Edge-TM: Exploiting Transactional Memory for Error Tolerance and Energy Efficiency.
ACM Trans. Embedded Comput. Syst., 2017

From wait-free to arbitrary concurrent solo executions in colorless distributed computing.
Theor. Comput. Sci., 2017

New Challenges in Parallelism (Dagstuhl Seminar 17451).
Dagstuhl Reports, 2017

Proust: A Design Space for Highly-Concurrent Transactional Data Structures.
CoRR, 2017

Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Concurrent Data Structures for Near-Memory Computing.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Fast Scheduling in Distributed Transactional Memory.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

POSTER: State Teleportation via Hardware Transactional Memory.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

Blockchains and the Future of Distributed Computing.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

The Teleportation Design Pattern for Hardware Transactional Memory.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016
Topology Approach in Distributed Computing.
Encyclopedia of Algorithms, 2016

Renaming.
Encyclopedia of Algorithms, 2016

Linearizability.
Encyclopedia of Algorithms, 2016

Asynchronous Consensus Impossibility.
Encyclopedia of Algorithms, 2016

Well-Structured Futures and Cache Locality.
TOPC, 2016

Enhancing Accountability and Trust in Distributed Ledgers.
CoRR, 2016

Asynchronous Computability Theorems for t-Resilient Systems.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Fast and Robust Memory Reclamation for Concurrent Data Structures.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Blockchains and the Logic of Accountability: Keynote Address.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Fast non-intrusive memory reclamation for highly-concurrent data structures.
Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management, Santa Barbara, CA, USA, June 14, 2016

Thrifty-malloc: A HW/SW codesign for the dynamic management of hardware transactional memory in embedded multicore systems.
Proceedings of the 2016 International Conference on Compilers, 2016

2015
Guest Editor Introduction.
TOPC, 2015

Energy-Efficient and High-Performance Lock Speculation Hardware for Embedded Multicore Systems.
ACM Trans. Embedded Comput. Syst., 2015

Multidimensional agreement in Byzantine systems.
Distributed Computing, 2015

Impossibility Results for Distributed Transactional Memory.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

The Relative Power of Composite Loop Agreement Tasks.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Playing with Fire: Transactional Memory Revisited for Error-Resilient and Energy-Efficient MPSoC Execution.
Proceedings of the 25th edition on Great Lakes Symposium on VLSI, GLVLSI 2015, Pittsburgh, PA, USA, May 20, 2015

A Practical Transactional Memory Interface.
Proceedings of the Euro-Par 2015: Parallel Processing, 2015

2014
The Future of Synchronization on Multicores: The multicore transformation (Ubiquity symposium).
Ubiquity, 2014

An Equivariance Theorem with Applications to Renaming.
Algorithmica, 2014

Approximate Local Sums and Their Applications in Radio Networks.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

The Adaptive Priority Queue with Elimination and Combining.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Scheduling Multiple Objects in Distributed Transactional Memory.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Distributed computability in Byzantine asynchronous systems.
Proceedings of the Symposium on Theory of Computing, 2014

Fun with hardware transactional memory.
Proceedings of the International Conference on Management of Data, 2014

Speculative synchronization for coherence-free embedded NUMA architectures.
Proceedings of the XIVth International Conference on Embedded Computer Systems: Architectures, 2014

The future(s) of shared data structures.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Computing in the Presence of Concurrent Solo Executions.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Sporadic Solutions to Zero-One Exclusion Tasks.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

StackTrack: an automated transactional approach to concurrent memory reclamation.
Proceedings of the Ninth Eurosys Conference 2014, 2014

Composable Transactional Objects: A Position Paper.
Proceedings of the Programming Languages and Systems, 2014

Warp-aware trace scheduling for GPUs.
Proceedings of the International Conference on Parallel Architectures and Compilation, 2014

Invyswell: a hybrid transactional memory for haswell's restricted transactional memory.
Proceedings of the International Conference on Parallel Architectures and Compilation, 2014

2013
Power and limits of distributed computing shared memory models.
Theor. Comput. Sci., 2013

The topology of distributed adversaries.
Distributed Computing, 2013

The Topology of Asynchronous Byzantine Colorless Tasks
CoRR, 2013

Multidimensional approximate agreement in Byzantine asynchronous systems.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Upper bound on the complexity of solving hard renaming.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

Transparent and energy-efficient speculation on NUMA architectures for embedded MPSoCs.
Proceedings of the 1st International Workshop on Many-core Embedded Systems 2013, 2013

Using Elimination and Delegation to Implement a Scalable NUMA-Friendly Stack.
Proceedings of the 5th USENIX Workshop on Hot Topics in Parallelism, 2013

Distributed Computing Through Combinatorial Topology
Morgan Kaufmann, ISBN: 978-0-12-404578-1, 2013

2012
Transactional memory: beyond the first two decades.
SIGACT News, 2012

Computability in distributed computing: a Tutorial.
SIGACT News, 2012

Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121).
Dagstuhl Reports, 2012

Simulations and reductions for colorless tasks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Visualizing transactional memory.
Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, 2012

2011
Transactional Memories.
Proceedings of the Encyclopedia of Parallel Computing, 2011

An Equivariance Theorem with Applications to Renaming (Preliminary Version)
CoRR, 2011

Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

On the power of hardware transactional memory to simplify memory management.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

On the Nature of Progress.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Scout: High-Performance Heterogeneous Computing Made Simple.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

SoC-TM: integrated HW/SW support for transactional memory programming on embedded MPSoCs.
Proceedings of the 9th International Conference on Hardware/Software Codesign and System Synthesis, 2011

2010
Embedded-TM: Energy and complexity-effective hardware transactional memory for embedded multicore systems.
J. Parallel Distributed Comput., 2010

Threshold protocols in survivor set systems.
Distributed Computing, 2010

Teaching parallel programming: a roundtable discussion.
ACM Crossroads, 2010

Concurrent Computing and Shellable Complexes.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Coarse-grained transactions.
Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010

The topology of shared-memory adversaries.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Transactional Memory Today.
Proceedings of the Distributed Computing and Internet Technology, 2010

Energy and Throughput Efficient Transactional Memory for Embedded Multicore Systems.
Proceedings of the High Performance Embedded Architectures and Compilers, 2010

Applications of Shellable Complexes to Distributed Computing - (Invited Talk).
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
A topological treatment of early-deciding set-agreement.
Theor. Comput. Sci., 2009

An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems.
Electron. Notes Theor. Comput. Sci., 2009

Transactional Memory: A Primer for Theorists.
Bulletin of the EATCS, 2009

On the weakest failure detector ever.
Distributed Computing, 2009

Technical perspective - Highly concurrent data structures.
Commun. ACM, 2009

Committing conflicting transactions in an STM.
Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2009

Brief announcement: concurrent non-commutative boosted transactions.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Transactional Memory Today: A Status Report.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Enhanced Fault-Tolerance through Byzantine Failure Detection.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Distributed Computing and the Multicore Revolution.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

tm_db: A Generic Debugging Library for Transactional Programs.
Proceedings of the PACT 2009, 2009

2008
Topology Approach in Distributed Computing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Renaming.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Linearizability.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Asynchronous Consensus Impossibility.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Distributed computing and the multicore revolution.
SIGACT News, 2008

Composable memory transactions.
Commun. ACM, 2008

Hopscotch Hashing.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Optimizing Threshold Protocols in Adversarial Structures.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Dreadlocks: efficient deadlock detection.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Checkpoints and continuations instead of nested transactions.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Transactional boosting: a methodology for highly-concurrent transactional objects.
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2008

The future of distributed computing: renaissance or reformation?
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Energy efficient synchronization techniques for embedded architectures.
Proceedings of the 18th ACM Great Lakes Symposium on VLSI 2008, 2008

08241 Summary - Transactional Memory : From Implementation to Application.
Proceedings of the Transactional Memory: From Implementation to Application, 08.06., 2008

08241 Abstracts Collection - Transactional Memory : From Implementation to Application.
Proceedings of the Transactional Memory: From Implementation to Application, 08.06., 2008

The art of multiprocessor programming.
Morgan Kaufmann, ISBN: 978-0-12-370591-4, 2008

2007
A hardware/software framework for supporting transactional memory in a MPSoC environment.
SIGARCH Computer Architecture News, 2007

A Lazy Concurrent List-Based Set Algorithm.
Parallel Processing Letters, 2007

Distributed transactional memory for metric-space networks.
Distributed Computing, 2007

A Simple Optimistic Skiplist Algorithm.
Proceedings of the Structural Information and Communication Complexity, 2007

Potential show-stoppers for transactional synchronization.
Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

Taking Concurrency Seriously: the Multicore Challenge.
Proceedings of the IEEE 10th International Symposium on Workload Characterization, 2007

Language Support and Compiler Optimizations for STM and Transactional Boosting.
Proceedings of the Distributed Computing and Internet Technology, 2007

The Multicore Revolution.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
Self-Stabilizing Distributed Queuing.
IEEE Trans. Parallel Distrib. Syst., 2006

Dynamic Analysis of the Arrow Distributed Protocol.
Theory Comput. Syst., 2006

Randomized smoothing networks.
J. Parallel Distributed Comput., 2006

Virtual Leashing: Creating a computational foundation for software protection.
J. Parallel Distributed Comput., 2006

Self-stabilizing smoothing and balancing networks.
Distributed Computing, 2006

Subconsensus Tasks: Renaming Is Weaker Than Set Agreement.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Energy implications of multiprocessor synchronization.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Proving correctness of highly-concurrent linearisable objects.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2006

The art of multiprocessor programming.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Towards a theory of transactional contention managers.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

A flexible framework for implementing software transactional memory.
Proceedings of the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2006

2005
Nonblocking memory management support for dynamic-sized data structures.
ACM Trans. Comput. Syst., 2005

Snapshots and software transactional memory.
Sci. Comput. Program., 2005

Tight bounds for k-set agreement with limited-scope failure detectors.
Distributed Computing, 2005

Polymorphic Contention Management.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Toward a theory of transactional contention managers.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

The transactional manifesto: software engineering and non-blocking synchronization.
Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation, 2005

Optimal Randomized Fair Exchange with Secret Shared Coins.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Energy reduction in multiprocessor systems using transactional memory.
Proceedings of the 2005 International Symposium on Low Power Electronics and Design, 2005

Virtualizing Transactional Memory.
Proceedings of the 32st International Symposium on Computer Architecture (ISCA 2005), 2005

Virtual Leashing: Internet-Based Software Piracy Protection.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

2004
Read-modify-write networks.
Distributed Computing, 2004

Bringing practical lock-free synchronization to 64-bit applications.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
A classification of wait-free loop agreement tasks.
Theor. Comput. Sci., 2003

Space and Time Adaptive Non-blocking Algorithms.
Electron. Notes Theor. Comput. Sci., 2003

tight bounds for k-set agreement with limited-scope failure detectors.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Software transactional memory for dynamic-sized data structures.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Self-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

Obstruction-Free Synchronization: Double-Ended Queues as an Example.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2002
Threshold counters with increments and decrements.
Theor. Comput. Sci., 2002

Sorting and Counting Networks of Arbitrary Width and Small Depth.
Theory Comput. Syst., 2002

The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Dynamic-sized lock-free data structures.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001
Ordered Multicast and Distributed Swap.
Operating Systems Review, 2001

An Overview of Synchronous Message-Passing and Topology.
Electron. Notes Theor. Comput. Sci., 2001

A New Synchronous Lower Bound for Set Agreement.
Proceedings of the Distributed Computing, 15th International Conference, 2001

Adding Networks.
Proceedings of the Distributed Computing, 15th International Conference, 2001

Routing without flow control.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Competitive concurrent distributed queuing.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

On beyond registers: wait-free readable objects.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000
Review of Distributed Computing by Attiya and Welch.
SIGACT News, 2000

Algebraic spans.
Mathematical Structures in Computer Science, 2000

Tight bounds for k-set agreement.
J. ACM, 2000

A Combinatorial Characterization of Properties Preserved by Antitokens.
Bulletin of the EATCS, 2000

A tale of two directories: implementing distributed shared objects in Java.
Concurrency - Practice and Experience, 2000

Supporting Increment and Decrement Operations in Balancing Networks.
Chicago J. Theor. Comput. Sci., 2000

Hard-Potato routing.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Randomized greedy hot-potato routing.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On the Existence of Booster Types.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Wait-Free Implementations in Message-Passing Systems.
Theor. Comput. Sci., 1999

Time-Lapse Snapshots.
SIAM J. Comput., 1999

The topological structure of asynchronous computability.
J. ACM, 1999

Sorting and Counting Networks of Small Depth and Arbitrary Width.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

New Perspectives in Distributed Computing.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

The Aleph Toolkit: Support for Scalable Distributed Shared Objects.
Proceedings of the Network-Based Parallel Computing: Communication, 1999

1998
On the Space Complexity of Randomized Synchronization.
J. ACM, 1998

A Survey on Counting Networks.
Proceedings of the Distributed Data & Structures, 1998

A Wait-Free Classification of Loop Agreement Tasks.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

The Arrow Distributed Directory Protocol.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

Unifying Synchronous and Asynchronous Message-Passing Models.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
Contention in shared memory algorithms.
J. ACM, 1997

The Decidability of Distributed Decision Tasks (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Linearizable Counting Networks.
Distributed Computing, 1996

On the Decidability of Distributed Decision Tasks (Brief Announcement).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Applications of Algebraic Topology to Concurrent Computation.
Proceedings of the Applications on Advanced Architecture Computers, 1996

1995
Scalable Concurrent Counting.
ACM Trans. Comput. Syst., 1995

Atomic Snapshots Using Lattice Agreement.
Distributed Computing, 1995

Algebraic Spans (Preliminary Version).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Algebraic Topology and Distributed Computing: A Primer.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

A Tight Lower Bound for Processor Coordination.
Proceedings of the Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems, 1995

1994
Counting Networks.
J. ACM, 1994

A simple constructive computability theorem for wait-free computation.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Set Consensus Using Arbitrary Objects (Preliminary Version).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
A Methodology for Implementing Highly Concurrent Objects.
ACM Trans. Program. Lang. Syst., 1993

The asynchronous computability theorem for t-resilient tasks.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Bounded Round Numbers.
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

Transactional Memory: Architectural Support for Lock-Free Data Structures.
Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993

A Tight Lower Bound for k-Set Agreement
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Lock-Free Garbage Collection for Multiprocessors.
IEEE Trans. Parallel Distrib. Syst., 1992

A Methodology for Implementing Highly Concurrent Data Objects (Abstract).
Operating Systems Review, 1992

On the Correctness of Orphan Management Algorithms.
J. ACM, 1992

Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Low Contention Load Balancing on Large-Scale Multiprocessors.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1991
Specifying Graceful Degradation.
IEEE Trans. Parallel Distrib. Syst., 1991

Wait-Free Synchronization.
ACM Trans. Program. Lang. Syst., 1991

Hybrid Concurrency Control for Abstract Data Types.
J. Comput. Syst. Sci., 1991

Counting Networks and Multi-Processor Coordination
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Impossibility Results for Asynchronous PRAM (Extended Abstract).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Randomized Wait-Free Concurrent Objects (Extended Abstract).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Low Contention Linearizable Counting
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Concurrency and Availability as Dual Properties of Replicated Atomic Data
J. ACM, April, 1990

Linearizability: A Correctness Condition for Concurrent Objects.
ACM Trans. Program. Lang. Syst., 1990

Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types.
ACM Trans. Database Syst., 1990

Fast Randomized Consensus Using Shared Memory.
J. Algorithms, 1990

Position Statement: Type Specific Replication for Multiprocessors.
Proceedings of the First Workshop on the Management of Replicated Data, 1990

Wait-Free Data Structures in the Asynchronous PRAM Model.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

A Methodology for Implementing Highly Concurrent Data Structures.
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.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

1989
Timestamp-Based Orphan Elimination.
IEEE Trans. Software Eng., 1989

Linearizable concurrent objects.
SIGPLAN Notices, 1989

Taking concurrency seriously (position paper).
SIGPLAN Notices, 1989

Specifying Security Constraints with Relaxation Lattices.
Proceedings of the Second IEEE Computer Security Foundations Workshop, 1989

1988
Inheritance of Synchronization and Recovery Properties in Avalon/C++.
IEEE Computer, 1988

Impossibility and Universality Results for Wait-Free Synchronization.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

Reasoning about Atomic Objects.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1988

1987
Dynamic Quorum Adjustment for Partitioned Data.
ACM Trans. Database Syst., 1987

Concurrency versus Availability: Atomic Mechanisms for Replicated Data.
ACM Trans. Comput. Syst., 1987

Extending Multiversion Time-Stamping Protocols to Exploit Type Information.
IEEE Trans. Computers, 1987

Optimistic Concurrency Control for Abstract Data Types.
Operating Systems Review, 1987

Axioms for Concurrent Objects.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

Specifying Graceful Degradation in Distributed Systems.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

How to Make Replicated Data Secure.
Proceedings of the Advances in Cryptology, 1987

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

1986
A Quorum-Consensus Replication Method for Abstract Data Types.
ACM Trans. Comput. Syst., 1986

Comparing How Atomicity Mechanisms Support Replication.
Operating Systems Review, 1986

Time-Driven Orphan Elimination.
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.
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.
Proceedings of the Third Symposium on Reliability in Distributed Software and Database Systems, 1983

1982
A Value Transmission Method for Abstract Data Types.
ACM Trans. Program. Lang. Syst., 1982


  Loading...