Satyanarayana V. Lokam

	2012
27		Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam: Reconstruction of depth-4 multilinear circuits with top fan-in 2. STOC 2012: 625-642
26		Vipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody: On Black-Box Reductions between Predicate Encryption Schemes. TCC 2012: 440-457
	2011
25		Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam: Efficient Reconstruction of Random Multilinear Formulas. FOCS 2011: 778-787
24		Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam: Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. Electronic Colloquium on Computational Complexity (ECCC) 18: 153 (2011)
	2010
23		Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan: Forcing Out a Confession - Threshold Discernible Ring Signatures. SECRYPT 2010: 379-388
	2009
22		Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma: Using Elimination Theory to construct Rigid Matrices. FSTTCS 2009: 299-310
21		Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma: Using Elimination Theory to construct Rigid Matrices CoRR abs/0910.5301: (2009)
20		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) 16: 106 (2009)
19		Satyanarayana V. Lokam: Complexity Lower Bounds using Linear Algebra. Foundations and Trends in Theoretical Computer Science 4(1-2): 1-155 (2009)
	2008
18		Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam: Improved Bounds on Security Reductions for Discrete Log Based Signatures. CRYPTO 2008: 93-107
17		Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, P. L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi: Vulnerabilities in Anonymous Credential Systems. Electr. Notes Theor. Comput. Sci. 197(2): 141-148 (2008)
16		Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, P. L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi: On The Diffie-Hellman Assumption. IACR Cryptology ePrint Archive 2008: 525 (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	[20] [21] [22]
2	Shivank Agrawal	[23]
3	Andris Ambainis	[6]
4	László Babai	[1] [11]
5	Raghav Bhaskar	[16] [17] [18]
6	Elizabeth Broering	[12]
7	K. Chandrasekaran	[16] [17]
8	Amit Deshpande	[9] [13]
9	Jürgen Forster	[8]
10	Anna Gál	[11]
11	Sanjam Garg	[18]
12	Vipul Goyal	[26]
13	Ankit Gupta	[24] [25] [27]
14	Rahul Jain	[9] [13]
15	Telikepalli Kavitha	[9] [13]
16	Neeraj Kayal	[24] [25] [27]
17	Peter G. Kimmel	[1] [11]
18	Matthias Krause	[8]
19	Swarun Kumar	[23]
20	Virendra Kumar	[26]
21	Meena Mahajan	[2]
22	Mohammad Mahmoody	[26]
23	P. L. Montgomery	[16] [17]
24	Rustam Mubarakzjanov	[8]
25	Vijay M. Patankar	[20] [21] [22]
26	Jaikumar Radhakrishnan	[9] [13]
27	C. Pandu Rangan (Chandrasekaran Pandu Rangan)	[23]
28	Jayalal M. N. Sarma	[20] [21] [22]
29	Niels Schmitt	[8]
30	Dungjade Shiowattana	[14]
31	Hans Ulrich Simon (Hans-Ulrich Simon)	[8]
32	Ramarathnam Venkatesan	[16] [17] [23]
33	V. Vinay	[2]
34	Yacov Yacobi	[16] [17]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page