A. Aggarval and J. S. Vitter, The input/output complexity of sorting and related problems, Communications of the ACM, vol.31, issue.9, pp.1116-1127, 1988.
DOI : 10.1145/48529.48535

R. Allen and K. Kennedy, Optimizing Compilers for Modern Architectures, 2002.

G. E. Andrews, The theory of partitions, 1976.
DOI : 10.1017/CBO9780511608650

K. Beauchamp, Applications of Walsh and related functions, 1984.

D. F. Elliott and K. R. Rao, Fast Transforms: Algorithms, Analyses, Applications, 1982.

M. Furis, Cache miss analysis of Walsh-Hadamard Transform algorithms, 2003.

J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach, 2002.

P. Hitczenko, J. R. Johnson, and H. Huang, Distribution of a class of divide and conquer recurrences arizing from the computation of the Walsh?Hadamard transform. preprint, 2003.

P. Hitczenko, J. R. Johnson, and H. Huang, Distribution of WHT Recurrences, Mathematics and computer science. III, Trends Math, pp.161-162, 2004.
DOI : 10.1007/978-3-0348-7915-6_16

P. Hitczenko and G. Louchard, Distinctness of compositions of an integer: A probabilistic analysis, Random Structures and Algorithms, vol.35, issue.3-4, pp.407-437, 2001.
DOI : 10.1002/rsa.10008

P. Hitczenko and C. D. Savage, On the Multiplicity of Parts in a Random Composition of a Large Integer, SIAM Journal on Discrete Mathematics, vol.18, issue.2, pp.418-435, 2004.
DOI : 10.1137/S0895480199363155

H. Huang, Performance analysis of an adaptive algorithm for the Walsh-Hadamard transform, 2002.

J. Johnson and M. Püschel, In search of the optimal Walsh-Hadamard transform, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100), pp.3347-3350, 2000.
DOI : 10.1109/ICASSP.2000.860117

R. E. Ladner, J. D. Fix, and A. Lamarca, Cache performance analysis of traversals and random accesses, SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), pp.613-622, 1999.

F. Macwilliams and N. Sloane, The theory of error-correcting codes, 1992.

S. Sen, S. Chatterjee, and N. Dumir, Towards a theory of cache-efficient algorithms, Journal of the ACM, vol.49, issue.6, pp.828-858, 2002.
DOI : 10.1145/602220.602225