#### Filter Results:

- Full text PDF available (32)

#### Publication Year

2004

2018

- This year (2)
- Last 5 years (13)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Javier Esparza, Stefan Kiefer, Michael Luttenberger
- STACS
- 2008

Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with positive realâ€¦ (More)

- Javier Esparza, Stefan Kiefer, Michael Luttenberger
- SIAM J. Comput.
- 2010

We consider equation systems of the form X 1 = f 1 are polynomials with positive real coefficients. In vector form we denote such an equation system by X = f(X) and call f a system of positiveâ€¦ (More)

- Stefan Kiefer, Michael Luttenberger, Javier Esparza
- STOC
- 2007

Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn) where each fi is a polynomial with positive real coefficients.â€¦ (More)

- Javier Esparza, Michael Luttenberger
- CALCO
- 2011

Systems of equations over Ï‰-continuous semirings can be mapped to context-free grammars in a natural way. We show how an analysis of the derivation trees of the grammar yields new algorithms forâ€¦ (More)

- Javier Esparza, Stefan Kiefer, Michael Luttenberger
- STACS
- 2007

Fixed point equations x = f(x) over Ï‰-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f(0), . . . converges to the leastâ€¦ (More)

- Matthias Hopf, Michael Luttenberger, Thomas Ertl
- IEEE Computer Graphics and Applications
- 2004

To let scientists interactively view these data sets at high resolution on desktop workstations or PCs, we want to visualize the scattered data directly without resampling them to a volume density.â€¦ (More)

- Javier Esparza, Stefan Kiefer, Michael Luttenberger
- J. ACM
- 2010

This article presents a novel generic technique for solving dataflow equations in interprocedural dataflow analysis. The technique is obtained by generalizing Newton's method for computing a zero ofâ€¦ (More)

Fixed point equations x = F (x) over Ï‰-continuous semirings are a natural mathematical foundation of interprocedural program analysis. Equations over the semiring of the real numbers can be solvedâ€¦ (More)

- Michael Luttenberger
- ArXiv
- 2008

This article extends the idea of solving parity games by stra tegy iteration to non-deterministic strategies: In a non-determi nistic strategy a player restricts himself to some non-empty subset ofâ€¦ (More)

- Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger
- ArXiv
- 2010

Parikhâ€™s theorem states that every context-free language has the same Parikh image as some regular language. We present a very simple construction that, given a context-free grammar, produces aâ€¦ (More)