Regular Recursion Trees: Description and Theoretical Analysis

1
?????? ???????
?????? ???????
2
Goloveshkin V. A.
Goloveshkin V. A.
3
Ulyanov M. V.
Ulyanov M. V.
1 Moscow State University of Instrument Engineering and Informatics

Send Message

To: Author

GJSFR Volume 13 Issue F10

Article Fingerprint

ReserarchID

S7Y0R

Regular Recursion Trees: Description and Theoretical Analysis Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Recursive algorithms analysis by generated trees node counting refers to detailed study of their structures. In this connection the paper presents the specific description of peculiar to a number of recursive algorithms regular trees. We have developed the method which is based on introduced regular description and provides an analytical solution for a number of generated nodes at such regular tree each level. The results obtained make possible a theoretical time complexity analysis of recursive algorithms generating regular recursion trees.

4 Cites in Articles

References

  1. V Goloveshkin,M Ulyanov (2006). Chapter 6: Recursion and Combinatorics.
  2. T Corman,C Leiserson,R Rivest,K Stein (1296). Algorithms: construction and analysis, Second Edition: Translated from English.
  3. Ronald Graham,Donald Knuth,Oren Patashnik,Stanley Liu (1989). Concrete Mathematics: A Foundation for Computer Science.
  4. V Sachkov (2004). Introduction to Combinatorial methods of discrete mathematics.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

?????? ???????. 2013. \u201cRegular Recursion Trees: Description and Theoretical Analysis\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 13 (GJSFR Volume 13 Issue F10): .

Download Citation

Issue Cover
GJSFR Volume 13 Issue F10
Pg. 1- 11
Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Keywords
Classification
Not Found
Version of record

v1.2

Issue date

December 25, 2013

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 4760
Total Downloads: 2313
2026 Trends
Research Identity (RIN)
Related Research

Published Article

Recursive algorithms analysis by generated trees node counting refers to detailed study of their structures. In this connection the paper presents the specific description of peculiar to a number of recursive algorithms regular trees. We have developed the method which is based on introduced regular description and provides an analytical solution for a number of generated nodes at such regular tree each level. The results obtained make possible a theoretical time complexity analysis of recursive algorithms generating regular recursion trees.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Regular Recursion Trees: Description and Theoretical Analysis

Goloveshkin V. A.
Goloveshkin V. A.
Ulyanov M. V.
Ulyanov M. V.

Research Journals