论文信息 - Dynamic Matrix Rank with Partial Lookahead - 字舞流文

Dynamic Matrix Rank with Partial Lookahead

[1] Virginia Vassilevska Williams,et al. Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[2] Joseph M. Landsberg,et al. The complexity of matrix multiplication , 2011 .

[3] Piotr Sankowski,et al. Fast Dynamic Transitive Closure with Lookahead , 2010, Algorithmica.

[4] Piotr Sankowski,et al. Dynamic normal forms and dynamic characteristic polynomial , 2008, Theor. Comput. Sci..

[5] Piotr Sankowski,et al. Faster dynamic matchings and vertex connectivity , 2007, SODA '07.

[6] Gudmund Skovbjerg Frandsen,et al. Dynamic matrix rank , 2006, Theor. Comput. Sci..

[7] David R. Karger,et al. Deterministic network coding by matrix completion , 2005, SODA '05.

[8] Piotr Sankowski,et al. Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[9] Piotr Sankowski,et al. Dynamic transitive closure via dynamic matrix inverse: extended abstract , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[10] J. Geelen. Maximum rank matrix completion , 1999 .

[11] Rajeev Motwani,et al. On Certificates and Lookahead in Dynamic Graph Problems , 1996, SODA '96.

[12] Piotr Sankowski,et al. Dynamic Transitive Closure via Dynamic Matrix Inverse , 2004 .

[13] Mark Berdan,et al. A Matrix Rank Problem , 2003 .