scientific article; zbMATH DE number 3936509

MaRDI QIDQ3707401zbMATH OpenFDO

Authors V. M. Glushkov

Publication date 1982

zbMATH Keywords

Algebraic transformations of simple iterative algorithmsdata structuresefficiencystrongly connected components of a graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99)

Recommendations

• Some aspects of algorithm transformation based on the formalization of information connections
• scientific article; zbMATH DE number 3874635
• scientific article; zbMATH DE number 1086634
• scientific article; zbMATH DE number 4086991
• An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs

Cited in

(18)

• Some aspects of algorithm transformation based on the formalization of information connections
• scientific article; zbMATH DE number 3870590 (Why is no real title available?)
• scientific article; zbMATH DE number 3874635 (Why is no real title available?)
• scientific article; zbMATH DE number 3880874 (Why is no real title available?)
• Algorithms for computing the static single assignment form
• Composing Transformations to Optimize Linear Code
• Formal Techniques for Deriving Binary Search Algorithms
• The Algorithmic Transformation of Schemas to Structured Form
• Transformation synthesis of efficient algorithms with auxiliary specifications
• scientific article; zbMATH DE number 4086991 (Why is no real title available?)
• scientific article; zbMATH DE number 1194289 (Why is no real title available?)
• scientific article; zbMATH DE number 1086634 (Why is no real title available?)
• Transformation of algorithms written in the form of composition schemes
• scientific article; zbMATH DE number 4003556 (Why is no real title available?)
• scientific article; zbMATH DE number 844104 (Why is no real title available?)
• Deriving efficient graph algorithms
• Automata, Languages and Programming
• Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics

This page was built for publication:

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