Maurice Herlihy | Academic Influence

Maurice Herlihy's AcademicInfluence.com Rankings

Maurice Herlihy

Computer Science

#563

World Rank

#583

Historical Rank

#307

USA Rank

Distributed Computing

#3

World Rank

#3

Historical Rank

#3

USA Rank

Database

#255

World Rank

#265

Historical Rank

#121

USA Rank

computer-science Degrees

Download Badge

Computer Science

Maurice Herlihy's Degrees

Bachelors Mathematics Stanford University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Maurice Herlihy Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Maurice Peter Herlihy is a computer scientist active in the field of multiprocessor synchronization. Herlihy has contributed to areas including theoretical foundations of wait-free synchronization, linearizable data structures, applications of combinatorial topology to distributed computing, as well as hardware and software transactional memory. He is the An Wang Professor of Computer Science at Brown University, where he has been a member of the faculty since 1994.

(See a Problem?)

Maurice Herlihy's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Linearizability: a correctness condition for concurrent objects (1990) (3304)
Transactional Memory: Architectural Support For Lock-free Data Structures (1993) (2548)
Wait-free synchronization (1991) (1926)
Software transactional memory for dynamic-sized data structures (2003) (1078)
Composable memory transactions (2005) (805)
The art of multiprocessor programming (2020) (658)
Obstruction-free synchronization: double-ended queues as an example (2003) (536)
The topological structure of asynchronous computability (1999) (483)
A methodology for implementing highly concurrent data objects (1993) (478)
Virtualizing transactional memory (2005) (417)
Transactional boosting: a methodology for highly-concurrent transactional objects (2008) (296)
Atomic Cross-Chain Swaps (2018) (290)
A flexible framework for implementing software transactional memory (2006) (286)
A quorum-consensus replication method for abstract data types (1986) (276)
Fast Randomized Consensus Using Shared Memory (1990) (268)
Toward a theory of transactional contention managers (2005) (247)
A Lazy Concurrent List-Based Set Algorithm (2005) (228)
Impossibility and universality results for wait-free synchronization (1988) (227)
A methodology for implementing highly concurrent data structures (1990) (227)
The asynchronous computability theorem for t-resilient tasks (1993) (202)
Axioms for concurrent objects (1987) (198)
A Value Transmission Method for Abstract Data Types (1982) (191)
Distributed Computing Through Combinatorial Topology (2013) (186)
The Art of Multiprocessor Programming, Revised Reprint (2012) (184)
Counting networks (1994) (170)
Hopscotch Hashing (2008) (166)
Apologizing versus asking permission: optimistic concurrency control for abstract data types (1990) (158)
Dynamic quorum adjustment for partitioned data (1987) (149)
Adding concurrency to smart contracts (2017) (145)
Inheritance of synchronization and recovery properties in Avalon/C++ (1988) (142)
The Arrow Distributed Directory Protocol (1998) (141)
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures (2002) (140)
Distributed transactional memory for metric-space networks (2005) (130)
Polymorphic Contention Management (2005) (129)
Wait-free data structures in the asynchronous PRAM model (1990) (121)
Proving correctness of highly-concurrent linearisable objects (2006) (116)
Hybrid concurrency control for abstract data types (1988) (115)
Nonblocking memory management support for dynamic-sized data structures (2005) (107)
A persistent lock-free queue for non-volatile memory (2018) (104)
A Simple Optimistic Skiplist Algorithm (2007) (100)
How to Make Replicated Data Secure (1987) (100)
Contention in shared memory algorithms (1993) (89)
Algebraic spans (1995) (85)
Tight bounds for k-set agreement (2000) (84)
Counting networks and multi-processor coordination (1991) (81)
A simple constructive computability theorem for wait-free computation (1994) (78)
Unifying synchronous and asynchronous message-passing models (1998) (78)
The decidability of distributed decision tasks (extended abstract) (1997) (78)
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement (2006) (77)
Cross-chain deals and adversarial commerce (2019) (77)
Limitations of synchronous communication with static process structure in languages for distributed computing (1986) (76)
Lock-free garbage collection for multiprocessors (1991) (75)
On the space complexity of randomized synchronization (1993) (75)
Committing conflicting transactions in an STM (2009) (75)
Concurrent Data Structures for Near-Memory Computing (2017) (73)
Coarse-grained transactions (2010) (70)
Atomic snapshots using lattice agreement (1995) (69)
Multidimensional approximate agreement in Byzantine asynchronous systems (2013) (69)
Avalon : language support for reliable distributed systems (1986) (68)
Time-Lapse Snapshots (1992) (67)
Specifying Graceful Degradation (1991) (64)
Competitive concurrent distributed queuing (2001) (63)
REPLICATION METHODS FOR ABSTRACT DATA TYPES (1984) (62)
Composable memory transactions (2005) (60)
Scalable concurrent counting (1995) (60)
Dynamic Analysis of the Arrow Distributed Protocol (2004) (60)
On the power of hardware transactional memory to simplify memory management (2011) (58)
StackTrack: an automated transactional approach to concurrent memory reclamation (2014) (58)
Robust Contention Management in Software Transactional Memory (2005) (58)
Invyswell: A hybrid transactional memory for Haswell's restricted transactional memory (2014) (57)
Blockchains from a distributed computing perspective (2019) (57)
ARGUS REFERENCE MANUAL (1987) (56)
Dreadlocks: efficient deadlock detection (2008) (54)
Set consensus using arbitrary objects (preliminary version) (1994) (52)
The Aleph Toolkit: Support for Scalable Distributed Shared Objects (1999) (51)
Optimistic concurrency control for abstract data types (1986) (49)
Checkpoints and continuations instead of nested transactions (2008) (49)
Distributed computing and the multicore revolution (2008) (49)
A tale of two directories: implementing distributed shared objects in Java (1999) (48)
Low contention load balancing on large-scale multiprocessors (1992) (48)
Optimal Randomized Fair Exchange with Secret Shared Coins (2005) (47)
Self-stabilizing distributed queuing (2001) (46)
A classification of wait-free loop agreement tasks (2003) (46)
Contention in shared memory algorithms (1993) (46)
Multidimensional agreement in Byzantine systems (2015) (45)
Embedded-TM: Energy and complexity-effective hardware transactional memory for embedded multicore systems (2010) (43)
The topology of shared-memory adversaries (2010) (43)
Concurrency versus availability: atomicity mechanisms for replicated data (1987) (43)
Algebraic Topology and Distributed Computing: A Primer (1995) (42)
A tight lower bound for k-set agreement (1993) (42)
On the Nature of Progress (2011) (42)
On the weakest failure detector ever (2007) (41)
Impossibility results for asynchronous PRAM (extended abstract) (1991) (40)
A Methodology for Implementing Highly Concurrent Data Objects (1992) (39)
An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts (2019) (39)
Power and limits of distributed computing shared memory models (2013) (39)
On the Correctness of Orphan Elimination Algorithms. (1987) (38)
Bringing practical lock-free synchronization to 64-bit applications (2004) (37)
Low contention linearizable counting (1991) (37)
Hard-Potato routing (2000) (36)
Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores (2013) (36)
Fast and Robust Memory Reclamation for Concurrent Data Structures (2016) (35)
Extending Multiversion Time-Stamping Protocols to Exploit Type Information (1987) (33)
Energy reduction in multiprocessor systems using transactional memory (2005) (32)
Tight bounds for k-set agreement with limited-scope failure detectors (2003) (32)
Ordered Multicast and Distributed Swap (2000) (32)
Randomized wait-free concurrent objects (extended abstract) (1991) (31)
Snapshots and software transactional memory (2005) (30)
The future(s) of shared data structures (2014) (30)
On the decidability of distributed decision tasks (1996) (30)
Fast non-intrusive memory reclamation for highly-concurrent data structures (2016) (30)
On the space complexity of randomized synchronization (1998) (29)
Enhancing Accountability and Trust in Distributed Ledgers (2016) (29)
Elements of Combinatorial Topology (2014) (29)
Using Elimination and Delegation to Implement a Scalable NUMA-Friendly Stack (2013) (28)
Simulations and reductions for colorless tasks (2012) (28)
Energy-Aware Microprocessor Synchronization : Transactional Memory vs . Locks (2006) (28)
Routing without flow control (2001) (27)
New Perspectives in Distributed Computing (1999) (27)
Randomized greedy hot-potato routing (2000) (26)
Linearizable counting networks (1996) (25)
Specifying graceful degradation in distributed systems (1987) (25)
Warp-aware trace scheduling for GPUs (2014) (24)
Privacy-Preserving Cross-Chain Atomic Swaps (2020) (24)
Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract) (1992) (24)
Dynamic-sized lock-free data structures (2002) (24)
The transactional manifesto: software engineering and non-blocking synchronization (2005) (24)
SoC-TM: Integrated HW/SW support for transactional memory programming on embedded MPSoCs (2011) (24)
Timestamp-Based Orphan Elimination (1989) (23)
The Adaptive Priority Queue with Elimination and Combining (2014) (22)
Distributed computability in Byzantine asynchronous systems (2013) (21)
Wait-Free Implementations in Message-Passing Systems (1999) (21)
Towards a theory of transactional contention managers (2006) (21)
The topology of distributed adversaries (2013) (20)
Encrypted Databases for Differential Privacy (2019) (20)
Energy efficient synchronization techniques for embedded architectures (2008) (19)
Visualizing transactional memory (2012) (19)
Edge-TM (2017) (19)
tm_db: A Generic Debugging Library for Transactional Programs (2009) (18)
A hardware/software framework for supporting transactional memory in a MPSoC environment (2007) (18)
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems (2009) (18)
Bounded round number (1993) (18)
Blockchains and the Future of Distributed Computing (2017) (18)
Concurrent Computing and Shellable Complexes (2010) (17)
Supporting Increment and Decrement Operations in Balancing Networks (1999) (17)
Hedging Against Sore Loser Attacks in Cross-Chain Transactions (2021) (17)
Computing in the Presence of Concurrent Solo Executions (2014) (17)
Asynchronous Computability Theorems for t-Resilient Systems (2016) (16)
Self-stabilizing smoothing and balancing networks (2006) (16)
Time-Driven Orphan Elimination (1986) (16)
Composing networks of automated market makers (2021) (15)
General quorum consensus : a replication method for abstract data types (1984) (15)
Issues Process and Communication Structure for Distributed Programs (1983) (15)
From wait-free to arbitrary concurrent solo executions in colorless distributed computing (2017) (15)
Comparing how atomicity mechanisms support replication (1985) (14)
Virtual Leashing: Internet-Based Software Piracy Protection (2005) (14)
Lower bounds for wait-free computation in message-passing systems (1990) (14)
An Equivariance Theorem with Applications to Renaming (2012) (14)
On the existence of booster types (2000) (14)
Atomicity vs. availability : concurrency control for replicated data (1985) (14)
Concurrency and availability as dual properties of replicated atomic data (1990) (13)
Energy and Throughput Efficient Transactional Memory for Embedded Multicore Systems (2010) (13)
Upper bound on the complexity of solving hard renaming (2013) (13)
A topological treatment of early-deciding set-agreement (2006) (13)
Energy Implications of Transactional Memory for Embedded Architectures (2008) (12)
Wait-Free Computation in Message-Passing Systems: Preliminary Report (1990) (12)
Concurrent Data Structures with Near-Data-Processing: an Architecture-Aware Implementation (2019) (12)
Blockchains and the Logic of Accountability: Keynote Address (2016) (12)
Preliminary Version Space-and Time-adaptive Nonblocking Algorithms (12)
Randomized smoothing networks (2004) (12)
FFT-based Gradient Sparsification for the Distributed Training of Deep Neural Networks (2020) (12)
Using type information to enhance the availability of partitioned data (1985) (11)
An Overview of Synchronous Message-Passing and Topology (2000) (11)
Well-Structured Futures and Cache Locality (2013) (10)
A Wait-Free Classification of Loop Agreement Tasks (1998) (10)
A Tutorial on Algebraic Topology and Distributed Computation (1994) (10)
Technical perspectiveHighly concurrent data structures (2009) (9)
Reasoning about Atomic Objects (1988) (9)
Language Support and Compiler Optimizations for STM and Transactional Boosting (2007) (9)
Proceedings of the Tenth European Conference on Computer Systems (2015) (9)
Improving Parallelism in Hardware Transactional Memory (2018) (9)
TRANSMITTING ABSTRACT VALUES IN MESSAGES (1980) (9)
Dynamic-sized lockfree data structures (2002) (9)
The Topology of Asynchronous Byzantine Colorless Tasks (2013) (9)
Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory (2017) (9)
Bounds on the Step and Namespace Complexity of Renaming (2019) (9)
A Survey on Counting Networks (1998) (8)
Fast Scheduling in Distributed Transactional Memory (2017) (8)
Speculative synchronization for coherence-free embedded NUMA architectures (2014) (8)
Scout: High-Performance Heterogeneous Computing Made Simple (2011) (8)
Threshold protocols in survivor set systems (2010) (8)
VBR: Version Based Reclamation (2021) (7)
Transactional memory: Architectural support for lock-free synchronization (1993) (7)
Transactional Memory Today (2010) (7)
The Multicore Revolution (2007) (7)
Well-structured futures and cache locality (2014) (7)
Time-communication impossibility results for distributed transactional memory (2018) (7)
Self-stabilizing smoothing and counting (2003) (7)
Playing with Fire: Transactional Memory Revisited for Error-Resilient and Energy-Efficient MPSoC Execution (2015) (6)
On the correctness of orphan management algorithms (1992) (6)
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions (2011) (6)
Guest Editor Introduction (2015) (6)
A Practical Transactional Memory Interface (2015) (6)
Sorting and counting networks of small depth and arbitrary width (1999) (6)
Attacking memory-hard scrypt with near-data-processing (2019) (6)
Read-modify-write networks (2004) (5)
Applications of Shellable Complexes to Distributed Computing - (Invited Talk) (2010) (5)
Potential show-stoppers for transactional synchronization (2007) (5)
SuperNeurons: FFT-based Gradient Sparsification in the Distributed Training of Deep Neural Networks (2018) (5)
The multicore revolution: the challenges for theory (2007) (5)
A safety proof of a lazy concurrent list-based set implementation (2006) (5)
CUDA-DTM: Distributed Transactional Memory for GPU Clusters (2019) (5)
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures (2017) (5)
Space and Time Adaptive Non-blocking Algorithms (2003) (5)
Brief Announcement: Linearizability: A Typo (2021) (5)
Fun with hardware transactional memory (2014) (5)
Proof-Carrying Smart Contracts (2018) (5)
Energy-Efficient and High-Performance Lock Speculation Hardware for Embedded Multicore Systems (2015) (4)
Sorting and Counting Networks of Arbitrary Width and Small Depth (2001) (4)
Enhanced Fault-Tolerance through Byzantine Failure Detection (2009) (4)
The Relative Power of Composite Loop Agreement Tasks (2015) (4)
Threshold counters with increments and decrements (2002) (4)
A New Synchronous Lower Bound for Set Agreement (2001) (4)
Impossibility Results for Distributed Transactional Memory (2015) (4)
Clairvoyant State Machine Replication (2019) (4)
Computability in distributed computing: a Tutorial (2012) (4)
Conflict Abstractions and Shadow Speculation for Optimistic Transactional Objects (2019) (4)
DREADLOCKS: Efficient Deadlock Detection for STM (2008) (4)
Linearizable concurrent objects (1988) (4)
Specifying security constraints with relaxation lattices (1989) (4)
Transactional memory: beyond the first two decades (2012) (4)
Optimistic Parallelization (1993) (4)
Teaching parallel programming (2010) (4)
Non-Blocking Garbage Collection for Multiprocessors (1990) (4)
Approximate Local Sums and Their Applications in Radio Networks (2014) (3)
Virtual Leashing: Creating a computational foundation for software protection (2006) (3)
Clairvoyant State Machine Replications (2018) (3)
Dynamic scheduling in distributed transactional memory (2020) (3)
Energy implications of multiprocessor synchronization (2006) (3)
Comparing how atomicity mechanisms support replication (1986) (3)
Adding networks (2001) (3)
Principles of Blockchain Systems (2021) (3)
Sporadic Solutions to Zero-One Exclusion Tasks (2014) (3)
Cryptoasset Competition and Market Concentration in the Presence of Network Effects (2021) (3)
Composable Transactional Objects: A Position Paper (2014) (3)
Authenticated modular maps in Haskell (2018) (3)
An algorithmic approach to the asynchronous computability theorem (2017) (3)
Implementing Distributed Capabilities without a Trusted Kernel (1991) (3)
Presentation and Publication: Loss and Slippage in Networks of Automated Market Makers (2021) (3)
Preliminary Proceedings of the Workshop on Geometry and Topology in Concurrency Theory GETCO ’ 01 Aalborg , Denmark , August 25 , 2001 (2001) (3)
Multiprocessor Synchronization and Concurrent Data Structures (2005) (2)
Algebraic Spans (Preliminary Version). (1995) (2)
Brief Announcement: Dynamic-Sized Lock-Free Data Structures∗ (2003) (2)
Cross-Chain State Machine Replication (2022) (2)
H ow to add concurrency to smart contracts (2018) (2)
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems (2015) (2)
Brief announcement: Scheduling multiple objects in distributed transactional memory (2014) (2)
HybriDS: Cache-Conscious Concurrent Data Structures for Near-Memory Processing Architectures (2022) (2)
Proceedings of the workshop on geometry and topology in concurrency theory, GETCO '01 (2001) (2)
A Combinatorial Characterization of Properties Preserved by Antitokens (2000) (2)
The future of distributed computing: renaissance or reformation? (2008) (2)
Transparent and energy-efficient speculation on NUMA architectures for embedded MPSoCs (2013) (2)
Brief announcement: concurrent non-commutative boosted transactions (2009) (2)
The Teleportation Design Pattern for Hardware Transactional Memory (2017) (2)
Lock Elision for Memcached: Power and Performance analysis on an Embedded Platform (2013) (2)
Linearizability: a Typo (2021) (2)
Type-specific replication algorithms for multiprocessors (1990) (2)
Blockchain: From Technology to Marketplaces (2020) (2)
Transactional Memory Today: A Status Report (2009) (1)
Thrifty-malloc: A HW/SW codesign for the dynamic management of hardware transactional memory in embedded multicore systems (2016) (1)
Transactional Memory: A Primer for Theorists (2009) (1)
Peer-to-Peer Multiplayer Gaming using Arrow Multicast : Peer-to-Peer Quake (2003) (1)
On the Decidability of Distributed Decision Tasks (Brief Announcement). (1996) (1)
Combinatorial Topology and Distributed Computing (2010) (1)
A Puff of Steem: Security Analysis of Decentralized Content Curation (2019) (1)
Distributed Runtime Verification of Metric Temporal Properties for Cross-Chain Protocols (2022) (1)
Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures (2012) (1)
Ordered Multi ast and Distributed (2000) (1)
Taking concurrency seriously (position paper) (1988) (1)
Asynchronous Consensus Impossibility (2008) (1)
Architectural Transactional Memory: Support for Lock-Free Data Structures (1997) (1)
A Tight Lower Bound for Processor Coordination (1995) (1)
The Seventh International Conference on Distributed Computing and Internet Technology (2011) (1)
Proceedings of the 14th International Conference on Distributed Computing (2000) (1)
Power and energy-aware architectural techniques for high-performance uniprocessor and multiprocessor systems (2006) (1)
Classifying Loop Agreement Tasks (2014) (1)
Proceedings from the Workshop on Large-Grained Parallelism (2nd) Held in Hidden Valley, Pennsylvania on October 11-14, 1987. (1987) (1)
The Arrow Distributed Dire tory Proto olMi (1998) (1)
Taking Concurrency Seriously: the Multicore Challenge (2007) (1)
Acknowledgments: We Would like to Thank 7.1 Renaming (1996) (1)
Acknowledgments: We Would like to Thank 7.1 Renaming (1996) (1)
Scheduling Multiple Objects in Distributed Transactional Memory (2014) (1)
The relative power of primitive synchronization operations (2021) (0)
Position Statement: Type Specific Replication for Multiprocessors (1990) (0)
UCL Centre for Blockchain Technologies (2020) (0)
Adding concurrency to smart contracts (2019) (0)
Simplified synchronization through optimistic linearizability (2010) (0)
The topology of distributed adversaries (2013) (0)
Session details: Keynote adress (2012) (0)
Hardware Transactional Memory Exploration in Coherence-Free Many-Core Architectures (2018) (0)
The Future of Synchronization on Multicores: The multicore transformation (Ubiquity symposium) (2014) (0)
Special issue on blockchain networks and distributed protocols (2022) (0)
Proceedings of the 2nd Workshop on Geometric and Topological Methods in Concurrency Theory, GETCO 2000, ENTCS vol. 39(2) (2000) (0)
Implementation of commit timestamps in Avalon (1991) (0)
Flexible Scheduling of Transactional Memory on Trees (2022) (0)
Cryptocurrency Market Structure and Concentration in the Presence of Network Effects (2021) (0)
Wait-Free Computability for General Tasks (2014) (0)
Thread Level Speculation (TLS) Parallelization (2011) (0)
Monitors and blocking synchronization (2021) (0)
Transactional programming (2021) (0)
Axioms for concurrent objects. Interim report (1987) (0)
Concurrent hashing and natural parallelism (2021) (0)
Mutual exclusion (2021) (0)
Behaviour Compatibility within Particular Contexts (0)
Chapter 10 – Connectivity (2014) (0)
Self-Stabilizing Smoothing and Counting Maurice Herlihy, Srikanta Tirthapura. (2003) (0)
Properties in AvalodCtF (1988) (0)
Linearizable Iterators Eli Rosenthal Linearizable Iterators Eli Rosenthal Supervised (2016) (0)
Two-Process Systems (2014) (0)
Coarse-grained transactions (extended version) (2011) (0)
Colorless Wait-Free Computation (2014) (0)
Chapter 9 – Manifold Protocols (2014) (0)
On beyond registers: wait-free readable objects (2001) (0)
Towards Hardware Accelerated Garbage Collection with Near-Memory Processing (2022) (0)
Queues, memory management, and the ABA problem (2021) (0)
Time-communication impossibility results for distributed transactional memory (2017) (0)
Linked lists: The role of locking (2021) (0)
Spin locks and contention (2021) (0)
Skiplists and balanced search (2021) (0)
Task Solvability in Different Models (2014) (0)
Review of Distributed Computing by Attiya and Welch (2000) (0)
Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121) (2012) (0)
Stacks and elimination (2021) (0)
Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
An Equivariance Theorem with Applications to Renaming (Preliminary Version) (2011) (0)
Issues with Orphan Computations in Distributed Computing Systems (2021) (0)
Issues with Orphan Computations in Distributed Computing Systems (2021) (0)
New Perspectives in Distributed Computing Invited Lecture (2007) (0)
Topology Approach in Distributed Computing (2008) (0)
Priority queues (2021) (0)
Foundations of shared memory (2021) (0)
New Challenges in Parallelism (2018) (0)
Fast Scheduling in Distributed Transactional Memory (2020) (0)
A Wait-free Classiication of Loop Agreement Tasks (extended Abstract) ? (1998) (0)
Ordered Multicast and Distributed Swap preliminary report (2000) (0)
Session details: Concurrency (2012) (0)
Blockchains and the Logic of Accountability (2016) (0)
Read-Write Protocols for General Tasks (2014) (0)
Multidimensional agreement in Byzantine systems (2015) (0)
08241 Summary - Transactional Memory : From Implementation to Application (2008) (0)
Distributed computing : 14th International Conference, DISC 2000, Toledo, Spain, October 4-6, 2000 : proceedings (2000) (0)
Applications of Algebraic Topology to Concurrent Computation (1996) (0)
08241 Abstracts Collection - Transactional Memory : From Implementation to Application (2008) (0)
Efficient Atomic Snapshots U sing Lattice Agreement ( Preliminary Version ) (2015) (0)
Towards Whatever-Scale Abstractions for Data-Driven Parallelism (2014) (0)
Renaming and Oriented Manifolds (2014) (0)
TRANSACT 2008 D READLOCKS : Efficient Deadlock Detection for STM (2008) (0)
Universality of consensus (2021) (0)
Exploiting Hardware Transactional Memory for Error-Resilient and Energy-Efficient Execution (2015) (0)
A transaction-friendly dynamic memory manager for embedded multicore systems (2015) (0)
Simulations and Reductions (2014) (0)
Immediate Snapshot Subdivisions (2014) (0)
Optimism and manual memory management (2021) (0)
An Approach for Orphan Detection (2020) (0)
Session details: Keynote address 2 (2012) (0)
Investigating Energy / Performance Tradeoffs using Transactional Memory in a MPSoC Environment (2006) (0)
N MIT / LCS / TM-406 N ON THE CORRECTNESS OF ORPHAN MANAGEMENT ALGORITHMS (0)
Invited Paper: Cross-Chain State Machine Replication (2022) (0)
Invited Paper: Failure is (literally) an Option: Atomic Commitment vs Optionality in Decentralized Finance (2021) (0)
International Conference on Blockchain Economics, Security and Protocols, Tokenomics 2019, May 6-7, 2019, Paris, France (2020) (0)
Transaction Processing over High-speed Networks (2015) (0)
New Challenges in Parallelism (Dagstuhl Seminar 17451) (2017) (0)
Transactional Memories (2011) (0)
Session details: R1 (2009) (0)
Aggressive Transactional Boosting (2008) (0)
Chapter 14 – Simulations and Reductions for Colored Tasks (2014) (0)
Ragnarok : RAndom Graphs Never ARe OK (2010) (0)
Concurrent objects (2021) (0)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
D C ] 2 8 M ay 2 01 9 Clairvoyant State Machine Replication (2019) (0)
Senior Capstone : Parallelization of Finger Trees (2014) (0)
Proceedings of the workshop on geometry and topology in concurrency theory, GETCO '00, August 21 2000 (2000) (0)
Byzantine-Resilient Colorless Computation (2014) (0)
Hardware Transactional Memory Exploration in Coherence-Free Many-Core Architectures (2018) (0)
Special issue on blockchain networks and distributed protocols (2022) (0)
Session details: Potential show-stoppers for transactional synchronization (2007) (0)
POSTER: State Teleportation via Hardware Transactional Memory (2017) (0)
An algorithmic approach to the asynchronous computability theorem (2018) (0)
Session details: Keynote talk (2009) (0)
Geometry and Topology in Concurrency and Distributed Computing (2004) (0)
! 1 ! ! Executive Summary (2012) (0)
Solvability of Colorless Tasks in Different Models (2014) (0)
Theory of Mazurkiewicz-Traces (2011) (0)
Optimizing Threshold Protocols in Adversarial Structures (2008) (0)
Data parallelism (2021) (0)
Scheduling and work distribution (2021) (0)
Invited Paper: Fault-tolerant and Expressive Cross-Chain Swaps (2022) (0)
An Equivariance Theorem with Applications to Renaming (2013) (0)
Early Foundations of a Transactional Boosting Library for Scala and Java ! (0)
Load Balanced Distributed Directories (2021) (0)
C o n c u r r e n cy and Availability as Dual Properties of Replicated Atomic Data (2011) (0)
Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
Dynamic scheduling in distributed transactional memory (2021) (0)
Counting, sorting, and distributed coordination (2021) (0)
Preliminary Proceedings of the Workshop on Geometry and Topology in Concurrency GETCO ’ 05 San Francisco , California , USA , August 21 , 2005 (2005) (0)
Experiment with Annotations after Developing a Program Using Control Abstraction, 9 Programming Methodology (2007) (0)

This paper list is powered by the following services:

Other Resources About Maurice Herlihy

en.wikipedia.org

What Schools Are Affiliated With Maurice Herlihy?

Maurice Herlihy is affiliated with the following schools: