Satyanarayana V. Lokam - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2020

ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact RepairVenkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman. TIT, 66(11):6749-6761, 2020. [doi]

2018

Fourier Entropy-Influence Conjecture for Random Linear Threshold FunctionsSourav Chakraborty 0001, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh. latin 2018: 275-289 [doi]

∊-MSR Codes: Contacting Fewer Code Blocks for Exact RepairVenkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman. isit 2018: 2371-2375 [doi]

2016

2015

Upper Bounds on Fourier EntropySourav Chakraborty 0001, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh. cocoon 2015: 771-782 [doi]

Weight enumerators and higher support weights of maximally recoverable codesV. Lalitha, Satyanarayana V. Lokam. allerton 2015: 835-842 [doi]

Restrictions of nondegenerate Boolean functions and degree lower bounds over different ringsChia-Jung Lee, Satyanarayana V. Lokam, Shi-Chun Tsai, Ming-Chuan Yang. isit 2015: 501-505 [doi]

2014

Using Elimination Theory to Construct Rigid MatricesAbhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma. cc, 23(4):531-563, 2014. [doi]

2013

Upper Bounds on Fourier EntropySourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh. eccc, 20:52, 2013. [doi]

2012

Reconstruction of depth-4 multilinear circuits with top fan-in 2Ankit Gupta 0001, Neeraj Kayal, Satyanarayana V. Lokam. stoc 2012: 625-642 [doi]

On-Line/Off-Line Leakage Resilient Secure Computation ProtocolsChaya Ganesh, Vipul Goyal, Satyanarayana V. Lokam. indocrypt 2012: 100-119 [doi]

On Black-Box Reductions between Predicate Encryption SchemesVipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody. tcc 2012: 440-457 [doi]

2011

Efficient Reconstruction of Random Multilinear FormulasAnkit Gupta 0001, Neeraj Kayal, Satyanarayana V. Lokam. focs 2011: 778-787 [doi]

Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2Ankit Gupta 0001, Neeraj Kayal, Satyanarayana V. Lokam. eccc, 18:153, 2011. [doi]

2010

Forcing Out a Confession - Threshold Discernible Ring SignaturesSwarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan. secrypt 2010: 379-388

Threshold Discernible Ring SignaturesSwarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan. icete 2012: 259-273 [doi]

2009

Using Elimination Theory to construct Rigid MatricesKumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma. fsttcs 2009: 299-310 [doi]

Using Elimination Theory to construct Rigid MatricesKumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma. eccc, 16:106, 2009. [doi]

Complexity Lower Bounds using Linear AlgebraSatyanarayana V. Lokam. fttcs, 4(1-2):1-155, 2009. [doi]

2008

2006

Quadratic Lower Bounds on Matrix RigiditySatyanarayana V. Lokam. tamc 2006: 295-307 [doi]

An optimal lower bound for 2-query locally decodable linear codesDungjade Shiowattana, Satyanarayana V. Lokam. ipl, 97(6):244-250, 2006. [doi]

2005

Lower bounds for adaptive locally decodable codesAmit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan. rsa, 27(3):358-378, 2005. [doi]

2003

Communication Complexity of Simultaneous MessagesLászló Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam. SICOMP, 33(1):137-166, 2003. [doi]

Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract)Elizabeth Broering, Satyanarayana V. Lokam. sat 2004: 162-171 [doi]

Graph Complexity and Slice FunctionsSatyanarayana V. Lokam. mst, 36(1):71-88, 2003. [doi]

2002

Better Lower Bounds for Locally Decodable CodesAmit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam. cocoon 2002: 184-193 [doi]

2001

Relations Between Communication Complexity, Linear Arrangements, and Computational ComplexityJürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon. fsttcs 2001: 171-182 [doi]

Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication ComplexitySatyanarayana V. Lokam. jcss, 63(3):449-473, 2001. [doi]

2000

Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing FunctionAndris Ambainis, Satyanarayana V. Lokam. latin 2000: 207-216

On the rigidity of Vandermonde matricesSatyanarayana V. Lokam. TCS, 237(1-2):477-483, 2000. [doi]

1998

Remarks on Graph ComplexitySatyanarayana V. Lokam. fsttcs 1998: 307-318

1995

Simultaneous Messages vs. CommunicationLászló Babai, Peter G. Kimmel, Satyanarayana V. Lokam. STACS 1995: 361-372

Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication ComplexitySatyanarayana V. Lokam. focs 1995: 6-15

Logspace Verifiers, NC, and NPSatyanarayana V. Lokam, Meena Mahajan, V. Vinay. isaac 1995: 52-61

Sign in or sign up to see more results.

runs on WebDSL