{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:04Z","timestamp":1750308124617,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1983,2,1]],"date-time":"1983-02-01T00:00:00Z","timestamp":412905600000},"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":["SIGSAM Bull."],"published-print":{"date-parts":[[1983,2]]},"abstract":"<jats:p>The effect of the \"ordering of identifiers\" on the data structures generated and on the execution time and space required by algebraic mode programs for the REDUCE Algebraic Manipulator is illustrated by examples. Possible explanations for these results are discussed.<\/jats:p>","DOI":"10.1145\/1089320.1089327","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"31-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Data structures and execution times of Algebraic mode programs for REDUCE"],"prefix":"10.1145","volume":"17","author":[{"given":"P. D.","family":"Pearce","sequence":"first","affiliation":[{"name":"Kingston Polytechnic, England"}]},{"given":"R. J.","family":"Hicks","sequence":"additional","affiliation":[{"name":"Kingston Polytechnic, England"}]}],"member":"320","published-online":{"date-parts":[[1983,2]]},"reference":[{"volume-title":"A FORTRAN Vector Based Algebra System. Department of Computer Studies","author":"Beardsworth","key":"e_1_2_1_1_1","unstructured":"Beardsworth R 1979, Lethal , A FORTRAN Vector Based Algebra System. Department of Computer Studies , University of Leeds , England. Beardsworth R 1979, Lethal, A FORTRAN Vector Based Algebra System. Department of Computer Studies, University of Leeds, England."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800204.806277"},{"volume-title":"C 1979, Non-modular Computation of Polynomial GCD's Using Trial Division. Proceedings of EUROSAM '79, An International Symposium on Symbolic and Algebraic Manipulation","author":"Hearn A","key":"e_1_2_1_3_1","unstructured":"Hearn A C 1979, Non-modular Computation of Polynomial GCD's Using Trial Division. Proceedings of EUROSAM '79, An International Symposium on Symbolic and Algebraic Manipulation , Marseille, France. Springer-Verlag. Hearn A C 1979, Non-modular Computation of Polynomial GCD's Using Trial Division. Proceedings of EUROSAM '79, An International Symposium on Symbolic and Algebraic Manipulation, Marseille, France. Springer-Verlag."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/800206.806383"}],"container-title":["ACM SIGSAM Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089320.1089327","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1089320.1089327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:23Z","timestamp":1750262903000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089320.1089327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,2]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,2]]}},"alternative-id":["10.1145\/1089320.1089327"],"URL":"https:\/\/doi.org\/10.1145\/1089320.1089327","relation":{},"ISSN":["0163-5824"],"issn-type":[{"type":"print","value":"0163-5824"}],"subject":[],"published":{"date-parts":[[1983,2]]},"assertion":[{"value":"1983-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}