{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:58:36Z","timestamp":1760061516629},"reference-count":24,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0167-8191(02)00161-8","type":"journal-article","created":{"date-parts":[[2003,1,9]],"date-time":"2003-01-09T09:01:52Z","timestamp":1042102912000},"page":"1531-1548","source":"Crossref","is-referenced-by-count":7,"title":["On parallel block algorithms for exact triangularizations"],"prefix":"10.1016","volume":"28","author":[{"given":"Jean-Guillaume","family":"Dumas","sequence":"first","affiliation":[]},{"given":"Jean-Louis","family":"Roch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00161-8_BIB1","series-title":"Recent Trends in Multidimensional Systems Theory, Mathematics and its Applications","first-page":"184","article-title":"Gr\u00f6bner bases: an algorithmic method in polynomial ideal theory","author":"Buchberger","year":"1985"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB2","series-title":"First International Symposium on Parallel Symbolic Computation, PASCO \u201994, Hagenberg\/Linz, Austria","first-page":"124","article-title":"Parallelization of Gr\u00f6bner basis","volume":"vol. 5","author":"Faug\u00e8re","year":"1994"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB3","article-title":"Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices","volume":"vol. 292","author":"Wallis","year":"1972"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB4","unstructured":"J.-G. Dumas, Algorithmes parall\u00e8les efficaces pour le calcul formel: alg\u00e8bre lin\u00e9aire creuse et extensions alg\u00e9briques, Ph.D. thesis, Institut National Polytechnique de Grenoble, France, December 2000. Available from <ftp:\/\/ftp.imag.fr\/pub\/-Mediatheque.IMAG\/theses\/2000\/Dumas.Jean-Guillaume>"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB5","series-title":"Introduction to parallel computing. Design and analysis of algorithms","author":"Kumar","year":"1994"},{"issue":"1","key":"10.1016\/S0167-8191(02)00161-8_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77626.79170","article-title":"A set of level 3 basic linear algebra subprograms","volume":"16","author":"Dongarra","year":"1990","journal-title":"Transactions on Mathematical Software"},{"issue":"4\u20135","key":"10.1016\/S0167-8191(02)00161-8_BIB7","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0020-0190(80)90042-3","article-title":"A note on the parallel complexity of computing the rank of order n matrices","volume":"11","author":"Ibarra","year":"1980","journal-title":"Information Processing Letters"},{"issue":"1","key":"10.1016\/S0167-8191(02)00161-8_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(82)90007-4","article-title":"A generalization of the fast LUP matrix decomposition algorithm and applications","volume":"3","author":"Ibarra","year":"1982","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB9","unstructured":"A. Storjohann, Algorithms for matrix canonical forms, Ph.D. thesis, Department of Computer Science, Swiss Federal Institute of Technology ETH Zurich, December 2000"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB10","article-title":"Polynomial and Matrix Computations","volume":"vol. 1","author":"Bini","year":"1994"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB11","doi-asserted-by":"crossref","unstructured":"J.-G. Dumas, J.-L. Roch, A fast parallel block algorithm for exact tri-angularization of rectangular matrices, in: SPAA\u201901, Proceedings of the Thirteenth ACM Symposium on Parallel Algorithms and Architectures, Kreta, Greece, 2001, pp. 324\u2013325","DOI":"10.1145\/378580.378743"},{"issue":"4","key":"10.1016\/S0167-8191(02)00161-8_BIB12","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/S0895480198338724","article-title":"Complexes of directed graphs","volume":"12","author":"Bj\u00f6rner","year":"1999","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"10.1016\/S0167-8191(02)00161-8_BIB13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1008728115910","article-title":"Minimal resolutions and the homology of matching and chessboard complexes","volume":"11","author":"Reiner","year":"2000","journal-title":"Journal of Algebraic Combinatorics"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB14","series-title":"Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, Lille, France","article-title":"Finite fields linear algebra subroutines","author":"Dumas","year":"2002"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB15","unstructured":"J.-C. Faug\u00e8re, A new efficient algorithm for computing Gr\u00f6bner bases (F4), Tech. Rep., Laboratoire d\u2019lnformatique de Paris 6, January 1999. Available from <http:\/\/www-calfor.lip6.fr\/\u223cjcf>"},{"issue":"1","key":"10.1016\/S0167-8191(02)00161-8_BIB16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1112\/jlms\/49.1.25","article-title":"Chessboard complexes and matching complexes","volume":"49","author":"Bj\u00f6rner","year":"1994","journal-title":"Journal of the London Mathematical Society"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB17","series-title":"Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, Saint Andrews, Scotland","first-page":"95","article-title":"Integer Smith form via the Valence: Experience with large sparse matrices from Homology","author":"Dumas","year":"2000"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB18","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numerische Mathematik"},{"issue":"3","key":"10.1016\/S0167-8191(02)00161-8_BIB19","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB20","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"1","key":"10.1016\/S0167-8191(02)00161-8_BIB21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579205","article-title":"A fast parallel algorithm to compute the rank of a matrix","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB22","series-title":"Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/S0167-8191(02)00161-8_BIB23","unstructured":"G.G.H. Cavalheiro, M. Doreille, F. Galil\u00e9e, J.-L. Roch, Athapascan-1: on-line building data flow graph in a parallel language, in: PACT\u201998, Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, Paris, France, 1998"},{"issue":"2","key":"10.1016\/S0167-8191(02)00161-8_BIB24","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on certain multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM Journal of Applied Mathematics"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102001618?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102001618?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T15:08:40Z","timestamp":1583852920000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819102001618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":24,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0167819102001618"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00161-8","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}