default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Luttenberger
Person information
- affiliation: TU Munich, Department of Informatics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Swen Jacobs, Guillermo A. Pérez
, 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, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. Int. J. Softw. Tools Technol. Transf. 26(5): 551-567 (2024)- [c28]Michael Luttenberger, Maximilian Schlund:
Newton's Method - There and Back Again. Taming the Infinities of Concurrency 2024: 181-205 - 2023
- [c27]Chih-Hong Cheng, Michael Luttenberger, Rongjie Yan:
Runtime Monitoring DNN-Based Perception - (via the Lens of Formal Methods). RV 2023: 428-446 - [i15]Chih-Hong Cheng, Michael Luttenberger, Rongjie Yan:
Runtime Monitoring DNN-Based Perception. CoRR abs/2310.03999 (2023) - 2022
- [i14]Swen Jacobs, Guillermo A. Pérez, 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, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. CoRR abs/2206.00251 (2022) - 2021
- [j10]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-Word Transducers. Int. J. Found. Comput. Sci. 32(6): 761-783 (2021) - 2020
- [j9]Michael Luttenberger, Philipp J. Meyer, Salomon Sickert:
Practical synthesis of reactive systems from LTL specifications via parity games. Acta Informatica 57(1-2): 3-36 (2020) - [c26]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
Equivalence of Linear Tree Transducers with Output in the Free Group. DLT 2020: 207-221 - [c25]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-Word Transducers. DLT 2020: 222-236 - [i13]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
Equivalence of Linear Tree Transducers with Output in the Free Group. CoRR abs/2001.03480 (2020)
2010 – 2019
- 2019
- [i12]Michael Luttenberger, Philipp J. Meyer, Salomon Sickert:
Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games. CoRR abs/1903.12576 (2019) - [i11]Swen Jacobs, Roderick Bloem, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Philipp J. Meyer, Thibaud Michaud, Mouhammad Sakr, Salomon Sickert, Leander Tentrup, Adam Walker:
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results. CoRR abs/1904.07736 (2019) - [i10]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-word Transducers. CoRR abs/1911.13054 (2019) - 2018
- [c24]Philipp J. Meyer, Salomon Sickert, Michael Luttenberger:
Strix: Explicit Reactive Synthesis Strikes Back! CAV (1) 2018: 578-586 - [c23]Michael Luttenberger, Raphaela Palenta, Helmut Seidl:
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. STACS 2018: 48:1-48:13 - 2017
- [i9]Michael Luttenberger, Raphaela Palenta, Helmut Seidl:
Computing the longest common prefix of a context-free language in polynomial time. CoRR abs/1702.06698 (2017) - [i8]Philipp J. Meyer, Matthias Rungger, Michael Luttenberger, Javier Esparza, Majid Zamani:
Quantitative Implementation Strategies for Safety Controllers. CoRR abs/1712.05278 (2017) - 2016
- [j8]Michael Luttenberger, Maximilian Schlund:
Convergence of Newton's Method over Commutative Semirings. Inf. Comput. 246: 43-61 (2016) - [c22]Philipp J. Meyer, Michael Luttenberger:
Solving Mean-Payoff Games on the GPU. ATVA 2016: 262-267 - 2015
- [j7]Javier Esparza, Michael Luttenberger, Maximilian Schlund:
FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings. Int. J. Found. Comput. Sci. 26(7): 805-826 (2015) - [c21]Georg Bachmeier, Michael Luttenberger, Maximilian Schlund:
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity. LATA 2015: 473-485 - 2014
- [c20]Maximilian Schlund, Michael Luttenberger, Javier Esparza:
Fast and Accurate Unlexicalized Parsing via Structural Annotations. EACL 2014: 164-168 - [c19]Javier Esparza, Michael Luttenberger, Maximilian Schlund:
A Brief History of Strahler Numbers. LATA 2014: 1-13 - [c18]Michael Luttenberger, Maximilian Schlund:
Regular Expressions for Provenance. TAPP 2014 - [c17]Javier Esparza, Michael Luttenberger, Maximilian Schlund:
FPsolve: A Generic Solver for Fixpoint Equations over Semirings. CIAA 2014: 1-15 - [i7]Georg Bachmeier, Michael Luttenberger, Maximilian Schlund:
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity. CoRR abs/1410.2737 (2014) - 2013
- [c16]Philipp Hoffmann, Michael Luttenberger:
Solving Parity Games on the GPU. ATVA 2013: 455-459 - [c15]Michael Luttenberger, Maximilian Schlund:
Convergence of Newton's Method over Commutative Semirings. LATA 2013: 407-418 - [c14]Maximilian Schlund, Michal Terepeta, Michael Luttenberger:
Putting Newton into Practice: A Solver for Polynomial Equations over Semirings. LPAR 2013: 727-734 - 2012
- [j6]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Space-efficient scheduling of stochastically generated tasks. Inf. Comput. 210: 87-110 (2012) - 2011
- [j5]Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger:
Parikhʼs theorem: A simple and direct automaton construction. Inf. Process. Lett. 111(12): 614-619 (2011) - [j4]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Derivation tree analysis for accelerated fixed-point computation. Theor. Comput. Sci. 412(28): 3226-3241 (2011) - [c13]Javier Esparza, Michael Luttenberger:
Solving Fixed-Point Equations by Derivation Tree Analysis. CALCO 2011: 19-35 - [c12]Chih-Hong Cheng, Alois C. Knoll, Michael Luttenberger, Christian Buckl:
GAVS+: An Open Platform for the Research of Algorithmic Game Solving. TACAS 2011: 258-261 - [i6]Michael Luttenberger:
An Extension of Parikh's Theorem beyond Idempotence. CoRR abs/1112.2864 (2011) - 2010
- [b1]Michael Luttenberger:
Solving Polynomial Systems on Semirings (Lösen polynomieller Systeme über Semiringen). Technical University of Munich, Germany, 2010 - [j3]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Newtonian program analysis. J. ACM 57(6): 33:1-33:47 (2010) - [j2]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Computing the Least Fixed Point of Positive Polynomial Systems. SIAM J. Comput. 39(6): 2282-2335 (2010) - [c11]Chih-Hong Cheng, Christian Buckl, Michael Luttenberger, Alois C. Knoll:
GAVS: Game Arena Visualization and Synthesis. ATVA 2010: 347-352 - [c10]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Space-Efficient Scheduling of Stochastically Generated Tasks. ICALP (2) 2010: 539-550 - [p2]Michael Luttenberger:
Lösen polynomieller Gleichungssysteme über Semiringen. Ausgezeichnete Informatikdissertationen 2010: 211-220 - [p1]Javier Esparza, Michael Luttenberger:
Newtonian Program Analysis - An Introduction. Logics and Languages for Reliability and Security 2010: 31-72 - [i5]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Computing the Least Fixed Point of Positive Polynomial Systems. CoRR abs/1001.0340 (2010) - [i4]Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Space-efficient scheduling of stochastically generated tasks. CoRR abs/1004.4286 (2010) - [i3]Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger:
Parikh's Theorem: A simple and direct construction. CoRR abs/1006.3825 (2010)
2000 – 2009
- 2009
- [c9]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Solving Fixed-Point Equations on omega-Continuous Semirings. FICS 2009: 9 - 2008
- [c8]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Derivation Tree Analysis for Accelerated Fixed-Point Computation. Developments in Language Theory 2008: 301-313 - [c7]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Newton's Method for omega-Continuous Semirings. ICALP (2) 2008: 14-26 - [c6]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Solving Monotone Polynomial Equations. IFIP TCS 2008: 285-298 - [c5]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. STACS 2008: 289-300 - [i2]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. CoRR abs/0802.2856 (2008) - [i1]Michael Luttenberger:
Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games. CoRR abs/0806.2923 (2008) - 2007
- [c4]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
An Extension of Newton's Method to omega -Continuous Semirings. Developments in Language Theory 2007: 157-168 - [c3]Javier Esparza, Stefan Kiefer, Michael Luttenberger:
On Fixed Point Equations over Commutative Semirings. STACS 2007: 296-307 - [c2]Stefan Kiefer, Michael Luttenberger, Javier Esparza:
On the convergence of Newton's method for monotone systems of polynomial equations. STOC 2007: 217-226 - 2006
- [c1]Michael Luttenberger:
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic. CIAA 2006: 281-282 - 2004
- [j1]Matthias Hopf, Michael Luttenberger, Thomas Ertl:
Hierarchical Splatting of Scattered 4D Data. IEEE Computer Graphics and Applications 24(4): 64-72 (2004)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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.
last updated on 2024-10-16 21:21 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 was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
