{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:00Z","timestamp":1750308600479,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"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":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["BRUTUS"],"award-info":[{"award-number":["BRUTUS"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,23]]},"DOI":"10.1145\/3115936.3115944","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T12:12:36Z","timestamp":1502367156000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Sparse PLUQ Factorization modulo p"],"prefix":"10.1145","author":[{"given":"Charles","family":"Bouillaguet","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Lille, CRIStAL Cit\u00e9, Scientifique, Villeneuve d'Ascq"}]},{"given":"Claire","family":"Delaplace","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lille, CRIStAL Universit\u00e9 de Rennes, IRISA, G\u00e9n\u00e9ral Leclerc, Rennes"}]},{"given":"Marie-Emilie","family":"Voge","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lille, CRIStAL Cit\u00e9, Scientifique, Villeneuve d'Ascq"}]}],"member":"320","published-online":{"date-parts":[[2017,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894278952"},{"key":"e_1_3_2_1_2_1","volume-title":"Uniquely restricted matchings and edge colorings. CoRR abs\/1611.06815","author":"Baste Julien","year":"2016","unstructured":"Julien Baste , Dieter Rautenbach , and Ignasi Sau . 2016. Uniquely restricted matchings and edge colorings. CoRR abs\/1611.06815 ( 2016 ). Julien Baste, Dieter Rautenbach, and Ignasi Sau. 2016. Uniquely restricted matchings and edge colorings. CoRR abs\/1611.06815 (2016)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45641-6_8"},{"key":"e_1_3_2_1_4_1","volume-title":"GBLA - Gr\u00f6bner Basis Linear Algebra Package. CoRR abs\/1602.06097","author":"Boyer Brice","year":"2016","unstructured":"Brice Boyer , Christian Eder , Jean-Charles Faug\u00e8re , Sylvian Lachartre , and Fayssal Martani . 2016. GBLA - Gr\u00f6bner Basis Linear Algebra Package. CoRR abs\/1602.06097 ( 2016 ). http:\/\/arxiv.org\/abs\/1602.06097 Brice Boyer, Christian Eder, Jean-Charles Faug\u00e8re, Sylvian Lachartre, and Fayssal Martani. 2016. GBLA - Gr\u00f6bner Basis Linear Algebra Package. CoRR abs\/1602.06097 (2016). http:\/\/arxiv.org\/abs\/1602.06097"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740674"},{"key":"e_1_3_2_1_6_1","unstructured":"G. Chaty and M. Chein. 1979. Ordered matchings and matchings without alternating cycles in bipartite graphs. Utilitas Mathematica 16 (January 1979) 183--187.  G. Chaty and M. Chein. 1979. Ordered matchings and matchings without alternating cycles in bipartite graphs. Utilitas Mathematica 16 (January 1979) 183--187."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/2153413"},{"key":"e_1_3_2_1_8_1","volume-title":"Graphs in which some and every maximum matching is uniquely restricted. ArXiv e-prints (April","author":"Penso L. Draque","year":"2015","unstructured":"L. Draque Penso , D. Rautenbach , and U. dos Santos Souza . 2015. Graphs in which some and every maximum matching is uniquely restricted. ArXiv e-prints (April 2015 ). arXiv:math.CO\/1504.02250 L. Draque Penso, D. Rautenbach, and U. dos Santos Souza. 2015. Graphs in which some and every maximum matching is uniquely restricted. ArXiv e-prints (April 2015). arXiv:math.CO\/1504.02250"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278177.1278186"},{"key":"e_1_3_2_1_10_1","volume-title":"CASC'2002","author":"Dumas Jean-Guillaume","year":"2002","unstructured":"Jean-Guillaume Dumas and Gilles Villard . 2002 . Computing the rank of sparse matrices over finite fields . In CASC'2002 , Proceedings of the fifth International Workshop on Computer Algebra in Scientific Computing, Yalta, Ukraine, Victor G. Ganzha, Ernst W. Mayr, and Evgenii V. Vorozhtsov (Eds.). Technische Universit\u00e4t M\u00fcnchen, Germany, 47--62. http:\/\/ljk.imag.fr\/membres\/Jean-Guillaume.Dumas\/Publications\/sparseeliminationCASC 2002.pdf Jean-Guillaume Dumas and Gilles Villard. 2002. Computing the rank of sparse matrices over finite fields. In CASC'2002, Proceedings of the fifth International Workshop on Computer Algebra in Scientific Computing, Yalta, Ukraine, Victor G. Ganzha, Ernst W. Mayr, and Evgenii V. Vorozhtsov (Eds.). Technische Universit\u00e4t M\u00fcnchen, Germany, 47--62. http:\/\/ljk.imag.fr\/membres\/Jean-Guillaume.Dumas\/Publications\/sparseeliminationCASC2002.pdf"},{"key":"e_1_3_2_1_11_1","unstructured":"J.-G. Dumas. Sparse Integer Matrices Collection. (????). http:\/\/hpac.imag.fr.  J.-G. Dumas. Sparse Integer Matrices Collection. (????). http:\/\/hpac.imag.fr."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837210.1837225"},{"key":"e_1_3_2_1_13_1","volume-title":"Uniquely Restricted Matchings in Interval Graphs. CoRR abs\/1604.07016","author":"Francis Mathew C.","year":"2016","unstructured":"Mathew C. Francis , Dalu Jacob , and Satyabrata Jana . 2016. Uniquely Restricted Matchings in Interval Graphs. CoRR abs\/1604.07016 ( 2016 ). Mathew C. Francis, Dalu Jacob, and Satyabrata Jana. 2016. Uniquely Restricted Matchings in Interval Graphs. CoRR abs\/1604.07016 (2016)."},{"key":"e_1_3_2_1_14_1","volume-title":"Nested Dissection of a Regular Finite Element Mesh. 10, 2 (April","author":"George Alan","year":"1973","unstructured":"Alan George . 1973. Nested Dissection of a Regular Finite Element Mesh. 10, 2 (April 1973 ), 345--363. Alan George. 1973. Nested Dissection of a Regular Finite Element Mesh. 10, 2 (April 1973), 345--363."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0909058"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.08.027"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0004-z"},{"key":"e_1_3_2_1_18_1","first-page":"950","article-title":"Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs. International Journal of Computer, Electrical","volume":"10","author":"Gupta Swapnil","year":"2016","unstructured":"Swapnil Gupta and C. Pandu Rangan . 2016 . Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs. International Journal of Computer, Electrical , Automation, Control and Information Engineering 10 , 6 (2016), 950 -- 959 . http:\/\/waset.org\/Publications?p=114 Swapnil Gupta and C. Pandu Rangan. 2016. Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs. International Journal of Computer, Electrical, Automation, Control and Information Engineering 10, 6 (2016), 950--959. http:\/\/waset.org\/Publications?p=114","journal-title":"Automation, Control and Information Engineering"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081089308818204"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.05.039"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00398-6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2005.06.055"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830911001115"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.3.3.255"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2011.05.059"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00383169"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576746"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.01.016"},{"key":"e_1_3_2_1_29_1","unstructured":"The FFLAS-FFPACK group. 2014. FFLAS-FFPACK: Finite Field Linear Algebra Subroutines \/ Package (v2.0.0 ed.). http:\/\/linalg.org\/projects\/fflas-ffpack.  The FFLAS-FFPACK group. 2014. FFLAS-FFPACK: Finite Field Linear Algebra Subroutines \/ Package (v2.0.0 ed.). http:\/\/linalg.org\/projects\/fflas-ffpack."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057137"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0602010"}],"event":{"name":"PASCO 2017: International Workshop on Parallel Symbolic Computation","sponsor":["Heriot-Watt University Heriot-Watt University"],"location":"Kaiserslautern Germany","acronym":"PASCO 2017"},"container-title":["Proceedings of the International Workshop on Parallel Symbolic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3115936.3115944","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3115936.3115944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:40Z","timestamp":1750273540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3115936.3115944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,23]]},"references-count":31,"alternative-id":["10.1145\/3115936.3115944","10.1145\/3115936"],"URL":"https:\/\/doi.org\/10.1145\/3115936.3115944","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"}}]}}