Talks
Local Correction of Linear Functions
ARCO Conference 2024, Copenhagen (April 2024): Slides (15 minutes)
Aarhus Algo and Complexity Seminar (May 2024): Slides (1 hour)
A talk on local correction and local list correction algorithms for low-degree polynomials over any abelian group and boolean hypercube as the domain.
Based on the following work: Local Correction of Linear Functions over the Boolean Cube
How to compute the roots of a polynomial?
Algorithms and Complexity Seminar of Aarhus University (February 2024)
Classical Newton's iteration to compute roots of a multivariate polynomial using arithmetic circuits. This is a result of Kaltofen from the 70's.
Efficient PIT for Sparse Polynomials
Algorithms and Complexity Seminar of Aarhus University (October 2023)
Presented the following result: Efficient algorithm for PIT for sparse polynomials.
Shortest Paths using Baur-Strassen
Algorithms and Complexity Seminar of Aarhus University (November 2022)
Presented the following result: Algorithmic applications of classical Baur-Strassen.