Skip To Main Content
Pierre Ohlmann on Muck Rack

Pierre Ohlmann

As seen in: arXiv
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile
Back to Pierre Ohlmann’s profile

Articles by Pierre Ohlmann

[2506.14544] Infinite lexicographic products of positional objectives

|
By Pierre Ohlmann, Michał Skrzypczak, Igor Walukiewicz
| arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (370) Issue with article?

[2502.05840] The memory of $ω$-regular and BC($Σ_2^0$) objectives

|
By Pierre Ohlmann
| arXiv
Open in Who Shared Issue with article?

[2410.14688] A positional $\mathbfΠ^0_3$-complete objective

|
By Pierre Ohlmann, Pierre Vandenhove
| arXiv
arXiv:2410.14688 (cs) View PDF HTML (experimental) Comments: Subjects: Computational Complexity (cs.CC); Formal Languages and Automata Theory (cs.FL); Computer Science and Game Theory (cs.GT); Logic in Computer Science (cs.LO) Cite as: arXiv:2410.14688 [cs.CC] (or arXiv:2410.14688v1 [cs.CC] for this version) https://doi.org/10.48550/arXiv.2410.14688 Submission history From: Pierre Vandenhove [ view email] [v1] Thu, 3 Oct 2024 20:49:09 UTC (95 KB) Bibliographic Tools Bibliographic Explorer...
Open in Who Shared View Duplicates (209) Issue with article?

[2401.13328] Rank-decreasing transductions

|
By Pierre Ohlmann
| arXiv
arXiv:2401.13328 (cs) Download PDF HTML (experimental) Comments: Subjects: Logic in Computer Science (cs.LO) Cite as: arXiv:2401.13328 [cs.LO] (or arXiv:2401.13328v1 [cs.LO] for this version) https://doi.org/10.48550/arXiv.2401.13328 Submission history From: Pierre Ohlmann [ view email] [v1] Wed, 24 Jan 2024 09:45:38 UTC (328 KB) Bibliographic Tools Bibliographic Explorer Toggle Bibliographic Explorer () Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are...
Open in Who Shared View Duplicates (698) Issue with article?

Fast value iteration: A uniform approach to efficient algorithms for energy games

|
By Antonio Casares, Pierre Ohlmann
| arXiv
arXiv:2110.07346 (cs) [Submitted on 14 Oct 2021 (v1), last revised 12 Feb 2025 (this version, v3)] View PDF Comments: Subjects: Computer Science and Game Theory (cs.GT) Cite as: arXiv:2110.07346 [cs.GT] (or arXiv:2110.07346v3 [cs.GT] for this version) https://doi.org/10.48550/arXiv.2110.07346 Submission history From: Antonio Casares [ view email] [v1] Thu, 14 Oct 2021 13:27:27 UTC (3,580 KB) [v2] Fri, 29 Sep 2023 11:47:59 UTC (3,630 KB) [v3] Wed, 12 Feb 2025 15:09:24 UTC (1,812 KB)...
Open in Who Shared View Duplicates (19) Issue with article?
Show More