{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:34Z","timestamp":1760061574364,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,23]],"date-time":"2017-07-23T00:00:00Z","timestamp":1500768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Horizon 2020 European Research Infrastructures project","award":["OpenDreamKit (676541)"],"award-info":[{"award-number":["OpenDreamKit (676541)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,23]]},"DOI":"10.1145\/3087604.3087609","type":"proceedings-article","created":{"date-parts":[[2017,7,19]],"date-time":"2017-07-19T20:02:15Z","timestamp":1500494535000},"page":"133-140","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Certificates for Triangular Equivalence and Rank Profiles"],"prefix":"10.1145","author":[{"given":"Jean-Guillaume","family":"Dumas","sequence":"first","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, Grenoble, France"}]},{"given":"David","family":"Lucas","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, Grenoble, France"}]},{"given":"Cl\u00e9ment","family":"Pernet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, Grenoble, France"}]}],"member":"320","published-online":{"date-parts":[[2017,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528404"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"e_1_3_2_1_3_1","first-page":"150","article-title":"\/\/www.jstor.org\/stable\/112607 Condensation of Determinants, Being a New and Brief Method for Computing their Arithmetical Values","volume":"15","author":"Dodgson C. L.","year":"1866","unstructured":"C. L. Dodgson. href http:\/\/www.jstor.org\/stable\/112607 Condensation of Determinants, Being a New and Brief Method for Computing their Arithmetical Values. Proceedings of the Royal Society of London, 15:150--155, 1866.","journal-title":"Proceedings of the Royal Society of London"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608644"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930908"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465506.2465517"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756682"},{"key":"e_1_3_2_1_8_1","volume-title":"Journal of Symbolic Computation","author":"Dumas J.-G.","year":"2016","unstructured":"J.-G. Dumas, C. Pernet, and Z. Sultan. Fast computation of the rank profile matrix and the generalized Bruhat decomposition. Journal of Symbolic Computation, 2016. in press."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/36664.36676"},{"key":"e_1_3_2_1_11_1","volume-title":"Sept.","author":"Freivalds R.","year":"1979","unstructured":"R. Freivalds. Fast probabilistic algorithms. Mathematical Foundations of Computer Science,textitLNCS, 74:57--69, Sept. 1979."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_13_1","volume-title":"Rank-profile revealing gaussian elimination and the CUP matrix decomposition. Journal of Symbolic Computation, 56:pages 46--68","author":"Jeannerod C.-P.","year":"2013","unstructured":"C.-P. Jeannerod, C. Pernet, and A. Storjohann. Rank-profile revealing gaussian elimination and the CUP matrix decomposition. Journal of Symbolic Computation, 56:pages 46--68, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993915"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277590"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756672"}],"event":{"name":"ISSAC '17: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Kaiserslautern Germany","acronym":"ISSAC '17"},"container-title":["Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087604.3087609","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087604.3087609","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087604.3087609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,23]]},"references-count":15,"alternative-id":["10.1145\/3087604.3087609","10.1145\/3087604"],"URL":"https:\/\/doi.org\/10.1145\/3087604.3087609","relation":{},"subject":[],"published":{"date-parts":[[2017,7,23]]},"assertion":[{"value":"2017-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}