On the distribution of the number of computations in any finite number of subtrees for the stack algorithm
Författare
Summary, in English
Multitype branching processes have been employed to determine the stack algorithm computational distribution for one subtree. These results are extended here to the distribution of the number of computations in any finite number of subtrees. Starting from the computational distribution forK-1subsequent subtrees, a recurrent equation for the distribution forKsubsequent subtrees is determined.
Publiceringsår
1985
Språk
Engelska
Sidor
100-102
Publikation/Tidskrift/Serie
IEEE Transactions on Information Theory
Volym
31
Issue
1
Fulltext
- Available as PDF - 391 kB
- Download statistics
Länkar
Dokumenttyp
Artikel i tidskrift
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 0018-9448