default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatyanarayana V. Lokam
Person information
- affiliation: Microsoft Research India, Bangalore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c26]Arasu Arun, Chaya Ganesh, Satya V. Lokam, Tushar Mopuri, Sriram Sridhar
:
Dew: A Transparent Constant-Sized Polynomial Commitment Scheme. Public Key Cryptography (2) 2023: 542-571- 2022
- [i11]Arasu Arun, Chaya Ganesh, Satya V. Lokam, Tushar Mopuri, Sriram Sridhar:
Dew: Transparent Constant-sized zkSNARKs. IACR Cryptol. ePrint Arch. 2022: 419 (2022) - 2020
- [j10]Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman:
ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. IEEE Trans. Inf. Theory 66(11): 6749-6761 (2020)
2010 – 2019
- 2019
- [i10]Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh:
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. CoRR abs/1903.11635 (2019) - 2018
- [c25]Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman:
∊-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. ISIT 2018: 2371-2375 - [c24]Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh:
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. LATIN 2018: 275-289 - [e2]Satya V. Lokam, Sushmita Ruj, Kouichi Sakurai:
Proceedings of the 2nd ACM Workshop on Blockchains, Cryptocurrencies, and Contracts, BCC@AsiaCCS 2018, Incheon, Republic of Korea, June 4, 2018. ACM 2018 [contents] - [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 für Informatik 2018, ISBN 978-3-95977-055-2 [contents] - [i9]Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman:
ε-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. CoRR abs/1807.01166 (2018) - 2017
- [c23]Kartik Nayak, Christopher W. Fletcher, Ling Ren, Nishanth Chandran, Satya V. Lokam, Elaine Shi, Vipul Goyal:
HOP: Hardware makes Obfuscation Practical. NDSS 2017 - 2016
- [j9]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper bounds on Fourier entropy. Theor. Comput. Sci. 654: 92-112 (2016) - [c22]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. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c21]V. Lalitha, Satyanarayana V. Lokam:
Weight enumerators and higher support weights of maximally recoverable codes. Allerton 2015: 835-842 - [c20]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper Bounds on Fourier Entropy. COCOON 2015: 771-782 - [c19]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
- [j8]Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to Construct Rigid Matrices. Comput. Complex. 23(4): 531-563 (2014) - 2013
- [i5]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper Bounds on Fourier Entropy. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c18]Chaya Ganesh, Vipul Goyal, Satyanarayana V. Lokam:
On-Line/Off-Line Leakage Resilient Secure Computation Protocols. INDOCRYPT 2012: 100-119 - [c17]Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam:
Reconstruction of depth-4 multilinear circuits with top fan-in 2. STOC 2012: 625-642 - [c16]Vipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody:
On Black-Box Reductions between Predicate Encryption Schemes. TCC 2012: 440-457 - 2011
- [c15]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. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c14]Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan:
Threshold Discernible Ring Signatures. ICETE (Selected Papers) 2010: 259-273 - [c13]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
- [j7]Satyanarayana V. Lokam:
Complexity Lower Bounds using Linear Algebra. Found. Trends Theor. Comput. Sci. 4(1-2): 1-155 (2009) - [c12]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. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c11]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, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi:
On The Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2008: 525 (2008) - 2007
- [c10]Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi:
Vulnerabilities in Anonymous Credential Systems. STM@ESORICS 2007: 141-148 - 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]Satyanarayana V. Lokam:
Quadratic Lower Bounds on Matrix Rigidity. TAMC 2006: 295-307 - 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. CCC 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]Satyanarayana V. Lokam:
Remarks on Graph Complexity. FSTTCS 1998: 307-318 - 1995
- [c3]Satyanarayana V. Lokam:
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity. FOCS 1995: 6-15 - [c2]Satyanarayana V. Lokam, Meena Mahajan, V. Vinay:
Logspace Verifiers, NC, and NP. ISAAC 1995: 52-61 - [c1]László Babai, Peter G. Kimmel, Satyanarayana V. Lokam:
Simultaneous Messages vs. Communication. STACS 1995: 361-372
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
