{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:25:28Z","timestamp":1775053528562,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Programming and Computer Software"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1022940530911","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:16:51Z","timestamp":1049739411000},"page":"59-71","source":"Crossref","is-referenced-by-count":4,"title":["Solution of Systems of Linear Equations by the p-Adic Method"],"prefix":"10.1007","volume":"29","author":[{"given":"G. I.","family":"Malaschonok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"465471_CR1","doi-asserted-by":"crossref","unstructured":"Labahn, G. and Storjohann, A., Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices, Proc. of ISSAC'96, ACM, 1996, pp. 259\u2013266.","DOI":"10.1145\/236869.237083"},{"key":"465471_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Reading: Addison- Wesley, 1975. Translated under the title Postroenie i analiz vychislitel'nykh algoritmov Moscow: Mir, 1979."},{"key":"465471_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01459082","volume":"40","author":"J. Dixon","year":"1982","unstructured":"Dixon, J., Exact Solution of Linear Equations Using p-Adic Expansions, Numer. Math., 1982, vol. 40, pp. 137\u2013141.","journal-title":"Numer. Math."},{"key":"465471_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1098\/rstl.1861.0016","volume":"151","author":"H.J.S. Smith","year":"1861","unstructured":"Smith, H.J.S., On System of Linear Indeterminate Equations and Congruences, Phil. Trans. Royal Soc. (London), 1861, vol. 151, pp.293\u2013326.","journal-title":"Phil. Trans. Royal Soc. (London)"},{"key":"465471_CR5","first-page":"236","volume":"4","author":"H.J.S. Smith","year":"1873","unstructured":"Smith, H.J.S., On the Arithmetical Invariants of a Rectangular Matrix of Which the Constituents are Integral Numbers, Proc. London Math. Soc., 1873, vol. 4, pp. 236\u2013349.","journal-title":"Proc. London Math. Soc."},{"key":"465471_CR6","doi-asserted-by":"crossref","unstructured":"Gregory, R.T. and Krishnamurthy, E.V., Methods and Applications of Error-free Computation, Berlin, 1984.","DOI":"10.1007\/978-1-4612-5242-9"},{"key":"465471_CR7","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1137\/0119053","volume":"10","author":"M.F. Hurt","year":"1970","unstructured":"Hurt, M.F. and Waid, C.A., A Generalized Inverse Which Give All the Integral Solutions to a System of Linear Equations, SIAM J. Appl. Math., 1970, vol. 10, pp. 547\u2013550.","journal-title":"SIAM J. Appl. Math."},{"issue":"6","key":"465471_CR8","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1137\/0220067","volume":"20","author":"J.L. Hafner","year":"1991","unstructured":"Hafner, J.L. and McCuley, K.S., Asymptotically Fast Triangularization of Matrix Over Rings, SIAM J. Comput. 1991, vol. 20, no. 6, pp. 1068\u20131083.","journal-title":"SIAM J. Comput."},{"key":"465471_CR9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/309831.309905","volume-title":"Proc. of ISSAC'99","author":"T. Mulders","year":"1999","unstructured":"Mulders, T. and Storjohann, A., Diophantine Linear System Solving, Proc. of ISSAC'99, Vancouver: ACM, 1999, pp. 181\u2013188."},{"key":"465471_CR10","unstructured":"Von zur Gathen, J. and Gerhard, J., Modern Computer Algebra, Cambridge Univ. Press, 1999."},{"key":"465471_CR11","doi-asserted-by":"crossref","unstructured":"Malaschonok, G.I., Solution of Systems of Linear Diophantine Equations, Proc. of Conf. on Computer Algebra in Scientific Computing, CASC 2001, Springer, 2001, pp. 401\u2013415.","DOI":"10.1007\/978-3-642-56666-0_31"},{"key":"465471_CR12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A. and Strassen, V., Schnelle Multiplikation Grosser Zahlen, Computing, 1971, vol. 7, pp. 281\u2013292.","journal-title":"Computing"},{"key":"465471_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00289520","volume":"1","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica, 1971, vol. 1, pp. 139\u2013144.","journal-title":"Acta Informatica"},{"key":"465471_CR14","first-page":"756","volume":"19","author":"S.A. Abramov","year":"1979","unstructured":"Abramov, S.A., Some Estimates Related to the Euclidean Algorithm, Zh. Vychisl. Mat. Mat. Fiz., 1979, vol. 19, pp. 756\u2013760.","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"issue":"134","key":"465471_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/377626.377629","volume":"34","author":"S.A. Abramov","year":"2000","unstructured":"Abramov, S.A., A Note on the Number of Division Steps in the Euclidean Algorithm, SIGSAM Bull., 2000, vol. 34 (Issue 134), pp. 1\u20132.","journal-title":"SIGSAM Bull."},{"key":"465471_CR16","volume-title":"Computer Algebra. Symbolic and Algebraic Computation","author":"B. Buchberger","year":"1982","unstructured":"Buchberger, B., Collins, G.E., and Loos, R., Computer Algebra. Symbolic and Algebraic Computation, New York: Springer, 1982. Translated under the title Kompyuternaya algebra. Simvolnye i algebraicheskie vychisleniya, Moscow: Mir, 1986."},{"key":"465471_CR17","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1969","unstructured":"Knuth, D.E., The Art of Computer Programming, vol. 2: Seminumerical Algorithms, Reading: Addison-Wesley, 1969. Translated under the title Iskusstvo programmirovaniya dlya EVM, tom 2: Poluchislennye algoritmy, Moscow: Mir, 1977."},{"key":"465471_CR18","first-page":"475","volume-title":"Proc. of the 15th IMACS World Congress","author":"G.I. Malaschonok","year":"1997","unstructured":"Malaschonok, G.I., Recursive Method for the Solution of Systems of Linear Equations Computational Mathematics, Proc. of the 15th IMACS World Congress, vol. I (Berlin, 1997), Berlin: Wissenschaft and Technik, 1997, pp. 475\u2013480."},{"key":"465471_CR19","doi-asserted-by":"crossref","unstructured":"Wang, P.S., A p-Adic Algorithm for Univariante Partial Factors, Proc. of SYMSAC'81, ACM, 1981, pp. 212\u2013217.","DOI":"10.1145\/800206.806398"},{"key":"465471_CR20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/jsco.1995.1051","volume":"20","author":"G.E. Collins","year":"1995","unstructured":"Collins, G.E. and Encarnacion, M.J., Efficient Rational Number Reconstruction, J. Symbolic Computation, 1995, vol. 20, pp. 287\u2013297.","journal-title":"J. Symbolic Computation"},{"key":"465471_CR21","doi-asserted-by":"crossref","unstructured":"Giesbrecht, M., Efficient Parallel Solution of Sparse System of Linear Diophantine Equations, Proc. of the Second Int. Symp. on Parallel Symbolic Computation, PASCO'97, ACM, 1997, pp. 1\u201310.","DOI":"10.1145\/266670.266678"},{"key":"465471_CR22","volume-title":"Kombinatornaya teoriya kolets. Standartnye bazisy (Combinatorial Theory of Rings: Standard Bases)","author":"V.N. Latyshev","year":"1988","unstructured":"Latyshev, V.N., Kombinatornaya teoriya kolets. Standartnye bazisy (Combinatorial Theory of Rings: Standard Bases), Moscow: Mosk. Gos. Univ., 1988."},{"key":"465471_CR23","volume-title":"Komp'yuternaya algebra. Vychisleniya v differentsial'noi i raznostnoi algebre (Computer Algebra: Computation in Differential and Difference Algebras)","author":"A.V. Mikhalev","year":"1989","unstructured":"Mikhalev, A.V. and Pankrat'ev, E.V., Komp'yuternaya algebra. Vychisleniya v differentsial'noi i raznostnoi algebre (Computer Algebra: Computation in Differential and Difference Algebras), Moscow: Mosk. Gos. Univ., 1989."},{"key":"465471_CR24","volume-title":"Komp'yuternaya algebra. Faktorizatsiya mnogochlenov (Computer Algebra: Factorization of Polynomials)","author":"E.V. Pankrat'ev","year":"1988","unstructured":"Pankrat'ev, E.V., Komp'yuternaya algebra. Faktorizatsiya mnogochlenov (Computer Algebra: Factorization of Polynomials), Moscow: Mosk. Gos. Univ., 1988."},{"key":"465471_CR25","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D. Wiedemann","year":"1986","unstructured":"Wiedemann, D., Solving Sparse Linear Equations over Finite Fields, IEEE Trans. Information Theory 1986, vol. 32, pp. 54\u201362.","journal-title":"IEEE Trans. Information Theory"},{"key":"465471_CR26","first-page":"180","volume-title":"Proc. of the 3rd Annu. ACM Symp. on Parallel Algorithm Architecture, SPAA'91","author":"E. Kaltofen","year":"1991","unstructured":"Kaltofen, E. and Pan, V., Processor Efficient Parallel Solution of Linear Systems over an Abstract Field, Proc. of the 3rd Annu. ACM Symp. on Parallel Algorithm Architecture, SPAA'91, New York: ACM, 1991, pp. 180\u2013191."},{"key":"465471_CR27","first-page":"91","volume-title":"Proc. of Symp. on Parallel Comput. Solving Large Scale Irregular Applications, Stratagem' 96","author":"E. Kaltofen","year":"1996","unstructured":"Kaltofen, E., Blocked Iterative Sparse Linear System Solvers for Finite Fields, Proc. of Symp. on Parallel Comput. Solving Large Scale Irregular Applications, Stratagem' 96 France: Sophia Antipolis, 1996, pp. 91\u201395."},{"key":"465471_CR28","doi-asserted-by":"crossref","unstructured":"Huang, X. and Pan, V.Y., Fast Rectangular Matrix Multiplication and Improving Parallel Matrix Computations, Proc. of PASCO'97, ACM, 1997, pp. 11\u201323.","DOI":"10.1145\/266670.266679"},{"key":"465471_CR29","doi-asserted-by":"crossref","unstructured":"Malaschonok, G.I., Effective Matrix Methods in Commutative Domains, in Formal Power Series and Algebraic Combinatorics, Springer, 2000, pp. 506\u2013517.","DOI":"10.1007\/978-3-662-04166-6_48"},{"key":"465471_CR30","volume-title":"Algorithms for Matrix Canonical Forms","author":"A. Storjohann","year":"2000","unstructured":"Storjohann, A., Algorithms for Matrix Canonical Forms, Ph D Dissertation, Zurich: Swiss Federal Inst. of Technology, 2000."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022940530911.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022940530911","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022940530911.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:55:46Z","timestamp":1775008546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022940530911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["465471"],"URL":"https:\/\/doi.org\/10.1023\/a:1022940530911","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}