{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:19:47Z","timestamp":1776763187336,"version":"3.51.2"},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"value":"354057235X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013169","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:23:18Z","timestamp":1132730598000},"page":"66-80","source":"Crossref","is-referenced-by-count":2,"title":["Process scheduling in DSC and the large sparse linear systems challenge"],"prefix":"10.1007","author":[{"given":"A.","family":"Diaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Hitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Kaltofen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Lobo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Valente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Batut, C., Bernardi, D., Cohen, H., and Olivier, M., \u201cUser's Guide to PARI-GP,\u201d Manual, February 1991."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0024-3795(80)90161-5","volume":"34","author":"R. R. Bitmead","year":"1980","unstructured":"Bitmead, R. R. and Anderson, B. D. O., \u201cAsymtotically fast solution of Toeplitz and related systems of linear equations,\u201d Linear Algebra Applic. 34, pp. 103\u2013116 (1980).","journal-title":"Linear Algebra Applic."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Char, B. W., \u201cProgress report on a system for general-purpose parallel symbolic algebraic computation,\u201d in Proc. 1990 Internat. Symp. Symbolic Algebraic Comput., edited by S. Watanabe and M. Nagata; ACM Press, pp. 96\u2013103, 1990.","DOI":"10.1145\/96877.96902"},{"key":"7_CR4","unstructured":"Collins, G. E., Johnson, J. R., and K\u00fcchlin, W., \u201cPARSAC-2: A multi-threaded system for symbolic and algebraic computation,\u201d Tech. Report TR.38, Comput. and Information Sci. Research Center, Ohio State University, December 1990."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., \u201cSolving linear equations over GF(2) via block Wiedemann algorithm,\u201d Math. Comput., p. to appear (1992).","DOI":"10.1016\/0024-3795(93)90235-G"},{"key":"7_CR6","volume-title":"\u201cDSC,\u201d Users Manual","author":"A. Diaz","year":"1992","unstructured":"Diaz, A., \u201cDSC,\u201d Users Manual (2nd ed.), Dept. Comput. Sci., Rensselaer Polytech. Inst., Troy, New York, 1992.","edition":"2nd ed."},{"key":"7_CR7","unstructured":"Diaz, A., Kaltofen, E., Schmitz, K., and Valente, T., \u201cDSC A System for Distributed Symbolic Computation,\u201d in Proc. 1991 Internat. Symp. Symbolic Algebraic Comput., edited by S. M. Watt; ACM Press, pp. 323\u2013332, 1991."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0024-3795(86)90279-X","volume":"80","author":"I. Gohberg","year":"1986","unstructured":"Gohberg, I., Kailath, T., and Koltracht, I., \u201cEfficient solution of linear systems of equations with recursive structure,\u201d Linear Algebra Applic. 80, pp. 81\u2013113 (1986).","journal-title":"Linear Algebra Applic."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/147105.147108","volume":"26\/4","author":"H. Hong","year":"1992","unstructured":"Hong, H. and Schreiner, W., \u201cProgramming in PACLIB,\u201d SIGSAM Bull. 26\/4, pp. 1\u20136 (1992).","journal-title":"SIGSAM Bull."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., \u201cAnalysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems,\u201d in Proc. AAECC-10, Springer Lect. Notes Comput. Sci. 673, edited by G. Cohen, T. Mora, and O. Moreno; pp. 195\u2013212, 1993.","DOI":"10.1007\/3-540-56686-4_44"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0747-7171(08)80015-6","volume":"9\/3","author":"E. Kaltofen","year":"1990","unstructured":"Kaltofen, E. and Trager, B., \u201cComputing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators,\u201d J. Symbolic Comput. 9\/3, pp. 301\u2013320 (1990).","journal-title":"J. Symbolic Comput."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Valente, T., and Yui, N., \u201cAn improved Las Vegas primality test,\u201d Proc. ACM-SIGSAM 1989 Internat. Symp. Symbolic Algebraic Comput., pp. 26\u201333 (1989).","DOI":"10.1145\/74540.74545"},{"key":"7_CR13","volume-title":"The Architecture of Symbolic Computers","author":"P. M. Kogge","year":"1991","unstructured":"Kogge, P. M., The Architecture of Symbolic Computers; McGraw-Hill, Inc., New York, N.Y., 1991."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Morain, F., \u201cDistributed primality proving and the primality of (23539+1)\/3,\u201d in Advances in Cryptology\u2014EUROCRYPT '90, Springer Lect. Notes Comput. Sci. 473, edited by I. B. Damg\u00e5rd; pp. 110\u2013123, 1991.","DOI":"10.1007\/3-540-46877-3_10"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Morf, M., \u201cDoubling algorithms for Toeplitz and related equations,\u201d in Proc. 1980 IEEE Internat. Conf. Acoust. Speech Signal Process.; IEEE, pp. 954\u2013959, 1980.","DOI":"10.1109\/ICASSP.1980.1171074"},{"key":"7_CR16","series-title":"Springer Lect. Notes Math. 584","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-55328-2_2","volume-title":"Computer Algebra and Parallelism","author":"S. Seitz","year":"1992","unstructured":"Seitz, S., \u201cAlgebraic computing on a local net,\u201d in Computer Algebra and Parallelism, Springer Lect. Notes Math. 584; Springer Verlag, New York, N. Y., pp. 19\u201331, 1992."},{"key":"7_CR17","volume-title":"Ph.D. Thesis","author":"T. Valente","year":"1992","unstructured":"Valente, T., \u201cA distributed approach to proving large numbers prime,\u201d Ph.D. Thesis, Dept. Comput. Sci., Rensselaer Polytech. Instit., Troy, New York, December 1992."},{"key":"7_CR18","doi-asserted-by":"publisher","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"}],"container-title":["Lecture Notes in Computer Science","Design and Implementation of Symbolic Computation Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:32:31Z","timestamp":1586579551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057235X"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0013169","relation":{},"subject":[]}}