A theoretical study of reconfigurability for numerical algorithms on a reconfigurable network

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Desprez, F., & Tourancheau, B. (1992). A theoretical study of reconfigurability for numerical algorithms on a reconfigurable network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 634 LNCS, pp. 817–818). Springer Verlag. https://doi.org/10.1007/3-540-55895-0_504

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free