The 1969 paper "Gaussian Elimination is Not Optimal" introduced a method for matrix multiplication that shattered existing speed limits, proving that large matrix operations could be completed significantly faster than the traditional cubic time complexity. This discovery established Volker Strassen as a pivotal figure in the evolution of theoretical computer science and algorithm design.
Early Education and Academic Trajectory
Born in 1936 in Düsseldorf-Gerresheim, Germany, Strassen pursued a broad academic curriculum encompassing philosophy, physics, music, and mathematics. He completed his doctoral studies at the University of Göttingen in 1962, under the supervision of Konrad Jacobs. His early career took him to the University of California, Berkeley, where he served in the mathematics and statistics departments, eventually rising to associate professor. By 1968, he moved to the University of Zurich to lead the Seminar for Applied Mathematics, a position he held for two decades before transitioning to the University of Konstanz in 1988, where he remained until his retirement in 1998.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Foundational Contributions to Probability Theory
Before his shift toward computational complexity, Strassen made significant strides in probability theory. His 1964 work, "An Invariance Principle for the Law of the Iterated Logarithm," earned him a presentation at the 1966 International Congress of Mathematicians in Moscow. By 1965, he had derived necessary and sufficient conditions regarding probability measures and martingales. His collaborative work in 1973 with Huber on minimax tests and the Neyman-Pearson lemma served as a cornerstone for later developments in the field of robust statistics.
Advancements in Algorithmic Efficiency
Strassen's influence on algorithm design includes the 1971 development of the Schönhage-Strassen algorithm for integer multiplication, which provided the fastest known method for decades. In 1977, he collaborated with Robert M. Solovay to create the Solovay-Strassen primality test, marking a shift toward randomized polynomial time verification. His 1983 collaboration with Walter Baur provided a method to bound the complexity of rational functions, further extending his earlier research on algebraic complexity presented at the 1974 International Congress of Mathematicians in Vancouver.
Professional Recognition
Throughout his career, Strassen has been inducted into several institutions, including the German Academy of Sciences Leopoldina, the Göttingen Academy of Sciences and Humanities in Lower Saxony, and the Heidelberg Academy of Sciences and Humanities. He is also a Fellow of the American Mathematical Society. His awards include the 1999 Cantor medal, the 2003 Paris Kanellakis Award, the 2008 Knuth Prize, and the 2011 Konrad Zuse Medal.
Fast facts
- Born: 1936, Düsseldorf
- Citizenship: Germany
- Doctorate: University of Göttingen, 1962
- Notable Algorithm: Strassen's algorithm for matrix multiplication
- Knuth Prize: 2008
- Cantor medal: 1999
- Konrad Zuse Medal: 2011
- Academic Home: University of Konstanz
Questions readers ask
What is the significance of the Strassen algorithm?
It proved that multiplying large matrices could be performed faster than the conventional O(n³) time bound.
Which major awards has Volker Strassen received?
His honors include the Cantor medal, the Knuth Prize, the Paris Kanellakis Award, and the Konrad Zuse Medal.
Achievements
- Knuth Prize — 2008
- Cantor medal — 1999
- Konrad Zuse Medal — 2011
- Held posts at University of California, Berkeley and University of Zurich
- Fields: mathematics, probability theory and theoretical computer science
