Michael Luttenberger

activity

20082022

most citedParikh's Theorem: A simple and direct automaton construction

52 citations · 113 across the 8 of their papers we have counts for

collaborators

Showing 2008Show all

2 papers · 1 filter

cs.GT2008

Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games

Michael Luttenberger

This article extends the idea of solving parity games by strategy iteration to non-deterministic strategies: In a non-deterministic strategy a player restricts himself to some non-…

cs.DS2008

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations

Javier Esparza, Stefan Kiefer, Michael Luttenberger

Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations $X_{1} = f_{1} (X_{1}, ..., X_{n}),$ $..., X_{n} = f_{n} (X_{1}, ..., X_{n})$ where each $f_{i}$ is a polynomial w…