default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTyler Crain
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c17]Tyler Crain, Christopher Natoli, Vincent Gramoli:
Red Belly: A Secure, Fair and Scalable Open Blockchain. SP 2021: 466-483- 2020
- [c16]Christian Cachin, Daniel Collins, Tyler Crain, Vincent Gramoli:
Anonymity Preserving Byzantine Vector Consensus. ESORICS (1) 2020: 133-152 - [i7]Tyler Crain:
A Simple and Efficient Binary Byzantine Consensus Algorithm using Cryptography and Partial Synchrony. CoRR abs/2001.07867 (2020) - [i6]Tyler Crain:
A Simple and Efficient Asynchronous Randomized Binary Byzantine Consensus Algorithm. CoRR abs/2002.04393 (2020) - [i5]Tyler Crain:
Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with t<n/3 and O(n2) Messages and O(1) Round Expected Termination. CoRR abs/2002.08765 (2020) - [i4]Tyler Crain:
Experimental Evaluation of Asynchronous Binary Byzantine Consensus Algorithms with t<n/3 and O(n2) Messages and O(1) Round Expected Termination. CoRR abs/2004.09547 (2020)
2010 – 2019
- 2019
- [j3]Tyler Crain
, Vincent Gramoli, Michel Raynal:
A speculation-friendly binary search tree. Concurr. Comput. Pract. Exp. 31(4) (2019) - [i3]Christian Cachin, Daniel Collins, Tyler Crain, Vincent Gramoli:
Byzantine Fault Tolerant Vector Consensus with Anonymous Proposals. CoRR abs/1902.10010 (2019) - 2018
- [c15]Tyler Crain, Vincent Gramoli, Mikel Larrea, Michel Raynal:
DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains. NCA 2018: 1-8 - [i2]Tyler Crain, Christopher Natoli, Vincent Gramoli:
Evaluating the Red Belly Blockchain. CoRR abs/1812.11747 (2018) - 2017
- [i1]Tyler Crain, Vincent Gramoli, Mikel Larrea, Michel Raynal:
(Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains. CoRR abs/1702.03068 (2017) - 2016
- [j2]Tyler Crain, Vincent Gramoli, Michel Raynal:
A Fast Contention-Friendly Binary Search Tree. Parallel Process. Lett. 26(3): 1650015:1-1650015:17 (2016) - [c14]Alejandro Z. Tomsic, Tyler Crain, Marc Shapiro:
PhysiCS-NMSI: efficient consistent snapshots for scalable snapshot isolation. PaPoC@EuroSys 2016: 4:1-4:4 - [c13]Deepthi Devaki Akkoorath, Alejandro Z. Tomsic, Manuel Bravo, Zhongmiao Li, Tyler Crain, Annette Bieniusa, Nuno M. Preguiça, Marc Shapiro:
Cure: Strong Semantics Meets High Availability and Low Latency. ICDCS 2016: 405-414 - 2015
- [c12]Alejandro Z. Tomsic, Tyler Crain, Marc Shapiro:
An empirical perspective on causal consistency. PaPoC@EuroSys 2015: 2:1-2:3 - [c11]Tyler Crain, Marc Shapiro:
Designing a causally consistent protocol for geo-distributed partial replication. PaPoC@EuroSys 2015: 6:1-6:4 - [c10]Alejandro Z. Tomsic, Tyler Crain, Marc Shapiro:
Scaling Geo-replicated Databases to the MEC Environment. SRDS Workshop 2015: 74-79 - 2013
- [b1]Tyler Crain:
On improving the ease of use of the software transactional memory abstraction. (Faciliter l'utilisation des mémoires transactionnelles logicielles). University of Rennes 1, France, 2013 - [j1]Tyler Crain, Damien Imbs, Michel Raynal:
Towards a universal construction for transaction-based multiprocess programs. Theor. Comput. Sci. 496: 154-169 (2013) - [c9]Tyler Crain, Vincent Gramoli, Michel Raynal:
A Contention-Friendly Binary Search Tree. Euro-Par 2013: 229-240 - [c8]Tyler Crain, Vincent Gramoli, Michel Raynal:
No Hot Spot Non-blocking Skip List. ICDCS 2013: 196-205 - 2012
- [c7]Tyler Crain, Eleni Kanellou, Michel Raynal:
STM Systems: Enforcing Strong Isolation between Transactions and Non-transactional Code. ICA3PP (1) 2012: 317-331 - [c6]Tyler Crain, Damien Imbs, Michel Raynal:
Towards a Universal Construction for Transaction-Based Multiprocess Programs. ICDCN 2012: 61-75 - [c5]Tyler Crain, Vincent Gramoli, Michel Raynal:
A speculation-friendly binary search tree. PPoPP 2012: 161-170 - [c4]Tyler Crain, Vincent Gramoli, Michel Raynal:
Brief Announcement: A Contention-Friendly, Non-blocking Skip List. DISC 2012: 423-424 - 2011
- [c3]Tyler Crain, Damien Imbs, Michel Raynal:
Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible. ICA3PP (1) 2011: 244-257 - [c2]Tyler Crain, Damien Imbs, Michel Raynal:
Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible. SPAA 2011: 315-316
2000 – 2009
- 2009
- [c1]Jonathan Ventura, Marcus Jang, Tyler Crain, Tobias Höllerer, Doug A. Bowman:
Evaluating the effects of tracker reliability and field of view on a target following task in augmented reality. VRST 2009: 151-154
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:21 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:
