On a tree collision resolution algorithm in presence of capture

DOI10.1051/ita/1992260201631zbMath0767.94001OpenAlexW141071176MaRDI QIDQ3992092

Ulrich Schmid

Publication date: 28 June 1992

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92413

zbMATH Keywords

collision resolutionpacketscapture effectscollision-type channelrandom access broadcast systemtree-algorithm

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)

Related Items (3)

Analysis of an optimized search algorithm for skip lists ⋮ A note on binomial recurrences arising in the analysis of algorithms ⋮ The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects

Cites Work

• Splitting protocols in presence of capture
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• Digital Search Trees Revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a tree collision resolution algorithm in presence of capture