An \(O(n)\) algorithm for computing the set of available expressions of D-charts

DOI10.1007/BF00268137zbMath0313.68031OpenAlexW2082203695MaRDI QIDQ1220380

Tadao Kasami, Kenichi Taniguchi

Publication date: 1976

Published in: Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cites Work

• Fast algorithms for the elimination of common subexpressions
• A Fast and Usually Linear Algorithm for Global Flow Analysis
• A global flow analysis algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An \(O(n)\) algorithm for computing the set of available expressions of D-charts