N. V. Vinodchandran

According to our database1, N. V. Vinodchandran authored at least 65 papers between 1994 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning.
CoRR, 2020

Efficiently Learning and Sampling Interventional Distributions from Observations.
CoRR, 2020

2019
A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC), 2019

2018
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory.
Algorithmica, 2018

New Algorithms for Distributed Sliding Windows.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

On Pseudodeterministic Approximation Algorithms.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

KmerEstimate: A Streaming Algorithm for Estimating k-mer Counts with Optimal Space Usage.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

2017
Fractal features for automatic detection of dysarthria.
Proceedings of the 2017 IEEE EMBS International Conference on Biomedical & Health Informatics, 2017

2016
Budgeted testing through an algorithmic lens.
Proceedings of the 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2016

Constrained Group Testing to Predict Binding Response of Candidate Compounds.
Proceedings of the 2016 SIAM International Conference on Data Mining, 2016

A Note on the Advice Complexity of Multipass Randomized Logspace.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Algorithms for k-median Clustering over Distributed Streams.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Computing triangle and open-wedge heavy-hitters in large networks.
Proceedings of the 2016 IEEE International Conference on Big Data, 2016

2015
On Optimal Language Compression for Sets in PSPACE/poly.
Theory Comput. Syst., 2015

On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs.
Electronic Colloquium on Computational Complexity (ECCC), 2014

ReachFewL = ReachUL.
Computational Complexity, 2014

2013
An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability.
Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, 2013

2012
Space complexity of perfect matching in bounded genus bipartite graphs.
J. Comput. Syst. Sci., 2012

On the power of unambiguity in log-space.
Computational Complexity, 2012

2010
Green's Theorem and Isolation in Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs.
Electronic Colloquium on Computational Complexity (ECCC), 2010

On the Power of Unambiguity in Logspace.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Resource-bounded Dimension in Computational Learning Theory
CoRR, 2010

A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources.
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, 2010

2009
Directed Planar Reachability Is in Unambiguous Log-Space.
TOCT, 2009

A log-space algorithm for reachability in planar DAGs with few sources.
Electronic Colloquium on Computational Complexity (ECCC), 2009

Kolmogorov Complexity in Randomness Extraction.
Electronic Colloquium on Computational Complexity (ECCC), 2009

2008
An efficient and attack-resistant key agreement scheme for secure group communications in mobile ad-hoc networks.
Wireless Communications and Mobile Computing, 2008

Kernels for Generalized Multiple-Instance Learning.
IEEE Trans. Pattern Anal. Mach. Intell., 2008

Relations between Average-Case and Worst-Case Complexity.
Theory Comput. Syst., 2008

Partial Bi-immunity, Scaled Dimension, and NP-Completeness.
Theory Comput. Syst., 2008

On reoptimizing multi-class classifiers.
Machine Learning, 2008

2-Local Random Reductions to 3-Valued Functions.
Computational Complexity, 2008

2007
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy.
Theor. Comput. Sci., 2007

2006
Computational depth: Concept and applications.
Theor. Comput. Sci., 2006

Dimension, entropy rates, and compression.
J. Comput. Syst. Sci., 2006

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks.
Proceedings of IEEE International Conference on Communications, 2006

Some Results on Average-Case Hardness Within the Polynomial Hierarchy.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
A note on the circuit complexity of PP.
Theor. Comput. Sci., 2005

Entropy rates and finite-state dimension.
Theor. Comput. Sci., 2005

Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games.
Int. J. Found. Comput. Sci., 2005

Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
Electronic Colloquium on Computational Complexity (ECCC), 2005

Derandomizing Arthur-Merlin Games using Hitting Sets.
Computational Complexity, 2005

A balanced key tree approach for dynamic secure group communication.
Proceedings of the 14th International Conference On Computer Communications and Networks, 2005

CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks.
Proceedings of IEEE International Conference on Communications, 2005

On computing disjoint paths with dependent cost structure in optical networks.
Proceedings of the 2nd International Conference on Broadband Networks (BROADNETS 2005), 2005

2004
Counting Complexity of Solvable Black-Box Group Problems.
SIAM J. Comput., 2004

AMexp[nsube](NP[cap]coNP)/poly.
Inf. Process. Lett., 2004

Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility
Electronic Colloquium on Computational Complexity (ECCC), 2004

An Extended Kernel for Generalized Multiple-Instance Learning.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

SVM-based generalized multiple-instance learning via approximate box counting.
Proceedings of the Machine Learning, 2004

Learning DNFs and Circuits Using Teaching Assistants.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

Partial Bi-immunity and NP-Completeness.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003
Using Depth to Capture Average-Case Complexity.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
The Query Complexity of Program Checking by Constant-Depth Circuits.
Chicago J. Theor. Comput. Sci., 2002

2000
The counting complexity of group-definable languages.
Theor. Comput. Sci., 2000

Exact learning via teaching assistants.
Theor. Comput. Sci., 2000

1999
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1997
Solvable Black-Box Group Problems are Low for PP.
Theor. Comput. Sci., 1997

Improved Lowness Results for Solvable Black-box Group Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

Exact Learning via Teaching Assistants (Extended Abstract).
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract).
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995
A Note on Mod and Generalised Mod Classes.
Inf. Process. Lett., 1995

1994
A Note on SpanP Functions.
Inf. Process. Lett., 1994


  Loading...