1. Bachmann, O., Schönemann, H., 1998. Monomial representations for Gröbner bases computations. In: Proc. ISSAC’98, pp. 309–316.
2. Biscani, F., 2010. Multiplication of sparse Laurent polynomials and Poisson series on modern hardware architectures. Submitted to arXiv, Cornell University Library. http://arxiv.org.
3. The Magma algebra system I: the user language;Bosma;Journal of Symbolic Computation,1997
4. Comparing the speed of programs for sparse polynomial multiplication;Fateman;ACM SIGSAM Bulletin,2003
5. Fateman, R., 2008. What it’s worth to write a short program for polynomial multiplication. Unpublished manuscript. See http://www.cs.berkeley.edu/~fateman/papers/shortprog.pdf.