The following pages link to Maurice P. Herlihy (Q1176283):
Displaying 50 items.
- (Q235718) (redirect page) (← links)
- (Q1601744) (redirect page) (← links)
- The topology of distributed adversaries (Q360277) (← links)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- An equivariance theorem with applications to renaming (Q486986) (← links)
- Threshold protocols in survivor set systems (Q661005) (← links)
- Embedded-TM: energy and complexity-effective hardware transactional memory for embedded multicore systems (Q666237) (← links)
- Dynamic analysis of the arrow distributed protocol (Q863197) (← links)
- Multidimensional agreement in Byzantine systems (Q901876) (← links)
- A topological treatment of early-deciding set-agreement (Q1004319) (← links)
- Hybrid concurrency control for abstract data types (Q1176284) (← links)
- Wait-free implementations in message-passing systems (Q1292433) (← links)
- Sorting and counting networks of arbitrary width and small depth (Q1601745) (← links)
- An algorithmic approach to the asynchronous computability theorem (Q1616400) (← links)
- Asynchronous computability theorems for \(t\)-resilient systems (Q1660951) (← links)
- A classification of wait-free loop agreement tasks (Q1870526) (← links)
- Tight bounds for \(k\)-set agreement with limited-scope failure detectors (Q1953644) (← links)
- Distributed transactional memory for metric-space networks (Q1954240) (← links)
- Fast scheduling in distributed transactional memory (Q2035479) (← links)
- Time-communication impossibility results for distributed transactional memory (Q2075626) (← links)
- Dynamic scheduling in distributed transactional memory (Q2121056) (← links)
- Load balanced distributed directories (Q2139097) (← links)
- Clairvoyant state machine replication (Q2139098) (← links)
- Adding concurrency to smart contracts (Q2189168) (← links)
- Self-stabilizing smoothing and balancing networks (Q2375300) (← links)
- On the weakest failure detector ever (Q2377264) (← links)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
- Randomized smoothing networks (Q2497733) (← links)
- Virtual leashing: creating a computational foundation for software protection (Q2507138) (← links)
- (Q2703723) (← links)
- (Q2709236) (← links)
- (Q2783230) (← links)
- Competitive concurrent distributed queuing (Q2787673) (← links)
- Unifying synchronous and asynchronous message-passing models (Q2790108) (← links)
- Impossibility Results for Distributed Transactional Memory (Q2796258) (← links)
- An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems (Q2810958) (← links)
- A simple constructive computability theorem for wait-free computation (Q2817615) (← links)
- (Q2843926) (← links)
- An Equivariance Theorem with Applications to Renaming (Q2894460) (← links)
- Simulations and reductions for colorless tasks (Q2933802) (← links)
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions (Q2943400) (← links)
- The future(s) of shared data structures (Q2943609) (← links)
- tight bounds for k-set agreement with limited-scope failure detectors (Q2943758) (← links)
- On the space complexity of randomized synchronization (Q3158522) (← links)
- The topological structure of asynchronous computability (Q3158560) (← links)
- Hard-Potato routing (Q3191994) (← links)
- (Q3305190) (← links)
- (Q3397631) (← links)
- Concurrency and availability as dual properties of replicated atomic data (Q3474268) (← links)
- Fast randomized consensus using shared memory (Q3485848) (← links)
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement (Q3524315) (← links)
