Showing 1–20 of 32 results
/ Date/ Name
Mar 31, 2019Efficient Concurrent Execution of Smart Contracts in Blockchains using Object-based Transactional MemoryMay 28, 2019Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent ObjectsJun 29, 2021Blunting an Adversary Against Randomized Concurrent Programs with Linearizable ImplementationsOct 5, 2025Beyond Canonical Rounds: Communication Abstractions for Optimal Byzantine ResilienceJun 23, 2025The Power of Strong Linearizability: the Difficulty of Consistent RefereeingAug 8, 2019Privatization-Safe Transactional Memories (Extended Version)Dec 20, 2020Optimal Resilience in Systems that Mix Shared Memory and Message PassingAug 9, 2023Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-CommitMar 21, 2024History-Independent Concurrent ObjectsJan 26, 2013Safety of Deferred Update in Transactional MemoryAug 10, 2017Simulating a Shared Register in a System that Never Stops ChangingDec 10, 2025Recoverable Lock-Free LocksAug 20, 2025Auditable Shared Objects: From Registers to Synchronization PrimitivesOct 24, 2025Arbitration-Free Consistency is Available (and Vice Versa)May 31, 2019Tracking in Order to Recover: Detectable Recovery of Lock-Free Data StructuresSep 5, 2021Assessing the Use Cases of Persistent Memory in High-Performance Scientific ComputingNov 20, 2020Locally Solvable Tasks and the Limitations of Valency ArgumentsMar 17, 2020Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice AgreementFeb 21, 2024Strong Linearizability using Primitives with Consensus Number 2Jan 12, 2018Safe Privatization in Transactional Memory