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
[1]
Hilfe
Suche: Author="Novocin, Andrew"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generating subfields
Mark van Hoeij
,
Jürgen Klüners
,
Andrew Novocin
Journal Symbolic Computation
52
, 2013, pp. 17-34
Gradual sub-lattice reduction and a new complexity for factoring polynomials
Mark van Hoeij
,
Andrew Novocin
Algorithmica
63
(3), 2012, pp. 616-633
Practical divide-and-conquer algorithms for polynomial arithmetic
William Hart
,
Andrew Novocin
Lecture Notes in Computer Science
6885
, 2011, pp. 200-214
Practical polynomial factoring in polynomial time
William Hart
,
Mark van Hoeij
,
Andrew Novocin
Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, ISSAC'2011 (San Jose, CA, USA, June 8-11, 2011)
, 2011, pp. 163-170
An LLL-reduction algorithm with quasi-linear time complexity
Andrew Novocin
,
Damien Stehlé
,
Gilles Villard
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 403-412
Generating subfields
Mark van Hoeij
,
Jürgen Klüners
,
Andrew Novocin
Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, ISSAC'2011 (San Jose, CA, USA, June 8-11, 2011)
, 2011, pp. 345-352
Gradual sub-lattice reduction and a new complexity for factoring polynomials
Mark van Hoeij
,
Andrew Novocin
Lecture Notes in Computer Science
6034
, 2010, pp. 539-553