K. V. Subrahmanyam

	2009
15		Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam: Quantum deformations of the restriction of GLmn(C)-modules to GLm(C) × GLn(C) CoRR abs/0905.0094: (2009)
	2002
14		Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran: The Query Complexity of Program Checking by Constant-Depth Circuits. Chicago J. Theor. Comput. Sci. 2002: (2002)
	2001
13		Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam: Solving Some Discrepancy Problems in NC. Algorithmica 29(3): 371-395 (2001)
	2000
12		Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. Algorithmica 26(1): 31-49 (2000)
	1999
11		Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran: The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC 1999: 123-132
	1998
10		Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. ICALP 1998: 556-567
9		Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran: The Query Complexity of Program Checking by Constant-Depth Circuits Electronic Colloquium on Computational Complexity (ECCC) 5(78): (1998)
	1997
8		Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam: Solving Some Discrepancy Problems in NC. FSTTCS 1997: 22-36
	1995
7		Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur: Descriptive Complexity of #P Functions. J. Comput. Syst. Sci. 50(3): 493-505 (1995)
	1994
6		Jaikumar Radhakrishnan, K. V. Subrahmanyam: Directed Monotone Contact Networks for Threshold Functions. Inf. Process. Lett. 50(4): 199-203 (1994)
5		Sachin B. Patkar, Brigitte Servatius, K. V. Subrahmanyam: Abstract and Generic Rigidity in the Plane. J. Comb. Theory, Ser. B 62(1): 107-113 (1994)
	1993
4		Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam: Directed vs. Undirected Monotone Contact Networks for Threshold Functions FOCS 1993: 604-613
3		Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam: On Some Communication Complexity Problems Related to THreshold Functions. FSTTCS 1993: 248-259
	1992
2		Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur: Descriptive Complexity of #P Functions. Structure in Complexity Theory Conference 1992: 169-184
1		Sanjeev Saluja, K. V. Subrahmanyam: On the Power of Enumerative Counting. Inf. Process. Lett. 43(3): 119-125 (1992)

Coauthor Index

1	Bharat Adsul	[15]
2	Vikraman Arvind	[9] [11] [14]
3	Shiva Chaudhuri	[10] [12]
4	Frank Geraets (Frank Wagner)	[10] [12]
5	Magnús M. Halldórsson	[3] [4]
6	Sanjeev Mahajan	[8] [13]
7	Sachin B. Patkar	[5]
8	Jaikumar Radhakrishnan	[3] [4] [6]
9	Edgar A. Ramos	[8] [13]
10	Sanjeev Saluja	[1] [2] [7]
11	Brigitte Servatius	[5]
12	Milind A. Sohoni	[15]
13	Madhukar N. Thakur	[2] [7]
14	N. V. Vinodchandran (N. Variyam Vinodchandran)	[9] [11] [14]
15	Christos D. Zaroliagis	[10] [12]

Colors in the list of coauthors