Zvi Schreiber. k-root-n: An efficient O(√n) algorithm for avoiding short term double spending in Distributed Ledger Technologies such as Blockchain. IACR Cryptology ePrint Archive, 2019:827, 2019. [doi]
@article{Schreiber19,
title = {k-root-n: An efficient O(√n) algorithm for avoiding short term double spending in Distributed Ledger Technologies such as Blockchain},
author = {Zvi Schreiber},
year = {2019},
url = {https://eprint.iacr.org/2019/827},
researchr = {https://researchr.org/publication/Schreiber19},
cites = {0},
citedby = {0},
journal = {IACR Cryptology ePrint Archive},
volume = {2019},
pages = {827},
}