Du är här

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

Publiceringsår: 1985
Språk: Engelska
Sidor: 100-102
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 31
Nummer: 1
Dokumenttyp: Artikel

Sammanfattning

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.

Disputation

Nyckelord

  • Technology and Engineering

Övrigt

Published
Yes
"This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."
  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen

LERU logo U21 logo