1. A Course in Convexity;Barvinok,2002
2. The combinatorics of permutation polytopes;Billera;DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,1996
3. Tres observaciones sobre el algebra lineal;Birkhoff;Univ. Nacional Tucuman, Rev. Ser. A,1946
4. The asymptotic volume of the Birkhoff polytope;Canfield;Online J. Anal. Comb.,2009
5. P. Gopalan, G. Hu, S. Kopparty, S. Saraf, C. Wang, S. Yekhanin, Maximally Recoverable Codes for Grid-like Topologies, in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, in: SODA ’17, 2017.