Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDPierre Ohlmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i12]Pierre Ohlmann:
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. CoRR abs/2205.04309 (2022)- 2021
- [j3]Nathanaël Fijalkow
, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. 30(2): 14 (2021) - [j2]Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a random population. Log. Methods Comput. Sci. 17(4) (2021) - [c6]Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Jérôme Leroux, Pierre Ohlmann:
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, Pawel Gawrychowski, Pierre Ohlmann:
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. MFCS 2020: 34:1-34:15 - [c3]Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
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, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
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, Nathanaël Fijalkow, Pierre Ohlmann:
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. 25: 38 (2018) - [i2]Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. 25: 180 (2018) - 2017
- [c1]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-05-12 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
