- On Reoptimizing Multi-Class Classifiers Chris Bourke
- Derandomizing ArthurMerlin games using hitting sets Peter Bro Miltersen
- AM exp 6 (NP \ coNP)/poly N. V. Vinodchandran
- The Query Complexity of Program Checking by ConstantDepth V. Arvind \Lambda K. V. Subrahmanyam y N. V. Vinodchandran z
- Computational Depth: Concept and Applications #
- 2-LOCAL RANDOM REDUCTIONS TO 3-VALUED FUNCTIONS
- A note on the circuit complexity of PP N. V. Vinodchandran
- Solvable Black-Box Group Problems are Low for PP V. Arvind and N. V. Vinodchandran
- Exact Learning via Teaching Assistants V. Arvind and N. V. Vinodchandran
- Extracting Kolmogorov Complexity with Applications to Dimension ZeroOne Laws
- Dimension, Entropy Rates, and Compression John M. Hitchcock 1
- LIPIcs Leibniz International Proceedings in Informatics Kolmogorov Complexity in
- A log-space algorithm for reachability in planar acyclic digraphs with few sources Derrick Stolee
- Kernels for Generalized Multiple-Instance Qingping Tao, Stephen Scott, N. V. Vinodchandran, Thomas Takeo Osugi,
- Learning DNFs and Circuits using Teaching N. V. Vinodchandran
- Relations between Averagecase and Worstcase A. Pavan #1 and N. V. Vinodchandran ##2
- CERTIFICATE This is to certify that the Ph.D. thesis submitted by Vinodchandran N. V. to
- Partial Biimmunity, Scaled Dimension, and NPCompleteness
- An Extended Kernel for Generalized Multiple-Instance Learning Qingping Tao, Stephen Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller
- DIRECTED PLANAR REACHABILITY IS IN UNAMBIGUOUS CHRIS BOURKE, RAGHUNATH TEWARI, AND N. V. VINODCHANDRAN
- On the Power of Unambiguity in Logspace Aduri Pavan
- The Complexity of NP Problems over Finite V. Arvind and N. V. Vinodchandran
