{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:40:51Z","timestamp":1649072451187},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T00:00:00Z","timestamp":1390348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00224-014-9531-2","type":"journal-article","created":{"date-parts":[[2014,1,21]],"date-time":"2014-01-21T01:16:55Z","timestamp":1390267015000},"page":"229-249","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Matrix Rank with Partial Lookahead"],"prefix":"10.1007","volume":"55","author":[{"given":"Telikepalli","family":"Kavitha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,22]]},"reference":[{"key":"9531_CR1","unstructured":"Berdan, M.: A matrix rank problem. Master\u2019s thesis, University of Waterloo (2003)"},{"key":"9531_CR2","doi-asserted-by":"crossref","first-page":"4085","DOI":"10.1016\/j.tcs.2009.06.012","volume":"410","author":"G.S. Frandsen","year":"2009","unstructured":"Frandsen, G.S., Frandsen, P.F.: Dynamic matrix rank. Theor. Comput. Sci. 410, 4085\u20134093 (2009). Preliminary version in Proc. of the 33rd ICALP, 395\u2013406, 2006","journal-title":"Theor. Comput. Sci."},{"key":"9531_CR3","series-title":"LNCS","first-page":"434","volume-title":"Proc. of the 35th ICALP","author":"G.S. Frandsen","year":"2008","unstructured":"Frandsen, G.S., Sankowski, P.: Dynamic normal forms and dynamic characteristic polynomial. In: Proc. of the 35th ICALP. LNCS, vol. 5125, pp. 434\u2013446 (2008)"},{"issue":"1\u20133","key":"9531_CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0024-3795(98)10210-0","volume":"288","author":"J.F. Geelen","year":"1999","unstructured":"Geelen, J.F.: Maximum rank matrix completion. Linear Algebra Appl. 288(1\u20133), 211\u2013217 (1999)","journal-title":"Linear Algebra Appl."},{"key":"9531_CR5","first-page":"489","volume-title":"Proc. of the 16th Annual ACM-SIAM SODA","author":"N.J.A. Harvey","year":"2005","unstructured":"Harvey, N.J.A., Karger, D.R., Murota, K.: Deterministic network coding by matrix completion. In: Proc. of the 16th Annual ACM-SIAM SODA, pp. 489\u2013498 (2005)"},{"key":"9531_CR6","first-page":"222","volume-title":"Proc. of the 7th Annual ACM-SIAM SODA","author":"S. Khanna","year":"1996","unstructured":"Khanna, S., Motwani, R., Wilson, R.H.: On certificates and lookahead on dynamic graph problems. In: Proc. of the 7th Annual ACM-SIAM SODA, pp. 222\u2013231 (1996)"},{"key":"9531_CR7","first-page":"248","volume-title":"Proc. of the 45th Annual IEEE FOCS","author":"M. Mucha","year":"2004","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via Gaussian elimination. In: Proc. of the 45th Annual IEEE FOCS, pp. 248\u2013255 (2004)"},{"key":"9531_CR8","first-page":"509","volume-title":"Proc. of the 45th Annual IEEE FOCS","author":"P. Sankowski","year":"2004","unstructured":"Sankowski, P.: Dynamic transitive closure via dynamic matrix inverse. In: Proc. of the 45th Annual IEEE FOCS, pp. 509\u2013517 (2004)"},{"key":"9531_CR9","first-page":"118","volume-title":"Proc. of the 18th Annual ACM-SIAM SODA","author":"P. Sankowski","year":"2007","unstructured":"Sankowski, P.: Faster dynamic matchings and vertex connectivity. In: Proc. of the 18th Annual ACM-SIAM SODA, pp. 118\u2013126 (2007)"},{"issue":"2","key":"9531_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/s00453-008-9166-2","volume":"56","author":"P. Sankowski","year":"2010","unstructured":"Sankowski, P., Mucha, M.: Fast dynamic transitive closure with lookahead. Algorithmica 56(2), 180\u2013197 (2010)","journal-title":"Algorithmica"},{"key":"9531_CR11","unstructured":"Stothers, A.: On the complexity of matrix multiplication. Ph.D. thesis, University of Edinburgh (2010)"},{"key":"9531_CR12","first-page":"887","volume-title":"Proc. of the 44th Annual ACM STOC","author":"V. Vassilevska Williams","year":"2012","unstructured":"Vassilevska Williams, V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proc. of the 44th Annual ACM STOC, pp. 887\u2013898 (2012)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9531-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9531-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9531-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:26Z","timestamp":1558684466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9531-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,22]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9531"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9531-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,22]]}}}