1. W. Baur and V. Strassen, The complexity of partial derivatives, Theor. Computer Science
22 (1982), 317–330.
2. E. Becker and N. Schwartz, Zum Darstellungssatz von Kadison-Dubois, Archiv Math.
40 (1983), 421–428.
3. D. Bini, Relations between EC-algorithms and APA-algorithms, applications, Nota interna B 79 (8), Pisa (1979).
4. D. Bini, M. Capovani, G. Lotti and F. Romani, O(n
2.7799) complexity for matrix multiplication, Inf. Proc. Letters
8 (1979), 234–235.
5. P. Bürgisser, Doctoral thesis, Universität Konstanz (1990).