default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Raja 0001
Person information
- affiliation: Institute of Technology (IIT) Tirupati, India
- affiliation (former, PhD): Institute of Mathematical Sciences, Chennai, India
Other persons with the same name
- S. Raja — disambiguation page
- Shiva Raja
![[0000-0003-4528-3043]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-4528-3043")
(aka: S. Raja 0002) — CLK Design Automation, Littleton, MA, USA - S. Raja 0003 — Amrita College of Engineering and Technology, Nagarcoil, India
- S. Raja 0005 — CSIR-National Aerospace Laboratories, Bangalore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j3]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. Theory Comput. 15: 1-36 (2019)- 2016
- [j2]Vikraman Arvind, S. Raja:
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j1]Vikraman Arvind, Pushkar S. Joglekar, S. Raja:
Noncommutative Valiant's Classes: Structure and Complete Problems. ACM Trans. Comput. Theory 9(1): 3:1-3:29 (2016)
Conference and Workshop Papers
- 2021
- [c6]S. Raja, G. V. Sumukha Bharadwaj:
On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits. FCT 2021: 427-439 - 2017
- [c5]Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja:
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. MFCS 2017: 38:1-38:13 - [c4]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Randomized polynomial time identity testing for noncommutative circuits. STOC 2017: 831-841 - 2014
- [c3]Vikraman Arvind, S. Raja:
The Complexity of Bounded Register and Skew Arithmetic Computation. COCOON 2014: 572-583 - [c2]Vikraman Arvind, S. Raja, A. V. Sreejith:
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. CSR 2014: 65-76 - 2010
- [c1]Swagato Sanyal, Raja S, Somenath Biswas:
Necessary and sufficient conditions for success of the metropolis algorithm for optimization. GECCO 2010: 1417-1424
Informal and Other Publications
- 2021
- [i12]S. Raja, G. V. Sumukha Bharadwaj:
On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits. CoRR abs/2109.10094 (2021) - 2017
- [i11]Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja:
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. CoRR abs/1705.00140 (2017) - [i10]Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, Raja S:
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i9]Vikraman Arvind, Partha Mukhopadhyay, S. Raja:
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. CoRR abs/1606.00596 (2016) - [i8]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. CoRR abs/1611.07235 (2016) - [i7]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, Raja S:
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - [i6]Vikraman Arvind, Partha Mukhopadhyay, Raja S:
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i5]Vikraman Arvind, Pushkar S. Joglekar, S. Raja:
Noncommutative Valiant's Classes: Structure and Complete Problems. CoRR abs/1508.00395 (2015) - [i4]Vikraman Arvind, S. Raja:
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. CoRR abs/1511.02308 (2015) - [i3]Vikraman Arvind, Pushkar S. Joglekar, Raja S:
Noncommutative Valiant's Classes: Structure and Complete Problems. Electron. Colloquium Comput. Complex. TR15 (2015) - [i2]Vikraman Arvind, Raja S:
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i1]Vikraman Arvind, S. Raja:
The Complexity of Two Register and Skew Arithmetic Computation. Electron. Colloquium Comput. Complex. TR14 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
