A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints

Kevin Atighehchi. A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints. J. Parallel Distrib. Comput., 137:246-251, 2020. [doi]

Abstract

Abstract is missing.