1. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995). https://doi.org/10.1145/210332.210337
2. Arvind, V., Chatterjee, A., Datta, R., Mukhopadhyay, P.: Fast exact algorithms using Hadamard product of polynomials. CoRR arXiv:1807.04496 (2018)
3. Arvind, V., Chatterjee, A., Datta, R., Mukhopadhyay, P.: Efficient black-box identity testing over free group algebra (accepted in RANDOM 2019). CoRR arXiv:1904.12337 (2019)
4. Arvind, V., Joglekar, P.S., Srinivasan, S.: Arithmetic circuits and the Hadamard product of polynomials. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15–17, 2009, IIT Kanpur, India, pp. 25–36 (2009)
5. Arvind, V., Srinivasan, S.: On the hardness of the noncommutative determinant. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5–8 June 2010, pp. 677–686 (2010). https://doi.org/10.1145/1806689.1806782