Qualifications

• B.Tech. (Computer Sc. and Engg.) Indian Institute of Technology, Bombay (1986).
• M.S. (Electrical Engg and Computer Science) Vanderbilt University, Tennessee, USA (1988).
• Ph.D. (Computer Science) Bombay University, Tata Institute of Fundamental Research, Bombay (1995).

Areas of
Interest

• Algorithms and Complexity
• Algebraic Methods, Algebraic Complexity
• Polyhedral Combinatorics.

Selected
Publications

• S. Chaudhuri, K.V. Subrahmanyam, F. Wagner, C. Zaroliagis:
  On mimicking networks,
  Technical Report, Max Planck Institut fur Informatik, Saarbrucken (1997).
• S. Mahajan, E. Ramos, K.V. Subrahmanyam:
  On solving certain descrepancy problems in NC,
  Technical Report, Max Planck Institut fur Informatik, Saarbrucken (1997).
• S. Saluja, K. V. Subrahmanyam, M. Thakur:
  Descriptive complexity of #P functions
  Jl. Computing & Syst. Sci. (1995).
• S. Patkar, B. Servatius, K.V. Subrahmanyam:
  Abstract and generic rigidity in the plane
  Jl. Of Combinatorial Theory, Series B (1995).
• M. Haldorsson, J. Radhakrishnan, K.V. Subrahmanyam:
  Monotone contact networks for threshold functions
  Proc. 34th Annual IEEE FOCS (1993).