Mateusz Skomra

Postdoctoral Researcher

About Me

I am a postdoctoral researcher at École normale supérieure de Lyon, CNRS, Laboratoire de l'Informatique du Parallélisme, within the research team MC2.

Previously, I was a doctoral researcher at Centre de Mathématiques Appliquées, École polytechnique, CNRS, Université Paris-Saclay, within INRIA research team Tropical, where I worked under the supervision of Xavier Allamigeon and Stéphane Gaubert.

My research is focused on the interplay between tropical geometry, convex optimization, and algorithmic game theory. I am also working on problems related to algebraic complexity.

Publications

Intersection multiplicity of a sparse curve and a low-degree curve

Pascal Koiran and Mateusz Skomra

Journal of Pure and Applied Algebra, 224 (2020), article 106279

arXiv version DOI

Tropical spectrahedra

Xavier Allamigeon, Stéphane Gaubert, and Mateusz Skomra

Discrete & Computational Geometry, 63 (2020), pp. 507–548

arXiv version DOI

The tropical analogue of the Helton–Nie conjecture is true

Xavier Allamigeon, Stéphane Gaubert, and Mateusz Skomra

Journal of Symbolic Computation, 91 (2019), pp. 129–148

A preliminary version of this paper was presented at the International Conference on Effective Methods in Algebraic Geometry (MEGA), 2017

arXiv version DOI (journal)

Individual security and network design with malicious nodes

Tomasz Janus, Mateusz Skomra, and Marcin Dziubiński

Extended abstract published in the Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2018, pp. 1968–1970

arXiv version conference version

Condition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming

Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz, and Mateusz Skomra

Proceedings of the 23rd International Symposium on Mathematical Theory of Networks and Systems (MTNS), 2018, pp. 160–167

arXiv version conference version

Solving generic nonarchimedean semidefinite programs using stochastic game algorithms

Xavier Allamigeon, Stéphane Gaubert, and Mateusz Skomra

Journal of Symbolic Computation, 85 (2018), pp. 25–54

A preliminary version of this paper was published in the Proceedings of the 41st International Symposium on Symbolic and Algebraic Computation (ISSAC), ACM, 2016, pp. 31–38

arXiv version DOI (conference) DOI (journal)

PhD thesis

Past and Upcoming Events

Teaching

  • Computational Complexity, tutorial classes, January – April 2020, ENS de Lyon
  • Homework 1    Homework 2    TD07

  • Cryptography and Security, tutorial classes, January – April 2020, ENS de Lyon
  • Architecture, système, réseau 1, tutorial classes, September – December 2019, ENS de Lyon
  • Information theory, tutorial classes, September – December 2019, ENS de Lyon
  • Introduction to concepts of Computer Science, tutorial classes, September – October 2019, ENS de Lyon
  • Algorithmique avancée, tutorial classes, February – May 2019, ENS de Lyon
  • Optimisation linéaire et convexité, tutorial classes, February – May 2018, Sorbonne Université
  • Programmation Python, tutorial classes, September – December 2017, Sorbonne Université
  • Optimisation linéaire et convexité, tutorial classes, January – May 2017, Sorbonne Université
  • Suites, Intégrales, Introduction à l'algèbre linéaire, tutorial classes, January – May 2017, Sorbonne Université
  • Introduction à l'optimisation, tutorial classes, September – October 2016, École des Ponts ParisTech

Contact

  • Location:LIP, ENS Lyon
    46, allée d'Italie
    69364 Lyon Cedex 07
    France

  • Email: