{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:07:57Z","timestamp":1776881277548,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":101,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,28]]},"DOI":"10.1145\/3747199.3747556","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T10:51:17Z","timestamp":1762771877000},"page":"140-149","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Symbolic Mathematical Computation 1965\u20131975"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0515-1572","authenticated-orcid":false,"given":"Robert M.","family":"Corless","sequence":"first","affiliation":[{"name":"Computer Science, Western University, London, ON, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0196-3249","authenticated-orcid":false,"given":"Arthur C.","family":"Norman","sequence":"additional","affiliation":[{"name":"Trinity College, Cambridge, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1011-295X","authenticated-orcid":false,"given":"Tomas","family":"Recio","sequence":"additional","affiliation":[{"name":"Universidad Antonio de Nebrija, Madrid, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4734-9894","authenticated-orcid":false,"given":"William J.","family":"Turkel","sequence":"additional","affiliation":[{"name":"Department of History, Western University, London, ON, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8303-4983","authenticated-orcid":false,"given":"Stephen M.","family":"Watt","sequence":"additional","affiliation":[{"name":"Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Erwin\u00a0H. Bareiss. 1968. Sylvester\u2019s identity and multistep integer-preserving Gaussian elimination. Mathematics of computation 22 103 (1968) 565\u2013578.","DOI":"10.1090\/S0025-5718-1968-0226829-0"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Erwin\u00a0H. Bareiss. 1972. Computational solutions of matrix problems over an integral domain. IMA Journal of Applied Mathematics 10 1 (1972) 68\u2013104.","DOI":"10.1093\/imamat\/10.1.68"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","unstructured":"David Barton. 1967. A Scheme for Manipulative Algebra on a Computer. Comput. J. 9 4 (02 1967) 340\u2013344. 10.1093\/comjnl\/9.4.340","DOI":"10.1093\/comjnl\/9.4.340"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"David Barton Stephen\u00a0R. Bourne and Colin\u00a0J. Burgess. 1968. A simple algebra system. Comput. J. 11 3 (01 1968) 293\u2013298. 10.1093\/comjnl\/11.3.293","DOI":"10.1093\/comjnl\/11.3.293"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"David Barton and John\u00a0P. Fitch. 1972. Applications of algebraic manipulation programs in physics. Reports on Progress in Physics 35 1 (1972) 235.","DOI":"10.1088\/0034-4885\/35\/1\/305"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.5555\/889211"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/800005.807967"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/1141880.1243440"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Elwyn\u00a0R. Berlekamp. 1967. Factoring Polynomials over Finite Fields. Bell System Technical Journal 46 (1967) 1853\u20131859.","DOI":"10.1002\/j.1538-7305.1967.tb03174.x"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1460690.1460735"},{"key":"e_1_3_3_2_12_2","first-page":"29","volume-title":"Report on Symbolic Algebraic Computations Workshop, April, TR-200","author":"Boyle Ann","year":"1988","unstructured":"Ann Boyle and Bobby\u00a0F. Caviness. 1988. Future directions for research in symbolic computation. In Report on Symbolic Algebraic Computations Workshop, April, TR-200. Society for Industrial and Applied Mathematics, Washington DC, USA, 29\u201330."},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977233"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"crossref","unstructured":"William\u00a0S Brown. 1971. On Euclid\u2019s algorithm and the computation of polynomial greatest common divisors. Journal of the ACM (JACM) 18 4 (1971) 478\u2013504.","DOI":"10.1145\/321662.321664"},{"key":"e_1_3_3_2_15_2","unstructured":"Bruno Buchberger. 1965. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.\u00a0D. Dissertation. Mathematical Institute Leopold Franzens University Innsbruck Austria."},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","unstructured":"Bruno Buchberger. 1970. Ein algorithmisches Kriterium f\u00fcr die L\u00f6sbarkeit eines algebraischen Gleichungssystems. Aequationes Mathematicae 4 3 (Oct. 1970) 374\u2013383. 10.1007\/bf01844169","DOI":"10.1007\/bf01844169"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","unstructured":"Bruno Buchberger. 1976. A theoretical basis for the reduction of polynomials to canonical forms. SIGSAM Bull. 10 3 (Aug. 1976) 19\u201329. 10.1145\/1088216.1088219","DOI":"10.1145\/1088216.1088219"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511565847.034"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","unstructured":"Bruno Buchberger. 2006. Bruno Buchberger\u2019s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Journal of Symbolic Computation 41 3 (2006) 475\u2013511. 10.1016\/j.jsc.2005.09.007Logic Mathematics and Computer Science: Interactions in honor of Bruno Buchberger (60th birthday).","DOI":"10.1016\/j.jsc.2005.09.007"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","unstructured":"Bruno Buchberger George\u00a0E. Collins R\u00fcdiger Loos and Rudolf Albrecht. 1982. Computer algebra symbolic and algebraic computation. SIGSAM Bull. 16 4 (Nov. 1982) 5. 10.1145\/1089310.1089312","DOI":"10.1145\/1089310.1089312"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/1089310.1089312"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Bobby\u00a0F. Caviness. 1970. On canonical forms and simplification. Journal of the ACM (JACM) 17 2 (1970) 385\u2013396.","DOI":"10.1145\/321574.321591"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Alonzo Church. 1936. Correction to A Note on the Entscheidungsproblem. The Journal of Symbolic Logic 1 3 (1936) 101\u2013102.","DOI":"10.2307\/2269030"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Alonzo Church. 1936. A Note on the Entscheidungsproblem. The Journal of Symbolic Logic 1 1 (1936) 40\u201341.","DOI":"10.2307\/2269326"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/800204.806279"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"crossref","unstructured":"George\u00a0E. Collins. 1974. Quantifier elimination for real closed fields by cylindrical algebraic decomposition-\u2013preliminary report. SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation) 8 3 (Aug. 1974) 80\u201390.","DOI":"10.1145\/1086837.1086852"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","unstructured":"George\u00a0E Collins. 1976. Quantifier elimination for real closed fields by cylindrical algebraic decomposition: a synopsis. ACM SIGSAM Bulletin 10 1 (1976) 10\u201312.","DOI":"10.1145\/1093390.1093393"},{"key":"e_1_3_3_2_28_2","unstructured":"ISSAC\u00a0Steering Committee. 2025. Past ISSAC Conferences. https:\/\/www.issac-conference.org\/past.php."},{"key":"e_1_3_3_2_29_2","unstructured":"Stephen\u00a0A. Cook. 1966. On the minimum computation time of functions. Ph.\u00a0D. Dissertation. Harvard University."},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","unstructured":"Stephen\u00a0A. Cook and St\u00e1l\u00a0O. Aanderaa. 1969. On the minimum computation time of functions. Trans. Amer. Math. Soc. 142 0 (1969) 291\u2013314. 10.1090\/s0002-9947-1969-0249212-8","DOI":"10.1090\/s0002-9947-1969-0249212-8"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/800005.807958"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/800195.805928"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/800005.807970"},{"key":"e_1_3_3_2_34_2","volume-title":"Computer Algebra, Systems and Algorithms for Algebraic Computation (2nd ed.)","author":"Davenport J.\u00a0H.","year":"1993","unstructured":"J.\u00a0H. Davenport, Y. Siret, and E. Tournier. 1993. Computer Algebra, Systems and Algorithms for Algebraic Computation (2nd ed.). Academic Press, USA."},{"key":"e_1_3_3_2_35_2","unstructured":"Amanda Davis. 2024. Jean Sammet the accidental programmer. IEEE Spectrum 61 (December 2024). https:\/\/spectrum.ieee.org\/jean-sammet-accidental-computer-programmer"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","unstructured":"Martin Davis Hilary Putnam and Julia Robinson. 1961. The Decision Problem for Exponential Diophantine Equations. The Annals of Mathematics 74 3 (Nov. 1961) 425\u2013436. 10.2307\/1970289","DOI":"10.2307\/1970289"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-15984-3_279"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"crossref","unstructured":"Andr\u00e9 Deprit. 1969. Canonical transformations depending on a small parameter. Celestial mechanics 1 1 (1969) 12\u201330.","DOI":"10.1007\/BF01230629"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","unstructured":"Stephanie\u00a0A. Dick. 2020. Coded conduct: making MACSYMA users and the automation of mathematics. BJHS Themes 5 (2020) 205\u2013224. 10.1017\/bjt.2020.10","DOI":"10.1017\/bjt.2020.10"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51084-2_41"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"crossref","unstructured":"John\u00a0D. Dixon. 1982. Exact solution of linear equations using p-adic expansions. Numer. Math. 40 1 (1982) 137\u2013141.","DOI":"10.1007\/BF01459082"},{"key":"e_1_3_3_2_42_2","first-page":"117","volume-title":"Proceedings of the November 30\u2013December 1, 1965, fall joint computer conference, part II: computers: their impact on society","author":"Engelman Carl","year":"1965","unstructured":"Carl Engelman. 1965. MATHLAB: a program for on-line machine assistance in symbolic computations. In Proceedings of the November 30\u2013December 1, 1965, fall joint computer conference, part II: computers: their impact on society. ACM, New York, 117\u2013126."},{"key":"e_1_3_3_2_43_2","volume-title":"A Preliminary Report on the String Manipulation Language SNOBOL","author":"Farber D.J.","year":"1963","unstructured":"D.J. Farber, R.E. Grisold, and I.P. Polonsky. 1963. A Preliminary Report on the String Manipulation Language SNOBOL. Technical Report Unpublished Technical Memorandum 63-3344-2. Bell Telephone Laboratories."},{"key":"e_1_3_3_2_44_2","doi-asserted-by":"crossref","unstructured":"D.J. Farber R.E. Grisold and I.P. Polonsky. 1964. SNOBOL a string manipulation language. J. ACM 11 1 (1964) 21\u201330.","DOI":"10.1145\/321203.321207"},{"key":"e_1_3_3_2_45_2","doi-asserted-by":"crossref","unstructured":"Lawrence\u00a0M Fisher. 2017. Jean E. Sammet 1928\u20132017. Commun. ACM 60 7 (2017) 22\u201322.","DOI":"10.1145\/3099559"},{"key":"e_1_3_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02614-0_8"},{"key":"e_1_3_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/800205.3317677"},{"key":"e_1_3_3_2_48_2","doi-asserted-by":"publisher","unstructured":"Xiao-Shan Gao. 2017. Wen-Tsun Wu: His Life and Legacy. ACM Commun. Comput. Algebra 51 2 (Oct. 2017) 73\u201379. 10.1145\/3151131.3151136","DOI":"10.1145\/3151131.3151136"},{"key":"e_1_3_3_2_49_2","doi-asserted-by":"crossref","unstructured":"W.\u00a0Morven Gentleman. 1972. Optimal Multiplication Chains for Computing a Power of a Symbolic Polynomial. Math. Comp. 26 120 (1972) 935\u2013939.","DOI":"10.1090\/S0025-5718-1972-0314303-3"},{"key":"e_1_3_3_2_50_2","doi-asserted-by":"publisher","unstructured":"W.\u00a0Morven Gentleman. 1974. Experience with truncated power series. SIGSAM Bull. 8 3 (1974) 61\u201362. 10.1145\/1086837.1086846","DOI":"10.1145\/1086837.1086846"},{"key":"e_1_3_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/800068.802152"},{"key":"e_1_3_3_2_52_2","doi-asserted-by":"publisher","unstructured":"Richard\u00a0D. Greenblatt Thomas\u00a0F. Knight John\u00a0T. Holloway and David\u00a0A. Moon. 1980. A LISP machine. SIGIR Forum 15 2 (March 1980) 137\u2013138. 10.1145\/1013881.802703","DOI":"10.1145\/1013881.802703"},{"key":"e_1_3_3_2_53_2","first-page":"45","volume-title":"Proc. 2nd Symposium on Symbolic and Algebraic Manipulation","author":"Griesmer James\u00a0H.","year":"1971","unstructured":"James\u00a0H. Griesmer and Richard\u00a0D. Jenks. 1971. SCRATCHPAD\/1\u2014an interactive facility for symbolic mathematics. In Proc. 2nd Symposium on Symbolic and Algebraic Manipulation. ACM, New York, 45\u201353."},{"key":"e_1_3_3_2_54_2","doi-asserted-by":"crossref","unstructured":"Ralph\u00a0E. Griswold. 1978. A History of the SNOBOL Programming Langauges. ACM Sigplan Notices 13 8 (1978) 275\u2013308.","DOI":"10.1145\/960118.808393"},{"key":"e_1_3_3_2_55_2","doi-asserted-by":"publisher","unstructured":"Walter Habicht. 1948. Zur inhomogenen Eliminationstheorie. Commentarii Mathematici Helvetici 21 1 (Dec. 1948) 79\u201398. 10.1007\/bf02568027","DOI":"10.1007\/bf02568027"},{"key":"e_1_3_3_2_56_2","doi-asserted-by":"publisher","unstructured":"James\u00a0W. Hanson Jane\u00a0Shearin Caviness and Camilla Joseph. 1962. Analytic differentiation by computer. Commun. ACM 5 6 (June 1962) 349\u2013355. 10.1145\/367766.368195","DOI":"10.1145\/367766.368195"},{"key":"e_1_3_3_2_57_2","doi-asserted-by":"publisher","unstructured":"Anthony\u00a0C. Hearn. 1966. Computation of Algebraic Properties of Elementary Particle Reactions Using a Digital Computer. Comm. ACM 9 8 (1966) 573\u2013577. 10.1145\/365758.365766","DOI":"10.1145\/365758.365766"},{"key":"e_1_3_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-395608-8.50011-6"},{"key":"e_1_3_3_2_59_2","first-page":"19","volume-title":"Algorithmic Algebra and Logic. Proceedings of the A3L","author":"Hearn Anthony\u00a0C.","year":"2005","unstructured":"Anthony\u00a0C. Hearn. 2005. REDUCE: The First Forty Years. In Algorithmic Algebra and Logic. Proceedings of the A3L, Andreas Dolzmann, Andreas Seidl, and Thomas Sturm (Eds.). Books on Demand GmbH, Norderstedt, 19\u201324. http:\/\/reduce-algebra.com\/reduce40.pdf"},{"key":"e_1_3_3_2_60_2","doi-asserted-by":"crossref","unstructured":"Grete Hermann. 1926. Die Frage der endlich vielen Schritte in der Theorie der Polynomideale: Unter Benutzung nachgelassener S\u00e4tze von K. Hentzelt. Math. Ann. 95 1 (1926) 736\u2013788.","DOI":"10.1007\/BF01206635"},{"key":"e_1_3_3_2_61_2","doi-asserted-by":"publisher","unstructured":"Grete Hermann. 1998. The question of finitely many steps in polynomial ideal theory. SIGSAM Bull. 32 3 (Sept. 1998) 8\u201330. 10.1145\/307339.307342","DOI":"10.1145\/307339.307342"},{"key":"e_1_3_3_2_62_2","unstructured":"A. Karatsuba and Yu. Ofman. 1962. Multiplication of many-digital numbers by automatic computers. Dokl. Akad. Nauk SSSR 145 (1962) 293\u2013294. Issue 2."},{"key":"e_1_3_3_2_63_2","doi-asserted-by":"crossref","unstructured":"Donald\u00a0E. Knuth. 1975. Son of seminumerical algorithms. ACM SIGSAM Bulletin 9 4 (1975) 10\u201311.","DOI":"10.1145\/1088322.1088323"},{"key":"e_1_3_3_2_64_2","doi-asserted-by":"publisher","unstructured":"S.\u00a0Y. Ku and R.\u00a0J. Adler. 1969. Computing polynomial resultants: Bezout\u2019s determinant vs. Collins\u2019 reduced P.R.S. algorithm. Commun. ACM 12 1 (Jan. 1969) 23\u201330. 10.1145\/362835.362839","DOI":"10.1145\/362835.362839"},{"key":"e_1_3_3_2_65_2","volume-title":"A Language for Symbolic Communication","author":"Lee C.Y.","year":"1962","unstructured":"C.Y. Lee et\u00a0al. 1962. A Language for Symbolic Communication. Technical Report Unpublished Technical Memorandum 62-3344-4. Bell Telephone Laboratories."},{"key":"e_1_3_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.5555\/1925"},{"key":"e_1_3_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/800204.806309"},{"key":"e_1_3_3_2_68_2","volume-title":"Uwagi o aksjomacie Nicod\u2019a io ,,dedukcji uog\u00f3lniaj\u0105cej\u201d","author":"\u0141ukasiewicz Jan","year":"1931","unstructured":"Jan \u0141ukasiewicz. 1931. Uwagi o aksjomacie Nicod\u2019a io ,,dedukcji uog\u00f3lniaj\u0105cej\u201d. sk\u0142. g\u0142. Ksi\u0119garnia SA Ksi\u0105\u017cnica-Atlas, Lviv. https:\/\/sbc.org.pl\/dlibra\/publication\/edition\/18864"},{"key":"e_1_3_3_2_69_2","doi-asserted-by":"publisher","unstructured":"John McCarthy. 1960. Recursive Functions of Symbolic Expressions and Their Computation by Machine Part I. Commun. ACM 3 4 (1960) 184\u2013195. 10.1145\/367177.367199","DOI":"10.1145\/367177.367199"},{"key":"e_1_3_3_2_70_2","volume-title":"A History of Engineering and Science in the Bell System: Communications sciences (1925-1980)","author":"Millman S.","year":"1984","unstructured":"S. Millman (Ed.). 1984. A History of Engineering and Science in the Bell System: Communications sciences (1925-1980). AT & T Bell Laboratories, Murray Hill."},{"key":"e_1_3_3_2_71_2","doi-asserted-by":"crossref","unstructured":"Joel Moses. 2012. Macsyma: A personal history. 123\u2013130\u00a0pages.","DOI":"10.1016\/j.jsc.2010.08.018"},{"key":"e_1_3_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/800192.805698"},{"key":"e_1_3_3_2_73_2","doi-asserted-by":"crossref","unstructured":"Vanni Noferini and Alex Townsend. 2016. Numerical instability of resultant methods for multidimensional rootfinding. SIAM J. Numer. Anal. 54 2 (2016) 719\u2013743.","DOI":"10.1137\/15M1022513"},{"key":"e_1_3_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.5555\/945759"},{"key":"e_1_3_3_2_75_2","doi-asserted-by":"crossref","unstructured":"Arthur\u00a0C Norman. 1975. Computing with formal power series. ACM Transactions on Mathematical Software (TOMS) 1 4 (1975) 346\u2013356.","DOI":"10.1145\/355656.355660"},{"key":"e_1_3_3_2_76_2","volume-title":"Automatic generation of Taylor coefficients (TAYLOR)","author":"Reiter Allen","year":"1965","unstructured":"Allen Reiter. 1965. Automatic generation of Taylor coefficients (TAYLOR). Mathematics Research Center, United States Army, the University of Wisconsin, USA."},{"key":"e_1_3_3_2_77_2","doi-asserted-by":"crossref","unstructured":"Daniel Richardson. 1969. Some undecidable problems involving elementary functions of a real variable. The Journal of Symbolic Logic 33 4 (1969) 514\u2013520.","DOI":"10.2307\/2271358"},{"key":"e_1_3_3_2_78_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0H. Risch. 1969. The problem of integration in finite terms. Trans. Amer. Math. Soc. 139 (1969) 167\u2013189.","DOI":"10.1090\/S0002-9947-1969-0237477-8"},{"key":"e_1_3_3_2_79_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0H. Risch. 1970. The solution of the problem of integration in finite terms. Bull. Amer. Math. Soc. 76 (1970) 605\u2013608.","DOI":"10.1090\/S0002-9904-1970-12454-5"},{"key":"e_1_3_3_2_80_2","doi-asserted-by":"crossref","unstructured":"Maxwell Rosenlicht. 1968. Liouville\u2019s theorem on functions with elementary integrals. Pacific J. Math. 24 1 (1968) 153\u2013161.","DOI":"10.2140\/pjm.1968.24.153"},{"key":"e_1_3_3_2_81_2","doi-asserted-by":"crossref","unstructured":"Maxwell Rosenlicht. 1972. Integration in finite terms. The American Mathematical Monthly 79 9 (1972) 963\u2013972.","DOI":"10.1080\/00029890.1972.11993166"},{"key":"e_1_3_3_2_82_2","doi-asserted-by":"publisher","unstructured":"Jean\u00a0E. Sammet. 1966. Survey of formula manipulation. Commun. ACM 9 8 (Aug. 1966) 555\u2013569. 10.1145\/365758.365762","DOI":"10.1145\/365758.365762"},{"key":"e_1_3_3_2_83_2","first-page":"47","volume-title":"Advances in Computers","author":"Sammet Jean\u00a0E.","year":"1967","unstructured":"Jean\u00a0E. Sammet. 1967. Formula manipulation by computer. In Advances in Computers. Vol.\u00a08. Academic Press (Elsevier), New York, 47\u2013102."},{"key":"e_1_3_3_2_84_2","volume-title":"Programming Languages: History and Fundamentals","author":"Sammet Jean\u00a0E.","year":"1967","unstructured":"Jean\u00a0E. Sammet. 1967. Programming Languages: History and Fundamentals. Prentice-Hall, Englewood Cliffs, New Jersey."},{"key":"e_1_3_3_2_85_2","doi-asserted-by":"publisher","unstructured":"Jean\u00a0E. Sammet. 1972. Programming languages: history and future. Commun. ACM 15 7 (July 1972) 601\u2013610. 10.1145\/361454.361485","DOI":"10.1145\/361454.361485"},{"key":"e_1_3_3_2_86_2","unstructured":"Jean\u00a0E. Sammet. 1990s. personal communication."},{"key":"e_1_3_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_87"},{"key":"e_1_3_3_2_88_2","doi-asserted-by":"crossref","unstructured":"Arnold Sch\u00f6nhage and Volker Strassen. 1971. Fast multiplication of large numbers. Computing 7 (1971) 281\u2013292.","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_3_2_89_2","unstructured":"James\u00a0R. Slagle. 1961. A heuristic program that solves symbolic integration problems in freshman calculus: symbolic automatic integrator (SAINT). Ph.\u00a0D. Dissertation. Massachusetts Institute of Technology."},{"key":"e_1_3_3_2_90_2","doi-asserted-by":"crossref","unstructured":"Cynthia Solomon Brian Harvey Ken Kahn Henry Lieberman Mark\u00a0L. Miller Margaret Minsky Artemis Papert and Brian Silverman. 2020. History of LOGO. Proceedings of the ACM on Programming Languages 4 HOPL (2020) 1\u201366.","DOI":"10.1145\/3386329"},{"key":"e_1_3_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.7208\/chicago\/9780226824192.001.0001"},{"key":"e_1_3_3_2_92_2","doi-asserted-by":"publisher","unstructured":"Volker Strassen. 1969. Gaussian elimination is not optimal. Numer. Math. 13 4 (1969) 354\u2013356. 10.1007\/BF02165411","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_3_2_93_2","first-page":"24","volume-title":"Quantifier elimination and cylindrical algebraic decomposition","author":"Tarski Alfred","year":"1948","unstructured":"Alfred Tarski. 1948. A decision method for elementary algebra and geometry. In Quantifier elimination and cylindrical algebraic decomposition. Springer, Vienna, 24\u201384."},{"key":"e_1_3_3_2_94_2","unstructured":"Andrei\u00a0L. Toom. 1963. The complexity of a scheme of functional elements simulating the multiplication of integers. Doklady Akad. Nauk SSSR 150 3 (1963) 496\u2013498."},{"key":"e_1_3_3_2_95_2","doi-asserted-by":"publisher","unstructured":"M.\u00a0Pilar V\u00e9lez Tom\u00e1s Recio and Carlos Ueno. 2022. Niagara Falls and the Origins of Computer Algebra. Maple Transactions 2 1 (Sept. 2022) 14\u00a0pages. 10.5206\/mt.v2i1.14362","DOI":"10.5206\/mt.v2i1.14362"},{"key":"e_1_3_3_2_96_2","volume-title":"A CDC 6600 program for symbolic evaluation of algebraic expressions","author":"Veltman Martinus\u00a0J.","year":"1963","unstructured":"Martinus\u00a0J. Veltman. 1963. A CDC 6600 program for symbolic evaluation of algebraic expressions. Technical Report. CERN. https:\/\/vsys.physics.lsa.umich.edu\/schip-docs\/CERN-Schoonschip-1967.pdf"},{"key":"e_1_3_3_2_97_2","doi-asserted-by":"publisher","unstructured":"Paul\u00a0S. Wang and Linda\u00a0Preiss Rothschild. 1973. Factoring multivariate polynomials over the integers. ACM SIGSAM Bulletin \u00a0 28 (Dec. 1973) 21\u201329. 10.1145\/1086814.1086819","DOI":"10.1145\/1086814.1086819"},{"key":"e_1_3_3_2_98_2","doi-asserted-by":"crossref","unstructured":"Paul\u00a0S. Wang and Linda\u00a0Preiss Rothschild. 1975. Factoring multivariate polynomials over the integers. Math. Comp. 29 131 (1975) 935\u2013950.","DOI":"10.1090\/S0025-5718-1975-0396471-3"},{"key":"e_1_3_3_2_99_2","doi-asserted-by":"publisher","DOI":"10.5555\/515297"},{"key":"e_1_3_3_2_100_2","series-title":"COE Lecture Notes","first-page":"422","volume-title":"Proceedings of the Joint Conference of ASCM 2009 and MACIS 2009: Asian Symposium of Computer Mathematics and Mathematical Aspects of Computer and Information Sciences","volume":"22","author":"Watt Stephen\u00a0M.","year":"2009","unstructured":"Stephen\u00a0M. Watt. 2009. On the Future of Computer Algebra Systems at the Threshold of 2010. In Proceedings of the Joint Conference of ASCM 2009 and MACIS 2009: Asian Symposium of Computer Mathematics and Mathematical Aspects of Computer and Information Sciences(COE Lecture Notes, Vol.\u00a022). Kyushu University, Japan, 422\u2013430."},{"key":"e_1_3_3_2_101_2","unstructured":"David Y.\u00a0Y. Yun. 1974. The Hensel lemma in algebraic manipulation. Ph.\u00a0D. Dissertation. MIT."},{"key":"e_1_3_3_2_102_2","doi-asserted-by":"crossref","unstructured":"Hans Zassenhaus. 1969. On Hensel factorization I. J. Number Theory 1 1 (1969) 291\u2013311.","DOI":"10.1016\/0022-314X(69)90047-X"}],"event":{"name":"ISSAC '25: International Symposium on Symbolic and Algebraic Computation","location":"Guanajuato Mexico","acronym":"ISSAC '25","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747199.3747556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:39:39Z","timestamp":1762774779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747199.3747556"}},"subtitle":["The View from a Half-Century Perspective"],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":101,"alternative-id":["10.1145\/3747199.3747556","10.1145\/3747199"],"URL":"https:\/\/doi.org\/10.1145\/3747199.3747556","relation":{},"subject":[],"published":{"date-parts":[[2025,7,28]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}