Pierre Ohlmann

Orcid: 0000-0002-4685-5253

Affiliations:
  • University of Warsaw, Poland


According to our database1, Pierre Ohlmann authored at least 26 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Half-positional ω-regular languages.
CoRR, 2024

Positionality in Σ⁰₂ and a Completeness Result.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Positional ω-regular languages.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Rank-decreasing transductions.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs.
TheoretiCS, 2023

Positionality in Σ_0^2 and a completeness result.
CoRR, 2023

Positionality of mean-payoff games on infinite graphs.
CoRR, 2023

Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Flipper Games for Monadically Stable Graph Classes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Characterising Memory in Infinite Games.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
The Theory of Universal Graphs for Infinite Duration Games.
Log. Methods Comput. Sci., 2022

A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

The GKK Algorithm is the Fastest over Simple Mean-Payoff Games.
Proceedings of the Computer Science - Theory and Applications, 2022

Scaling Neural Program Synthesis with Distribution-Based Search.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Monotonic graphs for parity and mean-payoff games. (Graphes monotones pour jeux de parité et à paiement moyen).
PhD thesis, 2021

Controlling a random population.
Log. Methods Comput. Sci., 2021

On the ESL algorithm for solving energy games.
CoRR, 2021

New Algorithms for Combinations of Objectives using Separating Automata.
Proceedings of the Proceedings 12th International Symposium on Games, 2021

Lower Bounds for Arithmetic Circuits via the Hankel Matrix.
Comput. Complex., 2021

2020
A symmetric attractor-decomposition lifting algorithm for parity games.
CoRR, 2020

Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.
Theory Comput. Syst., 2019

On the Monniaux Problem in Abstract Interpretation.
Proceedings of the Static Analysis - 26th International Symposium, 2019

2018
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees.
Electron. Colloquium Comput. Complex., 2018

The complexity of mean payoff games using universal graphs.
CoRR, 2018

2017
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017


  Loading...