Volker Strassen: Difference between revisions
→External links: added link to MacTutor entry and Math geneaology entry |
No edit summary |
||
| Line 35: | Line 35: | ||
==Awards and honors== |
==Awards and honors== |
||
In 1999 Strassen was awarded the [[Cantor medal]],<ref name="cm"/> and in 2003 he was co-recipient of the [[Paris Kanellakis Award]] with [[Robert M. Solovay|Robert Solovay]], [[Gary Miller (professor)|Gary Miller]], and [[Michael O. Rabin|Michael Rabin]] for their work on randomized primality testing.<ref name="pfvs"/> In 2008 he was awarded the [[Knuth Prize]] for "seminal and influential contributions to the design and analysis of efficient algorithms."<ref name=sigact2008>[http://www.sigact.org/Prizes/Knuth/2008.html The 2008 Knuth Prize is awarded to Volker Strassen for his seminal and influential contributions to efficient algorithms], ACM SIGACT.</ref> In 2011 he won the [[Konrad Zuse Medal]] of the [[Gesellschaft für Informatik]].<ref name=IDW>{{citation|url=http://www.idw-online.de/pages/de/news443079|journal=Informationsdienst Wissenschaft|date=September 28, 2011|title=Konrad-Zuse-Medaille für Informatik an Fritz-Rudolf Güntsch und Volker Strassen|first=Cornelia|last=Winter|language=German}}.</ref><ref name=KZM>[http://www.gi.de/?id=276 Konrad-Zuse-Medaille] {{Webarchive|url=https://web.archive.org/web/20140819084001/http://www.gi.de/?id=276 |date=2014-08-19 }}, [[Gesellschaft für Informatik]] (in German), retrieved 2012-03-09.</ref> In 2012 he became a fellow of the [[American Mathematical Society]].<ref>[http://www.ams.org/profession/fellows-list List of Fellows of the American Mathematical Society], retrieved 2013-08-05.</ref> |
In 1999 Strassen was awarded the [[Cantor medal]],<ref name="cm"/> and in 2003 he was co-recipient of the [[Paris Kanellakis Award]] with [[Robert M. Solovay|Robert Solovay]], [[Gary Miller (professor)|Gary Miller]], and [[Michael O. Rabin|Michael Rabin]] for their work on randomized primality testing.<ref name="pfvs"/> In 2008 he was awarded the [[Knuth Prize]] for "seminal and influential contributions to the design and analysis of efficient algorithms."<ref name=sigact2008>[http://www.sigact.org/Prizes/Knuth/2008.html The 2008 Knuth Prize is awarded to Volker Strassen for his seminal and influential contributions to efficient algorithms], ACM SIGACT.</ref> In 2011 he won the [[Konrad Zuse Medal]] of the [[Gesellschaft für Informatik]].<ref name=IDW>{{citation|url=http://www.idw-online.de/pages/de/news443079|journal=Informationsdienst Wissenschaft|date=September 28, 2011|title=Konrad-Zuse-Medaille für Informatik an Fritz-Rudolf Güntsch und Volker Strassen|first=Cornelia|last=Winter|language=German}}.</ref><ref name=KZM>[http://www.gi.de/?id=276 Konrad-Zuse-Medaille] {{Webarchive|url=https://web.archive.org/web/20140819084001/http://www.gi.de/?id=276 |date=2014-08-19 }}, [[Gesellschaft für Informatik]] (in German), retrieved 2012-03-09.</ref> In 2012 he became a fellow of the [[American Mathematical Society]].<ref>[http://www.ams.org/profession/fellows-list List of Fellows of the American Mathematical Society], retrieved 2013-08-05.</ref> |
||
==See also== |
|||
*Schönhage and Strassen’s conjecture – there should exist an algorithm that multiplies n-digit numbers using essentially n * log(n) single-digit operations, and such an algorithm would be the fastest possible |
|||
==References== |
==References== |
||
| Line 44: | Line 47: | ||
* {{MacTutor Biography|id=Strassen}} |
* {{MacTutor Biography|id=Strassen}} |
||
* {{MathGenealogy|id=36095}} |
* {{MathGenealogy|id=36095}} |
||
{{Kanellakis Award laureates}} |
{{Kanellakis Award laureates}} |
||
Revision as of 15:53, 2 August 2019
Volker Strassen | |
|---|---|
 Volker Strassen giving the Knuth Prize lecture at SODA 2009 | |
| Born | April 29, 1936 |
| Nationality | German |
| Alma mater | University of Göttingen |
| Scientific career | |
| Fields | Mathematics |
| Institutions | University of Konstanz |
| Doctoral advisor | Konrad Jacobs |
| Doctoral students | Joachim von zur Gathen |
Volker Strassen (born April 29, 1936) is a German mathematician, a professor emeritus in the department of mathematics and statistics at the University of Konstanz.[1]
For important contributions to the analysis of algorithms he has received many awards, including the Cantor medal,[2] the Konrad Zuse Medal,[3] the Paris Kanellakis Award for work on randomized primality testing,[4] the Knuth Prize for "seminal and influential contributions to the design and analysis of efficient algorithms."[5]
Biography
Strassen was born on April 29, 1936, in Düsseldorf-Gerresheim.[2] After studying music, philosophy, physics, and mathematics at several German universities,[2] he received his Ph.D. in mathematics in 1962 from the University of Göttingen under the supervision of Konrad Jacobs.[6] He then took a position in the department of statistics at the University of California, Berkeley while performing his habilitation at the University of Erlangen-Nuremberg, where Jacobs had since moved.[2] In 1968, Strassen moved to the Institute of Applied Mathematics at the University of Zurich, where he remained for twenty years before moving to the University of Konstanz in 1988.[2] He retired in 1998.[4]
Research
Strassen began his researches as a probabilist; his 1964 paper An Invariance Principle for the Law of the Iterated Logarithm defined a functional form of the law of the iterated logarithm, showing a form of scale invariance in random walks. This result, now known as Strassen's invariance principle or as Strassen's law of the iterated logarithm, has been highly cited and led to a 1966 presentation at the International Congress of Mathematicians.
In 1969, Strassen shifted his research efforts towards the analysis of algorithms with a paper on Gaussian elimination, introducing Strassen's algorithm, the first algorithm for performing matrix multiplication faster than the O(n3) time bound that would result from a naive algorithm. In the same paper he also presented an asymptotically fast algorithm to perform matrix inversion, based on the fast matrix multiplication algorithm. This result was an important theoretical breakthrough, leading to much additional research on fast matrix multiplication, and despite later theoretical improvements it remains a practical method for multiplication of dense matrices of moderate to large sizes. In 1971 Strassen published another paper together with Arnold Schönhage on asymptotically fast integer multiplication based on the fast Fourier transform; see the Schönhage–Strassen algorithm. Strassen is also known for his 1977 work with Robert M. Solovay on the Solovay–Strassen primality test, the first method to show that testing whether a number is prime can be performed in randomized polynomial time and one of the first results to show the power of randomized algorithms more generally.
Awards and honors
In 1999 Strassen was awarded the Cantor medal,[2] and in 2003 he was co-recipient of the Paris Kanellakis Award with Robert Solovay, Gary Miller, and Michael Rabin for their work on randomized primality testing.[4] In 2008 he was awarded the Knuth Prize for "seminal and influential contributions to the design and analysis of efficient algorithms."[5] In 2011 he won the Konrad Zuse Medal of the Gesellschaft für Informatik.[3][7] In 2012 he became a fellow of the American Mathematical Society.[8]
See also
- Schönhage and Strassen’s conjecture – there should exist an algorithm that multiplies n-digit numbers using essentially n * log(n) single-digit operations, and such an algorithm would be the fastest possible
References
- ^ FB Mathematik and Statistik Archived 2008-12-25 at the Wayback Machine, U. Konstanz.
- ^ a b c d e f Schönhage, A. (2000), "Cantor-Medaille für Volker Strassen" (PDF), Jahresbericht der Deutschen Mathematiker-Vereinigung, 102 (4).
- ^ a b Winter, Cornelia (September 28, 2011), "Konrad-Zuse-Medaille für Informatik an Fritz-Rudolf Güntsch und Volker Strassen", Informationsdienst Wissenschaft (in German).
- ^ a b c Preis für Prof. Volker Strassen, uni'kon 16.2004, Univ. of Konstanz.
- ^ a b The 2008 Knuth Prize is awarded to Volker Strassen for his seminal and influential contributions to efficient algorithms, ACM SIGACT.
- ^ Volker Strassen at the Mathematics Genealogy Project
- ^ Konrad-Zuse-Medaille Archived 2014-08-19 at the Wayback Machine, Gesellschaft für Informatik (in German), retrieved 2012-03-09.
- ^ List of Fellows of the American Mathematical Society, retrieved 2013-08-05.
External links
- Home page of Dr. Volker Strassen
- Weisstein, Eric W. "Strassen Formulas". MathWorld. Formulas for fast(er) matrix multiplication and inversion.
- O'Connor, John J.; Robertson, Edmund F., "Volker Strassen", MacTutor History of Mathematics Archive, University of St Andrews
- Volker Strassen at the Mathematics Genealogy Project
- 1936 births
- Living people
- German mathematicians
- 20th-century mathematicians
- 21st-century mathematicians
- Theoretical computer scientists
- University of Göttingen alumni
- University of California, Berkeley faculty
- University of Zurich faculty
- University of Konstanz faculty
- Knuth Prize laureates
- Fellows of the American Mathematical Society