{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:21:56Z","timestamp":1740097316115,"version":"3.37.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319456409"},{"type":"electronic","value":"9783319456416"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45641-6_8","type":"book-chapter","created":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T06:30:29Z","timestamp":1473316229000},"page":"101-116","source":"Crossref","is-referenced-by-count":3,"title":["Sparse Gaussian Elimination Modulo p: An Update"],"prefix":"10.1007","author":[{"given":"Charles","family":"Bouillaguet","sequence":"first","affiliation":[]},{"given":"Claire","family":"Delaplace","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,9]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/S0895479899358194","volume":"23","author":"PR Amestoy","year":"2001","unstructured":"Amestoy, P.R., Duff, I.S., Koster, J., L\u2019Excellent, J.-Y.: A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23(1), 15\u201341 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997). http:\/\/dx.doi.org\/10.1006\/jsco.1996.0125 . computational algebra and number theory, London (1993)","DOI":"10.1006\/jsco.1996.0125"},{"key":"8_CR3","unstructured":"Boyer, B., Eder, C., Faug\u00e8re, J., Lachartre, S., Martani, F.: GBLA - gr\u00f6bner basis linear algebra package. CoRR abs\/1602.06097 (2016). http:\/\/arxiv.org\/abs\/1602.06097"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/10722028_11","volume-title":"Algorithmic Number Theory","author":"S Cavallar","year":"2000","unstructured":"Cavallar, S.: Strategies in filtering in the number field sieve. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 209\u2013232. Springer, Heidelberg (2000). http:\/\/dx.doi.org\/10.1007\/10722028_11"},{"issue":"3","key":"8_CR5","doi-asserted-by":"crossref","first-page":"22:1","DOI":"10.1145\/1391989.1391995","volume":"35","author":"Y Chen","year":"2008","unstructured":"Chen, Y., Davis, T.A., Hager, W.W., Rajamanickam, S.: Algorithm 887: CHOLMOD, supernodal sparse cholesky factorization and update\/downdate. ACM Trans. Math. Softw. 35(3), 22:1\u201322:14 (2008). http:\/\/doi.acm.org\/10.1145\/1391989.1391995","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"8_CR6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1177\/109434208700100403","volume":"1","author":"C Cleveland Ashcraft","year":"1987","unstructured":"Cleveland Ashcraft, C., Grimes, R.G., Lewis, J.G., Peyton, P.W., Simon, H.D., Bj\u00f8rstad, P.E.: Progress in sparse matrix methods for large linear systems on vector supercomputers. Int. J. High Perform. Comput. Appl. 1(4), 10\u201330 (1987). http:\/\/dx.doi.org\/10.1177\/109434208700100403","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"205","key":"8_CR7","first-page":"333","volume":"62","author":"D Coppersmith","year":"1994","unstructured":"Coppersmith, D.: Solving homogeneous linear equations over $$\\mathbb{F}_2$$ via block wiedemann algorithm. Math. Comput. 62(205), 333\u2013350 (1994)","journal-title":"Math. Comput."},{"issue":"2","key":"8_CR8","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/992200.992206","volume":"30","author":"TA Davis","year":"2004","unstructured":"Davis, T.A.: Algorithm 832: UMFPACK V4.3\u2014an unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 30(2), 196\u2013199 (2004). http:\/\/dx.doi.org\/10.1145\/992200.992206","journal-title":"ACM Trans. Math. Softw."},{"key":"8_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)","author":"TA Davis","year":"2006","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2). Society for Industrial and Applied Mathematics, Philadelphia (2006)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Davis, T.A., Natarajan, E.P.: Algorithm 907: KLU, A direct sparse solver for circuit simulation problems. ACM Trans. Math. Softw. 37(3) (2010). http:\/\/doi.acm.org\/10.1145\/1824801.1824814","DOI":"10.1145\/1824801.1824814"},{"issue":"3","key":"8_CR11","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1137\/S0895479895291765","volume":"20","author":"JW Demmel","year":"1999","unstructured":"Demmel, J.W., Eisenstat, S.C., Gilbert, J.R., Li, X.S., Liu, J.W.H.: A supernodal approach to sparse partial pivoting. SIAM J. Matrix Anal. Appl. 20(3), 720\u2013755 (1999)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"8_CR12","unstructured":"Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Numerical Mathematics and Scientific Computation, Oxford University Press, USA, first paperback edition edn. (1989)"},{"issue":"1","key":"8_CR13","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/355815.355817","volume":"5","author":"IS Duff","year":"1979","unstructured":"Duff, I.S., Reid, J.K.: Some design features of a sparse matrix code. ACM Trans. Math. Softw. 5(1), 18\u201335 (1979). http:\/\/doi.acm.org\/10.1145\/355815.355817","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"8_CR14","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"IS Duff","year":"1983","unstructured":"Duff, I.S., Reid, J.K.: The multifrontal solution of indefinite sparse symmetric linear. ACM Trans. Math. Softw. 9(3), 302\u2013325 (1983). http:\/\/doi.acm.org\/10.1145\/356044.356047","journal-title":"ACM Trans. Math. Softw."},{"key":"8_CR15","unstructured":"Dumas, J.G., Villard, G.: Computing the rank of sparse matrices over finite fields. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2002, Proceedings of the fifth International Workshop on Computer Algebra in Scientific Computing, Yalta, Ukraine, pp. 47\u201362. Technische Universit\u00e4t M\u00fcnchen, Germany, September 2002. http:\/\/ljk.imag.fr\/membres\/Jean-Guillaume.Dumas\/Publications\/sparseeliminationCASC2002.pdf"},{"key":"8_CR16","unstructured":"Dumas, J.-G.: Sparse integer matrices collection. http:\/\/hpac.imag.fr"},{"key":"8_CR17","unstructured":"Dumas, J.-G., Elbaz-Vincent, P., Giorgi, P., Urbanska, A.: Parallel computation of the rank of large sparse matrices from algebraic $$k$$ -theory. In: Maza, M.M., Watt, S.M. (eds.) Parallel Symbolic Computation, PASCO 2007, International Workshop, 27\u201328 July 2007, University of Western Ontario, London, Ontario, Canada, pp. 43\u201352. ACM, New York (2007). http:\/\/doi.acm.org\/10.1145\/1278177.1278186"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Faug\u00e9re, J.-C., Lachartre, S.: Parallel gaussian elimination forgr\u00f6bner bases computations in finite fields. In: Maza, M.M., Roch, J.-L. (eds.) PASCO, pp. 89\u201397. ACM, New York (2010)","DOI":"10.1145\/1837210.1837225"},{"issue":"5","key":"8_CR19","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0909058","volume":"9","author":"JR Gilbert","year":"1988","unstructured":"Gilbert, J.R., Peierls, T.: Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Stat. Comput. 9(5), 862\u2013874 (1988). http:\/\/dx.doi.org\/10.1137\/0909058","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-642-14623-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T Kleinjung","year":"2010","unstructured":"Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thom\u00e9, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-Bit RSA modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 333\u2013350. Springer, Heidelberg (2010). http:\/\/dx.doi.org\/10.1007\/978-3-642-14623-7_18"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-38424-3_8","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"BA LaMacchia","year":"1991","unstructured":"LaMacchia, B.A., Odlyzko, A.M.: Solving large sparse linear systems over finite fields. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 109\u2013133. Springer, Heidelberg (1991). http:\/\/dx.doi.org\/10.1007\/3-540-38424-3_8"},{"issue":"3","key":"8_CR22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","volume":"3","author":"HM Markowitz","year":"1957","unstructured":"Markowitz, H.M.: The elimination form of the inverse and its application to linear programming. Manage. Sci. 3(3), 255\u2013269 (1957). http:\/\/dx.doi.org\/10.1287\/mnsc.3.3.255","journal-title":"Manage. Sci."},{"key":"8_CR23","unstructured":"May, J.P., Saunders, B.D., Wan, Z.: Efficient matrix rank computation with application to the study of strongly regular graphs. In: Wang, D. (ed.) Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28\u2013August 1, 2007, Proceedings, pp. 277\u2013284. ACM (2007). http:\/\/doi.acm.org\/10.1145\/1277548.1277586"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Saunders, B.D., Youse, B.S.: Large matrix, small rank. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC 2009, pp. 317\u2013324. ACM, New York (2009). http:\/\/doi.acm.org\/10.1145\/1576702.1576746","DOI":"10.1145\/1576702.1576746"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Saunders, D.: Matrices with two nonzero entries per row. In: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, pp. 323\u2013330. ACM, New York (2015). http:\/\/doi.acm.org\/10.1145\/2755996.2756679","DOI":"10.1145\/2755996.2756679"},{"key":"8_CR26","unstructured":"The CADO-NFS Development Team: CADO-NFS, an implementation of the number field sieve algorithm (2015), release2.2.0. http:\/\/cado-nfs.gforge.inria.fr\/"},{"key":"8_CR27","unstructured":"The FFLAS-FFPACK group: FFLAS-FFPACK: Finite Field Linear Algebra Subroutines\/Package, v2.0.0 edn. (2014). http:\/\/linalg.org\/projects\/fflas-ffpack"},{"key":"8_CR28","unstructured":"The Sage Developers: Sage Mathematics Software (Version 5.7) (2013). http:\/\/www.sagemath.org"},{"issue":"1","key":"8_CR29","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"DH Wiedemann","year":"1986","unstructured":"Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory 32(1), 54\u201362 (1986). http:\/\/dx.doi.org\/10.1109\/TIT.1986.1057137","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45641-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T04:12:08Z","timestamp":1568347928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45641-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319456409","9783319456416"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45641-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}