|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 10 keywords
|
|
|
|
|
Results
Found 27 publication records. Showing 27 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody |
On Black-Box Reductions between Predicate Encryption Schemes.  |
TCC  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam |
Reconstruction of depth-4 multilinear circuits with top fan-in 2. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam |
Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam |
Efficient Reconstruction of Random Multilinear Formulas. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan |
Forcing Out a Confession - Threshold Discernible Ring Signatures. |
SECRYPT |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma |
Using Elimination Theory to construct Rigid Matrices. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Satyanarayana V. Lokam |
Complexity Lower Bounds using Linear Algebra. |
Foundations and Trends in Theoretical Computer Science |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma |
Using Elimination Theory to construct Rigid Matrices |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma |
Using Elimination Theory to construct Rigid Matrices. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, P. L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi |
On The Diffie-Hellman Assumption. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, P. L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi |
Vulnerabilities in Anonymous Credential Systems. |
Electr. Notes Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam |
Improved Bounds on Security Reductions for Discrete Log Based Signatures. |
CRYPTO |
2008 |
DBLP DOI BibTeX RDF |
Schnorr Signature Scheme, Provable Security, Random Oracle Model |
| 1 | Dungjade Shiowattana, Satyanarayana V. Lokam |
An optimal lower bound for 2-query locally decodable linear codes. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyanarayana V. Lokam |
Quadratic Lower Bounds on Matrix Rigidity. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan |
Lower bounds for adaptive locally decodable codes. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyanarayana V. Lokam |
Graph Complexity and Slice Functions. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam |
Communication Complexity of Simultaneous Messages. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elizabeth Broering, Satyanarayana V. Lokam |
Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam |
Better Lower Bounds for Locally Decodable Codes. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Second Moment Method, Probabilistically Checkable Proof Systems, Error Correcting Codes, Pseudorandom Generators, Private Information Retrieval |
| 1 | Satyanarayana V. Lokam |
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyanarayana V. Lokam |
On the rigidity of Vandermonde matrices. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Satyanarayana V. Lokam |
Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function. |
LATIN |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyanarayana V. Lokam |
Remarks on Graph Complexity. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | László Babai, Peter G. Kimmel, Satyanarayana V. Lokam |
Simultaneous Messages vs. Communication. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyanarayana V. Lokam |
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
matrix rigidity, size-depth tradeoffs, explicit matrices, lower bounds, communication complexity, communication complexity, matrix algebra, complexity theory, arithmetic circuits |
| 1 | Satyanarayana V. Lokam, Meena Mahajan, V. Vinay |
Logspace Verifiers, NC, and NP. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #27 of 27 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")