{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:58:14Z","timestamp":1750309094603,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[1978,8,1]],"date-time":"1978-08-01T00:00:00Z","timestamp":270777600000},"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":[[1978,8]]},"abstract":"<jats:p>Virtually all algebraic manipulation systems are very large programs which can only be run on the largest computers, and even then press the limits of the machines resources [1]. I see this as the principal reason for the lack of popularity of algebraic manipulation; namely for many potential users the costs involved in running these programs do not outweigh their benefits. The motivation for this note is to stimulate discussion about the design of algebra systems, with a view to making them more economically viable.<\/jats:p>","DOI":"10.1145\/1088269.1088273","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"20-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Is a linked list the best storage structure for an algebra system?"],"prefix":"10.1145","volume":"12","author":[{"given":"Robert","family":"Moenck","sequence":"first","affiliation":[{"name":"University of Toronto"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1978,8]]},"reference":[{"first-page":"215","volume-title":"1977 MACSYMA Users Conf., NASA CP-2012","author":"Steel G. L.","key":"e_1_2_1_1_1"},{"volume-title":"Univ. Wisconsin, (March","year":"1971","author":"Collins G. E.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/359423.359427"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1093397.1093404"},{"key":"e_1_2_1_5_1","unstructured":"D. E. Knuth: The Art of Computer Programming: Vol. I Fundamental Algorithms Addison-Wesley Reading Mass. pp. 348--349.   D. E. Knuth: The Art of Computer Programming: Vol. I Fundamental Algorithms Addison-Wesley Reading Mass. pp. 348--349."},{"volume-title":"Calif.","year":"1972","author":"Griswold R. E.","key":"e_1_2_1_6_1"}],"container-title":["ACM SIGSAM Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1088269.1088273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1088269.1088273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:44Z","timestamp":1750286624000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1088269.1088273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,8]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,8]]}},"alternative-id":["10.1145\/1088269.1088273"],"URL":"https:\/\/doi.org\/10.1145\/1088269.1088273","relation":{},"ISSN":["0163-5824"],"issn-type":[{"type":"print","value":"0163-5824"}],"subject":[],"published":{"date-parts":[[1978,8]]},"assertion":[{"value":"1978-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}