Gerhard Heindl

发表

Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow

Vladik Kreinovich, Anatoly V. Lakeyev, Gerhard Heindl, 1998, Reliab. Comput..

How to Guarantee Finite Termination of Verifying Global Optimization Codes

Gerhard Heindl, 1999, Reliab. Comput..

Result Verification for Computational Problems in Geodesy

Gerhard Heindl, Stefan Borovac, 2003, Numerical Software with Result Verification.

How to Compute Interval Inclusions of Geodetic Coordinates from Interval Inclusions of Cartesian Coordinates

Gerhard Heindl, G. Heindl, 1997, Reliab. Comput..

In Case of Interval (or More General) Uncertainty, No Algorithm Can Choose the Simplest Representative

Vladik Kreinovich, Maria Rifqi, Gerhard Heindl, 2002, Reliab. Comput..

A Representation of the Interval Hull of a Tolerance Polyhedron Describing Inclusions of Function Values and Slopes

Gerhard Heindl, 1998, SCAN.

A Representation of the Interval Hull of a Tolerance Polyhedron Describing Inclusions of Function Values and Slopes

Gerhard Heindl, 1999, Reliab. Comput..

Construction and Applications of Hermite Interpolating Quadratic Spline Functions of two and three Variables

Gerhard Heindl, 1985 .

Interpolation and Approximation by Piecewise Quadratic C1 — Functions of Two Variables

Gerhard Heindl, G. Heindl, 1979 .

On the existence theorems of Kantorovich, Miranda and Borsuk.

Andreas Frommer, Götz Alefeld, Gerhard Heindl, 2004 .