Volker Strassen

Volker Strassen: Asymptotic spectrum and matrix multiplication. ISSAC 2012: 6-7

Volker Strassen: Probability, algorithms and complexity. SODA 2009: 565

Volker Strassen: Algebraic Complexity Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 633-672

Volker Strassen: The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication. FOCS 1986: 49-54

Volker Strassen: The Computational Complexity of Continued Fractions. SIAM J. Comput. 12(1): 1-27 (1983)

Walter Baur, Volker Strassen: The Complexity of Partial Derivatives. Theor. Comput. Sci. 22: 317-330 (1983)

A. Alder, Volker Strassen: On the Algorithmic Complexity of Associative Algebras. Theor. Comput. Sci. 15: 201-211 (1981)

Volker Strassen: The computational complexity of continued fractions. SYMSACC 1981: 51-67

Joachim von zur Gathen, Volker Strassen: Some Polynomials that are Hard to Compute. Theor. Comput. Sci. 11: 331-335 (1980)

A. Alder, Volker Strassen: The algorithmic complexity of linear algebras. Algorithms in Modern Mathematics and Computer Science 1979: 343-354

Robert Solovay, Volker Strassen: Erratum: A Fast Monte-Carlo Test for Primality. SIAM J. Comput. 7(1): 118 (1978)

Robert Solovay, Volker Strassen: A Fast Monte-Carlo Test for Primality. SIAM J. Comput. 6(1): 84-85 (1977)

Volker Strassen: Computational Complexity over Finite Fields. SIAM J. Comput. 5(2): 324-331 (1976)

Ernst Specker, Volker Strassen (Eds.): Komplexität von Entscheidungsproblemen, Ein Seminar. Lecture Notes in Computer Science 43, Springer 1976, isbn 3-540-07805-3

Volker Strassen: Die Berechnungskomplexität der Symbolischen Differentiation von Interpolationspolynomen. Theor. Comput. Sci. 1(1): 21-25 (1975)

Volker Strassen: Polynomials with Rational Coefficients Which are Hard to Compute. SIAM J. Comput. 3(2): 128-149 (1974)

Volker Strassen: Berechnung und Programm. II. Acta Inf. 2: 64-79 (1973)

Volker Strassen: Berechnung und Programm. I. Acta Inf. 1: 320-335 (1972)

Volker Strassen: Evaluation of Rational Functions. Complexity of Computer Computations 1972: 1-10