{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:09Z","timestamp":1750221009556,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"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":[[2019,7,8]]},"DOI":"10.1145\/3326229.3326272","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"235-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants"],"prefix":"10.1145","author":[{"given":"Seung Gyu","family":"Hyun","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"Vincent","family":"Neiger","sequence":"additional","affiliation":[{"name":"Univ. Limoges, CNRS, XLIM, UMR7252, Limoges, France"}]},{"given":"\u00c9ric","family":"Schost","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"S. Ab\u00e9lard P. Gaudry and P.-J. Spaenlehauer. 2018. Counting points on genus-3 hyperelliptic curves with explicit real multiplication. In ANTS-XIII.","DOI":"10.2140\/obs.2019.2.1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892230031"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897326912"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/309831.309929"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860870"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1108638.1716344"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/2153413"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01459082"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3145573"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"J. von zur Gathen and J. Gerhard. 2013. Modern Computer Algebra (third edition). Cambridge University Press.","DOI":"10.5555\/2512973"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/648185.749915"},{"volume-title":"Eurocrypt'04 (LNCS)","author":"Gaudry P.","key":"e_1_3_2_1_13_1","unstructured":"P. Gaudry and \u00c9. Schost. 2004. Construction of secure random curves of genus 2 over prime fields. In Eurocrypt'04 (LNCS), Vol. 3027. Springer, 239--256."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.09.003"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860889"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.09.006"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-003-0144-2"},{"key":"e_1_3_2_1_18_1","volume-title":"FLINT: Fast Library for Number Theory. Version 2.5.2","author":"Hart W.","year":"2015","unstructured":"W. Hart, F. Johansson, and S. Pancratz. 2015. FLINT: Fast Library for Number Theory. Version 2.5.2, http:\/\/flintlib.org."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.014"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087659"},{"key":"e_1_3_2_1_22_1","unstructured":"S. G. Hyun V. Neiger H. Rahkooy and \u00c9. Schost. 2017. Block-Krylov techniques in the context of sparse-FGLM algorithms. (2017). arXiv:1712.04177"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930928"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.11.015"},{"key":"e_1_3_2_1_25_1","unstructured":"C.-P. Jeannerod V. Neiger and G. Villard. 2018. Fast computation of approximant bases in canonical form. Journal of Symbolic Computation (2018). to appear."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.2307\/2153451"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90026-0"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219006"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"G. Labahn V. Neiger and W. Zhou. 2017. Fast deterministic computation of the Hermite normal form and determinant of a polynomial matrix. J. Complexity (in press) (2017).","DOI":"10.1016\/j.jco.2017.03.003"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175337"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.49"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3208988"},{"key":"e_1_3_2_1_34_1","unstructured":"V. Neiger B. Salvy \u00c9. Schost and G. Villard. 2019. In preparation."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2424415"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90166-4"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258792"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19330130111"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1025"},{"key":"e_1_3_2_1_40_1","unstructured":"V. Shoup. 2018. NTL: A Library for doing Number Theory version 11.3.2. http:\/\/www.shoup.net."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00097-X"},{"key":"e_1_3_2_1_42_1","volume-title":"Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings).","author":"Storjohann A.","year":"2006","unstructured":"A. Storjohann. 2006. Notes on computing minimal approximant bases. In Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_44_1","unstructured":"The CADO-NFS Development Team. 2017. CADO-NFS An implementation of the number field sieve algorithm. http:\/\/cado-nfs.gforge.inria.fr\/ Release 2.3.0."},{"key":"e_1_3_2_1_45_1","unstructured":"The FFLAS-FFPACK Group. 2019. FFLAS-FFPACK: Finite Field Linear Algebra Subroutines \/ Package version 2.3.2. http:\/\/github.com\/linbox-team\/fflas-ffpack."},{"key":"e_1_3_2_1_46_1","unstructured":"The LinBox Group. 2018. LinBox: Linear algebra over black-box matrices version 1.5.3. https:\/\/github.com\/linbox-team\/linbox\/."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02141952"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258742"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3209020"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.222926"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1968.227420"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(71)90009-7"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.009"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442881"}],"event":{"name":"ISSAC '19: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Beijing China","acronym":"ISSAC '19"},"container-title":["Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326272","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:00Z","timestamp":1750206360000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":54,"alternative-id":["10.1145\/3326229.3326272","10.1145\/3326229"],"URL":"https:\/\/doi.org\/10.1145\/3326229.3326272","relation":{},"subject":[],"published":{"date-parts":[[2019,7,8]]},"assertion":[{"value":"2019-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}