{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:24Z","timestamp":1725663384572},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_160","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:38:18Z","timestamp":1330209498000},"page":"520-531","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved parallel computations with matrices and polynomials"],"prefix":"10.1007","author":[{"given":"Dario","family":"Bini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Gemignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"3","key":"40_CR1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S. Berkowitz","year":"1984","unstructured":"S. Berkowitz, On Computing the Determinant in Small Parallel Time Using a Small Number of Processors, Information Processing Letters,\n18,3 1984, 147\u2013150.","journal-title":"Information Processing Letters"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"D. Bini, L. Gemignani, On the Euclidean Scheme for Polynomials, Proc. 2nd Ann. ACM SPAA 1990.","DOI":"10.1145\/97444.97692"},{"key":"40_CR3","unstructured":"D. Bini, L. Gemignani, Fast Parallel Computations of the Polynomial Remainder Sequence via Bezout and Hankel Matrices, Dipartimento di Matematica Universit\u00e0 di Pisa 1990."},{"key":"40_CR4","volume-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"A. Borodin","year":"1975","unstructured":"A. Borodin and I. Munro, The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, New York, 1975."},{"key":"40_CR5","volume-title":"Numeric and Algebraic Computations with Matrices and Polynomials, Volume 1: Fundamental algorithms","author":"D. Bini","year":"1991","unstructured":"D. Bini, V. Pan, Numeric and Algebraic Computations with Matrices and Polynomials, Volume 1: Fundamental algorithms, Birkh\u00e4user, Boston, 1991."},{"key":"40_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BFb0028792","volume":"199","author":"A.L. Chistov","year":"1985","unstructured":"A.L. Chistov, Fast Parallel Calculation of the Rank of Matrices over a Field of Arbitrary Characteristics, Proc. FCT 85, Springer Lecture Notes in Computer Science, 199, 63\u201369, 1985.","journal-title":"Springer Lecture Notes in Computer Science"},{"issue":"6","key":"40_CR7","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1137\/0908073","volume":"8","author":"J. Chun","year":"1987","unstructured":"J. Chun, T. Kailath and H. Lev-Ari, Fast Parallel Algorithm for QR-factorization of Structured Matrices, SIAM J. on Scientific and Statistical Computing,\n8,6 899\u2013913, 1987.","journal-title":"SIAM J. on Scientific and Statistical Computing"},{"key":"40_CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1146\/annurev.cs.03.060188.001313","volume":"3","author":"D. Eppstein","year":"1988","unstructured":"D. Eppstein and Z. Galil, Parallel Algorithmic Techniques for Combinatorial Computation, Annual Review of Computer Science\n3 233\u2013283, 1988.","journal-title":"Annual Review of Computer Science"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"M. Fiedler, Hankel and Loewner Matrices, Linear Algebra Appl.\n58, 1984.","DOI":"10.1016\/0024-3795(84)90205-2"},{"key":"40_CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0024-3795(83)90059-9","volume":"50","author":"W. B. Gragg","year":"1983","unstructured":"W. B. Gragg, A. Lindquist, On the Partial Realization Problem, Linear Algebra Appl.,\n50, 277\u2013319, 1983.","journal-title":"Linear Algebra Appl."},{"key":"40_CR11","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/0024-3795(89)90684-8","volume":"124","author":"U. Helmke","year":"1989","unstructured":"U. Helmke, P.A. Fuhrmann Bezoutians, Linear Algebra Appl.,\n124, 1039\u20131097, 1989.","journal-title":"Linear Algebra Appl."},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"G. Heining, K. Rost, Algebraic Methods for Toeplitz-like Matrices and Operators, Operator Theory 13, Birkhauser 1984.","DOI":"10.1007\/978-3-0348-6241-7"},{"key":"40_CR13","unstructured":"E. Kaltofen, Processor-Efficient Parallel Computation of Polynomial Greatest Common Divisor, PreliminaryReport, Dept. of Computer Sci., RPI, Troy, NY 1989."},{"key":"40_CR14","unstructured":"E. Kaltofen and M. Singer, Size Efficient Parallel Algebraic Circuits for Partial Derivatives, Tech. Report 90-32, Computer Science Department, RPI Troy, NY 1990."},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"E. Kaltofen and V. Pan, Processor Efficient Parallel Solution of Linear Systems over an Abstract Field, Preliminary Report, 1991.","DOI":"10.1145\/113379.113396"},{"issue":"2","key":"40_CR16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0022-247X(79)90124-0","volume":"68","author":"T. Kailath","year":"1979","unstructured":"T. Kailath, S.-Y. Kung and M. Morf, Displacement Ranks of Matrices and Linear Equations, J. Math. Anal. Appl.\n68,2 395\u2013407 1979.","journal-title":"J. Math. Anal. Appl."},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"R. Karp and V. Ramachandran, Survey of Parallel Algorithms for Shared Memory Machines. Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 869\u2013941, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"40_CR18","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(85)90049-0","volume":"36","author":"W. Keller-Gehrig","year":"1985","unstructured":"W. Keller-Gehrig, Fast Algorithms for the Characteristic Polynomial, Theor. Computer Sci.\n36 309\u2013317, 1985.","journal-title":"Theor. Computer Sci."},{"issue":"191","key":"40_CR19","first-page":"179","volume":"55","author":"V. Pan","year":"1990","unstructured":"V. Pan, On Some Computations with Dense Structured Matrices, Proc. ACM-SIGSAM Intern. Symp. on Symbolic and Alg. Comp., 34\u201342, 1989 and Math. of Comp.\n55, 191 179\u2013190 1990.","journal-title":"Proc. ACM-SIGSAM Intern. Symp. on Symbolic and Alg. Comp."},{"issue":"11","key":"40_CR20","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1016\/0898-1221(89)90080-1","volume":"17","author":"V. Pan","year":"1989","unstructured":"V. Pan, Fast and Efficient Parallel Evaluation of the Zeros of a Polynomial Having Only Real Zeros, Computers and Math. (with Appl.)\n17, 11, 1475\u20131481, 1989.","journal-title":"Computers and Math. (with Appl.)"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"V. Pan, Parallel Least-Squares Solution of General and Toeplitz-like Linear Systems, Proc. 2nd Ann. ACM Symp. on Parallel Algorithms and Architecture 244\u2013253 1990.","DOI":"10.1145\/97444.97691"},{"key":"40_CR22","unstructured":"V. Pan, Parametrization of Newton's Iteration for Computations with Structured Matrices and Applications, report CUNY, CUCS-032-90, New York 1990, to appear in Computers and Math. (with Appl.), 1991."},{"key":"40_CR23","unstructured":"A. Sch\u00f6nhage, The Fundamental Theorem of Algebra in Terms of Computational Complexity, manuscript, Dept. of Math., University of T\u00fcbingen T\u00fcbingen, West Germany 1982."},{"issue":"1","key":"40_CR24","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"IT-32","author":"D.H. Wiedemann","year":"1986","unstructured":"D.H. Wiedemann, Solving Sparse Linear Equations Over Finite Fields, IEEE Trans. on Inf. Theory\nIT-32,1 54\u201362 1986.","journal-title":"IEEE Trans. on Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:40:11Z","timestamp":1558269611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_160","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}