N. V. Vinodchandran

N. Variyam Vinodchandran

	2013
i16		N. V. Vinodchandran, Marius Zimand: On optimal language compression for sets in PSPACE/poly. CoRR abs/1304.1005 (2013)
	2012
j27		Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran: On the power of unambiguity in log-space. Computational Complexity 21(4): 643-670 (2012)
j26		Raghunath Tewari, N. V. Vinodchandran: Green's theorem and isolation in planar graphs. Inf. Comput. 215: 1-7 (2012)
j25		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78(3): 765-779 (2012)
c25		Derrick Stolee, N. V. Vinodchandran: Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. IEEE Conference on Computational Complexity 2012: 326-333
	2011
j24		Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang: Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. 209(4): 627-636 (2011)
j23		John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran: Kolmogorov Complexity in Randomness Extraction. TOCT 3(1): 1 (2011)
c24		Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran: ReachFewL = ReachUL. COCOON 2011: 252-258
c23		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590
i15		Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran: ReachFewL = ReachUL. Electronic Colloquium on Computational Complexity (ECCC) 18: 60 (2011)
	2010
c22		Derrick Stolee, Chris Bourke, N. V. Vinodchandran: A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. IEEE Conference on Computational Complexity 2010: 131-138
i14		Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran: On the Power of Unambiguity in Logspace. CoRR abs/1001.2034 (2010)
i13		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. CoRR abs/1004.5080 (2010)
i12		Ricard Gavaldà, María López-Valdés, Elvira Mayordomo, N. V. Vinodchandran: Resource-bounded Dimension in Computational Learning Theory. CoRR abs/1010.5470 (2010)
i11		Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran: On the Power of Unambiguity in Logspace. Electronic Colloquium on Computational Complexity (ECCC) 17: 9 (2010)
i10		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electronic Colloquium on Computational Complexity (ECCC) 17: 79 (2010)
i9		Raghunath Tewari, N. V. Vinodchandran: Green's Theorem and Isolation in Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 17: 151 (2010)
i8		Derrick Stolee, N. V. Vinodchandran: Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. Electronic Colloquium on Computational Complexity (ECCC) 17: 154 (2010)
	2009
j22		Chris Bourke, Raghunath Tewari, N. V. Vinodchandran: Directed Planar Reachability Is in Unambiguous Log-Space. TOCT 1(1) (2009)
c21		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Kolmogorov Complexity in Randomness Extraction. FSTTCS 2009: 215-226
i7		Derrick Stolee, Chris Bourke, N. V. Vinodchandran: A log-space algorithm for reachability in planar DAGs with few sources. Electronic Colloquium on Computational Complexity (ECCC) 16: 49 (2009)
i6		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Kolmogorov Complexity in Randomness Extraction. Electronic Colloquium on Computational Complexity (ECCC) 16: 71 (2009)
	2008
j21		Aduri Pavan, N. V. Vinodchandran: 2-Local Random Reductions to 3-Valued Functions. Computational Complexity 17(4): 501-514 (2008)
j20		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)
j19		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. 42(2): 131-142 (2008)
j18		Aduri Pavan, N. V. Vinodchandran: Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. 42(4): 596-607 (2008)
j17		Qingping Tao, Stephen D. Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller: Kernels for Generalized Multiple-Instance Learning. IEEE Trans. Pattern Anal. Mach. Intell. 30(12): 2084-2098 (2008)
j16		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
j15		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)
c20		Chris Bourke, Raghunath Tewari, N. V. Vinodchandran: Directed Planar Reachability is in Unambiguous Log-Space. IEEE Conference on Computational Complexity 2007: 217-221
	2006
j14		John M. Hitchcock, N. V. Vinodchandran: Dimension, entropy rates, and compression. J. Comput. Syst. Sci. 72(4): 760-782 (2006)
j13		Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran: Computational depth: Concept and applications. Theor. Comput. Sci. 354(3): 391-404 (2006)
c19		Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran: Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS 2006: 188-199
c18		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
c17		Sarang Deshpande, Ajay Kumar Todimala, Ravi K. Balachandran, Byrav Ramamurthy, Xukai Zou, N. V. Vinodchandran: A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks. ICC 2006: 2310-2315
	2005
j12		Peter Bro Miltersen, N. V. Vinodchandran: Derandomizing Arthur-Merlin Games using Hitting Sets. Computational Complexity 14(3): 256-279 (2005)
j11		N. Variyam Vinodchandran: Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games. Int. J. Found. Comput. Sci. 16(6): 1297-1308 (2005)
j10		N. V. Vinodchandran: A note on the circuit complexity of PP. Theor. Comput. Sci. 347(1-2): 415-418 (2005)
j9		Chris Bourke, John M. Hitchcock, N. V. Vinodchandran: Entropy rates and finite-state dimension. Theor. Comput. Sci. 349(3): 392-406 (2005)
c16		Ajay Kumar Todimala, Byrav Ramamurthy, N. V. Vinodchandran: On computing disjoint paths with dependent cost structure in optical networks. BROADNETS 2005: 155-166
c15		Aduri Pavan, N. V. Vinodchandran: Relations Between Average-Case and Worst-Case Complexity. FCT 2005: 422-432
c14		Ravi K. Balachandran, Byrav Ramamurthy, Xukai Zou, N. Variyam Vinodchandran: CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks. ICC 2005: 1123-1127
i5		Aduri Pavan, N. V. Vinodchandran: 2-Local Random Reductions to 3-Valued Functions. Electronic Colloquium on Computational Complexity (ECCC)(062) (2005)
i4		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)
	2004
j8		N. V. Vinodchandran: AMexp[nsube](NP[cap]coNP)/poly. Inf. Process. Lett. 89(1): 43-47 (2004)
j7		N. V. Vinodchandran: Counting Complexity of Solvable Black-Box Group Problems. SIAM J. Comput. 33(4): 852-869 (2004)
c13		John M. Hitchcock, N. V. Vinodchandran: Dimension, Entropy Rates, and Compression. IEEE Conference on Computational Complexity 2004: 174-183
c12		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Partial Bi-immunity and NP-Completeness. IEEE Conference on Computational Complexity 2004: 198-203
c11		N. V. Vinodchandran: Learning DNFs and Circuits Using Teaching Assistants. COCOON 2004: 188-197
c10		Qingping Tao, Stephen D. Scott, N. V. Vinodchandran, Thomas Takeo Osugi: SVM-based generalized multiple-instance learning via approximate box counting. ICML 2004
c9		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
i3		Aduri Pavan, N. V. Vinodchandran: Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility. Electronic Colloquium on Computational Complexity (ECCC)(053) (2004)
i2		N. V. Vinodchandran: A note on the circuit complexity of PP. Electronic Colloquium on Computational Complexity (ECCC)(056) (2004)
	2003
c8		Luis Antunes, Lance Fortnow, N. V. Vinodchandran: Using Depth to Capture Average-Case Complexity. FCT 2003: 303-310
	2002
j6		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
j5		Vikraman Arvind, N. V. Vinodchandran: Exact learning via teaching assistants. Theor. Comput. Sci. 241(1-2): 51-81 (2000)
j4		Vikraman Arvind, N. V. Vinodchandran: The counting complexity of group-definable languages. Theor. Comput. Sci. 242(1-2): 199-218 (2000)
	1999
c7		Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe: Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. COCOON 1999: 210-220
c6		Peter Bro Miltersen, N. V. Vinodchandran: Derandomizing Arthur-Merlin Games Using Hitting Sets. FOCS 1999: 71-80
c5		Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran: The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC 1999: 123-132
	1998
i1		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
j3		Vikraman Arvind, N. V. Vinodchandran: Solvable Black-Box Group Problems are Low for PP. Theor. Comput. Sci. 180(1-2): 17-45 (1997)
c4		Vikraman Arvind, N. V. Vinodchandran: Exact Learning via Teaching Assistants (Extended Abstract). ALT 1997: 291-306
c3		N. V. Vinodchandran: Improved Lowness Results for Solvable Black-box Group Problems. FSTTCS 1997: 220-234
	1996
c2		Vikraman Arvind, N. V. Vinodchandran: The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). ALT 1996: 100-112
c1		Vikraman Arvind, N. V. Vinodchandran: Solvable Black-Box Group Problems Are Low for PP. STACS 1996: 99-110
	1995
j2		Meena Mahajan, N. V. Vinodchandran: A Note on Mod and Generalised Mod Classes. Inf. Process. Lett. 55(1): 27-31 (1995)
	1994
j1		Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran: A Note on SpanP Functions. Inf. Process. Lett. 51(1): 7-10 (1994)

Coauthor Index

Colors in the list of coauthors

Last update Fri May 24 09:20:47 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page