Classes of algorithms: formalization and comparison

zbMATH Open1394.68424MaRDI QIDQ4584889FDOQ4584889

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

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

Mathematics Subject Classification ID

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

Cited In (2)

• Axiomatization and characterization of BSP algorithms
• Title not available (Why is that?)

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)