N. V. Vinodchandran

Available identifiers

zbMath Open vinodchandran.n-variyamMaRDI QIDQ439935

List of research outcomes

Publication	Date of Publication	Type
Pseudodeterminism: promises and lowerbounds	2023-12-08	Paper
Near-optimal learning of tree-structured distributions by Chow-Liu	2023-11-14	Paper
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu	2023-07-06	Paper
Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube	2023-06-21	Paper
Perfect zero knowledge: new upperbounds and relativized separations	2021-12-01	Paper
On Pseudodeterministic Approximation Algorithms.	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5116486	2020-08-25	Paper
New bounds for the CLIQUE-GAP problem using graph decomposition theory	2018-04-06	Paper
A Note on the Advice Complexity of Multipass Randomized Logspace	2018-03-21	Paper
Solvable black-box group problems are low for PP	2017-11-16	Paper
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs.	2017-04-25	Paper
Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs	2016-09-22	Paper
Algorithms for k-median Clustering over Distributed Streams	2016-09-02	Paper
Directed Planar Reachability Is in Unambiguous Log-Space	2015-09-24	Paper
Kolmogorov Complexity in Randomness Extraction	2015-09-24	Paper
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory	2015-09-16	Paper
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape	2015-09-16	Paper
On optimal language compression for sets in PSPACE/poly	2015-07-20	Paper
\textsc{ReachFewL} = \textsc{ReachUL}	2014-09-25	Paper
On the power of unambiguity in log-space	2012-12-27	Paper
Kolmogorov Complexity in Randomness Extraction.	2012-10-24	Paper
Green's theorem and isolation in planar graphs	2012-10-11	Paper
Space complexity of perfect matching in bounded genus bipartite graphs	2012-08-17	Paper
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.	2012-01-23	Paper
ReachFewL = ReachUL	2011-08-17	Paper
Extracting Kolmogorov complexity with applications to dimension zero-one laws	2011-04-28	Paper
The complexity of exactly learning algebraic concepts	2010-04-27	Paper
Fundamentals of Computation Theory	2010-04-20	Paper
2-local random reductions to 3-valued functions	2010-03-15	Paper
AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly	2009-07-09	Paper
On reoptimizing multi-class classifiers	2009-03-31	Paper
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws	2009-03-12	Paper
Relations between average-case and worst-case complexity	2008-06-06	Paper
Some Results on Average-Case Hardness Within the Polynomial Hierarchy	2008-04-17	Paper
Partial bi-immunity, scaled dimension, and NP-completeness	2008-04-03	Paper
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy	2007-10-18	Paper
Fundamentals of Computation Theory	2006-10-20	Paper
Dimension, entropy rates, and compression	2006-06-30	Paper
Computational depth: Concept and applications	2006-04-28	Paper
Entropy rates and finite-state dimension	2006-03-20	Paper
Derandomizing Arthur-Merlin games using hitting sets	2006-02-08	Paper
A note on the circuit complexity of PP	2005-12-29	Paper
NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES	2005-12-15	Paper
Computing and Combinatorics	2005-06-15	Paper
Counting Complexity of Solvable Black-Box Group Problems	2005-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q4483915	2003-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q4511221	2000-10-30	Paper
Exact learning via teaching assistants	2000-08-21	Paper
The counting complexity of group-definable languages	2000-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4938667	2000-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q4370033	1998-11-29	Paper
Solvable black-box group problems are low for PP	1998-07-22	Paper
A note on Mod and generalised Mod classes	1997-02-28	Paper
A note on SpanP functions	1994-08-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: N. V. Vinodchandran