Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication

Andrew Arnold, Daniel S. Roche. Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication. In Kazuhiro Yokoyama, Steve Linton, Daniel Robertz, editors, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, Bath, United Kingdom, July 06 - 09, 2015. pages 29-36, ACM, 2015. [doi]

@inproceedings{ArnoldR15-1,
  title = {Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication},
  author = {Andrew Arnold and Daniel S. Roche},
  year = {2015},
  doi = {10.1145/2755996.2756653},
  url = {http://doi.acm.org/10.1145/2755996.2756653},
  researchr = {https://researchr.org/publication/ArnoldR15-1},
  cites = {0},
  citedby = {0},
  pages = {29-36},
  booktitle = {Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, Bath, United Kingdom, July 06 - 09, 2015},
  editor = {Kazuhiro Yokoyama and Steve Linton and Daniel Robertz},
  publisher = {ACM},
  isbn = {978-1-4503-3435-8},
}