Martin Zimmermann
According to our database^{1},
Martin Zimmermann
authored at least 41 papers
between 2009 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
Visibly linear dynamic logic.
Theor. Comput. Sci., 2018
Distributed synthesis for parameterized temporal logics.
Inf. Comput., 2018
Parameterized linear temporal logics meet costs: still not costlier than LTL.
Acta Inf., 2018
The complexity of counting models of lineartime temporal logic.
Acta Inf., 2018
Team Semantics for the Specification and Verification of Hyperproperties.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Parity Games with Weights.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018
Synthesizing Optimally Resilient Controllers.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018
2017
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
Logical Methods in Computer Science, 2017
Parametric Linear Dynamic Logic.
Inf. Comput., 2017
Finitestate Strategies in Delay Games.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017
The FirstOrder Logic of Hyperproperties.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017
Games with costs and delays.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
Bounding AverageEnergy Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2017
2016
Delay Games with WMSO+U Winning Conditions.
RAIRO  Theor. Inf. and Applic., 2016
Approximating Optimal Bounds in PromptLTL Realizability in Doublyexponential Time
Proceedings of the Seventh International Symposium on Games, 2016
Limit Your Consumption! Finding Bounds in Averageenergy Games.
Proceedings of the Proceedings 14th International Workshop Quantitative Aspects of Programming Languages and Systems, 2016
How Much Lookahead is Needed to Win Infinite Games?
Logical Methods in Computer Science, 2016
Distributed PROMPTLTL Synthesis.
Proceedings of the Seventh International Symposium on Games, 2016
Visibly Linear Dynamic Logic.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016
Prompt Delay.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016
2015
Optimal strategy synthesis for requestresponse games.
RAIRO  Theor. Inf. and Applic., 2015
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL.
Proceedings of the Proceedings Sixth International Symposium on Games, 2015
How Much Lookahead is Needed to Win Infinite Games?
Proceedings of the Automata, Languages, and Programming  42nd International Colloquium, 2015
Delay Games with WMSO+U Winning Conditions.
Proceedings of the Computer Science  Theory and Applications, 2015
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015
2014
Down the Borel hierarchy: Solving Muller games via safety games.
Theor. Comput. Sci., 2014
Parity and Streett Games with Costs
Logical Methods in Computer Science, 2014
Parametric Linear Dynamic Logic.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014
The Complexity of Counting Models of Lineartime Temporal Logic.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014
2013
Optimal bounds in parametric LTL games.
Theor. Comput. Sci., 2013
2012
Solving infinite games with bounds.
PhD thesis, 2012
Playing Muller Games in a Hurry.
Int. J. Found. Comput. Sci., 2012
Playing Pushdown Parity Games in a Hurry
Proceedings of the Proceedings Third International Symposium on Games, 2012
Down the Borel Hierarchy: Solving Muller Games via Safety Games
Proceedings of the Proceedings Third International Symposium on Games, 2012
CostParity and CostStreett Games.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
2011
Optimal Bounds in Parametric LTL Games
Proceedings of Second International Symposium on Games, 2011
Degrees of Lookahead in Contextfree Infinite Games.
Proceedings of the Computer Science Logic, 2011
2010
Playing Muller Games in a Hurry
Proceedings of the Proceedings First Symposium on Games, 2010
2009
TimeOptimal Winning Strategies for Poset Games.
Proceedings of the Implementation and Application of Automata, 2009