Mateusz Skomra

Orcid: 0000-0001-5650-5559

Affiliations:
  • University of Toulouse, LAAS-CNRS, France


According to our database1, Mateusz Skomra authored at least 13 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Smoothed analysis of deterministic discounted and mean-payoff games.
CoRR, 2024

2023
Games on Graphs.
CoRR, 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
Derandomization and absolute reconstruction for sums of powers of linear forms.
Theor. Comput. Sci., 2021

Convexly independent subsets of Minkowski sums of convex polygons.
Discret. Math., 2021

Optimal bounds for bit-sizes of stationary distributions in finite Markov chains.
CoRR, 2021

2020
Tropical Spectrahedra.
Discret. Comput. Geom., 2020

2019
The tropical analogue of the Helton-Nie conjecture is true.
J. Symb. Comput., 2019

Intersection multiplicity of a sparse curve and a low-degree curve.
CoRR, 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

Solving generic nonarchimedean semidefinite programs using stochastic game algorithms.
J. Symb. Comput., 2018

Individual Security and Network Design with Malicious Nodes.
Inf., 2018

Condition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming.
CoRR, 2018


  Loading...