Functions of binary trees and their applications in algorithm complexity analysis

DOI10.1007/BF01074824zbMath0668.68041OpenAlexW2053623021MaRDI QIDQ3821575

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

data structurestime complexitycomplexity analysisbinary treestree stack transducers

Mathematics Subject Classification ID

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

Related Items (1)

Complexity analysis of algorithms by recognition of their classification properties

Cites Work

• Complexity analysis of algorithms by recognition of their classification properties
• Tree automata and attribute grammars
• COBLOC-A Program for All-Digital Simulation of a Hybrid Computer
• Unnamed Item
• Unnamed Item
• Unnamed Item

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