Subramanian, C. R. Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Schnorr, C. P., & Subramanian, C. R. (1998). Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter. In M. Luby, J. Rolim, & M. Serna (Eds.), Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98) (pp. 218-231). Berlin, Germany: Springer.
