{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:02Z","timestamp":1725472022731},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_35","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"395-406","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Matrix Rank"],"prefix":"10.1007","author":[{"given":"Gudmund Skovbjerg","family":"Frandsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Frands","family":"Frandsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"M.B.: A matrix rank problem. Master\u2019s thesis, University of Waterloo (December 2003)","key":"35_CR1"},{"key":"35_CR2","volume-title":"Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory. In: Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol.\u00a0315, Springer, Berlin (1997): With the collaboration of Thomas Lickteig"},{"issue":"3","key":"35_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbolic Comput.\u00a09(3), 251\u2013280 (1990)","journal-title":"J. Symbolic Comput."},{"issue":"2","key":"35_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1006\/inco.2001.3046","volume":"171","author":"G.S. Frandsen","year":"2001","unstructured":"Frandsen, G.S., Hansen, J.P., Miltersen, P.B.: Lower bounds for dynamic algebraic problems. Inform. and Comput.\u00a0171(2), 333\u2013349 (2001)","journal-title":"Inform. and Comput."},{"issue":"1-3","key":"35_CR5","doi-asserted-by":"publisher","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.\u00a0288(1-3), 211\u2013217 (1999)","journal-title":"Linear Algebra Appl."},{"unstructured":"Harvey, N.J.A., Karger, D.R., Murota, K.: Deterministic network coding by matrix completion. In: SODA 2005: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 489\u2013498 (2005)","key":"35_CR6"},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/jcom.1998.0476","volume":"14","author":"X. Huang","year":"1998","unstructured":"Huang, X., Pan, V.Y.: Fast rectangular matrix multiplication and applications. J. Complexity\u00a014(2), 257\u2013299 (1998)","journal-title":"J. Complexity"},{"issue":"2-3","key":"35_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0304-3975(85)90049-0","volume":"36","author":"W. Keller-Gehrig","year":"1985","unstructured":"Keller-Gehrig, W.: Fast algorithms for the characteristic polynomial. Theoret. Comput. Sci.\u00a036(2-3), 309\u2013317 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR9","first-page":"509","volume-title":"FOCS 2004: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004)","author":"P. Sankowski","year":"2004","unstructured":"Sankowski, P.: Dynamic transitive closure via dynamic matrix inverse (extended abstract). In: FOCS 2004: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), Washington, DC, USA, pp. 509\u2013517. IEEE Computer Society Press, Los Alamitos (2004)"},{"unstructured":"Sankowski, P.: Faster dynamic matchings and vertex connectivity (extended abstract) (April 2006)","key":"35_CR10"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BF01402563","volume":"20","author":"A. Sch\u00f6nhage","year":"1972","unstructured":"Sch\u00f6nhage, A.: Unit\u00e4re Transformationen grosser Matrizen. Numer. Math.\u00a020, 409\u2013417 (1972)","journal-title":"Numer. Math."}],"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\/11786986_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:32:12Z","timestamp":1558294332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11786986_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}