{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T01:43:12Z","timestamp":1758591792375,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,16]]},"DOI":"10.1145\/3666000.3672619","type":"proceedings-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T13:18:51Z","timestamp":1721049531000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Encounters in Symbolic Computation: Ideas for the Ages"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2739-3230","authenticated-orcid":false,"given":"Erich L.","family":"Kaltofen","sequence":"first","affiliation":[{"name":"NCSU, USA and Duke University, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"A. Aho J. Hopcroft and J. Ullman. 1974. The Design and Analysis of Algorithms. Addison and Wesley Reading MA."},{"key":"e_1_3_2_1_2_1","first-page":"056","article-title":"On The Rapid Computation of Various Polylogarithmic Constants","volume":"95","author":"Bailey D.","year":"1995","unstructured":"D. Bailey, P. Borwein, and S. Plouffe. 1995. On The Rapid Computation of Various Polylogarithmic Constants. Preprint 95:056. Centre for Experimental and Constructive Mathematics, Simon Fraser University, http:\/\/mosaic.cecm.sfu.ca\/preprints\/1995pp.html.","journal-title":"Preprint"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-97-00856-9"},{"key":"e_1_3_2_1_4_1","unstructured":"Manjul Bhargava. 2021. Galois groups of random integer polynomials and van der Waerden\u2019s Conjecture. URL: https:\/\/arxiv.org\/abs\/2111.06507."},{"volume-title":"Pi and the AGM\u2014A Study in Analytic Number Theory and Computational Complexity","author":"Borwein M.","key":"e_1_3_2_1_5_1","unstructured":"Jonathan\u00a0M. Borwein and Peter\u00a0B. Borwein. 1987. Pi and the AGM\u2014A Study in Analytic Number Theory and Computational Complexity. John Wiley & Sons, New York."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"L. Chen W. Eberly E. Kaltofen B.\u00a0D. Saunders W.\u00a0J. Turner and G. Villard. 2002. Efficient Matrix Preconditioners for Black Box Linear Algebra. Linear Algebra and Applications 343\u2013344 (2002) 119\u2013146. Special issue on Structured and Infinite Systems of Linear Equations edited by P. Dewilde V. Olshevsky and A. H. Sayed. URL: #1.","DOI":"10.1016\/S0024-3795(01)00472-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80041-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930908"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1979-14691-3"},{"key":"e_1_3_2_1_11_1","first-page":"171","article-title":"Multidimensional Euclidean algorithms. J. reine angew","volume":"334","author":"Ferguson P.","year":"1982","unstructured":"H.\u00a0R.\u00a0P. Ferguson and R.\u00a0W. Forcade. 1982. Multidimensional Euclidean algorithms. J. reine angew. Math. 334 (1982), 171\u2013181.","journal-title":"Math."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09526-8_5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005311"},{"volume-title":"Proc. 1983 ICALP(Lect. Notes Comput. Sci., Vol.\u00a0154)","author":"von zur Gathen Joachim","key":"e_1_3_2_1_14_1","unstructured":"Joachim von zur Gathen and E. Kaltofen. 1983. Factoring multivariate polynomials over finite fields. In Proc. 1983 ICALP(Lect. Notes Comput. Sci., Vol.\u00a0154). Springer Verlag, Heidelberg, Germany, 250\u2013263. Journal version in\u00a0[15]."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0790658-X"},{"key":"e_1_3_2_1_16_1","volume-title":"Symp. Symbolic Algebraic Comput. (ISSAC","author":"Giesbrecht Mark","year":"2003","unstructured":"Mark Giesbrecht, Erich Kaltofen, and Wen-shin Lee. 2003. Algorithms for Computing Sparsest Shifts of Polynomials in Power, Chebychev, and Pochhammer Bases. J. Symbolic Comput. 36, 3\u20134 (2003), 401\u2013424. Special issue Internat. Symp. Symbolic Algebraic Comput. (ISSAC 2002). Guest editors: M. Giusti & L. M. Pardo. URL: #1."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780519"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. Ninth Rhine Workshop on Computer Algebra (RWCA\u201904)","author":"Giesbrecht Mark","year":"2004","unstructured":"Mark Giesbrecht, George Labahn, and Wen-shin Lee. 2004. Symbolic-Numeric Sparse Interpolation of Multivariate Polynomials (Extended Abstract). In Proc. Ninth Rhine Workshop on Computer Algebra (RWCA\u201904), University of Nijmegen, the Netherlands. 127\u2013139."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145792"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.11.003"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-314X(01)92763-5"},{"key":"e_1_3_2_1_22_1","unstructured":"Emma\u00a0Haruka Iwao. 2022. Even more pi in the sky: Calculating 100 trillion digits of pi on Google Cloud. https:\/\/cloud.google.com\/blog\/products\/compute\/calculating-100-trillion-digits-of-pi-on-google-cloud."},{"key":"e_1_3_2_1_23_1","unstructured":"E. Kaltofen. 1979. An Attributed LL(1) Compilation of Pascal into Lambda-Calculus. Master\u2019s Project Rensselaer Polytechnic Instit. Math. Sci. Dept. Troy N. Y.. Also Tech. Report CS-8103 RPI Math. Sci. Dept. by E. Kaltofen and S. K. Abdali June 1981. URL: #1 URL: #1 URL: #1."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802200"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.56"},{"volume-title":"Proc. EUROSAM \u201984(Lect. Notes Comput. Sci.), J.\u00a0Fitch (Ed.)","author":"Kaltofen E.","key":"e_1_3_2_1_26_1","unstructured":"E. Kaltofen. 1984. Effective Hilbert Irreducibility. In Proc. EUROSAM \u201984(Lect. Notes Comput. Sci.), J.\u00a0Fitch (Ed.). Springer Verlag, Heidelberg, Germany, 275\u2013284. Journal version in\u00a0[27]."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80056-5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(85)80029-8"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214035"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12163"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/42267.45069"},{"volume-title":"Randomness and Computation, S.\u00a0Micali (Ed.). Advances in Computing Research, Vol.\u00a05","author":"Kaltofen E.","key":"e_1_3_2_1_32_1","unstructured":"E. Kaltofen. 1989. Factorization of polynomials given by straight-line programs. In Randomness and Computation, S.\u00a0Micali (Ed.). Advances in Computing Research, Vol.\u00a05. JAI Press Inc., Greenwhich, Connecticut, 375\u2013412. URL: #1."},{"key":"e_1_3_2_1_33_1","first-page":"777","article-title":"Analysis of Coppersmith\u2019s block Wiedemann algorithm for the parallel solution of sparse linear systems","volume":"64","author":"Kaltofen E.","year":"1995","unstructured":"E. Kaltofen. 1995. Analysis of Coppersmith\u2019s block Wiedemann algorithm for the parallel solution of sparse linear systems. Math. Comput. 64, 210 (1995), 777\u2013806. URL: #1.","journal-title":"Math. Comput."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.0370"},{"key":"e_1_3_2_1_35_1","unstructured":"Erich L. Kaltofen. 2022. A note on the van der Waerden conjecture on random polynomials with symmetric Galois group for function fields. https:\/\/arxiv.org\/abs\/2204.02836. 6 pages. URL: #1."},{"volume-title":"Handbook of Finite Fields, Gary\u00a0L","author":"Kaltofen Erich","key":"e_1_3_2_1_36_1","unstructured":"Erich Kaltofen and Gr\u00e9goire Lecerf. 2013. Section 11.5. Factorization of multivariate polynomials. In Handbook of Finite Fields, Gary\u00a0L. Mullen and Daniel Panario (Eds.). CRC Press, Taylor & Francis Group, Boca Raton, Florida, 382\u2013392. URL: #1."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.11.005"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993915"},{"volume-title":"Proc. 27th Annual ACM Symp. Theory Comput.ACM Press","author":"Kaltofen E.","key":"e_1_3_2_1_39_1","unstructured":"E. Kaltofen and V. Shoup. 1995. Subquadratic-time factoring of polynomials over finite fields. In Proc. 27th Annual ACM Symp. Theory Comput.ACM Press, New York, N.Y., 398\u2013406. Journal version in\u00a0[41]. URL: #1."},{"volume-title":"Proc. 1997 Internat. Symp. Symbolic Algebraic Comput. (ISSAC\u201997)","author":"Kaltofen E.","key":"e_1_3_2_1_40_1","unstructured":"E. Kaltofen and V. Shoup. 1997. Fast polynomial factorization over high algebraic extensions of finite fields. In Proc. 1997 Internat. Symp. Symbolic Algebraic Comput. (ISSAC\u201997), W.\u00a0K\u00fcchlin (Ed.). ACM Press, New York, N. Y., 184\u2013188. URL: #1."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-98-00944-2"},{"volume-title":"Proc. 29th Annual Symp. Foundations of Comp. Sci. IEEE, 296\u2013305","author":"Kaltofen E.","key":"e_1_3_2_1_42_1","unstructured":"E. Kaltofen and B. Trager. 1988. Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. In Proc. 29th Annual Symp. Foundations of Comp. Sci. IEEE, 296\u2013305. Journal version in\u00a0[43]."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80015-6"},{"volume-title":"ISSAC 2014 Proc. 39th Internat. Symp. Symbolic Algebraic Comput., Katsusuke Nabeshima (Ed.). Association for Computing Machinery","author":"Erich","key":"e_1_3_2_1_44_1","unstructured":"Erich L. Kaltofen and Zhengfeng Yang. 2014. Sparse Multivariate Function Recovery With a High Error Rate in Evaluations. In ISSAC 2014 Proc. 39th Internat. Symp. Symbolic Algebraic Comput., Katsusuke Nabeshima (Ed.). Association for Computing Machinery, New York, N. Y., 280\u2013287. URL: #1."},{"key":"e_1_3_2_1_45_1","volume-title":"Special Issue on ISSAC","author":"Erich","year":"2014","unstructured":"Erich L. Kaltofen and Zhengfeng Yang. 2016. Sparse Multivariate Function Recovery With a Small Number of Evaluations. J. Symbolic Comput. 75 (July\/Aug. 2016), 209\u2013218. Special Issue on ISSAC 2014, URL: #1."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500122"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90224-W"},{"key":"e_1_3_2_1_48_1","first-page":"82","article-title":"Factoring polynomials with rational coefficients","author":"Lenstra K.","year":"1982","unstructured":"A.\u00a0K. Lenstra, H.\u00a0W.\u00a0Lenstra Jr., and L. Lov\u00e1sz. 1982. Factoring polynomials with rational coefficients. Technical Report 82-05. Mathematisch Instituut, Roetersstraat 15 Amsterdam. Received March, 1982.","journal-title":"Technical Report"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80061-3"},{"volume-title":"Symbolic and Algebraic Computation(Lect. Notes Comput. Sci., Vol.\u00a072)","author":"Schwartz T.","key":"e_1_3_2_1_51_1","unstructured":"Jacob\u00a0T. Schwartz. 1979. Probabilistic algorithms for verification of polynomial identities (invited). In Symbolic and Algebraic Computation(Lect. Notes Comput. Sci., Vol.\u00a072). Springer Verlag, Heidelberg, Germany, 200\u2013215. Proc. EUROSAM \u201979."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"volume-title":"Mathematics and Computation","author":"Widgerson Avi","key":"e_1_3_2_1_53_1","unstructured":"Avi Widgerson. 2019. Mathematics and Computation. Princeton University Press. https:\/\/www.math.ias.edu\/avi\/book."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057137"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(69)90047-X"},{"volume-title":"Symbolic and Algebraic Computation(Lect. Notes Comput. Sci., Vol.\u00a072)","author":"Zippel Richard","key":"e_1_3_2_1_56_1","unstructured":"Richard Zippel. 1979. Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation(Lect. Notes Comput. Sci., Vol.\u00a072). Springer Verlag, Heidelberg, Germany, 216\u2013226. Proc. EUROSAM \u201979."},{"volume-title":"Probabilistic algorithms for sparse polynomials. Ph.\u00a0D. Dissertation. Massachusetts Inst. of Technology","author":"Zippel E.","key":"e_1_3_2_1_57_1","unstructured":"R.\u00a0E. Zippel. 1979. Probabilistic algorithms for sparse polynomials. Ph.\u00a0D. Dissertation. Massachusetts Inst. of Technology, Cambridge, USA."}],"event":{"name":"ISSAC '24: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Raleigh NC USA","acronym":"ISSAC '24"},"container-title":["Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3672619","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3666000.3672619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:52:54Z","timestamp":1758588774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3672619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":57,"alternative-id":["10.1145\/3666000.3672619","10.1145\/3666000"],"URL":"https:\/\/doi.org\/10.1145\/3666000.3672619","relation":{},"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"2024-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}