| |
| 2007 | ||
|---|---|---|
| 9 | EE | Juan Manuel Peña, Tomas Sauer: Efficient polynomial reduction. Adv. Comput. Math. 26(1-3): 323-336 (2007) |
| 8 | EE | Tomas Sauer: Approximate varieties, approximate ideals and dimension reduction. Numerical Algorithms 45(1-4): 295-313 (2007) |
| 2004 | ||
| 7 | EE | Dietrich Braess, Tomas Sauer: Bernstein polynomials and learning theory. Journal of Approximation Theory 128(2): 187-206 (2004) |
| 6 | Tomas Sauer: Lagrange interpolation on subgrids of tensor product grids. Math. Comput. 73(245): 181-190 (2004) | |
| 2003 | ||
| 5 | EE | Rida T. Farouki, Tim N. T. Goodman, Tomas Sauer: Construction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains. Computer Aided Geometric Design 20(4): 209-230 (2003) |
| 2002 | ||
| 4 | EE | Dietrich Braess, Jürgen Forster, Tomas Sauer, Hans-Ulrich Simon: How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution. ALT 2002: 380-394 |
| 2000 | ||
| 3 | EE | Juan Manuel Peña, Tomas Sauer: On the Multivariate Horner Scheme II: Running Error Analysis. Computing 65(4): 313-322 (2000) |
| 1995 | ||
| 2 | EE | Tomas Sauer: Axially parallel subsimplices and convexity. Computer Aided Geometric Design 12(5): 491-505 (1995) |
| 1991 | ||
| 1 | EE | Tomas Sauer: Multivariate Bernstein polynomials and convexity. Computer Aided Geometric Design 8(6): 465-478 (1991) |
| 1 | Dietrich Braess | [4] [7] |
| 2 | Rida T. Farouki | [5] |
| 3 | Jürgen Forster | [4] |
| 4 | Tim N. T. Goodman | [5] |
| 5 | Juan Manuel Peña | [3] [9] |
| 6 | Hans-Ulrich Simon | [4] |