D. P. Agrawal, Graph Theoretical Analysis and Design of Multistage Interconnection Networks, IEEE Transactions on Computers, vol.32, issue.7, pp.637-648, 1983.
DOI : 10.1109/TC.1983.1676295

V. E. Bene?, Optimal Rearrangeable Multistage Connecting Networks, Bell System Technical Journal, vol.43, issue.4, pp.1641-1656, 1964.
DOI : 10.1002/j.1538-7305.1964.tb04103.x

J. C. Bermond, J. M. Fourneau, and A. Jean-marie, A graph theoretical approach to equivalence of multistage interconnection networks, Discrete Applied Mathematics, vol.22, issue.3, pp.201-214, 1988.
DOI : 10.1016/0166-218X(88)90096-0

S. Burckel, Closed iterative calculus, Theoretical Computer Science, vol.158, issue.1-2, pp.371-378, 1996.
DOI : 10.1016/0304-3975(95)00171-9

S. Burckel and M. Morillon, Three generators for minimal writing-space computations, RAIRO - Theoretical Informatics and Applications, vol.34, issue.2, pp.131-138, 2000.
DOI : 10.1051/ita:2000110

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

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

S. Burckel and E. Gioan, In Situ Design of Register Operations, 2008 IEEE Computer Society Annual Symposium on VLSI, p.4, 2008.
DOI : 10.1109/ISVLSI.2008.62

URL : https://hal.archives-ouvertes.fr/lirmm-00287659

S. Burckel, E. Gioan, and E. Thomé, Mapping Computation with No Memory, Proc. 8th International Conference on Unconventional Computation UC09, pp.85-97, 2009.
DOI : 10.1007/978-3-642-03745-0_15

URL : https://hal.archives-ouvertes.fr/lirmm-00395080

P. Cameron, B. Fairbairn, and M. Gadouleau, Computing in matrix groups without memory. ArXiv: 1310, p.6009, 2013.

J. W. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of Computation, vol.19, issue.90, pp.297-301, 1965.
DOI : 10.1090/S0025-5718-1965-0178586-1

J. Delahaye, Le calculateur amnésique Available at, Pour La Science, vol.404, pp.88-92208, 2011.

M. Gadouleau and S. Riis, Memoryless computation: new results, constructions, and extensions. ArXiv: 1111, p.6026, 2011.
DOI : 10.1016/j.tcs.2014.09.040

URL : http://arxiv.org/abs/1111.6026

F. K. Hwang, The mathematical theory of nonblocking switching networks, Series on Applied Mathematics, vol.11, 2004.

F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, 1992.

W. Lin and W. E. Chen, Efficient nonblocking multicast communications on baseline networks, Computer Communications, vol.22, issue.6, pp.556-567, 1999.
DOI : 10.1016/S0140-3664(99)00016-X

Y. P. Ofman, A universal automaton, Trans. Moscow Math. Soc, vol.14, pp.200-215, 1965.

C. S. Raghavendra and R. V. Boppana, On self-routing in Benes and shuffle-exchange networks, IEEE Transactions on Computers, vol.40, issue.9, pp.1057-1064, 1991.
DOI : 10.1109/12.83649

C. D. Thompson, Generalized connection network for parallel processor interconnection, IEEE Trans. Comput, vol.27, pp.1119-1124, 1978.