( en | de | ru )

 

Disambiguation of "Ohlmann, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
Rank-decreasing transductions.

, and . LICS, page 59:1-59:13. ACM, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ohlmann

Lothar Öhlmann

Andre Öhlmann

Andreas Ohlmann

Dominik Ohlmann

 

Other publications of authors with the same name

On the Monniaux Problem in Abstract Interpretation., , , , , and . SAS, volume 11822 of Lecture Notes in Computer Science, page 162-180. Springer, (2019)Controlling a Random Population., , and . FoSSaCS, volume 12077 of Lecture Notes in Computer Science, page 119-135. Springer, (2020)Positionality in Σ⁰₂ and a Completeness Result., and . STACS, volume 289 of LIPIcs, page 54:1-54:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees., , and . Electron. Colloquium Comput. Complex., (2018)Monotonic graphs for parity and mean-payoff games. (Graphes monotones pour jeux de parité et à paiement moyen).. Université Paris Cité, France, (2021)Lower Bounds for Arithmetic Circuits via the Hankel Matrix., , , and . Comput. Complex., 30 (2): 14 (2021)Positional ω-regular languages., and . LICS, page 21:1-21:14. ACM, (2024)Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games., , and . MFCS, volume 170 of LIPIcs, page 34:1-34:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Characterizing Positionality in Games of Infinite Duration over Infinite Graphs.. LICS, page 22:1-22:12. ACM, (2022)Characterising memory in infinite games., and . CoRR, (2022)