"k-root-n: An efficient O(√n) algorithm for avoiding short term ..."

Zvi Schreiber (2019)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-05-11

- view
  - electronic edition @ iacr.org (open access)
- export record
  dblp key:
  - journals/iacr/Schreiber19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/Schreiber19
Zvi Schreiber:
k-root-n: An efficient O(√n) algorithm for avoiding short term double spending in Distributed Ledger Technologies such as Blockchain. IACR Cryptol. ePrint Arch. 2019: 827 (2019)

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.