The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

K. V. Subrahmanyam: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  15. Quantum deformations of the restriction of GLmn(C)-modules to GLm(C) × GLn(C) [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002