1. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York (2000), ISBN 1-58113-184-4, See [8]
2. Augot, D., Barbier, M., Couvreur, A.: List-decoding of binary Goppa codes up to the binary Johnson bound, http://arxiv.org/abs/1012.3439 , Citations in this document: §1
3. Avanzi, R.M.: A study on polynomials in separated variables with low genus factors, Ph.D. thesis, Universität Essen (2001), http://caccioppoli.mac.rub.de/website/papers/phdthesis.pdf , Citations in this document: §6
4. Bernstein, D.J.: Fast multiplication and its applications. In: [11], pp. 325–384 (2008), http://cr.yp.to/papers.html#multapps , Citations in this document: §1
5. Bernstein, D.J.: Reducing lattice bases to find small-height values of univariate polynomials. In: [11], pp. 421–446 (2008), http://cr.yp.to/papers.html#smallheight , Citations in this document: §3, §3, §3, §3, §7