Travelled to:1 × United Kingdom
3 × USA
Collaborated with:N.Limaye R.Santhanam V.Arvind P.Harsha H.Fournier G.Malod N.Kayal C.Saha S.Chien A.Sinclair V.Guruswami J.Håstad G.Varma
Talks about:hard (3) noncommut (2) determin (2) formula (2) super (2) lower (2) depth (2) bound (2) polylogarithm (1) hypergraph (1)
Person: Srikanth Srinivasan
DBLP: Srinivasan:Srikanth
Contributed to:
2014
201220112010Wrote 6 papers:
- STOC-2014-FournierLMS #bound #matrix #multi
- Lower bounds for depth 4 formulas computing iterated matrix multiplication (HF, NL, GM, SS), pp. 128–135.
- STOC-2014-GuruswamiHHSV
- Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (VG, PH, JH, SS, GV), pp. 614–623.
- STOC-2014-KayalLSS #bound
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas (NK, NL, CS, SS), pp. 119–127.
- ICALP-v1-2012-SanthanamS #on the
- On the Limits of Sparsification (RS, SS), pp. 774–785.
- STOC-2011-ChienHSS #commutative
- Almost settling the hardness of noncommutative determinant (SC, PH, AS, SS), pp. 499–508.
- STOC-2010-ArvindS #commutative #on the
- On the hardness of the noncommutative determinant (VA, SS), pp. 677–686.