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

DOI10.1007/3-540-55719-9_76zbMath1425.68024OpenAlexW1535122782MaRDI QIDQ5204319

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

functional equationasymptotic expansioncapture effectcollision resolutionsingle transmission

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Analytical depoissonization and its applications ⋮ On the variance of a class of inductive valuations of data structures for digital search ⋮ How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems

Cites Work

• Unnamed Item
• Unnamed Item
• On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
• Singularity Analysis of Generating Functions
• <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
• Register Allocation for Unary–Binary Trees
• On a tree collision resolution algorithm in presence of capture
• Generalized Digital Trees and Their Difference—Differential Equations
• Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation