2003 | ||
---|---|---|
7 | EE | Stefan Borovac, Gerhard Heindl: Result Verification for Computational Problems in Geodesy. Numerical Software with Result Verification 2003: 226-242 |
2002 | ||
6 | EE | Gerhard Heindl, Vladik Kreinovich, Maria Rifqi: In Case of Interval (or More General) Uncertainty, No Algorithm Can Choose the Simplest Representative. Reliable Computing 8(3): 213-227 (2002) |
1999 | ||
5 | EE | Gerhard Heindl: How to Guarantee Finite Termination of Verifying Global Optimization Codes. Reliable Computing 5(1): 63-68 (1999) |
4 | EE | Gerhard Heindl: A Representation of the Interval Hull of a Tolerance Polyhedron Describing Inclusions of Function Values and Slopes. Reliable Computing 5(3): 269-278 (1999) |
1998 | ||
3 | EE | Gerhard Heindl, Vladik Kreinovich, Anatoly V. Lakeyev: Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow. Reliable Computing 4(4): 377-381 (1998) |
2 | EE | Gerhard Heindl, Vladik Kreinovich, Anatoly V. Lakeyev: Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow. Reliable Computing 4(4): 383-388 (1998) |
1997 | ||
1 | EE | Gerhard Heindl: How to Compute Interval Inclusions of Geodetic Coordinates from Interval Inclusions of Cartesian Coordinates. Reliable Computing 3(4): 421-435 (1997) |
1 | Stefan Borovac | [7] |
2 | Vladik Kreinovich | [2] [3] [6] |
3 | Anatoly V. Lakeyev | [2] [3] |
4 | Maria Rifqi | [6] |