{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:23Z","timestamp":1764996983270,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T00:00:00Z","timestamp":1372204800000},"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":[[2013,6,26]]},"DOI":"10.1145\/2465506.2465955","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"307-314","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing the invariant structure of integer matrices"],"prefix":"10.1145","author":[{"given":"Colton","family":"Pauderis","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"Arne","family":"Storjohann","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2013,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/309831.309934"},{"key":"e_1_3_2_1_2_1","volume-title":"Algorithmic Number Theory","author":"Bach E.","year":"1996","unstructured":"E. Bach and J. Shallit . Algorithmic Number Theory , volume 1 : Efficient Algorithms. MIT Press , 1996 . E. Bach and J. Shallit. Algorithmic Number Theory, volume 1 : Efficient Algorithms. MIT Press, 1996."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073899"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01459082"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796601"},{"key":"e_1_3_2_1_6_1","volume-title":"Gnu mp: The GNU multiple precision arithmetic library","author":"Granlund T.","year":"2011","unstructured":"T. Granlund and the GMP development team. Gnu mp: The GNU multiple precision arithmetic library , 2011 . Edition 5.0.2. http:\/\/gmplib.org. T. Granlund and the GMP development team. Gnu mp: The GNU multiple precision arithmetic library, 2011. Edition 5.0.2. http:\/\/gmplib.org."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2009.01.003"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/143242.143350"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2003.08.019"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0185-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/309831.309905"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442870"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnt.2010.01.017"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005325"},{"key":"e_1_3_2_1_15_1","volume-title":"Sage Mathematics Software (Version 5.5.0)","author":"Stein W.","year":"2012","unstructured":"W. Stein Sage Mathematics Software (Version 5.5.0) . The Sage Development Team , 2012 . http:\/\/www.sagemath.org. W. Stein et al. Sage Mathematics Software (Version 5.5.0). The Sage Development Team, 2012. http:\/\/www.sagemath.org."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(98)10012-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2005.04.002"}],"event":{"name":"ISSAC'13: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Boston Maine USA","acronym":"ISSAC'13"},"container-title":["Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465955","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465506.2465955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:36Z","timestamp":1750234716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465955"}},"subtitle":["fast algorithms into practice"],"short-title":[],"issued":{"date-parts":[[2013,6,26]]},"references-count":17,"alternative-id":["10.1145\/2465506.2465955","10.1145\/2465506"],"URL":"https:\/\/doi.org\/10.1145\/2465506.2465955","relation":{},"subject":[],"published":{"date-parts":[[2013,6,26]]},"assertion":[{"value":"2013-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}