| |
| 1998 | ||
|---|---|---|
| 6 | EE | Carsten Rössner, Jean-Pierre Seifert: On the Hardness of Approximating Shortest Integer Relations among Rational Numbers. Theor. Comput. Sci. 209(1-2): 287-297 (1998) |
| 1996 | ||
| 5 | Carsten Rössner, Jean-Pierre Seifert: The Complexity of Approximate Optima for Greatest Common Divisor Computations. ANTS 1996: 307-322 | |
| 4 | Carsten Rössner, Claus-Peter Schnorr: An Optimal, Stable Continued Fraction Algorithm. IPCO 1996: 31-43 | |
| 3 | Carsten Rössner, Jean-Pierre Seifert: Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard. MFCS 1996: 494-505 | |
| 2 | EE | Carsten Rössner, Claus-Peter Schnorr: An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension Electronic Colloquium on Computational Complexity (ECCC) 3(20): (1996) |
| 1995 | ||
| 1 | Carsten Rössner, Claus-Peter Schnorr: Computation of Highly Regular Nearby Points. ISTCS 1995: 174-181 | |
| 1 | Claus-Peter Schnorr | [1] [2] [4] |
| 2 | Jean-Pierre Seifert | [3] [5] [6] |