Classes of algorithms: formalization and comparison

MaRDI QIDQ4584889zbMATH OpenFDO

Authors Serge Grigorieff, Pierre Valarcher

Publication date 4 September 2018

Full work available at URL http://eatcs.org/beatcs/index.php/beatcs/article/view/70/66

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of algorithms (68W01)

Recommendations

• A representation theorem for primitive recursive algorithms
• An ASM-characterization of a class of distributed algorithms
• scientific article; zbMATH DE number 3977003
• Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
• On Gurevich's theorem on sequential algorithms

Cited in

(2)

• Axiomatization and characterization of BSP algorithms
• scientific article; zbMATH DE number 3977003 (Why is no real title available?)

This page was built for publication: Classes of algorithms: formalization and comparison

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