6 citations · 14 across the 4 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
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,…
cs.DC2017★ 3 cited
Proust: A Design Space for Highly-Concurrent Transactional Data Structures
Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy +1
Most STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and…