1. Z. Allen-Zhu, Y. Li, R. Oliveira, A. Wigderson, Much faster algorithms for matrix scaling, arXiv preprint arXiv:1704.02315.
2. Approximating the permanent via importance sampling with application to the dimer covering problem;Beichl;J. Comput. Phys.,1999
3. D. Chakrabarty, S. Khanna, Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling, arXiv preprint arXiv:1801.02790.
4. M.B. Cohen, A. Madry, D. Tsipras, A. Vladu, Matrix scaling and balancing via box constrained Newton’s method and interior point methods, arXiv preprint arXiv:1704.02310.
5. The University of Florida sparse matrix collection;Davis;ACM Trans. Math. Software,2011