Mateusz Skomra
Orcid: 0000-0001-5650-5559Affiliations:
- University of Toulouse, LAAS-CNRS, France
According to our database1,
Mateusz Skomra
authored at least 16 papers
between 2016 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games.
Inf. Comput., 2025
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025
2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
2022
Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
Theor. Comput. Sci., 2021
Discret. Math., 2021
CoRR, 2021
2020
2019
2018
Spectraèdres tropicaux: application à la programmation semi-définie et aux jeux à paiement moyen. (Tropical spectrahedra: Application to semidefinite programming and mean payoff games).
PhD thesis, 2018
Condition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming.
CoRR, 2018
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
2016
Solving Generic Nonarchimedean Semidefinite Programs Using Stochastic Game Algorithms.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016