 | 2005 |
|---|
| 9 |       | Dietrich Braess,
Anna Nagurney,
Tina Wakolbinger:
On a Paradox of Traffic Planning.
Transportation Science 39(4): 446-450 (2005) |
| 2004 |
|---|
| 8 | | Dietrich Braess,
Tomas Sauer:
Bernstein polynomials and learning theory.
Journal of Approximation Theory 128(2): 187-206 (2004) |
| 2002 |
|---|
| 7 | | 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 |
| 6 | | Dietrich Braess,
Peter Deuflhard,
Konstantin Lipnikov:
A Subspace Cascadic Multigrid Method for Mortar Elements.
Computing 69(3): 205-225 (2002) |
| 1999 |
|---|
| 5 | | Dietrich Braess,
Maksimillian Dryja,
Wolfgang Hackbusch:
A Multigrid Method for Nonconforming FE-Discretisations with Application to Non-Matching Grids.
Computing 63(1): 1-25 (1999) |
| 1995 |
|---|
| 4 | | Dietrich Braess:
Towards Algebraic Multigrid for Elliptic Problems of Second Order.
Computing 55(4): 379-393 (1995) |
| 1975 |
|---|
| 3 | | Dietrich Braess:
Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems.
Computing 15(2): 157-167 (1975) |
| 1967 |
|---|
| 2 | | Dietrich Braess:
Approximation mit Exponentialsummen.
Computing 2(4): 309-321 (1967) |
| 1966 |
|---|
| 1 | | Dietrich Braess:
Über Dämpfung bei Minimalisierungsverfahren.
Computing 1(3): 264-272 (1966) |
