◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Srinivasan

55 papers hereh-index 284.1k citations135 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author8
  • middle author21
  • last author21

Across the 52 of 55 papers where every author was matched, so the position is known.

fields
  • cs.CC30
  • quant-ph13
  • cond-mat.mes-hall5
  • cond-mat.mtrl-sci2
  • cond-mat.supr-con2
  • cs.DM1
same name
  • S. Srinivasan — 57 papers, h 30
  • S. Srinivasan — 19 papers, h 15
  • S. Srinivasan — 14 papers, h 7
  • S. Srinivasan — 13 papers, h 20
  • S. Srinivasan — 13 papers, h 15
  • S. Srinivasan — 8 papers

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20082023
most citedDetecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code

516 citations · 2.7k across the 47 of their papers we have counts for

collaborators
Showing 2017 · cs.CCShow all

4 papers · 2 filters

cs.CC2017

Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications

Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan

In this paper, we study the algebraic formula complexity of multiplying d many 2×2 matrices, denoted IMMd​, and show that the well-known divide-and-conquer a…

cs.CC2017

Local decoding and testing of polynomials over grids

Mitali Bafna, Srikanth Srinivasan, Madhu Sudan

The well-known DeMillo-Lipton-Schwartz-Zippel lemma says that n-variate polynomials of total degree at most d over grids, i.e. sets of the form $A_1 \times A_2 \times \cdots \t…

cs.CC2017

Separation of AC0[⊕] Formulas and Circuits

Benjamin Rossman, Srikanth Srinivasan

This paper gives the first separation between the power of {\em formulas} and {\em circuits} of equal depth in the AC0[⊕] basis (unbounded fan-in AND, OR, NOT and…

cs.CC2017★ 30 cited

On polynomial approximations over Z/2kZ

Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan

We study approximation of Boolean functions by low-degree polynomials over the ring Z/2kZ. More precisely, given a Boolean function $F:\{0,1\}^n \rightarrow \{…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.