ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES.
- Published in:
- International Journal of Foundations of Computer Science, 1992, v. 3, n. 3, p. 379, doi. 10.1142/S0129054192000206
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 1992 AND VI 3 AND IP 3
Results: 6
1
2
FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS.
- Published in:
- International Journal of Foundations of Computer Science, 1992, v. 3, n. 3, p. 233, doi. 10.1142/S0129054192000152
- By:
- Publication type:
- Article
3
ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS.
- Published in:
- International Journal of Foundations of Computer Science, 1992, v. 3, n. 3, p. 323, doi. 10.1142/S0129054192000188
- By:
- Publication type:
- Article
4
A UNIFICATION ALGORITHM FOR THE λΠ-CALCULUS.
- Published in:
- International Journal of Foundations of Computer Science, 1992, v. 3, n. 3, p. 333, doi. 10.1142/S012905419200019X
- By:
- Publication type:
- Article
5
A CALCULUS OF TIMED COMMUNICATING SYSTEMS.
- Published in:
- International Journal of Foundations of Computer Science, 1992, v. 3, n. 3, p. 303, doi. 10.1142/S0129054192000176
- By:
- Publication type:
- Article
6
ITERATION ALGEBRAS.
- Published in:
- International Journal of Foundations of Computer Science, 1992, v. 3, n. 3, p. 245, doi. 10.1142/S0129054192000164
- By:
- Publication type:
- Article