1. Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynomial interpolation. In Proceeding of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 301–309, ACM Press, New York (1988)
2. Bostan, A., Kauers, M.: The complete generating function for Gessel walks is algebraic. In Proceedings of the AMS, (2010); with an Appendix by Mark van Hoeij. To appear. http://www.risc.uni-linz.ac.at/people/mkauers/publications/bostan10.pdf
3. Boyle, A., Caviness, B.F. (ed.): Future Directions for Research in Symbolic Computation. SIAM, Philadelphia (1989);
4. Report of a Workshop on Symbolic and Algebraic Computation April 29???30, 1988 Washington DC. Anthony C. Hearn Workshop Chairperson. http://www.cis.udel.edu/~caviness/wsreport.pdf
5. Brown, C.W.: Fast simplification of Tarski formulas. In ISSAC’09 Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pp. 63–70, New York, NY, USA (2009)