Skip to Main content Skip to Navigation
Journal articles

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

Kevin Atighehchi 1 
1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes
Document type :
Journal articles
Complete list of metadata
https://hal.archives-ouvertes.fr/hal-03488794
Contributor : Accord Elsevier CCSD Connect in order to contact the contributor
Submitted on : Thursday, July 21, 2022 - 9:52:42 AM
Last modification on : Thursday, July 21, 2022 - 9:52:43 AM

File

Vignette du document
S0743731518308682.pdf
Files produced by the author(s)

Licence

Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License
Elsevier-hosted Accepted Manuscript

Identifiers

Collections

PRES_CLERMONT | CNRS | LIMOS | CLERMONT-AUVERGNE-INP

Citation

Kevin Atighehchi. A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints. Journal of Parallel and Distributed Computing, Elsevier, 2020, 137, pp.246 - 251. ⟨10.1016/j.jpdc.2019.10.002⟩. ⟨hal-03488794⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

0

Files downloads

0