[1] González-López, M., & Recio, T. (1993). The ROMIN inverse geometric model and the dynamic evaluation method, in Proc. of the 1991 SCAFI Seminar, Computer Algebra in Industry. Wiley.
[2] Buchberger, B. (2006). "Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero-dimensional polynomial ideal, J. Symb. Comput., 41 (3-4), 475-511.https://doi.org/10.1016/j.jsc.2005.09.007
[3] Buchberger, B. (1979). A criterion for detecting unnecessary reductions in the construction of Gröbner bases, in International Symposium on Symbolic and Algebraic Manipulation, 3-21. https://doi.org/10.1007/3-540-09519-5_52
[4] Lazard, D. (1983). Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, in European Conference on Computer Algebra, 146-156. https://doi.org/10.1007/3-540-12868-9_99
[5] Faugere, J.-C. (1999). A new efficient algorithm for computing Gröbner bases (F4),
Journal of Pure and Applied Algebra, 139 (1-3), 61-88. https://doi.org/10.1016/S0022-4049(99)00005-5
[6] Faugere, J.-C. (2002). A new efficient algorithm for computing Gröbner bases without reduction to zero (F_
5), Proceedings of the International Symposium on Symbolic and Algebraic Computation, 75-83. https://doi.org/10.1145/780506.780516
[7] Weispfenning, V. (1992). Comprehensive Gröbner bases, Journal of Symbolic Computation, 14, (1), 1-29. doi:10.1016/0747-7171(92)90023-W.
[8] Dehghani Darmian, M. (2024). Efficient Algorithm for Computing Inverse of Parametric Matrices, Scientific Annals of Computer Science, 1, 1-22. doi:10.47743/SACS.2024.1.1.
[9] Dehghani Darmian, M. (2024). Improvement of an incremental signature-based comprehensive Gröbner system algorithm, Math. Comput. Sci, 18 (12). doi:http://dx.doi. org/10.1007/s11786-024-00587-w.
[10] Dehghani Darmian, M., & Hashemi, A. (2017). Parametric FGLM algorithm, Journal of Symbolic Computation, 82, 38-56. doi:10.1016/j.jsc.2016.12.006.
[11] Dehghani Darmian, M., & Hashemi, A. (2024). Parametric F4 Algorithm, Iranian Journal of Mathematical Sciences and Informatics, 19 (4), 117-133. doi:http://dx.doi.org/10.61186/ ijmsi.19.1.117.
[12] Dehghani Darmian, M., Hashemi, A., & Montes, A. (2011). Erratum to “A new algorithm for discussing Gröbner bases with parameters” J. Symb. Comput. 33 (1- 2)(2002) 183-208, J. Symb. Comput.," 46 (10), 1187-1188. doi:10.1016/J.JSC.2011.05.002.
[13] Hashemi, A., Dehghani Darmian, M., & Barkhordar, M. (2018, July 24-27). Universal Gröbner basis for parametric polynomial ideals, in Mathematical Software–ICMS 2018: 6th International Conference, South Bend, IN, USA, Proceedings Springer, 191-199. doi:http://dx.doi. org/10.1007/978-3-319-96418- 8_23.
[14] Hashemi, A., Dehghani Darmian, M., & Barkhordar, M. (2017). Gröbner systems conversion, Mathematics in Computer Science, 11, 61-77.
doi:10.1007/S11786- 017-0295-3.
[15] Hashemi, A., M.-Alizadeh, B., & Dehghani Darmian, M. (2013).
Minimal polynomial systems for parametric matrices, Linear and Multilinear Algebra, 61 (2), 265-272. doi:https://doi.org/ 10.1080/03081087.2012.670235.
[16] Kapur, D., Sun, Y., & Wang, D. (2010). A new algorithm for computing comprehensive Gröbner systems, in Proceedings of the International Symposium on Symbolic and Algebraic Computation, 29-36.
doi:10.1145/1837934.1837946.
[17] Kapur, D., Sun, Y., & Wang, D. (2013). An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system, Journal of Symbolic Computation, 49, 27-44.
https://doi.org/10.1016/j.jsc.2011.12.015
[18] Kapur, D., Sun, Y., & Wang, D. (2013). An efficient method for computing comprehensive Gröbner bases, Journal of Symbolic Computation. Comput., 52, 124-142.
https://doi.org/10.1016/j.jsc.2012.05.015
[19] Kapur, D., Sun, Y., Wang, D., & Zhou, J. (2015, July 20–23). The generalized Rabinowitsch trick, in Applications of Computer Algebra: Kalamata, Greece, Springer, 219-229. doi:10.1007/978-3-319-56932-1_14
[20] Montes, A. (2002). A new algorithm for discussing Gröbner bases with parameters, J. Symb. Comput., 33 (2), 183-208. doi:10.1006/JSCO.2001.0504.
[21] Montes, A., & Wibmer, M. (2010). Gröbner bases for polynomial systems with parameters, J. Symb. Comput., 45 (12), 1391-1425.
doi:10.1016/J.JSC.2010.06.017.
[22] Montes, A., & Wibmer, M. (2014, August 5-9). Software for discussing parametric polynomial systems: The Gröbner Cover, in Mathematical Software–ICMS 2014: 4th International Congress, Seoul, South Korea, Proceedings 4, 406-413. doi: 10.1007/978-3-662-44199-2_62
[23] Suzuki, A., & Sato, Y. (2006). A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases, in Proceedings of the International Symposium on Symbolic and Algebraic Computation, 326-331. doi:10.1145/1145768.1145821.
[24] Weispfenning, V. (2002). Canonical comprehensive Gröbner bases, in Proceedings of the International Symposium on Symbolic and Algebraic Computation, 270- 276. https://doi.org/10.1145/780506.780541
[25] Abánades, M., Botana, F., Montes, A., & Recio, T. (2014, August 5-9). Software using the Gröbner Cover for geometrical loci computation and classification, in Mathematical Software–ICMS 2014: 4th International Congress, Seoul, South Korea, Proceedings 4, 492-499. doi: 10.1007/978-3-662-44199-2_74.
[26] Cox, D. A., Little, J., & O'Shea, D. (2005). Using algebraic geometry. Springer Science & Business Media. https://doi.org/10.1007/b138611.
[27] Dehghani Darmian, M., Hashemi, A. (2010, November 10-11). Classification of cubic curves by Gröbner systems, presented at the 21st Algebra seminar of Iran, Tabriz, Iran.
[28] Montes, A., & Recio, T. (2006, August 31-September 2). Automatic discovery of geometry theorems using minimal canonical comprehensive Gröbner systems, in Automated Deduction in Geometry: 6th International Workshop, Pontevedra, Spain,113-138. doi: 10.5555/1784950.1784958.
[29] Suzuki, A., & Sato, Y. (2009). Computation of inverses in residue class rings of parametric polynomial ideal, in Proceedings of the International Symposium on Symbolic and Algebraic Computation, 311-316. https://doi.org/10.1145/1576702.15767
[30] Dimitrova, E. S., Jarrah, A. S., Laubenbacher, R., & Stigler. B. (2007). A Gröbner fan method for biochemical network modeling, in Proceedings of the International Symposium on Symbolic and Algebraic Computation, 122-126. https://doi.org/10.1145/1277548.127756
[31] Laubenbacher, R., & Stigler. B. (2004). A computational algebra approach to the reverse engineering of gene regulatory networks, Journal of Theoretical Biology, 229 (4), 523-537. https://doi.org/10.1016/j.jtbi.2004.04.037
[32] 
Cox, D. A., Little, J., & O'Shea, D. (2015). Ideals, varieties, and algorithms. Springer. doi:10.1007/978-3-319-16721-3.
[33] 
Dolzmann, A., & Sturm, T. (1997). Redlog: Computer algebra meets computer logic, ACM SIGSAM Bulletin, 31 (2), 2-9. https://doi.org/10.1145/261320.261324
[34] Montes, A. (1998). Algebraic solution of the load-flow problem for a 4-node electrical network, Mathematics and Computers in Simulation, 45 (1-2), 163-174. https://doi.org/10.1016/S0378-4754(97)00092-X
[35] Sit, W. Y. (1992). An algorithm for solving parametric linear systems, Journal of Symbolic Computation, 13 (4), 353-394.
[36] Kalkbrener, M. (1997). On the stability of Gröbner bases under specializations, J. Symb. Comput, 24(1), 51-58. https://doi.org/10.1145/3666000.3669718
