Talks

New Bounds for the Ideal Proof System in Positive Characteristic

ICALP (July 2025): Slides (20 minutes)

A talk on some new lower bounds for IPS over large fields of positive characteristic.

Based on the following work: New Bounds for the Ideal Proof System in Positive Characteristic

A Near-Optimal Polynomial Distance Lemma Over Boolean Slices

ICALP (July 2025): Slides (20 minutes)

A talk on the polynomial distance lemma for non-zero polynomials over the Boolean slices (i.e., the set of all Boolean points with a fixed Hamming weight).

Based on the following work: A Near-Optimal Polynomial Distance Lemma Over Boolean Slices

Low-Degree Local Correction Over the Boolean Cube

UK Complexity Seminar (December 2024): Slides (1 hour)
CAALM Workshop (June 2025): Slides (25 minutes)

A talk on local correction and local list correction algorithms for low-degree polynomials over any abelian group and the Boolean hypercube as the domain.

Based on the following work: Low-Degree Local Correction Over the Boolean Cube

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 linear polynomials over any abelian group and the 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.

"We decreased the number of questions without increasing the number of answers." - From Nature of Computation

"Mathematics is locally trivial." - Internet