{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:19Z","timestamp":1763468059101,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214028","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"549-562","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Fast matrix rank algorithms and applications"],"prefix":"10.1145","author":[{"given":"Ho Yee","family":"Cheung","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Tsz Chiu","family":"Kwok","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133053"},{"key":"e_1_3_2_2_4_1","volume-title":"Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover.Proceedings of the 15th Annual European Symposium on Algorithms (ESA), 175--186","author":"Alon N.","year":"2007","unstructured":"N. Alon , R. Yuster . Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover.Proceedings of the 15th Annual European Symposium on Algorithms (ESA), 175--186 , 2007 . N. Alon, R. Yuster. Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover.Proceedings of the 15th Annual European Symposium on Algorithms (ESA), 175--186, 2007."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250879"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1974-0331751-8"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1965416"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807362"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(01)00472-4"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793256223"},{"key":"e_1_3_2_2_11_1","volume-title":"Algebraic Algorithms for Linear Matroid Parity Problems.Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 1366--1382","author":"Cheung H.Y.","year":"2011","unstructured":"H.Y. Cheung , L.C. Lau , K.M. Leung . Algebraic Algorithms for Linear Matroid Parity Problems.Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 1366--1382 , 2011 . H.Y. Cheung, L.C. Lau, K.M. Leung. Algebraic Algorithms for Linear Matroid Parity Problems.Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 1366--1382, 2011."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.55"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0438"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215066"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_35"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90040-4"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579169"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0054"},{"key":"e_1_3_2_2_20_1","volume-title":"Cambridge University Press","author":"von zur Gathen J.","year":"2003","unstructured":"J. von zur Gathen , J. Gerhard . Modern Computer Algebra . Cambridge University Press , 2 nd edition, 2003 . J. von zur Gathen, J. Gerhard.Modern Computer Algebra. Cambridge University Press, 2nd edition, 2003.","edition":"2"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0505-z"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/070684008"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_2_25_1","volume-title":"Expander Graphs and their Applications. Bulletin (New series) of the American Mathematical Society,43:439--561","author":"Hoory S.","year":"2006","unstructured":"S. Hoory , N. Linial , A. Wigderson . Expander Graphs and their Applications. Bulletin (New series) of the American Mathematical Society,43:439--561 , 2006 . S. Hoory, N. Linial, A. Wigderson. Expander Graphs and their Applications. Bulletin (New series) of the American Mathematical Society,43:439--561, 2006."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1998.0476"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90007-4"},{"key":"e_1_3_2_2_28_1","volume-title":"Gammoids and Transversal Matroids. J. Combin. Theory Ser. B, 15, 51--68","author":"Ingleton A.W.","year":"1973","unstructured":"A.W. Ingleton , M.J. Piff . Gammoids and Transversal Matroids. J. Combin. Theory Ser. B, 15, 51--68 , 1973 . A.W. Ingleton, M.J. Piff. Gammoids and Transversal Matroids. J. Combin. Theory Ser. B, 15, 51--68, 1973."},{"key":"e_1_3_2_2_29_1","volume-title":"Method of Solving Sparse Linear Systems. In Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-9), 29--38","author":"Kaltofen E.","year":"1991","unstructured":"E. Kaltofen , B.D. Saunders . On Wiedemann's Method of Solving Sparse Linear Systems. In Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-9), 29--38 , 1991 . E. Kaltofen, B.D. Saunders. On Wiedemann's Method of Solving Sparse Linear Systems. In Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-9), 29--38, 1991."},{"key":"e_1_3_2_2_30_1","volume-title":"Fundamentals of Computation Theory, FCT 79, 565--574","author":"Lov\u00e1sz L.","year":"1979","unstructured":"L. Lov\u00e1sz . On Determinants , Matchings and Random Algorithms . In L. Budach, editor, Fundamentals of Computation Theory, FCT 79, 565--574 . Akademie-Verlag , Berlin , 1979 . L. Lov\u00e1sz. On Determinants, Matchings and Random Algorithms. In L. Budach, editor, Fundamentals of Computation Theory, FCT 79, 565--574. Akademie-Verlag, Berlin, 1979."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90066-0"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.12"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.40"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.25"},{"key":"e_1_3_2_2_35_1","volume-title":"Faster Dynamic Matchings and Vertex Connectivity.Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 118--126","author":"Sankowski P.","year":"2007","unstructured":"P. Sankowski . Faster Dynamic Matchings and Vertex Connectivity.Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 118--126 , 2007 . P. Sankowski. Faster Dynamic Matchings and Vertex Connectivity.Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 118--126, 2007."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.13001\/1081-3810.1118"},{"key":"e_1_3_2_2_38_1","unstructured":"A. Schrijver.Combinatorial Optimization.Springer 2003.  A. Schrijver.Combinatorial Optimization.Springer 2003."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576748"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"L.N. Trefethen D. Bau III.Numerical Linear Algebra SIAM 1997.  L.N. Trefethen D. Bau III.Numerical Linear Algebra SIAM 1997.","DOI":"10.1137\/1.9780898719574"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-22.2.107"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/645585.659429"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057137"},{"key":"e_1_3_2_2_44_1","volume-title":"Statistical Research Group","author":"Woodbury M.A.","year":"1950","unstructured":"M.A. Woodbury . Inverting Modified Matrices.Memorandum Report 42 , Statistical Research Group , Princeton University , 1950 . M.A. Woodbury. Inverting Modified Matrices.Memorandum Report 42, Statistical Research Group, Princeton University, 1950."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214028","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":44,"alternative-id":["10.1145\/2213977.2214028","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214028","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}