On schematological equivalence of dataflow networks

DOI10.1006/INCO.1996.0012zbMath0853.68093OpenAlexW2061851082MaRDI QIDQ1917073

Alexander Rabinovich

Publication date: 3 July 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.0012

zbMATH Keywords

polynomial algorithmdataflow networks

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

On schematological equivalence of partially interpreted dataflow networks

This page was built for publication: On schematological equivalence of dataflow networks