COMPUTER SCIENCE & ENGINEERING
Dr. S Raja
|
Assistant Professor
|
Areas of Interest
- Theoretical Computer Science
- Algorithms and Complexity
- Arithmetic Circuit Complexity
|
Education
- Ph.D, Institute of Mathematical Sciences, Chennai.
- MTech, Indian Institute of Technology Kanpur, India
- B.Tech, Amrita Institute of Technology and Science, Coimbatore.
|
Latest Publications
- V. Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja: Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. THEORY OF COMPUTING, Volume 15 (7), 2019, pp. 1–36. (A preliminary version of this appeared in STOC’17)
- V. Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja: Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. In Proceedings of 42nd MFCS 2017.
- V. Arvind, S. Raja: Some Lower Bound Results for Set-Multilinear Arithmetic Computations, Chicago Journal of Theoretical Computer Science 2016 (6).
- V. Arvind, Pushkar S Joglekar, S. Raja: Noncommutative Valiant's Classes: Structure and Complete Problems, in ACM Transactions on Computation Theory (ToCT) 9(1): 3:1-3:29 (2016).
|
