How to Compute Interval Inclusions of Geodetic Coordinates from Interval Inclusions of Cartesian Coordinates. - Gerhard Heindl (Reliab. Comput., 1997)

Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow. - Gerhard Heindl; Vladik Kreinovich; Anatoly V. Lakeyev (Reliab. Comput., 1998)

How to Guarantee Finite Termination of Verifying Global Optimization Codes. - Gerhard Heindl (Reliab. Comput., 1999)

A Representation of the Interval Hull of a Tolerance Polyhedron Describing Inclusions of Function Values and Slopes. - Gerhard Heindl (Reliab. Comput., 1999)

In Case of Interval (or More General) Uncertainty, No Algorithm Can Choose the Simplest Representative. - Gerhard Heindl; Vladik Kreinovich; Maria Rifqi (Reliab. Comput., 2002)

Result Verification for Computational Problems in Geodesy. - Stefan Borovac; Gerhard Heindl (Numerical Software with Result Verification, 2003)