Concepedia

N. V. Vinodchandran

NV

21

Publications

662

Citations

15

H-Index

1997

Active since

Affiliations

University of Nebraska–Lincoln(Current)

Indian Institute of Technology Kanpur

Iowa State University

Indiana University – Purdue University Indianapolis

University of Indianapolis

N. V. Vinodchandran is an author at University of Nebraska–Lincoln specializing in engineering, computer science, and discrete mathematics.

Top concepts

EngineeringComputer ScienceDiscrete MathematicsCombinatorial OptimizationComputational ComplexityProbabilityData ScienceGraph TheoryMachine LearningKnowledge Discovery

Publications per year

1997–2023

21

Publications

21

SVM-based generalized multiple-instance learning via approximate box counting

Qingping Tao, Stephen Scott, N. V. Vinodchandran et al. · 2004 · 85 citations

Multiple Instance Learning, Engineering, Machine Learning +18

Derandomizing Arthur–Merlin Games using Hitting Sets

Peter Bro Miltersen, N. V. Vinodchandran · Computational Complexity · 2005 · 75 citations · Full text

Derandomizing Arthur-Merlin games using hitting sets

Peter Bro Miltersen, N. V. Vinodchandran · 2003 · 70 citations

Circuit Complexity, Computational Complexity Theory, Engineering +21

Computational depth: Concept and applications

Luís Antunes, Lance Fortnow, Dieter van Melkebeek et al. · Theoretical Computer Science · 2005 · 60 citations

Geometric Modeling, Machine Vision, Engineering +9

Directed Planar Reachability Is in Unambiguous Log-Space

Chris Bourke, Raghunath Tewari, N. V. Vinodchandran · ACM Transactions on Computation Theory · 2009 · 58 citations

Mathematical Programming, Graph Reachability Problem, Directed Graph +14

Rows per page

1–5 of 21