Formal Algorithmic Elimination for PDEs

Daniel Robertz. Formal Algorithmic Elimination for PDEs. In Sergei A. Abramov, Eugene V. Zima, Xiao-Shan Gao, editors, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016. pages 19-22, ACM, 2016. [doi]

@inproceedings{Robertz16,
  title = {Formal Algorithmic Elimination for PDEs},
  author = {Daniel Robertz},
  year = {2016},
  doi = {10.1145/2930889.2930941},
  url = {http://doi.acm.org/10.1145/2930889.2930941},
  researchr = {https://researchr.org/publication/Robertz16},
  cites = {0},
  citedby = {0},
  pages = {19-22},
  booktitle = {Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016},
  editor = {Sergei A. Abramov and Eugene V. Zima and Xiao-Shan Gao},
  publisher = {ACM},
  isbn = {978-1-4503-4380-0},
}