Cache oblivious sparse polynomial factoring using the funnel heap

Fatima K. Abu Salem, Khalil El-Harake, Karl Gemayel. Cache oblivious sparse polynomial factoring using the funnel heap. In Jean-Guillaume Dumas, Erich L. Kaltofen, Clément Pernet, editors, Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, PASCO 2015, Bath, United Kingdom, July 10-12, 2015. pages 7-15, ACM, 2015. [doi]

@inproceedings{SalemEG15,
  title = {Cache oblivious sparse polynomial factoring using the funnel heap},
  author = {Fatima K. Abu Salem and Khalil El-Harake and Karl Gemayel},
  year = {2015},
  doi = {10.1145/2790282.2790283},
  url = {http://doi.acm.org/10.1145/2790282.2790283},
  researchr = {https://researchr.org/publication/SalemEG15},
  cites = {0},
  citedby = {0},
  pages = {7-15},
  booktitle = {Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, PASCO 2015, Bath, United Kingdom, July 10-12, 2015},
  editor = {Jean-Guillaume Dumas and Erich L. Kaltofen and Clément Pernet},
  publisher = {ACM},
  isbn = {978-1-4503-3599-7},
}