Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Seifert, Jean-Pierre"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Unfolded modular multiplication
Wieland Fischer
,
Jean-Pierre Seifert
Lecture Notes in Computer Science
2906
, 2003, pp. 726-735
On the complexity of computing short linearly independent vectors and short bases in a lattice
Johannes Blömer
,
Jean-Pierre Seifert
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 711-720
On routing in circulant graphs
Jin-Yi Cai
,
George Havas
,
Bernard Mans
,
Ajay Nerurkar
,
Jean-Pierre Seifert
,
Igor Shparlinski
Lecture Notes in Computer Science
1627
, 1999, pp. 360-369
The complexity of the extended GCD problem
George Havas
,
Jean-Pierre Seifert
Lecture Notes in Computer Science
1672
, 1999, pp. 103-113
On the hardness of approximating shortest integer relations among rational numbers
Carsten Rössner
,
Jean-Pierre Seifert
Theoretical Computer Science
209
(1-2), 1998, pp. 287-297
Approximating good simultaneous diophantine approximations is almost
NP
-hard
Carsten Rössner
,
Jean-Pierre Seifert
Lecture Notes in Computer Science
1113
, 1996, pp. 494-505
The complexity of approximate optima for greatest common divisor computations
Carsten Rössner
,
Jean-Pierre Seifert
Lecture Notes in Computer Science
1122
, 1996, pp. 307-322