{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T20:53:27Z","timestamp":1773262407213,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540545224","type":"print"},{"value":"9783540384366","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54522-0_93","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:58:31Z","timestamp":1330192711000},"page":"29-38","source":"Crossref","is-referenced-by-count":51,"title":["On wiedemann's method of solving sparse linear systems"],"prefix":"10.1007","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[]},{"given":"B.","family":"David Saunders","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"3_CR1","first-page":"467","volume":"358","author":"S. K. Abdali","year":"1988","unstructured":"Abdali, S. K. and Wise, D. S., \u201cExperiments with quadtree representation of matrices,\u201d Proc. ISSAC '88, Springer Lect. Notes Comput. Sci. 358, pp. 467\u2013474 (1988).","journal-title":"Proc. ISSAC '88, Springer Lect. Notes Comput. Sci."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1002\/j.1538-7305.1964.tb04103.x","volume":"43","author":"V. E. Bene\u0161","year":"1964","unstructured":"Bene\u0161, V. E., \u201cOptimal rearrangeable multistage connecting networks,\u201d Bell System Tech. J. 43, pp. 1641\u20131656 (1964)","journal-title":"Bell System Tech. J."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Canny, J., Kaltofen, E., and Lakshman, Yagati, \u201cSolving systems of non-linear polynomial equations faster,\u201d Proc. ACM-SIGSAM 1989 Internat. Symp. Symbolic Algebraic Comput., pp. 121\u2013128 (1989).","DOI":"10.1145\/74540.74556"},{"key":"3_CR4","unstructured":"Cantor, D. G. and Kaltofen, E., \u201cFast multiplication of polynomials over arbitrary rings,\u201d Tech. Report 87-35, Dept. Comput. Sci., Rensselaer Polytechnic Institute, December 1987. Revised version to appear in Acta Informatica."},{"key":"3_CR5","volume-title":"Matrix Computations","author":"G. H. Golub","year":"1987","unstructured":"Golub, G. H. and van Loan, C. F., Matrix Computations; Johns Hopkins University Press, Baltimore, Maryland, 1987."},{"key":"3_CR6","volume-title":"An Introduction to the Theory of Numbers","author":"G. H. Hardy","year":"1979","unstructured":"Hardy, G. H. and Wright, E. M., An Introduction to the Theory of Numbers; Oxford Univ. Press, Oxford, 1979."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Kaltofen, E. and Pan, V., \u201cProcessor efficient parallel solution of linear systems over an abstract field,\u201d in Proc. 3rd Ann. ACM Symp. Parallel Algor. Architecture; ACM Press, p. to appear, 1991.","DOI":"10.1145\/113379.113396"},{"issue":"188","key":"3_CR8","first-page":"697","volume":"53","author":"E. Kaltofen","year":"1989","unstructured":"Kaltofen, E. and Rolletschek, H., \u201cComputing greatest common divisors and factorizations in quadratic number fields,\u201d Math. Comp. 53\/188, pp. 697\u2013720 (1989).","journal-title":"Math. Comp."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/0196-6774(88)90026-0","volume":"9","author":"M. Kaminski","year":"1988","unstructured":"Kaminski, M., Kirkpatrick, D. G., and Bshouty, N. H., \u201cAddition requirements for matrix and transposed matrix products,\u201d J. Algorithms 9, pp. 354\u2013364 (1988).","journal-title":"J. Algorithms"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"LaMacchia, B. A. and Odlyzko, A. M., \u201cSolving large sparse linear systems over finite fields,\u201d in Advances in Cryptology: Crypto 90, Lect. Notes Comput. Sci., edited by S. Vanstone; Springer Verlag, p. to appear, 1991.","DOI":"10.1007\/3-540-38424-3_8"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. Lipton","year":"1979","unstructured":"Lipton, R., Rose, D., and Tarjan, R. E., \u201cGeneralized nested dissection,\u201d SIAM J. Numer. Anal. 16, pp. 346\u2013358 (1979).","journal-title":"SIAM J. Numer. Anal."},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"IT-15","author":"J. L. Massey","year":"1969","unstructured":"Massey, J. L., \u201cShift-register synthesis and BCH decoding,\u201d IEEE Trans. Inf. Theory IT-15, pp. 122\u2013127 (1969).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. T. Schwartz","year":"1980","unstructured":"Schwartz, J. T., \u201cFast probabilistic algorithms for verification of polynomial identities,\u201d J. ACM 27, pp. 701\u2013717 (1980).","journal-title":"J. ACM"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"IT-32","author":"D. Wiedemann","year":"1986","unstructured":"Wiedemann, D., \u201cSolving sparse linear equations over finite fields,\u201d IEEE Trans. Inf. Theory IT-32, pp. 54\u201362 (1986).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0743-7315(90)90079-5","volume":"9","author":"D. S. Wise","year":"1990","unstructured":"Wise, D. S. and Franco, J., \u201cCosts of quadtree representation of non-dense matrices,\u201d J. Parallel Distributed Comput. 9, pp. 282\u2013296 (1990).","journal-title":"J. Parallel Distributed Comput."},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume":"72","author":"R. E. Zippel","year":"1979","unstructured":"Zippel, R. E., \u201cProbabilistic algorithms for sparse polynomials,\u201d Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci. 72, pp. 216\u2013226 (1979).","journal-title":"Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54522-0_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:55:30Z","timestamp":1605628530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54522-0_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545224","9783540384366"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-54522-0_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}