Jacques Morgenstern

According to our database, Jacques Morgenstern authored at least 8 papers between 1973 and 1993.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1993

On the Intrinsic Complexity of Elimination Theory.

Joos Heintz, Jacques Morgenstern

J. Complex., 1993

1991

Invariant and Geometric Aspects of Algebraic Complexity Theory I.

Jacques Morgenstern

J. Symb. Comput., 1991

1985

How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen.

Jacques Morgenstern

SIGACT News, 1985

1984

On associative algebras of minimal rank.

Joos Heintz, Jacques Morgenstern

Proceedings of the Applied Algebra, 1984

1979

Une Extension du Theoreme de Winograd.

Jacques Morgenstern

Theor. Comput. Sci., 1979

1975

The Linear Complexity of Computation.

Jacques Morgenstern

J. ACM, 1975

1974

Linear Tangent Algorithms and Lower Bounds for the Complexity of Computation.

Jacques Morgenstern

Proceedings of the Information Processing, 1974

1973

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

Jacques Morgenstern

J. ACM, 1973