The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

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.

Publishing year

1985

Language

English

Pages

100-102

Publication/Series

IEEE Transactions on Information Theory

Volume

31

Issue

1

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

ISBN/ISSN/Other

  • ISSN: 0018-9448