On the formalization of the notion of a concurrent algorithm

DOI10.47743/SACS.2026.1.1MaRDI QIDQ6847333zbMATH OpenFDO

Authors C. A. Middelburg

Publication date 9 March 2026

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47743/SACS.2026.1.1

zbMATH Keywords

algorithmic equivalencecomputational equivalenceconcurrent algorithmconcurrent proto-algorithmnon-determinism

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A complexity theory of efficient parallel algorithms
• A Model for Asynchronous Shared Memory Parallel Computation
• A universal interconnection pattern for parallel computers
• Formalizing the notions of non-interactive and interactive algorithms
• scientific article; zbMATH DE number 46957 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 3241254 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3315195 (Why is no real title available?)
• Parallelism in random access machines
• Simulation of Parallel Random Access Machines by Circuits

This page was built for publication: On the formalization of the notion of a concurrent algorithm

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