Fast Matrix Rank Algorithms and Applications, Journal of the ACM, vol.60, issue.5, pp.31-32, 2013. ,
DOI : 10.1145/2528404
URL : http://arxiv.org/abs/1203.6705
Geppetto: Versatile Verifiable Computation, 2015 IEEE Symposium on Security and Privacy, pp.253-270, 2015. ,
DOI : 10.1109/SP.2015.23
Condensation of Determinants, Being a New and Brief Method for Computing their Arithmetical Values, Proceedings of the Royal Society of London, vol.15, issue.0, pp.150-155, 1866. ,
DOI : 10.1098/rspl.1866.0037
Essentially optimal interactive certificates in linear algebra, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.146-153, 2014. ,
DOI : 10.1145/2608628.2608644
URL : https://hal.archives-ouvertes.fr/hal-00932846
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '16, pp.199-206, 2016. ,
DOI : 10.1145/2930889.2930908
URL : https://hal.archives-ouvertes.fr/hal-01266041
Simultaneous computation of the row and column rank profiles, Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pp.181-188, 2013. ,
DOI : 10.1145/2465506.2465517
URL : https://hal.archives-ouvertes.fr/hal-00778136
Computing the Rank Profile Matrix, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '15, pp.149-156 ,
DOI : 10.1145/2755996.2756682
URL : https://hal.archives-ouvertes.fr/hal-01107722
Fast computation of the rank profile matrix and the generalized Bruhat decomposition, Journal of Symbolic Computation, 2016. ,
DOI : 10.1016/j.jsc.2016.11.011
URL : https://hal.archives-ouvertes.fr/hal-01251223
A new interactive certificate for matrix rank, 2015. ,
How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology -CRYPTO'86, pp.186-194, 1986. ,
DOI : 10.1007/3-540-47721-7_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.8796
Fast probabilistic algorithms, Mathematical Foundations of Computer Science LNCS, vol.74, pp.57-69, 1979. ,
DOI : 10.1007/3-540-09526-8_5
Delegating computation: interactive proofs for muggles, pp.113-122, 2008. ,
DOI : 10.1145/2699436
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition, Journal of Symbolic Computation, vol.56, pp.46-68, 2013. ,
DOI : 10.1016/j.jsc.2013.04.004
URL : https://hal.archives-ouvertes.fr/hal-00655543
Quadratic-time certificates in linear algebra, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.171-176, 2011. ,
DOI : 10.1145/1993886.1993915
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.7699
Faster algorithms for the characteristic polynomial, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.307-314, 2007. ,
DOI : 10.1145/1277548.1277590
A Relaxed Algorithm for Online Matrix Inversion, Yokoyama [17], pp.339-346 ,
DOI : 10.1145/2733693.2733713