default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas D. Dickerson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]Thomas D. Dickerson:
Adapting Persistent Data Structures for Concurrency and Speculation. Brown University, USA, 2019
Journal Articles
- 2020
- [j3]Thomas D. Dickerson, Paul Gazzillo
, Maurice Herlihy, Eric Koskinen:
Adding concurrency to smart contracts. Distributed Comput. 33(3-4): 209-225 (2020) - 2018
- [j2]Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Adding Concurrency to Smart Contracts. Bull. EATCS 124 (2018) - 2011
- [j1]Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson, Ying Daisy Zhuo:
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. Trans. Comput. Sci. 14: 211-238 (2011)
Conference and Workshop Papers
- 2019
- [c5]Thomas D. Dickerson, Eric Koskinen, Paul Gazzillo, Maurice Herlihy:
Conflict Abstractions and Shadow Speculation for Optimistic Transactional Objects. APLAS 2019: 313-331 - 2018
- [c4]Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Vikram Saraph, Eric Koskinen:
Proof-Carrying Smart Contracts. Financial Cryptography Workshops 2018: 325-338 - 2017
- [c3]Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures. PODC 2017: 251-253 - [c2]Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Adding Concurrency to Smart Contracts. PODC 2017: 303-312 - 2010
- [c1]Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson:
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. ISVD 2010: 132-141
Informal and Other Publications
- 2020
- [i5]Thomas D. Dickerson:
Adapting Persistent Data Structures for Concurrency and Speculation. CoRR abs/2003.07395 (2020) - 2017
- [i4]Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen:
Adding Concurrency to Smart Contracts. CoRR abs/1702.04467 (2017) - [i3]Thomas D. Dickerson, Paul Gazzillo, Eric Koskinen, Maurice Herlihy:
Proust: A Design Space for Highly-Concurrent Transactional Data Structures. CoRR abs/1702.04866 (2017) - [i2]Thomas D. Dickerson:
Fast Snapshottable Concurrent Braun Heaps. CoRR abs/1705.06271 (2017) - 2010
- [i1]Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson:
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. CoRR abs/1005.1053 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
