Publications and Talks
Also available on DBLP. If you encounter any difficulty locating a PDF, please contact me.
Conference Papers
-
2025
A (1+ε)-approximation for ultrametric
embedding in subquadratic time
AAAI [paper] [arXiv] [code] -
2025
Eco Search: A No-delay Best-First Search
Algorithm for Program Synthesis
AAAI — Invited for oral presentation [paper] -
2022
Scaling Neural Program Synthesis with
Distribution-Based Search
AAAI [paper] -
2021
Improving Ultrametrics Embeddings Through
Coresets
ICML [paper] -
2021
The complexity of learning linear temporal
formulas from examples
ICGI [paper] -
2020
Lower Bounds for Arithmetic Circuits via the
Hankel Matrix
STACS [paper] -
2020
On Efficient Low Distortion Ultrametric
Embedding
ICML [paper] -
2020
Trade-Offs Between Size and Degree in
Polynomial Calculus
ITCS [paper] -
2018
Lempel-Ziv: a “one-bit catastrophe” but not
a tragedy
SODA [paper] -
2017
Lower Bounds and PIT for Non-Commutative
Arithmetic Circuits with Restricted Parse Trees
MFCS [paper]
Journal Articles
-
2022
DeepSynth: Scaling Neural Program Synthesis
with Distribution-based Search
J. Open Source Softw. [paper] -
2021
Lower Bounds for Arithmetic Circuits via the
Hankel Matrix
Comput. Complex. [paper] -
2020
d-Galvin Families
Electron. J. Comb. [paper] -
2019
Lower Bounds and PIT for Non-commutative
Arithmetic Circuits with Restricted Parse Trees
Comput. Complex. [paper] -
2019
Non-commutative computations: lower bounds
and polynomial identity testing
Chic. J. Theor. Comput. Sci. [paper] -
2017
De Bruijn-Erdős-type theorems for graphs and
posets
Discret. Math. [paper]
Preprints
-
2026
Analyzing and Leveraging the k-Sensitivity
of LZ77
[arXiv] -
2025
ParamExplorer: A framework for exploring
parameters in generative art
[arXiv] [code] -
2023
Learning temporal formulas from examples is
hard
[arXiv] -
2018
Tight Bounds using Hankel Matrix for
Arithmetic Circuits with Unique Parse Trees
[arXiv]
A few slides
- Eco Search
- Recommender Systems
- (1+ε)-approximation for ultrametric embedding
- Arithmetic complexity
- LTL Learning
- Program synthesis
A few posters
- Eco Search
- (1+ε)-approximation for ultrametric embedding
- Improving Ultrametrics Embeddings Through Coresets
- Lempel-Ziv: a one-bit catastrophe
Popular Science
-
Henri Potier à l’école de la complexité, Le blog binaire,
Le Monde
- Un seul bit vous manque, et ça ne compresse plus…, INS2I CNRS
- La théorie de la complexité algorithmique, Interstices