N. V. Vinodchandran

N. Variyam Vinodchandran

2008
42	EE	Chris Bourke, Kun Deng, Stephen D. Scott, Robert E. Schapire, N. V. Vinodchandran: On reoptimizing multi-class classifiers. Machine Learning 71(2-3): 219-242 (2008)
41	EE	John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. 42(2): 131-142 (2008)
40	EE	Aduri Pavan, N. V. Vinodchandran: Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. 42(4): 596-607 (2008)
39	EE	Ravi K. Balachandran, Xukai Zou, Byrav Ramamurthy, Amandeep Thukral, N. Variyam Vinodchandran: An efficient and attack-resistant key agreement scheme for secure group communications in mobile ad-hoc networks. Wireless Communications and Mobile Computing 8(10): 1297-1312 (2008)
2007
38	EE	Chris Bourke, Raghunath Tewari, N. V. Vinodchandran: Directed Planar Reachability is in Unambiguous Log-Space. IEEE Conference on Computational Complexity 2007: 217-221
37	EE	Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran: Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385(1-3): 167-178 (2007)
2006
36	EE	Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran: Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS 2006: 188-199
35	EE	Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. ICALP (1) 2006: 335-345
34	EE	John M. Hitchcock, N. V. Vinodchandran: Dimension, entropy rates, and compression. J. Comput. Syst. Sci. 72(4): 760-782 (2006)
33	EE	Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran: Computational depth: Concept and applications. Theor. Comput. Sci. 354(3): 391-404 (2006)
2005
32		Ajay Kumar Todimala, Byrav Ramamurthy, N. V. Vinodchandran: On computing disjoint paths with dependent cost structure in optical networks. BROADNETS 2005: 155-166
31	EE	Aduri Pavan, N. V. Vinodchandran: Relations Between Average-Case and Worst-Case Complexity. FCT 2005: 422-432
30	EE	Peter Bro Miltersen, N. V. Vinodchandran: Derandomizing Arthur-Merlin Games using Hitting Sets. Computational Complexity 14(3): 256-279 (2005)
29	EE	Aduri Pavan, N. V. Vinodchandran: 2-Local Random Reductions to 3-Valued Functions Electronic Colloquium on Computational Complexity (ECCC)(062): (2005)
28	EE	Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws Electronic Colloquium on Computational Complexity (ECCC)(105): (2005)
27	EE	N. Variyam Vinodchandran: Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games. Int. J. Found. Comput. Sci. 16(6): 1297-1308 (2005)
26	EE	N. V. Vinodchandran: A note on the circuit complexity of PP. Theor. Comput. Sci. 347(1-2): 415-418 (2005)
25	EE	Chris Bourke, John M. Hitchcock, N. V. Vinodchandran: Entropy rates and finite-state dimension. Theor. Comput. Sci. 349(3): 392-406 (2005)
2004
24	EE	N. V. Vinodchandran: Learning DNFs and Circuits Using Teaching Assistants. COCOON 2004: 188-197
23	EE	Qingping Tao, Stephen D. Scott, N. V. Vinodchandran, Thomas Takeo Osugi: SVM-based generalized multiple-instance learning via approximate box counting. ICML 2004
22	EE	Qingping Tao, Stephen D. Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller: An Extended Kernel for Generalized Multiple-Instance Learning. ICTAI 2004: 272-277
21	EE	John M. Hitchcock, N. V. Vinodchandran: Dimension, Entropy Rates, and Compression. IEEE Conference on Computational Complexity 2004: 174-183
20	EE	John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Partial Bi-immunity and NP-Completeness. IEEE Conference on Computational Complexity 2004: 198-203
19	EE	Aduri Pavan, N. V. Vinodchandran: Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility Electronic Colloquium on Computational Complexity (ECCC)(053): (2004)
18	EE	N. V. Vinodchandran: A note on the circuit complexity of PP Electronic Colloquium on Computational Complexity (ECCC)(056): (2004)
17	EE	N. V. Vinodchandran: AMexp[nsube](NP[cap]coNP)/poly. Inf. Process. Lett. 89(1): 43-47 (2004)
16	EE	N. V. Vinodchandran: Counting Complexity of Solvable Black-Box Group Problems. SIAM J. Comput. 33(4): 852-869 (2004)
2003
15	EE	Luis Antunes, Lance Fortnow, N. V. Vinodchandran: Using Depth to Capture Average-Case Complexity. FCT 2003: 303-310
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)
2000
13	EE	Vikraman Arvind, N. V. Vinodchandran: Exact learning via teaching assistants. Theor. Comput. Sci. 241(1-2): 51-81 (2000)
12	EE	Vikraman Arvind, N. V. Vinodchandran: The counting complexity of group-definable languages. Theor. Comput. Sci. 242(1-2): 199-218 (2000)
1999
11	EE	Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe: Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. COCOON 1999: 210-220
10	EE	Peter Bro Miltersen, N. V. Vinodchandran: Derandomizing Arthur-Merlin Games Using Hitting Sets. FOCS 1999: 71-80
9	EE	Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran: The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC 1999: 123-132
1998
8	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
7		Vikraman Arvind, N. V. Vinodchandran: Exact Learning via Teaching Assistants (Extended Abstract). ALT 1997: 291-306
6	EE	N. V. Vinodchandran: Improved Lowness Results for Solvable Black-box Group Problems. FSTTCS 1997: 220-234
5	EE	Vikraman Arvind, N. V. Vinodchandran: Solvable Black-Box Group Problems are Low for PP. Theor. Comput. Sci. 180(1-2): 17-45 (1997)
1996
4		Vikraman Arvind, N. V. Vinodchandran: The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). ALT 1996: 100-112
3		Vikraman Arvind, N. V. Vinodchandran: Solvable Black-Box Group Problems Are Low for PP. STACS 1996: 99-110
1995
2	EE	Meena Mahajan, N. V. Vinodchandran: A Note on Mod and Generalised Mod Classes. Inf. Process. Lett. 55(1): 27-31 (1995)
1994
1		Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran: A Note on SpanP Functions. Inf. Process. Lett. 51(1): 7-10 (1994)

Coauthor Index

1	Luis Filipe Coelho Antunes (Luis Antunes)	[15] [33]
2	Vikraman Arvind	[3] [4] [5] [7] [8] [9] [12] [13] [14]
3	Ravi K. Balachandran	[39]
4	Chris Bourke	[25] [38] [42]
5	Kun Deng	[42]
6	Lance Fortnow	[15] [28] [33] [35]
7	John M. Hitchcock	[20] [21] [25] [28] [34] [35] [41]
8	Meena Mahajan	[1] [2]
9	Dieter van Melkebeek	[33]
10	Peter Bro Miltersen	[10] [11] [30]
11	Brandon Mueller	[22]
12	Thomas Takeo Osugi	[22] [23]
13	Aduri Pavan	[19] [20] [28] [29] [31] [35] [36] [37] [40] [41]
14	Byrav Ramamurthy	[32] [39]
15	Rahul Santhanam	[36]
16	Robert E. Schapire	[42]
17	Stephen D. Scott	[22] [23] [42]
18	Alan L. Selman	[37]
19	Samik Sengupta	[37]
20	K. V. Subrahmanyam	[8] [9] [14]
21	Qingping Tao	[22] [23]
22	Raghunath Tewari	[38]
23	Thomas Thierauf	[1]
24	Amandeep Thukral	[39]
25	Ajay Kumar Todimala	[32]
26	Fengming Wang	[28] [35]
27	Osamu Watanabe	[11]
28	Xukai Zou	[39]

Colors in the list of coauthors