Satyanarayana V. Lokam

Publication Activity (10 Years)

Years Active: 1995-2020
Publications (10 Years): 8

Top Topics

Convolutional Codes

Linear Threshold Functions

Tomographic Image Reconstruction

Top Venues

Electron. Colloquium Comput. Complex.

IEEE Trans. Inf. Theory

Publications

Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman
ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. IEEE Trans. Inf. Theory 66 (11) (2020)
Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. CoRR (2019)
Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman
∊-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. ISIT (2018)
Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman
ε-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. CoRR (2018)
Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. LATIN (2018)
Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh
Upper bounds on Fourier entropy. Theor. Comput. Sci. 654 (2016)
Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker
On the Sensitivity Conjecture for Read-k Formulas. Electron. Colloquium Comput. Complex. 23 (2016)
Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker
On the Sensitivity Conjecture for Read-k Formulas. MFCS (2016)
Chia-Jung Lee, Satyanarayana V. Lokam, Shi-Chun Tsai, Ming-Chuan Yang
Restrictions of nondegenerate Boolean functions and degree lower bounds over different rings. ISIT (2015)
V. Lalitha, Satyanarayana V. Lokam
Weight Enumerators and Higher Support Weights of Maximally Recoverable Codes. CoRR (2015)
Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh
Upper Bounds on Fourier Entropy. COCOON (2015)
V. Lalitha, Satyanarayana V. Lokam
Weight enumerators and higher support weights of maximally recoverable codes. Allerton (2015)
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
Using Elimination Theory to Construct Rigid Matrices. Comput. Complex. 23 (4) (2014)
Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh
Upper Bounds on Fourier Entropy. Electron. Colloquium Comput. Complex. 20 (2013)
Chaya Ganesh, Vipul Goyal, Satyanarayana V. Lokam
On-Line/Off-Line Leakage Resilient Secure Computation Protocols. INDOCRYPT (2012)
Vipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody
On Black-Box Reductions between Predicate Encryption Schemes. TCC (2012)
Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam
Reconstruction of depth-4 multilinear circuits with top fan-in 2. STOC (2012)
Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam
Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. Electron. Colloquium Comput. Complex. 18 (2011)
Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam
Efficient Reconstruction of Random Multilinear Formulas. FOCS (2011)
Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan
Forcing Out a Confession - Threshold Discernible Ring Signatures. SECRYPT (2010)
Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan
Threshold Discernible Ring Signatures. ICETE (Selected Papers) (2010)
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
Using Elimination Theory to construct Rigid Matrices. Electron. Colloquium Comput. Complex. 16 (2009)
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
Using Elimination Theory to construct Rigid Matrices. FSTTCS (2009)
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
Using Elimination Theory to construct Rigid Matrices CoRR (2009)
Satyanarayana V. Lokam
Complexity Lower Bounds using Linear Algebra. Found. Trends Theor. Comput. Sci. 4 (1-2) (2009)
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam
Improved Bounds on Security Reductions for Discrete Log Based Signatures. CRYPTO (2008)
Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi
On The Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2008 (2008)
Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi
Vulnerabilities in Anonymous Credential Systems. Electron. Notes Theor. Comput. Sci. 197 (2) (2008)
Dungjade Shiowattana, Satyanarayana V. Lokam
An optimal lower bound for 2-query locally decodable linear codes. Inf. Process. Lett. 97 (6) (2006)
Satyanarayana V. Lokam
Quadratic Lower Bounds on Matrix Rigidity. TAMC (2006)
Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan
Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27 (3) (2005)
László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam
Communication Complexity of Simultaneous Messages. SIAM J. Comput. 33 (1) (2003)
Elizabeth Broering, Satyanarayana V. Lokam
Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). SAT (2003)
Satyanarayana V. Lokam
Graph Complexity and Slice Functions. Theory Comput. Syst. 36 (1) (2003)
Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
Better Lower Bounds for Locally Decodable Codes. Computational Complexity Conference (2002)
Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. FSTTCS (2001)
Satyanarayana V. Lokam
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity. J. Comput. Syst. Sci. 63 (3) (2001)
Andris Ambainis, Satyanarayana V. Lokam
Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function. LATIN (2000)
Satyanarayana V. Lokam
On the rigidity of Vandermonde matrices. Theor. Comput. Sci. 237 (1-2) (2000)
Satyanarayana V. Lokam
Remarks on Graph Complexity. FSTTCS (1998)
László Babai, Peter G. Kimmel, Satyanarayana V. Lokam
Simultaneous Messages vs. Communication. STACS (1995)
Satyanarayana V. Lokam, Meena Mahajan, V. Vinay
Logspace Verifiers, NC, and NP. ISAAC (1995)
Satyanarayana V. Lokam
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity. FOCS (1995)