On a tree collision resolution algorithm in presence of capture
From MaRDI portal
Recommendations
- Analysis of tree algorithm for collision resolution
- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
- A class of algorithms for collision resolution with multiplicity estimation
- Efficient Collision Detection of Complex Deformable Models using AABB Trees
- Random infinite trees and supercritical behavior of collision resolution algorithms
- Tree-Based Pursuit: Algorithm and Properties
- A novel prediction‐based collision resolution algorithm
Cites work
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- Digital Search Trees Revisited
- scientific article; zbMATH DE number 4079347 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- Splitting protocols in presence of capture
Cited in
(7)- Dynamic tree algorithms
- A class of algorithms for collision resolution with multiplicity estimation
- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
- Analysis of tree algorithm for collision resolution
- Analysis of \(d\)-ary tree algorithms with successive interference cancellation
- Analysis of an optimized search algorithm for skip lists
- A note on binomial recurrences arising in the analysis of algorithms
This page was built for publication: On a tree collision resolution algorithm in presence of capture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992092)