scientific article; zbMATH DE number 3848584
From MaRDI portal
Publication:3318086
Cited in
(21)- An approach to automating the verification of compact parallel coordination programs. I
- An introduction to programming multiple-processor computers
- Reducibility of synchronization structures
- Computing efficient steady state policies for deterministic dynamic programs. I
- Language hierarchies and interfaces. International summer school, Marktoberdorf, Germany, 1975
- Properties of concurrent programs
- On a distributed implementation of a decomposition method for multistage linear stochastic programs
- scientific article; zbMATH DE number 986405 (Why is no real title available?)
- scientific article; zbMATH DE number 3898198 (Why is no real title available?)
- scientific article; zbMATH DE number 3958701 (Why is no real title available?)
- scientific article; zbMATH DE number 4078775 (Why is no real title available?)
- A constant time string shuffle algorithm on reconfigurable meshes
- scientific article; zbMATH DE number 42962 (Why is no real title available?)
- scientific article; zbMATH DE number 54242 (Why is no real title available?)
- scientific article; zbMATH DE number 108539 (Why is no real title available?)
- How to solve the Santa Claus problem
- scientific article; zbMATH DE number 767454 (Why is no real title available?)
- Dealing with Priorities and Locks for Concurrent Programs
- A new proposal of concurrent process calculus
- Formal verification and evaluation of execution time in the envelope theory
- Gurevich-Harrington's games defined by finite automata
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 Q3318086)
