Michael Luttenberger

According to our database1, Michael Luttenberger authored at least 45 papers between 2004 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results.
CoRR, 2019

Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games.
CoRR, 2019

2018
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Strix: Explicit Reactive Synthesis Strikes Back!
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Quantitative Implementation Strategies for Safety Controllers.
CoRR, 2017

Computing the longest common prefix of a context-free language in polynomial time.
CoRR, 2017

2016
Convergence of Newton's Method over Commutative Semirings.
Inf. Comput., 2016

Solving Mean-Payoff Games on the GPU.
Proceedings of the Automated Technology for Verification and Analysis, 2016

2015
FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings.
Int. J. Found. Comput. Sci., 2015

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity.
CoRR, 2014

FPsolve: A Generic Solver for Fixpoint Equations over Semirings.
Proceedings of the Implementation and Application of Automata, 2014

Regular Expressions for Provenance.
Proceedings of the 6th Workshop on the Theory and Practice of Provenance, 2014

A Brief History of Strahler Numbers.
Proceedings of the Language and Automata Theory and Applications, 2014

Fast and Accurate Unlexicalized Parsing via Structural Annotations.
Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, 2014

2013
Putting Newton into Practice: A Solver for Polynomial Equations over Semirings.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Convergence of Newton's Method over Commutative Semirings.
Proceedings of the Language and Automata Theory and Applications, 2013

Solving Parity Games on the GPU.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Space-efficient scheduling of stochastically generated tasks.
Inf. Comput., 2012

2011
Derivation tree analysis for accelerated fixed-point computation.
Theor. Comput. Sci., 2011

Parikhʼs theorem: A simple and direct automaton construction.
Inf. Process. Lett., 2011

An Extension of Parikh's Theorem beyond Idempotence
CoRR, 2011

GAVS+: An Open Platform for the Research of Algorithmic Game Solving.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Solving Fixed-Point Equations by Derivation Tree Analysis.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Newtonian Program Analysis - An Introduction.
Proceedings of the Logics and Languages for Reliability and Security, 2010

Computing the Least Fixed Point of Positive Polynomial Systems.
SIAM J. Comput., 2010

Newtonian program analysis.
J. ACM, 2010

Parikh's Theorem: A simple and direct construction
CoRR, 2010

Space-efficient scheduling of stochastically generated tasks
CoRR, 2010

Computing the Least Fixed Point of Positive Polynomial Systems
CoRR, 2010

Space-Efficient Scheduling of Stochastically Generated Tasks.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Lösen polynomieller Gleichungssysteme über Semiringen.
Proceedings of the Ausgezeichnete Informatikdissertationen 2010, 2010

GAVS: Game Arena Visualization and Synthesis.
Proceedings of the Automated Technology for Verification and Analysis, 2010

2009
Solving Fixed-Point Equations on omega-Continuous Semirings.
Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

2008
Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games
CoRR, 2008

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
CoRR, 2008

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations.
Proceedings of the STACS 2008, 2008

Solving Monotone Polynomial Equations.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Newton's Method for omega-Continuous Semirings.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Derivation Tree Analysis for Accelerated Fixed-Point Computation.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
On the convergence of Newton's method for monotone systems of polynomial equations.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

On Fixed Point Equations over Commutative Semirings.
Proceedings of the STACS 2007, 2007

An Extension of Newton's Method to omega -Continuous Semirings.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic.
Proceedings of the Implementation and Application of Automata, 2006

2004
Hierarchical Splatting of Scattered 4D Data.
IEEE Computer Graphics and Applications, 2004


  Loading...