At the ISSAC’2022 international conference in Lille in July 2022, the paper entitled “Sparse polynomial interpolation and division in soft-linear time” involving Pascal Giorgi, Bruno Grenet and Armelle Perret du Cray from the Computer Science department’s ECO team, and Daniel S. Roche (US Naval Academy) obtained the prestigious prize for the best article. In particular, the proposed work allowed us to obtain a quasi-optimal algorithm for solving the problem of hollow interpolation, which was initiated by the work of G.R. de Prony in the 19th century on the sum of exponentials.
The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the major conference in formal/algebraic computation. It gathers each year more than 250 researchers in mathematics/computing from all continents. This conference, affiliated to the Association for Computing Machinery (ACM), was created in the mid-1960s, first named SYNASC/EUROSAM/EUROSAC and then ISSAC in the late 1980s.
Each year the ACM interest group dedicated to formal/algebraic computation (SIGSAM: https://www.sigsam.org), on the advice of the programme committee, awards the best paper and the best student contribution to ISSAC at the conference.
Link to the article: https://arxiv.org/abs/2202.08106
Link to the award announcement: https://www.sigsam.org/Awards/ISSACAwards.html
