Computation of Highly Regular Nearby Points. - Carsten Rössner; Claus-Peter Schnorr (ISTCS, 1995)

The Complexity of Approximate Optima for Greatest Common Divisor Computations. - Carsten Rössner; Jean-Pierre Seifert (ANTS, 1996)

An Optimal, Stable Continued Fraction Algorithm. - Carsten Rössner; Claus-Peter Schnorr (IPCO, 1996)

Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard. - Carsten Rössner; Jean-Pierre Seifert (MFCS, 1996)

An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension - Carsten Rössner; Claus-Peter Schnorr (Electron. Colloquium Comput. Complex., 1996)

Factoring via Strong Lattice Reduction Algorithms. - Harald Ritter; Carsten Rössner (IACR Cryptol. ePrint Arch., 1997)

On the Hardness of Approximating Shortest Integer Relations among Rational Numbers. - Carsten Rössner; Jean-Pierre Seifert (Theor. Comput. Sci., 1998)