We stand with Ukraine  

S. Raja

Affiliations:
  • Institute of Technology (IIT) Tirupati, India
  • Institute of Mathematical Sciences, Chennai, India (former, PhD)


According to our database1, S. Raja authored at least 12 papers between 2010 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits.
[BibTeX]
[DOI]
S. Raja
,
G. V. Sumukha Bharadwaj
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2019
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits.
[BibTeX]
[DOI]
Vikraman Arvind
,
Pushkar S. Joglekar
,
Partha Mukhopadhyay
,
S. Raja
Theory Comput., 2019

2017
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings.
[BibTeX]
[DOI]
Vikraman Arvind
,
Rajit Datta
,
Partha Mukhopadhyay
,
Raja S
Electron. Colloquium Comput. Complex., 2017

Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings.
[BibTeX]
[DOI]
Vikraman Arvind
,
Rajit Datta
,
Partha Mukhopadhyay
,
S. Raja
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
Randomized Polynomial Time Identity Testing for Noncommutative Circuits.
[BibTeX]
[DOI]
Vikraman Arvind
,
Partha Mukhopadhyay
,
Raja S
Electron. Colloquium Comput. Complex., 2016

Identity Testing for +-Regular Noncommutative Arithmetic Circuits.
[BibTeX]
[DOI]
Vikraman Arvind
,
Pushkar S. Joglekar
,
Partha Mukhopadhyay
,
Raja S
Electron. Colloquium Comput. Complex., 2016

Some Lower Bound Results for Set-Multilinear Arithmetic Computations.
[BibTeX]
[DOI]
Vikraman Arvind
,
S. Raja
Chic. J. Theor. Comput. Sci., 2016

2015
Noncommutative Valiant's Classes: Structure and Complete Problems.
[BibTeX]
[DOI]
Vikraman Arvind
,
Pushkar S. Joglekar
,
Raja S
Electron. Colloquium Comput. Complex., 2015

2014
The Complexity of Two Register and Skew Arithmetic Computation.
[BibTeX]
[DOI]
Vikraman Arvind
,
S. Raja
Electron. Colloquium Comput. Complex., 2014

On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains.
[BibTeX]
[DOI]
Vikraman Arvind
,
S. Raja
,
A. V. Sreejith
Proceedings of the Computer Science - Theory and Applications, 2014

The Complexity of Bounded Register and Skew Arithmetic Computation.
[BibTeX]
[DOI]
Vikraman Arvind
,
S. Raja
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2010
Necessary and sufficient conditions for success of the metropolis algorithm for optimization.
[BibTeX]
[DOI]
Swagato Sanyal
,
Raja S
,
Somenath Biswas
Proceedings of the Genetic and Evolutionary Computation Conference, 2010


  Loading...