Analysis of tree algorithm for collision resolution - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Analysis of tree algorithm for collision resolution

Abstract

For the tree algorithm introduced by [Cap79] and [TsMi78] let $L_N$ denote the expected collision resolution time given the collision multiplicity $N$. If $L(z)$ stands for the Poisson transform of $L_N$, then we show that $L_N - L(N) ≃ 1.29·10^-4 \cos (2 π \log _2 N + 0.698)$.
Fichier principal
Vignette du fichier
dmAD0133.pdf (122.48 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184211 , version 1 (13-08-2015)

Identifiers

Cite

Laszlo Gyorfi, Sándor Gyori. Analysis of tree algorithm for collision resolution. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.357-364, ⟨10.46298/dmtcs.3376⟩. ⟨hal-01184211⟩

Collections

INSMI TDS-MACS
39 View
688 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More