Laszlo Gyorfi ; Sándor Gyori - Analysis of tree algorithm for collision resolution

dmtcs:3376 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms - https://doi.org/10.46298/dmtcs.3376
Analysis of tree algorithm for collision resolutionConference paper

Authors: Laszlo Gyorfi 1; Sándor Gyori 1

  • 1 Department of Computer Science and Information Theory

For the tree algorithm introduced by [Cap79] and [TsMi78] let LN denote the expected collision resolution time given the collision multiplicity N. If L(z) stands for the Poisson transform of LN, then we show that LN−L(N)≃1.29·10−4cos(2πlog2N+0.698).

https://doi.org/10.46298/dmtcs.3376
Source: HAL:hal-01184211v1
Volume: DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: random access communication,collision resolution time,tree algorithm,[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

2 Documents citing this article

Share and export

Consultation statistics

This page has been seen 254 times.
This article's PDF has been downloaded 211 times.