Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Luttenberger, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Space-efficient scheduling of stochastically generated tasks
Tomás̑ Brázdil
,
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Information and Computation
210
, 2012, pp. 87-110
Parikh's theorem: A simple and direct automaton construction
Javier Esparza
,
Pierre Ganty
,
Stefan Kiefer
,
Michael Luttenberger
Information Processing Letters
111
(12), 2011, pp. 614-619
Derivation tree analysis for accelerated fixed-point computation
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Theoretical Computer Science
412
(28), 2011, pp. 3226-3241
Space-efficient scheduling of stochastically generated tasks
Tomás̑ Brázdil
,
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Lecture Notes in Computer Science
6199
, 2010, pp. 539-550
Newtonian program analysis
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Journal of the ACM
57
(6), 2010, pp. 33: 1-47
Computing the least fixed point of positive polynomial systems
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
SIAM Journal on Computing
39
(6), 2010, pp. 2282-2335
Newton's method for
\omega
-continuous semirings
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Lecture Notes in Computer Science
5126
, 2008, pp. 14-26
Convergence thresholds of Newton's method for monotone polynomial equations
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 289-300
On fixed point equations over commutative semirings
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Lecture Notes in Computer Science
4393
, 2007, pp. 296-307
On the convergence of Newton's method for monotone systems of polynomial equations
Stefan Kiefer
,
Michael Luttenberger
,
Javier Esparza
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 217-226