TOWARDS A MORE PRECISE ANALYSIS OF AN ALGORITHM TO GENERATE BINARY-TREES - A TUTORIAL

Authors
PANHOLZER A PRODINGER H
Citation
A. Panholzer et H. Prodinger, TOWARDS A MORE PRECISE ANALYSIS OF AN ALGORITHM TO GENERATE BINARY-TREES - A TUTORIAL, Computer journal (Print), 41(3), 1998, pp. 201-204
Citations number
6
Categorie Soggetti
Computer Science Hardware & Architecture","Computer Science Information Systems","Computer Science Software Graphycs Programming","Computer Science Hardware & Architecture","Computer Science Information Systems","Computer Science Software Graphycs Programming
Journal title
Computer journal (Print) → ACNP
ISSN journal
00104620
Volume
41
Issue
3
Year of publication
1998
Pages
201 - 204
Database
ISI
SICI code
0010-4620(1998)41:3<201:TAMPAO>2.0.ZU;2-I
Abstract
For the analysis of an algorithm to generate binary trees, the behavio ur of a certain sequence of numbers is essential. In the original pape r, it was expressed by a recursion. Here, we show how to solve this (a nd similar) recursions, both explicitly and asymptotically, Some addit ional information about useful mathematical software is also provided.