2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.DC2020
Adapting Persistent Data Structures for Concurrency and Speculation
Thomas Dickerson
This work unifies insights from the systems and functional programming communities, in order to enable compositional reasoning about software which is nonetheless efficiently reali…
cs.DS2017★ 2 cited
Fast Snapshottable Concurrent Braun Heaps
Thomas D. Dickerson
This paper proposes a new concurrent heap algorithm, based on a stateless shape property, which efficiently maintains balance during insert and removeMin operations implemented wit…
cs.DC2017
Adding Concurrency to Smart Contracts
Thomas Dickerson, Paul Gazzillo, Maurice Herlihy +1
Modern cryptocurrency systems, such as Ethereum, permit complex financial transactions through scripts called smart contracts. These smart contracts are executed many, many times,…