K. V. Subrahmanyam - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2018

Constructive non-commutative rank computation is in deterministic polynomial timeGábor Ivanyos, Youming Qiao, K. V. Subrahmanyam. cc, 27(4):561-593, 2018. [doi]

CloudSat Observations of Three-Dimensional Distribution of Cloud Types in Tropical CyclonesK. V. Subrahmanyam, Karanam Kishore Kumar, Natalie D. Tourville. staeors, 11(2):339-344, 2018. [doi]

2017

Non-commutative Edmonds' problem and matrix semi-invariantsGábor Ivanyos, Youming Qiao, K. V. Subrahmanyam. cc, 26(3):717-763, 2017. [doi]

Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial TimeGábor Ivanyos, Youming Qiao, K. V. Subrahmanyam. innovations 2017: [doi]

2002

The Query Complexity of Program Checking by Constant-Depth CircuitsVikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran. cjtcs, 2002, 2002. [doi]

2001

Solving Some Discrepancy Problems in NCSanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam. algorithmica, 29(3):371-395, 2001. [doi]

2000

Computing Mimicking NetworksShiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis. algorithmica, 26(1):31-49, 2000. [doi]

1999

The Query Complexity of Program Checking by Constant-Depth CircuitsVikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran. isaac 1999: 123-132 [doi]

1998

The Query Complexity of Program Checking by Constant-Depth CircuitsVikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran. eccc, 5(78), 1998. [doi]

Computing Mimicking NetworksShiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis. icalp 1998: 556-567 [doi]

1997

Solving Some Discrepancy Problems in NCSanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam. fsttcs 1997: 22-36 [doi]

1995

Descriptive Complexity of #P FunctionsSanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur. jcss, 50(3):493-505, 1995.

1994

Abstract and Generic Rigidity in the PlaneSachin B. Patkar, Brigitte Servatius, K. V. Subrahmanyam. JCT, 62(1):107-113, 1994. [doi]

Directed Monotone Contact Networks for Threshold FunctionsJaikumar Radhakrishnan, K. V. Subrahmanyam. ipl, 50(4):199-203, 1994.

1993

On Some Communication Complexity Problems Related to THreshold FunctionsMagnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam. fsttcs 1993: 248-259

Directed vs. Undirected Monotone Contact Networks for Threshold FunctionsMagnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam. focs 1993: 604-613

1992

Descriptive Complexity of #P FunctionsSanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur. coco 1992: 169-184

On the Power of Enumerative CountingSanjeev Saluja, K. V. Subrahmanyam. ipl, 43(3):119-125, 1992.

Sign in or sign up to see more results.

runs on WebDSL