dblp.uni-trier.dewww.uni-trier.de

K. V. Subrahmanyam

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)