Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform. - Jacques Morgenstern (J. ACM, 1973)

Linear Tangent Algorithms and Lower Bounds for the Complexity of Computation. - Jacques Morgenstern (IFIP Congress, 1974)

The Linear Complexity of Computation. - Jacques Morgenstern (J. ACM, 1975)

Une Extension du Theoreme de Winograd. - Jacques Morgenstern (Theor. Comput. Sci., 1979)

On associative algebras of minimal rank. - Joos Heintz; Jacques Morgenstern (AAECC, 1984)

How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen. - Jacques Morgenstern (SIGACT News, 1985)

Invariant and Geometric Aspects of Algebraic Complexity Theory I. - Jacques Morgenstern (J. Symb. Comput., 1991)

On the Intrinsic Complexity of Elimination Theory. - Joos Heintz; Jacques Morgenstern (J. Complex., 1993)