Imperative process algebra and models of parallel computation
From MaRDI portal
Publication:6580081
DOI10.1007/S00224-024-10164-0MaRDI QIDQ6580081
Publication date: 29 July 2024
Published in: Theory of Computing Systems (Search for Journal in Brave)
parallel random access machineparallel time complexityimperative process algebraparallel computational thesis
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inversive meadows and divisive meadows
- Communicating processes with value-passing and assignments
- A formalization of multi-tape Turing machines
- A complexity theory of efficient parallel algorithms
- Global renaming operators in concrete process algebra
- Time bounded random access machines
- The abstract variable-binding calculus
- A theory of computer instructions
- A Process Algebra for Wireless Mesh Networks
- Mechanised Computability Theory
- Simulation of Parallel Random Access Machines by Circuits
- The rational numbers as an abstract data type
- CSP with Hierarchical State
- Process algebra for synchronous communication
- A universal interconnection pattern for parallel computers
- Process Algebra
- A Model for Asynchronous Shared Memory Parallel Computation
- Parallelism Always Helps
- ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE
- Mechanising Turing Machines and Computability Theory in Isabelle/HOL
- Parallelism in random access machines
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Imperative process algebra with abstraction
This page was built for publication: Imperative process algebra and models of parallel computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580081)
