Advanced

On the distribution of the number of computations in any finite number of subtrees for the stack algorithm

Johannesson, Rolf LU and Zigangirov, Kamil LU (1985) In IEEE Transactions on Information Theory 31(1). p.100-102
Abstract
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
IEEE Transactions on Information Theory
volume
31
issue
1
pages
100 - 102
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • Scopus:0021784828
ISSN
0018-9448
language
English
LU publication?
yes
id
2a441642-2e2c-4713-ab92-aa6dd43f49c0 (old id 1056908)
alternative location
http://ieeexplore.ieee.org/iel5/18/22746/01057001.pdf
date added to LUP
2008-04-17 12:45:24
date last changed
2016-10-13 04:36:30
@misc{2a441642-2e2c-4713-ab92-aa6dd43f49c0,
  abstract     = {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.},
  author       = {Johannesson, Rolf and Zigangirov, Kamil},
  issn         = {0018-9448},
  language     = {eng},
  number       = {1},
  pages        = {100--102},
  publisher    = {ARRAY(0xb17bd68)},
  series       = {IEEE Transactions on Information Theory},
  title        = {On the distribution of the number of computations in any finite number of subtrees for the stack algorithm},
  volume       = {31},
  year         = {1985},
}