Vinay V
Vinay V
Ati Motors Pvt Ltd
Verified email at atimotors.com
Title
Cited by
Cited by
Year
Clustering large graphs via the singular value decomposition
P Drineas, A Frieze, R Kannan, S Vempala, V Vinay
Machine learning 56 (1), 9-33, 2004
833*2004
Arithmetic circuits: A chasm at depth four
M Agrawal, V Vinay
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 67-75, 2008
2392008
Branching rules for satisfiability
JN Hooker, V Vinay
Journal of Automated Reasoning 15 (3), 359-383, 1995
2291995
A combinatorial algorithm for the determinant
M Mahajan, V Vinay
SODA, 730-738, 1997
158*1997
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
V Vinay
Proc. 6th Structure in Complexity Theory Conference 223, 270-284, 1991
1421991
Non-commutative arithmetic circuits: depth reduction and size lower bounds
E Allender, J Jiao, M Mahajan, V Vinay
Theoretical Computer Science 209 (1-2), 47-86, 1998
1121998
Analyzing the structure of large graphs
R Kannan, V Vinay
Forschungsinst. für Diskrete Mathematik, 1999
501999
String matching in O (n+ m) quantum time
H Ramesh, V Vinay
Journal of Discrete Algorithms 1 (1), 103-110, 2003
472003
String matching in O (n+ m) quantum time
H Ramesh, V Vinay
Journal of Discrete Algorithms 1 (1), 103-110, 2003
472003
Determinant: Old algorithms, new insights
M Mahajan, V Vinay
SIAM journal on Discrete Mathematics 12 (4), 474-490, 1999
441999
The combinatorial approach yields an NC algorithm for computing Pfaffians
M Mahajan, PR Subramanya, V Vinay
Discrete Applied Mathematics 143 (1-3), 1-16, 2004
42*2004
Time-space tradeoffs in the counting hierarchy
E Allender, M Koucky, D Ronneburger, S Roy, V Vinay
Proceedings 16th Annual IEEE Conference on Computational Complexity, 295-302, 2001
332001
A Circuit-Based Proof of Toda′ s Theorem
R Kannan, H Venkateswaran, V Vinay, AC Yao
Information and Computation 104 (2), 271-276, 1993
251993
Semi-unboundedness and complexity classes
V Vinay
PhD thesis, Indian Institute of Science, Bangalore, 1991
171991
Vinay. Clustering in large graphs and matrices
F Drineas, V Kannan, A Frieze, S Vempala
SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical …, 1999
151999
Circuits on cylinders
KA Hansen, PB Miltersen, V Vinay
computational complexity 15 (1), 62-81, 2006
142006
The chasm at depth four, and tensor rank: Old results, new insights
S Chillara, M Kumar, R Saptharishi, V Vinay
arXiv preprint arXiv:1606.04200, 2016
132016
Hierarchies of circuit classes that are closed under complement
V Vinay
Proceedings of Computational Complexity (Formerly Structure in Complexity …, 1996
131996
Circuits and context-free languages
P McKenzie, K Reinhardt, V Vinay
International Computing and Combinatorics Conference, 194-203, 1999
91999
Circuits, pebbling and expressibility
V Vinay, H Venkateswaran, CEV Madhavan
Proceedings Fifth Annual Structure in Complexity Theory Conference, 223-230, 1990
51990
The system can't perform the operation now. Try again later.
Articles 1–20