Hierarchical Splatting of Scattered 4D Data. - Matthias Hopf; Michael Luttenberger; Thomas Ertl (IEEE Computer Graphics and Applications, 2004)

Reachability Analysis of Procedural Programs with Affine Integer Arithmetic. - Michael Luttenberger (CIAA, 2006)

An Extension of Newton's Method to omega -Continuous Semirings. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (Developments in Language Theory, 2007)

On Fixed Point Equations over Commutative Semirings. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (STACS, 2007)

On the convergence of Newton's method for monotone systems of polynomial equations. - Stefan Kiefer; Michael Luttenberger; Javier Esparza (STOC, 2007)

Newton's Method for omega-Continuous Semirings. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (ICALP (2), 2008)

Solving Monotone Polynomial Equations. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (IFIP TCS, 2008)

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (STACS, 2008)

Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games - Michael Luttenberger (CoRR, 2008)

Solving Fixed-Point Equations on omega-Continuous Semirings. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (FICS, 2009)

GAVS: Game Arena Visualization and Synthesis. - Chih-Hong Cheng; Christian Buckl; Michael Luttenberger; Alois C. Knoll (ATVA, 2010)

Lösen polynomieller Gleichungssysteme über Semiringen. - Michael Luttenberger (Ausgezeichnete Informatikdissertationen, 2010)

Parikh's Theorem: A simple and direct construction - Javier Esparza; Pierre Ganty; Stefan Kiefer; Michael Luttenberger (CoRR, 2010)

Newtonian program analysis. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (J. ACM, 2010)

Computing the Least Fixed Point of Positive Polynomial Systems. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (SIAM J. Comput., 2010)

Solving Polynomial Systems on Semirings (Lösen polynomieller Systeme über Semiringen) - Michael Luttenberger (2010)

Newtonian Program Analysis - An Introduction. - Javier Esparza; Michael Luttenberger (Logics and Languages for Reliability and Security, 2010)

Solving Fixed-Point Equations by Derivation Tree Analysis. - Javier Esparza; Michael Luttenberger (CALCO, 2011)

GAVS+: An Open Platform for the Research of Algorithmic Game Solving. - Chih-Hong Cheng; Alois C. Knoll; Michael Luttenberger; Christian Buckl (TACAS, 2011)

An Extension of Parikh's Theorem beyond Idempotence - Michael Luttenberger (CoRR, 2011)

Parikhʼs theorem: A simple and direct automaton construction. - Javier Esparza; Pierre Ganty; Stefan Kiefer; Michael Luttenberger (Inf. Process. Lett., 2011)

Derivation tree analysis for accelerated fixed-point computation. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (Theor. Comput. Sci., 2011)

Space-efficient scheduling of stochastically generated tasks. - Tomás Brázdil; Javier Esparza; Stefan Kiefer; Michael Luttenberger (Inf. Comput., 2012)

Solving Parity Games on the GPU. - Philipp Hoffmann; Michael Luttenberger (ATVA, 2013)

Putting Newton into Practice: A Solver for Polynomial Equations over Semirings. - Maximilian Schlund; Michal Terepeta; Michael Luttenberger (LPAR, 2013)

Fast and Accurate Unlexicalized Parsing via Structural Annotations. - Maximilian Schlund; Michael Luttenberger; Javier Esparza (EACL, 2014)

A Brief History of Strahler Numbers. - Javier Esparza; Michael Luttenberger; Maximilian Schlund (LATA, 2014)

Regular Expressions for Provenance. - Michael Luttenberger; Maximilian Schlund (TAPP, 2014)

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity. - Georg Bachmeier; Michael Luttenberger; Maximilian Schlund (LATA, 2015)

FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings. - Javier Esparza; Michael Luttenberger; Maximilian Schlund (Int. J. Found. Comput. Sci., 2015)

Solving Mean-Payoff Games on the GPU. - Philipp J. Meyer; Michael Luttenberger (ATVA, 2016)

Convergence of Newton's Method over Commutative Semirings. - Michael Luttenberger; Maximilian Schlund (Inf. Comput., 2016)

Quantitative Implementation Strategies for Safety Controllers. - Philipp J. Meyer; Matthias Rungger; Michael Luttenberger; Javier Esparza; Majid Zamani 001 (CoRR, 2017)

Strix: Explicit Reactive Synthesis Strikes Back! - Philipp J. Meyer; Salomon Sickert; Michael Luttenberger (CAV (1), 2018)

Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. - Michael Luttenberger; Raphaela Palenta; Helmut Seidl (STACS, 2018)

The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results. - Swen Jacobs; Roderick Bloem; Maximilien Colange; Peter Faymonville; Bernd Finkbeiner; Ayrat Khalimov 001; Felix Klein 001; Michael Luttenberger; Philipp J. Meyer; Thibaud Michaud; Mouhammad Sakr; Salomon Sickert; et al. (CoRR, 2019)

Equivalence of Linear Tree Transducers with Output in the Free Group. - Raphaela Löbel; Michael Luttenberger; Helmut Seidl (DLT, 2020)

Practical synthesis of reactive systems from LTL specifications via parity games. - Michael Luttenberger; Philipp J. Meyer; Salomon Sickert (Acta Informatica, 2020)

On the Balancedness of Tree-to-Word Transducers. - Raphaela Löbel; Michael Luttenberger; Helmut Seidl (Int. J. Found. Comput. Sci., 2021)

Runtime Monitoring DNN-Based Perception - (via the Lens of Formal Methods). - Chih-Hong Cheng; Michael Luttenberger; Rongjie Yan (RV, 2023)

Runtime Monitoring DNN-Based Perception. - Chih-Hong Cheng; Michael Luttenberger; Rongjie Yan (CoRR, 2023)

Newton's Method - There and Back Again. - Michael Luttenberger; Maximilian Schlund (Taming the Infinities of Concurrency, 2024)

The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. - Swen Jacobs; Guillermo A. Pérez 001; Remco Abraham; Véronique Bruyère; Michaël Cadilhac; Maximilien Colange; Charly Delfosse; Tom van Dijk; Alexandre Duret-Lutz; Peter Faymonville; Bernd Finkbeiner; Ayrat Khalimov 001; et al. (Int. J. Softw. Tools Technol. Transf., 2024)