{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:49:11Z","timestamp":1762325351432,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T00:00:00Z","timestamp":1656892800000},"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":[[2022,7,4]]},"DOI":"10.1145\/3476446.3535495","type":"proceedings-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T13:16:01Z","timestamp":1657026961000},"page":"351-360","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix"],"prefix":"10.1145","author":[{"given":"George","family":"Labahn","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Neiger","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, CNRS, LIP6, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thi Xuan","family":"Vu","sequence":"additional","affiliation":[{"name":"UiT, The Arctic University of Norway, Tromso, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(92)90039-Z"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892230031"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings ISSAC","author":"Beckermann B.","year":"1999","unstructured":"B. Beckermann , G. Labahn , and G. Villard . 1999. Shifted Normal Forms of Polynomial Matrices . In Proceedings ISSAC 1999 . ACM, 189--196. https:\/\/doi.org\/10.1145\/309831.309929 10.1145\/309831.309929 B. Beckermann, G. Labahn, and G. Villard. 1999. Shifted Normal Forms of Polynomial Matrices. In Proceedings ISSAC 1999. ACM, 189--196. https:\/\/doi.org\/10.1145\/309831.309929"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2006.02.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528404"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.11.011"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0313029"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"K. O. Geddes S. R. Czapor and G. Labahn. 1992. Algorithms for computer algebra. Kluwer Boston.  K. O. Geddes S. R. Czapor and G. Labahn. 1992. Algorithms for computer algebra. Kluwer Boston.","DOI":"10.1007\/b102438"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings ISSAC","author":"Giorgi P.","year":"2003","unstructured":"P. Giorgi , C.-P. Jeannerod , and G. Villard . 2003. On the complexity of polynomial matrix computations . In Proceedings ISSAC 2003 . ACM, 135--142. https:\/\/doi.org\/10.1145\/860854.860889 10.1145\/860854.860889 P. Giorgi, C.-P. Jeannerod, and G. Villard. 2003. On the complexity of polynomial matrix computations. In Proceedings ISSAC 2003. ACM, 135--142. https:\/\/doi.org\/10.1145\/860854.860889"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.09.006"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1851.41.191"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326229.3326272"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465533"},{"key":"e_1_3_2_1_14_1","unstructured":"C.-P. Jeannerod. 2006. LSP matrix decomposition revisited. Research report 2006--28. Inria -- LIP -- Ens de Lyon. http:\/\/www.ens-lyon.fr\/LIP\/Pub\/Rapports\/RR\/RR2006\/RR2006--28.pdf  C.-P. Jeannerod. 2006. LSP matrix decomposition revisited. Research report 2006--28. Inria -- LIP -- Ens de Lyon. http:\/\/www.ens-lyon.fr\/LIP\/Pub\/Rapports\/RR\/RR2006\/RR2006--28.pdf"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.11.015"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.011"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.04.004"},{"volume-title":"Linear Systems","author":"Kailath T.","key":"e_1_3_2_1_18_1","unstructured":"T. Kailath . 1980. Linear Systems . Prentice-Hall . T. Kailath. 1980. Linear Systems. Prentice-Hall."},{"key":"e_1_3_2_1_19_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 42C (2017) 44--71.  G. Labahn V. Neiger and W. Zhou. 2017. Fast deterministic computation of the Hermite normal form and determinant of a polynomial matrix. J. Complexity 42C (2017) 44--71.","DOI":"10.1016\/j.jco.2017.03.003"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2020.06.006"},{"volume-title":"The Theory of Matrices","author":"MacDuffee C. C.","key":"e_1_3_2_1_21_1","unstructured":"C. C. MacDuffee . 1933. The Theory of Matrices . Springer-Verlag Berlin Heidelberg . https:\/\/doi.org\/10.1007\/978--3--642--99234--6 10.1007\/978--3--642--99234--6 C. C. MacDuffee. 1933. The Theory of Matrices. Springer-Verlag Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978--3--642--99234--6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00139-6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930936"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2021.101572"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings ISSAC 2018","author":"Neiger V.","year":"2089","unstructured":"V. Neiger , J. Rosenkilde , and G. Solomatov . 2018. Computing Popov and Hermite Forms of Rectangular Polynomial Matrices . In Proceedings ISSAC 2018 . ACM, 295--302. https:\/\/doi.org\/10.1145\/3 2089 76.3208988 10.1145\/3208976.3208988 V. Neiger, J. Rosenkilde, and G. Solomatov. 2018. Computing Popov and Hermite Forms of Rectangular Polynomial Matrices. In Proceedings ISSAC 2018. ACM, 295--302. https:\/\/doi.org\/10.1145\/3208976.3208988"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings ISSAC","author":"Neiger V.","year":"2017","unstructured":"V. Neiger and T. X. Vu . 2017. Computing canonical bases of modules of univariate relations . In Proceedings ISSAC 2017 . ACM, 357--364. https:\/\/doi.org\/10.1145\/3087604.3087656 10.1145\/3087604.3087656 V. Neiger and T. X. Vu. 2017. Computing canonical bases of modules of univariate relations. In Proceedings ISSAC 2017. ACM, 357--364. https:\/\/doi.org\/10.1145\/3087604.3087656"},{"volume-title":"Integral Matrices","author":"Newman M.","key":"e_1_3_2_1_28_1","unstructured":"M. Newman . 1972. Integral Matrices . Academic Press . M. Newman. 1972. Integral Matrices. Academic Press."},{"key":"e_1_3_2_1_30_1","volume-title":"Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2006\/776","author":"Storjohann A.","year":"2006","unstructured":"A. Storjohann . 2006 . Notes on computing minimal approximant bases . In Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2006\/776 A. Storjohann. 2006. Notes on computing minimal approximant bases. In Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2006\/776"},{"volume-title":"Proceedings Algorithms - ESA' 98","author":"Storjohann A.","key":"e_1_3_2_1_31_1","unstructured":"A. Storjohann and T. Mulders . 1998. Fast Algorithms for Linear Algebra Modulo N . In Proceedings Algorithms - ESA' 98 . Springer, 139--150. https:\/\/doi.org\/10.1007\/3- 540--68530--8_12 10.1007\/3- A. Storjohann and T. Mulders. 1998. Fast Algorithms for Linear Algebra Modulo N. In Proceedings Algorithms - ESA' 98. Springer, 139--150. https:\/\/doi.org\/10.1007\/3- 540--68530--8_12"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings ISSAC","author":"Storjohann A.","year":"2005","unstructured":"A. Storjohann and G. Villard . 2005. Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix . In Proceedings ISSAC 2005 . ACM, 309--316. https:\/\/doi.org\/10.1145\/1073884.1073927 10.1145\/1073884.1073927 A. Storjohann and G. Villard. 2005. Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix. In Proceedings ISSAC 2005. ACM, 309--316. https:\/\/doi.org\/10.1145\/1073884.1073927"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02141952"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.009"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings ISSAC","author":"Zhou W.","year":"2013","unstructured":"W. Zhou and G. Labahn . 2013. Computing Column Bases of Polynomial Matrices . In Proceedings ISSAC 2013 . ACM, 379--386. https:\/\/doi.org\/10.1145\/2465506.2465947 10.1145\/2465506.2465947 W. Zhou and G. Labahn. 2013. Computing Column Bases of Polynomial Matrices. In Proceedings ISSAC 2013. ACM, 379--386. https:\/\/doi.org\/10.1145\/2465506.2465947"},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings ISSAC","author":"Zhou W.","year":"2014","unstructured":"W. Zhou and G. Labahn . 2014. Unimodular Completion of Polynomial Matrices . In Proceedings ISSAC 2014 . ACM, 413--420. https:\/\/doi.org\/10.1145\/2608628.2608640 10.1145\/2608628.2608640 W. Zhou and G. Labahn. 2014. Unimodular Completion of Polynomial Matrices. In Proceedings ISSAC 2014. ACM, 413--420. https:\/\/doi.org\/10.1145\/2608628.2608640"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings ISSAC","author":"Zhou W.","year":"2012","unstructured":"W. Zhou , G. Labahn , and A. Storjohann . 2012. Computing Minimal Nullspace Bases . In Proceedings ISSAC 2012 . ACM, 366--373. https:\/\/doi.org\/10.1145\/2442829.2442881 10.1145\/2442829.2442881 W. Zhou, G. Labahn, and A. Storjohann. 2012. Computing Minimal Nullspace Bases. In Proceedings ISSAC 2012. ACM, 366--373. https:\/\/doi.org\/10.1145\/2442829.2442881"}],"event":{"name":"ISSAC '22: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Villeneuve-d'Ascq France","acronym":"ISSAC '22"},"container-title":["Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476446.3535495","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3476446.3535495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:47Z","timestamp":1750188647000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476446.3535495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,4]]},"references-count":36,"alternative-id":["10.1145\/3476446.3535495","10.1145\/3476446"],"URL":"https:\/\/doi.org\/10.1145\/3476446.3535495","relation":{},"subject":[],"published":{"date-parts":[[2022,7,4]]},"assertion":[{"value":"2022-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}