{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:02Z","timestamp":1742591402659,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167662"},{"type":"electronic","value":"9783540387466"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16766-8_26","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:54:19Z","timestamp":1330196059000},"page":"283-295","source":"Crossref","is-referenced-by-count":1,"title":["Fast and efficient parallel linear programming and linear least squares computations"],"prefix":"10.1007","author":[{"given":"Victor","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Reif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"\u00c5. Bj\u00f6rck 1976, Methods for Sparse Linear Least Squares Problems, 177\u2013200, in Sparse Matrix Computations (J.R. Bunch and D.J. Rose edits.), Academic Press, N.Y.","DOI":"10.1016\/B978-0-12-141050-6.50015-5"},{"key":"26_CR2","volume-title":"Linear Programming","author":"V. Chvatal","year":"1983","unstructured":"V. Chvatal 1983, Linear Programming, W.H. Freeman, San Francisco."},{"key":"26_CR3","unstructured":"P.A. Gartenberg 1985, Fast Rectangular Matrix Multiplication, Ph.D. Thesis, Dept. of Math., University of California, Los Angeles."},{"issue":"2","key":"26_CR4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"J.A. George","year":"1973","unstructured":"J.A. George 1973, Nested Dissection of a Regular Finite Element Mesh, SIAM J. on Numerical Analysis, 10,2, 345\u2013367.","journal-title":"SIAM J. on Numerical Analysis"},{"key":"26_CR5","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1983","unstructured":"G.H. Golub and C.F. van Loan 1983, Matrix Computations, the Johns Hopkins Univ. Press, Baltimore, Maryland."},{"key":"26_CR6","volume-title":"Graphs and Algorithms","author":"M. Gondran","year":"1984","unstructured":"M. Gondran and M. Minoux 1984, Graphs and Algorithms, Wiley-Interscience, New York."},{"issue":"4","key":"26_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"N.K. Karmarkar 1984, A New Polynomial Time Algorithm for Linear Programming, Combinatorica 4,4, 373\u2013395.","journal-title":"Combinatorica"},{"issue":"2","key":"26_CR8","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. Lipton","year":"1979","unstructured":"R. Lipton, D. Rose and R.E. Tarjan 1979, Generalized Nested Dissection, SIAM J. on Numerical Analysis 16,2, 346\u2013358.","journal-title":"SIAM J. on Numerical Analysis"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"R.J. Lipton and R.E. Tarjan 1979, A Separator Theorem for Planar Graphs, SIAM J. on Applied Math. 36, 177\u2013189.","journal-title":"SIAM J. on Applied Math."},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90054-3","volume":"23","author":"G. Lotti","year":"1983","unstructured":"G. Lotti and F. Romani 1983, On the Asymptotic Complexity of Rectangular Matrix Multiplication, Theoretical Computer Science 23, 171\u2013185.","journal-title":"Theoretical Computer Science"},{"key":"26_CR11","volume-title":"Linear and Combinatorial Programming","author":"K.G. Murty","year":"1976","unstructured":"K.G. Murty 1976, Linear and Combinatorial Programming, Wiley, New York."},{"key":"26_CR12","volume-title":"Linear Programming","author":"K.G. Murty","year":"1983","unstructured":"K.G. Murty 1983, Linear Programming, Wiley, New York."},{"key":"26_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-13866-8","volume-title":"How to Multiply Matrices Faster","author":"V. Pan","year":"1984","unstructured":"V. Pan 1984, How to Multiply Matrices Faster, Lecture Notes in Computer Science 179, Springer-Verlag, Berlin."},{"issue":"4","key":"26_CR14","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0898-1221(85)90060-4","volume":"11","author":"V. Pan","year":"1985","unstructured":"V. Pan 1985, Fast Finite Methods for a System of Linear Inequalities, Computers and Mathematics (with Applics.) 11,4, 355\u2013394.","journal-title":"Computers and Mathematics (with Applics.)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"V. Pan 1985, Fast and Efficient Algorithms for the Exact Inversion of Integer Matrices, Proc. Fifth Conference on Foundations of Software Engin. and Theor. Computer Science, Indian Inst. of Techn. and Tata Inst. of Fundam. Research, New Delhi, India (Dec. 1985).","DOI":"10.1007\/3-540-16042-6_29"},{"issue":"11","key":"26_CR16","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1016\/0898-1221(85)90190-7","volume":"11","author":"V. Pan","year":"1985","unstructured":"V. Pan 1985, On the Complexity of a Pivot Step of Revised Simplex Algorithm, Computers and Mathematics (with Applics.) 11, 11, 1127\u20131140.","journal-title":"Computers and Mathematics (with Applics.)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"V. Pan and J. Reif 1984, Efficient Parallel Solution of Linear Systems, Proc. 17-th Ann. ACM STOC, 143\u2013152, Providence, R.I.","DOI":"10.1145\/22145.22161"},{"key":"26_CR18","unstructured":"V. Pan and J. Reif 1985, Extension of the Parallel Nested Dissection Algorithm to the Path Algebra Problems, Tech. Report 85-9, Computer Science Dept. SUNY Albany (June 1985)."},{"key":"26_CR19","volume-title":"Sparse Matrix Technology","author":"S. Pissanetsky","year":"1984","unstructured":"S. Pissanetsky 1984, Sparse Matrix Technology, Academic Press, New York."},{"issue":"6","key":"26_CR20","first-page":"87","volume":"13","author":"N.Z. Shor","year":"1977","unstructured":"N.Z. Shor 1977, New Development Trend in Nondifferentiable Optimization, Kibernetika 13,6, 87\u201391, (transl. in Cybernetics 13,6, 881\u2013886 (1977)).","journal-title":"Kibernetika"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16766-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:30:18Z","timestamp":1742589018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16766-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167662","9783540387466"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-16766-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}