DOAJ Open Access 2005

Analysis of tree algorithm for collision resolution

Laszlo Gyorfi Sándor Gyori

Lihat Sumber DOI

Abstrak

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)$.

Topik & Kata Kunci

Mathematics

Penulis (2)

Laszlo Gyorfi

Sándor Gyori

Format Sitasi

APA MLA BibTeX

Gyorfi, L., Gyori, S. (2005). Analysis of tree algorithm for collision resolution. https://doi.org/10.46298/dmtcs.3376

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3376

Informasi Jurnal

Tahun Terbit: 2005
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3376
Akses: Open Access ✓