The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects

DOI10.1007/3-540-55719-9_76MaRDI QIDQ5204319zbMATH OpenOpenAlexFDO

Authors Ulrich Schmid

Publication date 4 December 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55719-9_76

zbMATH Keywords

asymptotic expansioncapture effectcollision resolutionfunctional equationsingle transmission

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• On a tree collision resolution algorithm in presence of capture
• Analysis of tree algorithm for collision resolution
• The average CRI-length of a controlled ALOHA collision resolution algorithm
• Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
• On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm

Cites work

• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• A perspective on multiaccess channels
• Digital Search Trees Revisited
• Generalized Digital Trees and Their Difference—Differential Equations
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 3111409 (Why is no real title available?)
• On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
• On a tree collision resolution algorithm in presence of capture
• Register Allocation for Unary–Binary Trees
• Singularity Analysis of Generating Functions
• Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation

Cited in

(8)

• Analytical depoissonization and its applications
• On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm
• The average CRI-length of a controlled ALOHA collision resolution algorithm
• On a tree collision resolution algorithm in presence of capture
• How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
• Analysis of tree algorithm for collision resolution
• Differential transcendence of Bell numbers and relatives: a Galois theoretic approach
• On the variance of a class of inductive valuations of data structures for digital search

This page was built for publication: The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects

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