The fastest multiplication algorithm for n-bit binary numbers was discovered by Joris van der Hoeven and David Harvey, achieving an O(n log n) time complexity. This result, peer-reviewed and published in the Annals of Mathematics in 2021, represents a significant milestone in computational complexity, highlighting his integration of advanced mathematical theory with high-performance algorithmic development.
Academic Background and Development
Born in 1971, Joris van der Hoeven earned his doctorate from Paris Diderot University in 1997. His dissertation, titled Asymptotique automatique, established the foundation for his later focus on algebraic analysis and computer algebra. He currently holds the position of Director of Research at the National Center for Scientific Research (CNRS) and leads the Max Modélisation algébrique team at the Laboratoire d'informatique of the École polytechnique in Palaiseau.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Software Contributions
Beyond his theoretical work, van der Hoeven is deeply engaged in the free software movement. He became the maintainer of GNU TeXmacs in 1997, a platform designed for scientific editing. Furthermore, he developed Mathemagix, a system intended for computer algebra and analysis. These tools facilitate the practical application of his research into algorithmic properties and complex function theory.
Research into Transseries
His primary research interests involve transseries, which function as generalizations of formal power series. These structures are essential for studying nonlinear differential equations and algebraic analysis. His book, Transseries and real differential algebra, published in 2006, serves as a key reference. He further explored this area in the 2017 text Asymptotic differential algebra and model theory of transseries, co-authored with Matthias Aschenbrenner and Lou van den Dries.
Awards and Recognition
Van der Hoeven's collaborative efforts have garnered significant academic attention. In 2018, he delivered a talk titled On numbers, germs, and transseries at the International Congress of Mathematicians in Rio de Janeiro alongside Aschenbrenner and van den Dries. That same year, the group received the Carol Karp Prize. He was also awarded the N. G. de Bruijn prize in 2022.
Fast facts
- Born: 1971
- Citizenship: France
- Education: Paris Diderot University
- Employer: CNRS and École polytechnique
- Location of work: Palaiseau
- Carol Karp Prize: 2018
- N. G. de Bruijn prize: 2022
- Languages: French, English
Questions readers ask
What is the primary significance of his multiplication algorithm?
It achieved the fastest known time complexity for multiplying binary numbers, specifically O(n log n).
What software projects does he maintain?
He is the maintainer of the GNU TeXmacs platform and a developer of the Mathemagix computer algebra system.
Achievements
- Carol Karp Prize — 2018
- Held posts at National Center for Scientific Research and École polytechnique
