Analysis of tree algorithm for collision resolution

zbMATH Open1099.68778MaRDI QIDQ5485312FDOQ5485312

Authors: László Györfi, Sándor Győri 

Publication date: 29 August 2006

Recommendations

• On a tree collision resolution algorithm in presence of capture
• The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
• Random infinite trees and supercritical behavior of collision resolution algorithms
• Limiting distribution of the collision resolution interval
• Dynamic tree algorithms

zbMATH Keywords

tree algorithmrandom access communicationcollision resolution time

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10)

Cited In (4)

• On a tree collision resolution algorithm in presence of capture
• On tries, contention trees and their analysis
• The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
• Interrelation of characteristics of blocked RMA stack algorithms

This page was built for publication: Analysis of tree algorithm for collision resolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485312)