메뉴 건너뛰기




Volumn 2015-October, Issue , 2015, Pages 706-719

Demystifying incentives in the consensus computer

Author keywords

Bitcoin; Consensus computer; Cryptocurrency; Ethereum; Incentive compatibility; Verifiable computation

Indexed keywords

MINERS; SEMANTICS;

EID: 84954102636     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2810103.2813659     Document Type: Conference Paper
Times cited : (230)

References (44)
  • 28
    • 79955434234 scopus 로고    scopus 로고
    • Proving program termination
    • May
    • Byron Cook, Andreas Podelski, and Andrey Rybalchenko. Proving program termination. Commun. ACM, 54(5):88-98, May 2011.
    • (2011) Commun ACM , vol.54 , Issue.5 , pp. 88-98
    • Cook, B.1    Podelski, A.2    Rybalchenko, A.3
  • 32
    • 55249124059 scopus 로고    scopus 로고
    • Every monotone graph property is testable
    • Noga Alon and Asaf Shapira. Every monotone graph property is testable. SIAM Journal on Computing, 38(2):505-522, 2008.
    • (2008) SIAM Journal on Computing , vol.38 , Issue.2 , pp. 505-522
    • Alon, N.1    Shapira, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.