Jacques Morgenstern

On the Intrinsic Complexity of Elimination Theory

Joos Heintz, Jacques Morgenstern, 1993, J. Complex..

The Linear Complexity of Computation

Jacques Morgenstern, J. Morgenstern, Jacques Morgenstern, 1975, JACM.

Linear Tangent Algorithms and Lower Bounds for the Complexity of Computation

Jacques Morgenstern, 1974, IFIP Congress.

On associative algebras of minimal rank

Jacques Morgenstern, Joos Heintz, J. Morgenstern, 1984, International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes.

Une Extension du Theoreme de Winograd

Jacques Morgenstern, 1979, Theor. Comput. Sci..

Invariant and Geometric Aspects of Algebraic Complexity Theory I

Jacques Morgenstern, 1991, J. Symb. Comput..

Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

Jacques Morgenstern, J. Morgenstern, Jacques Morgenstern, 1973, JACM.