|
Search the dblp DataBase
Carsten Rössner:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Carsten Rössner, Jean-Pierre Seifert
The Complexity of Approximate Optima for Greatest Common Divisor Computations. [Citation Graph (0, 0)][DBLP] ANTS, 1996, pp:307-322 [Conf]
- Carsten Rössner, Claus-Peter Schnorr
An Optimal, Stable Continued Fraction Algorithm. [Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:31-43 [Conf]
- Carsten Rössner, Claus-Peter Schnorr
Computation of Highly Regular Nearby Points. [Citation Graph (0, 0)][DBLP] ISTCS, 1995, pp:174-181 [Conf]
- Carsten Rössner, Jean-Pierre Seifert
Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard. [Citation Graph (0, 0)][DBLP] MFCS, 1996, pp:494-505 [Conf]
- Carsten Rössner, Claus-Peter Schnorr
An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:20, pp:- [Journal]
- Carsten Rössner, Jean-Pierre Seifert
On the Hardness of Approximating Shortest Integer Relations among Rational Numbers. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:209, n:1-2, pp:287-297 [Journal]
Search in 0.003secs, Finished in 0.003secs
|