6 citations · 14 across the 4 of their papers we have counts for
5 papers
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…
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…
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,…
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…
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks
Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson
The round-trip distance function on a geographic network (such as a road network, flight network, or utility distribution grid) defines the "distance" from a single vertex to a pai…