1. On sets of integers which contain no three terms in arithmetical progression;Behrend;Proc. Nat. Acad. Sci. USA,1946
2. On the Asymptotic Complexity of Matrix Multiplication;Coppersmith;SIAM Journal on Computing,1982
3. Matrix Multiplication via Behrend's Theorem;Coppersmith,1986
4. Matrix Multiplication via Arithmetic Progressions;Coppersmith,1987
5. Strassen Algorithm Is Not Optimal. Trilinear Technique of Aggregating Uniting and Canceling for Constructing Fast Algorithms for Matrix Multiplication;Pan,1978