Volker Strassen

According to our database1, Volker Strassen
  • authored at least 20 papers between 1971 and 2012.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2012
Asymptotic spectrum and matrix multiplication.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2009
Probability, algorithms and complexity.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

1990
Algebraic Complexity Theory.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990

1986
The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1983
The Complexity of Partial Derivatives.
Theor. Comput. Sci., 1983

The Computational Complexity of Continued Fractions.
SIAM J. Comput., 1983

1981
On the Algorithmic Complexity of Associative Algebras.
Theor. Comput. Sci., 1981

The computational complexity of continued fractions.
Proceedings of the SYMSAC 1981, 1981

1980
Some Polynomials that are Hard to Compute.
Theor. Comput. Sci., 1980

1979
The algorithmic complexity of linear algebras.
Proceedings of the Algorithms in Modern Mathematics and Computer Science, 1979

1978
Erratum: A Fast Monte-Carlo Test for Primality.
SIAM J. Comput., 1978

1977
A Fast Monte-Carlo Test for Primality.
SIAM J. Comput., 1977

1976
Computational Complexity over Finite Fields.
SIAM J. Comput., 1976

1975
Die Berechnungskomplexität der Symbolischen Differentiation von Interpolationspolynomen.
Theor. Comput. Sci., 1975

1974
Polynomials with Rational Coefficients Which are Hard to Compute.
SIAM J. Comput., 1974

1973
Berechnungen in partiellen Algebren endlichen Typs.
Computing, 1973

Berechnung und Programm. II.
Acta Inf., 1973

1972
Berechnung und Programm. I.
Acta Inf., 1972

Evaluation of Rational Functions.
Proceedings of a symposium on the Complexity of Computer Computations, 1972

1971
Schnelle Multiplikation großer Zahlen.
Computing, 1971


  Loading...