default search action
Pierre Ohlmann
Person information
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Antonio Casares
, Pierre Ohlmann
Positional ω-regular languages. LICS 2024: 21:1-21:14 - [c15]Mikolaj Bojanczyk
Rank-decreasing transductions. LICS 2024: 59:1-59:13 - [c14]Pierre Ohlmann, Michal Skrzypczak:
Positionality in Σ⁰₂ and a Completeness Result. STACS 2024: 54:1-54:18 - [i20]Mikolaj Bojanczyk, Pierre Ohlmann:
Rank-decreasing transductions. CoRR abs/2401.13328 (2024) - [i19]Antonio Casares, Pierre Ohlmann:
Half-positional ω-regular languages. CoRR abs/2401.15384 (2024) - [i18]Antonio Casares, Pierre Ohlmann, Pierre Vandenhove:
A positional Π03-complete objective. CoRR abs/2410.14688 (2024) - 2023
- [j5]Pierre Ohlmann:
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. TheoretiCS 2 (2023) - [c13]Antonio Casares, Pierre Ohlmann:
Characterising Memory in Infinite Games. ICALP 2023: 122:1-122:18 - [c12]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
Flipper Games for Monadically Stable Graph Classes. ICALP 2023: 128:1-128:16 - [c11]Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. ICALP 2023: 135:1-135:17 - [i17]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
Flipper games for monadically stable graph classes. CoRR abs/2301.13735 (2023) - [i16]Pierre Ohlmann, Michal Pilipczuk, Szymon Torunczyk, Wojciech Przybyszewski:
Canonical decompositions in monadically stable and bounded shrubdepth graph classes. CoRR abs/2303.01473 (2023) - [i15]Pierre Ohlmann:
Positionality of mean-payoff games on infinite graphs. CoRR abs/2305.00347 (2023) - [i14]Pierre Ohlmann, Michal Skrzypczak:
Positionality in Σ_0^2 and a completeness result. CoRR abs/2309.17022 (2023) - 2022
- [j4]Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The Theory of Universal Graphs for Infinite Duration Games. Log. Methods Comput. Sci. 18(3) (2022) - [c10]Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon
Scaling Neural Program Synthesis with Distribution-Based Search. AAAI 2022: 6623-6630 - [c9]Pierre Ohlmann
The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. CSR 2022: 269-288 - [c8]K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski:
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. FSTTCS 2022: 44:1-44:20 - [c7]Pierre Ohlmann:
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. LICS 2022: 22:1-22:12 - [i13]Pierre Ohlmann:
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. CoRR abs/2205.04309 (2022) - [i12]Antonio Casares, Pierre Ohlmann:
Characterising memory in infinite games. CoRR abs/2209.12044 (2022) - 2021
- [b1]Pierre Ohlmann:
Monotonic graphs for parity and mean-payoff games. (Graphes monotones pour jeux de parité et à paiement moyen). Université Paris Cité, France, 2021 - [j3]Nathanaël Fijalkow
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. 30(2): 14 (2021) - [j2]Thomas Colcombet
Controlling a random population. Log. Methods Comput. Sci. 17(4) (2021) - [c6]Ashwani Anand
New Algorithms for Combinations of Objectives using Separating Automata. GandALF 2021: 227-240 - [i11]Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The Theory of Universal Graphs for Infinite Duration Games. CoRR abs/2104.05262 (2021) - [i10]Pierre Ohlmann:
The GKK Algorithm is the Fastest over Simple Mean-Payoff Games. CoRR abs/2110.04533 (2021) - [i9]Antonio Casares, Pierre Ohlmann:
On the ESL algorithm for solving energy games. CoRR abs/2110.07346 (2021) - [i8]Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Potta:
Scaling Neural Program Synthesis with Distribution-based Search. CoRR abs/2110.12485 (2021) - 2020
- [c5]Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a Random Population. FoSSaCS 2020: 119-135 - [c4]Nathanaël Fijalkow
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. MFCS 2020: 34:1-34:15 - [c3]Nathanaël Fijalkow
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS 2020: 24:1-24:17 - [i7]Marcin Jurdzinski, Rémi Morvan, Pierre Ohlmann, K. S. Thejaswini:
A symmetric attractor-decomposition lifting algorithm for parity games. CoRR abs/2010.08288 (2020)
2010 – 2019
- 2019
- [j1]Nathanaël Fijalkow
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. 63(5): 1027-1048 (2019) - [c2]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
On the Monniaux Problem in Abstract Interpretation. SAS 2019: 162-180 - [i6]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
On the Monniaux Problem in Abstract Interpretation. CoRR abs/1907.08257 (2019) - [i5]Thomas Colcombet
Controlling a random population. CoRR abs/1911.01195 (2019) - 2018
- [i4]Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The complexity of mean payoff games using universal graphs. CoRR abs/1812.07072 (2018) - [i3]Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann:
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Electron. Colloquium Comput. Complex. TR18 (2018) - [i2]Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c1]Nathanaël Fijalkow
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS 2017: 29:1-29:13 - [i1]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR abs/1701.02162 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: