Maud Szusterman

According to our database1, Maud Szusterman authored at least 3 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Markovian protocols and an upper bound on the extension complexity of the matching polytope.
CoRR, February, 2026

2023
Contributions to algebraic complexity, extension complexity, and affine convex geometry. (Contributions en complexité algébrique, en complexité d'extensions et en géométrie convexe affine).
PhD thesis, 2023

2019
Nonnegative Rank Measures and Monotone Algebraic Branching Programs.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019


  Loading...