2008 |
17 | EE | Sanjam Garg,
Raghav Bhaskar,
Satyanarayana V. Lokam:
Improved Bounds on Security Reductions for Discrete Log Based Signatures.
CRYPTO 2008: 93-107 |
16 | EE | Raghav Bhaskar,
K. Chandrasekaran,
Satyanarayana V. Lokam,
P. L. Montgomery,
R. Venkatesan,
Yacov Yacobi:
Vulnerabilities in Anonymous Credential Systems.
Electr. Notes Theor. Comput. Sci. 197(2): 141-148 (2008) |
2006 |
15 | EE | Satyanarayana V. Lokam:
Quadratic Lower Bounds on Matrix Rigidity.
TAMC 2006: 295-307 |
14 | EE | Dungjade Shiowattana,
Satyanarayana V. Lokam:
An optimal lower bound for 2-query locally decodable linear codes.
Inf. Process. Lett. 97(6): 244-250 (2006) |
2005 |
13 | EE | 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 |
12 | EE | Elizabeth Broering,
Satyanarayana V. Lokam:
Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract).
SAT 2003: 162-171 |
11 | EE | 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) |
10 | EE | Satyanarayana V. Lokam:
Graph Complexity and Slice Functions.
Theory Comput. Syst. 36(1): 71-88 (2003) |
2002 |
9 | EE | 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 |
8 | EE | 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 |
7 | EE | 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) |
2000 |
6 | | Andris Ambainis,
Satyanarayana V. Lokam:
Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function.
LATIN 2000: 207-216 |
5 | EE | Satyanarayana V. Lokam:
On the rigidity of Vandermonde matrices.
Theor. Comput. Sci. 237(1-2): 477-483 (2000) |
1998 |
4 | | Satyanarayana V. Lokam:
Remarks on Graph Complexity.
FSTTCS 1998: 307-318 |
1995 |
3 | | Satyanarayana V. Lokam:
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity.
FOCS 1995: 6-15 |
2 | | Satyanarayana V. Lokam,
Meena Mahajan,
V. Vinay:
Logspace Verifiers, NC, and NP.
ISAAC 1995: 52-61 |
1 | | László Babai,
Peter G. Kimmel,
Satyanarayana V. Lokam:
Simultaneous Messages vs. Communication.
STACS 1995: 361-372 |