2002 |
14 | EE | 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 | EE | Sanjeev Mahajan,
Edgar A. Ramos,
K. V. Subrahmanyam:
Solving Some Discrepancy Problems in NC.
Algorithmica 29(3): 371-395 (2001) |
2000 |
12 | EE | Shiva Chaudhuri,
K. V. Subrahmanyam,
Frank Wagner,
Christos D. Zaroliagis:
Computing Mimicking Networks.
Algorithmica 26(1): 31-49 (2000) |
1999 |
11 | EE | Vikraman Arvind,
K. V. Subrahmanyam,
N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits.
ISAAC 1999: 123-132 |
1998 |
10 | EE | Shiva Chaudhuri,
K. V. Subrahmanyam,
Frank Wagner,
Christos D. Zaroliagis:
Computing Mimicking Networks.
ICALP 1998: 556-567 |
9 | EE | 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 | EE | 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 | EE | 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) |