The SCEAS System
| |||||||

## Search the dblp DataBase
Satyanarayana V. Lokam:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
**Better Lower Bounds for Locally Decodable Codes.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:184-193 [Conf] - Satyanarayana V. Lokam
**Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:6-15 [Conf] - Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon
**Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:171-182 [Conf] - Satyanarayana V. Lokam
**Remarks on Graph Complexity.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1998, pp:307-318 [Conf] - Satyanarayana V. Lokam, Meena Mahajan, V. Vinay
**Logspace Verifiers, NC, and NP.**[Citation Graph (0, 0)][DBLP] ISAAC, 1995, pp:52-61 [Conf] - Andris Ambainis, Satyanarayana V. Lokam
**Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function.**[Citation Graph (0, 0)][DBLP] LATIN, 2000, pp:207-216 [Conf] - Elizabeth Broering, Satyanarayana V. Lokam
**Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract).**[Citation Graph (0, 0)][DBLP] SAT, 2003, pp:162-171 [Conf] - László Babai, Peter G. Kimmel, Satyanarayana V. Lokam
**Simultaneous Messages vs. Communication.**[Citation Graph (0, 0)][DBLP] STACS, 1995, pp:361-372 [Conf] - Satyanarayana V. Lokam
**Quadratic Lower Bounds on Matrix Rigidity.**[Citation Graph (0, 0)][DBLP] TAMC, 2006, pp:295-307 [Conf] - Dungjade Shiowattana, Satyanarayana V. Lokam
**An optimal lower bound for 2-query locally decodable linear codes.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:97, n:6, pp:244-250 [Journal] - Satyanarayana V. Lokam
**Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:63, n:3, pp:449-473 [Journal] - Satyanarayana V. Lokam
**Graph Complexity and Slice Functions.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2003, v:36, n:1, pp:71-88 [Journal] - Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan
**Lower bounds for adaptive locally decodable codes.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2005, v:27, n:3, pp:358-378 [Journal] - László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam
**Communication Complexity of Simultaneous Messages.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:33, n:1, pp:137-166 [Journal] - Satyanarayana V. Lokam
**On the rigidity of Vandermonde matrices.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:237, n:1-2, pp:477-483 [Journal] **Improved Bounds on Security Reductions for Discrete Log Based Signatures.**[Citation Graph (, )][DBLP]**Using Elimination Theory to construct Rigid Matrices.**[Citation Graph (, )][DBLP]**Using Elimination Theory to construct Rigid Matrices**[Citation Graph (, )][DBLP]**Vulnerabilities in Anonymous Credential Systems.**[Citation Graph (, )][DBLP]
Search in 0.010secs, Finished in 0.011secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |