Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarSatyanarayana V. Lokam
Satya V. Lokam
Person information
- affiliation: Microsoft Research India, Bangalore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[c22]Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh:
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. LATIN 2018: 275-289- [e1]Satya V. Lokam, R. Ramanujam:
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India. LIPIcs 93, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2018, ISBN 978-3-95977-055-2 [contents] - 2017
- [c21]Kartik Nayak, Christopher W. Fletcher, Ling Ren, Nishanth Chandran, Satya V. Lokam, Elaine Shi, Vipul Goyal:
HOP: Hardware makes Obfuscation Practical. NDSS 2017 - 2016
- [j10]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper bounds on Fourier entropy. Theor. Comput. Sci. 654: 92-112 (2016) - [c20]Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker:
On the Sensitivity Conjecture for Read-k Formulas. MFCS 2016: 16:1-16:14 - [i8]Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker:
On the Sensitivity Conjecture for Read-k Formulas. Electronic Colloquium on Computational Complexity (ECCC) 23: 132 (2016) - 2015
- [c19]V. Lalitha, Satyanarayana V. Lokam:
Weight enumerators and higher support weights of maximally recoverable codes. Allerton 2015: 835-842 - [c18]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper Bounds on Fourier Entropy. COCOON 2015: 771-782 - [c17]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: 501-505 - [i7]Chia-Jung Lee, Satya V. Lokam, Shi-Chun Tsai, Ming-Chuan Yang:
On Restricting No-Junta Boolean Function and Degree Lower Bounds by Polynomial Method. CoRR abs/1502.00357 (2015) - [i6]V. Lalitha, Satyanarayana V. Lokam:
Weight Enumerators and Higher Support Weights of Maximally Recoverable Codes. CoRR abs/1507.01095 (2015) - 2014
- [j9]Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to Construct Rigid Matrices. Computational Complexity 23(4): 531-563 (2014) - 2013
- [i5]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper Bounds on Fourier Entropy. Electronic Colloquium on Computational Complexity (ECCC) 20: 52 (2013) - 2012
- [c16]Chaya Ganesh, Vipul Goyal, Satyanarayana V. Lokam:
On-Line/Off-Line Leakage Resilient Secure Computation Protocols. INDOCRYPT 2012: 100-119 - [c15]Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam:
Reconstruction of depth-4 multilinear circuits with top fan-in 2. STOC 2012: 625-642 - [c14]Vipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody:
On Black-Box Reductions between Predicate Encryption Schemes. TCC 2012: 440-457 - 2011
- [c13]Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam:
Efficient Reconstruction of Random Multilinear Formulas. FOCS 2011: 778-787 - [i4]Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam:
Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. Electronic Colloquium on Computational Complexity (ECCC) 18: 153 (2011) - 2010
- [c12]Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan:
Forcing Out a Confession - Threshold Discernible Ring Signatures. SECRYPT 2010: 379-388
2000 – 2009
- 2009
- [j8]Satyanarayana V. Lokam:
Complexity Lower Bounds using Linear Algebra. Foundations and Trends in Theoretical Computer Science 4(1-2): 1-155 (2009) - [c11]Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to construct Rigid Matrices. FSTTCS 2009: 299-310 - [i3]Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to construct Rigid Matrices. CoRR abs/0910.5301 (2009) - [i2]Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to construct Rigid Matrices. Electronic Colloquium on Computational Complexity (ECCC) 16: 106 (2009) - 2008
- [j7]Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, P. L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi:
Vulnerabilities in Anonymous Credential Systems. Electr. Notes Theor. Comput. Sci. 197(2): 141-148 (2008) - [c10]Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam:
Improved Bounds on Security Reductions for Discrete Log Based Signatures. CRYPTO 2008: 93-107 - [i1]Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, P. L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi:
On The Diffie-Hellman Assumption. IACR Cryptology ePrint Archive 2008: 525 (2008) - 2006
- [j6]Dungjade Shiowattana, Satyanarayana V. Lokam:
An optimal lower bound for 2-query locally decodable linear codes. Inf. Process. Lett. 97(6): 244-250 (2006) - [c9]
- 2005
- [j5]Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan:
Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27(3): 358-378 (2005) - 2003
- [j4]Satyanarayana V. Lokam:
Graph Complexity and Slice Functions. Theory Comput. Syst. 36(1): 71-88 (2003) - [j3]László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam:
Communication Complexity of Simultaneous Messages. SIAM J. Comput. 33(1): 137-166 (2003) - [c8]Elizabeth Broering, Satyanarayana V. Lokam:
Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). SAT 2003: 162-171 - 2002
- [c7]Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam:
Better Lower Bounds for Locally Decodable Codes. IEEE Conference on Computational Complexity 2002: 184-193 - 2001
- [j2]Satyanarayana V. Lokam:
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity. J. Comput. Syst. Sci. 63(3): 449-473 (2001) - [c6]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: 171-182 - 2000
- [j1]Satyanarayana V. Lokam:
On the rigidity of Vandermonde matrices. Theor. Comput. Sci. 237(1-2): 477-483 (2000) - [c5]Andris Ambainis, Satyanarayana V. Lokam:
Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function. LATIN 2000: 207-216
1990 – 1999
- 1998
- [c4]
- 1995
- [c3]Satyanarayana V. Lokam:
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity. FOCS 1995: 6-15 - [c2]
- [c1]László Babai, Peter G. Kimmel, Satyanarayana V. Lokam:
Simultaneous Messages vs. Communication. STACS 1995: 361-372
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-12 22:14 CEST by the dblp team