Skip to Main content Skip to Navigation
Conference papers

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)$.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184211
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 13, 2015 - 1:34:28 PM
Last modification on : Friday, December 8, 2017 - 6:04:01 PM
Long-term archiving on: : Saturday, November 14, 2015 - 10:22:21 AM

File

dmAD0133.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184211, version 1

Collections

Citation

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. ⟨hal-01184211⟩

Share

Metrics

Record views

84

Files downloads

761