Carsten Rössner

According to our database, Carsten Rössner authored at least 7 papers between 1995 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1998

On the Hardness of Approximating Shortest Integer Relations among Rational Numbers.

Carsten Rössner, Jean-Pierre Seifert

Theor. Comput. Sci., 1998

1997

Factoring via Strong Lattice Reduction Algorithms.

Harald Ritter, Carsten Rössner

IACR Cryptol. ePrint Arch., 1997

1996

An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension

Carsten Rössner, Claus-Peter Schnorr

Electron. Colloquium Comput. Complex., 1996

Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard.

Carsten Rössner, Jean-Pierre Seifert

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

An Optimal, Stable Continued Fraction Algorithm.

Carsten Rössner, Claus-Peter Schnorr

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

The Complexity of Approximate Optima for Greatest Common Divisor Computations.

Carsten Rössner, Jean-Pierre Seifert

Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

1995

Computation of Highly Regular Nearby Points.

Carsten Rössner, Claus-Peter Schnorr

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995