Functions of binary trees and their applications in algorithm complexity analysis

DOI10.1007/BF01074824MaRDI QIDQ3821575zbMATH OpenOpenAlexFDO

Authors A. B. Vinokur, G. P. Kozhevnikova

Publication date 1987

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01074824

zbMATH Keywords

binary treescomplexity analysisdata structurestime complexitytree stack transducers

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 4173001
• scientific article; zbMATH DE number 3854413
• Extremal properties of ?-weighted binary trees
• Tree enumeration and tree algorithm complexity computation
• Publication:4735205

Cites work

• COBLOC-A Program for All-Digital Simulation of a Hybrid Computer
• Complexity analysis of algorithms by recognition of their classification properties
• scientific article; zbMATH DE number 3815971 (Why is no real title available?)
• scientific article; zbMATH DE number 3936522 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Tree automata and attribute grammars

Cited in

(3)

• Binary search tree recursions with harmonic toll functions
• Complexity analysis of algorithms by recognition of their classification properties
• scientific article; zbMATH DE number 4173001 (Why is no real title available?)

This page was built for publication: Functions of binary trees and their applications in algorithm complexity analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3821575)