Necessary and sufficient conditions for success of the metropolis algorithm for optimization. - Swagato Sanyal; Raja S 001; Somenath Biswas (GECCO, 2010)

The Complexity of Bounded Register and Skew Arithmetic Computation. - Vikraman Arvind; S. Raja 001 (COCOON, 2014)

On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. - Vikraman Arvind; S. Raja 001; A. V. Sreejith (CSR, 2014)

The Complexity of Two Register and Skew Arithmetic Computation. - Vikraman Arvind; S. Raja 001 (Electron. Colloquium Comput. Complex., 2014)

Noncommutative Valiant's Classes: Structure and Complete Problems. - Vikraman Arvind; Pushkar S. Joglekar; Raja S 001 (Electron. Colloquium Comput. Complex., 2015)

Some Lower Bound Results for Set-Multilinear Arithmetic Computations. - Vikraman Arvind; S. Raja 001 (Chic. J. Theor. Comput. Sci., 2016)

Identity Testing for +-Regular Noncommutative Arithmetic Circuits. - Vikraman Arvind; Pushkar S. Joglekar; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2016)

Randomized Polynomial Time Identity Testing for Noncommutative Circuits. - Vikraman Arvind; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2016)

Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. - Vikraman Arvind; Rajit Datta; Partha Mukhopadhyay; S. Raja 001 (MFCS, 2017)

Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. - Vikraman Arvind; Rajit Datta; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2017)

Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. - Vikraman Arvind; Pushkar S. Joglekar; Partha Mukhopadhyay; S. Raja 001 (Theory Comput., 2019)

On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits. - S. Raja 001; G. V. Sumukha Bharadwaj (FCT, 2021)

Randomized Black-Box PIT for Small Depth +-Regular Non-commutative Circuits. - G. V. Sumukha Bharadwaj; Raja S 001 (Electron. Colloquium Comput. Complex., 2024)