Satyanarayana V. Lokam

	2009
20		Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma: Using Elimination Theory to construct Rigid Matrices. FSTTCS 2009: 299-310
19		Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma: Using Elimination Theory to construct Rigid Matrices CoRR abs/0910.5301: (2009)
18		Satyanarayana V. Lokam: Complexity Lower Bounds using Linear Algebra. Foundations and Trends in Theoretical Computer Science 4(1-2): 1-155 (2009)
	2008
17		Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam: Improved Bounds on Security Reductions for Discrete Log Based Signatures. CRYPTO 2008: 93-107
16		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		Satyanarayana V. Lokam: Quadratic Lower Bounds on Matrix Rigidity. TAMC 2006: 295-307
14		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		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		Elizabeth Broering, Satyanarayana V. Lokam: Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). SAT 2003: 162-171
11		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		Satyanarayana V. Lokam: Graph Complexity and Slice Functions. Theory Comput. Syst. 36(1): 71-88 (2003)
	2002
9		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		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		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		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

Coauthor Index

1	Kumar Abhinav	[19] [20]
2	Andris Ambainis	[6]
3	László Babai	[1] [11]
4	Raghav Bhaskar	[16] [17]
5	Elizabeth Broering	[12]
6	K. Chandrasekaran	[16]
7	Amit Deshpande	[9] [13]
8	Jürgen Forster	[8]
9	Anna Gál	[11]
10	Sanjam Garg	[17]
11	Rahul Jain	[9] [13]
12	Telikepalli Kavitha	[9] [13]
13	Peter G. Kimmel	[1] [11]
14	Matthias Krause	[8]
15	Meena Mahajan	[2]
16	P. L. Montgomery	[16]
17	Rustam Mubarakzjanov	[8]
18	Vijay M. Patankar	[19] [20]
19	Jaikumar Radhakrishnan	[9] [13]
20	Jayalal M. N. Sarma	[19] [20]
21	Niels Schmitt	[8]
22	Dungjade Shiowattana	[14]
23	Hans-Ulrich Simon	[8]
24	R. Venkatesan	[16]
25	V. Vinay	[2]
26	Yacov Yacobi	[16]

Colors in the list of coauthors