{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:03Z","timestamp":1750308123688,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"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":[[1981,11]]},"abstract":"<jats:p>Possibly the most frequently used algorithm in computational group theory is the Todd-Coxeter process for enumerating the cosets of a subgroup of a finitely presented group. In all implementations the power of this algorithm is limited much more by its storage requirements than by its execution time. This note outlines a technique which can often be used to economise on storage at the expense of an increased execution time. Before giving details it will be helpful to review some background.<\/jats:p>","DOI":"10.1145\/1089270.1089273","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"12-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Saving space in coset enumeration"],"prefix":"10.1145","volume":"15","author":[{"given":"M. D.","family":"Atkinson","sequence":"first","affiliation":[{"name":"University College, Cardiff U.K."}]}],"member":"320","published-online":{"date-parts":[[1981,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1973-0335610-5"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1964-052-3"}],"container-title":["ACM SIGSAM Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089270.1089273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1089270.1089273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:22Z","timestamp":1750262902000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089270.1089273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":2,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["10.1145\/1089270.1089273"],"URL":"https:\/\/doi.org\/10.1145\/1089270.1089273","relation":{},"ISSN":["0163-5824"],"issn-type":[{"type":"print","value":"0163-5824"}],"subject":[],"published":{"date-parts":[[1981,11]]},"assertion":[{"value":"1981-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}