D. P. Agrawal, Graph theoretical analysis and design of multistage interconnection networks, IEEE Trans. Computers, vol.32, pp.637-648, 1983.

V. E. Bene?, Optimal Rearrangeable Multistage Connecting Networks, Bell System Technical J, vol.43, pp.1641-1656, 1964.

J. C. Bermond, J. M. Fourneau, and A. Jean-marie, A graph theoretical approach to equivalence of multi-stage interconnection networks, Discrete Applied Maths, vol.22, pp.201-214, 1988.

S. Burckel and E. Gioan, In situ design of register operations, IEEE Proceedings of ISVLSI 2008, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00287659

S. Burckel and M. Morillon, Quadratic Sequential Computations. Theory of Computing Systems, vol.37, pp.519-525, 2004.

S. Burckel and M. Morillon, Sequential Computation of Linear Boolean Mappings. Theoretical Computer Science serie A 314, pp.287-292, 2004.

J. W. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comput, vol.19, pp.297-301, 1965.

D. König, Uber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlhere, Math. Ann, vol.77, pp.453-465, 1916.

H. J. Nussbaumer, Fast Fourier transform and convolution algorithms, Springer Series in Information Sciences, vol.2, 1982.

C. P. Ravikumar, R. Aggarwal, and C. Sharma, A graph theoretic approach for register file based synthesis, Proceedings of VLSID 1997, Tenth International Conference on VLSI Design, 1997.