Sledovat
Vinay V
Vinay V
Jed-i Technologies Pvt Ltd
E-mailová adresa ověřena na: jed-i.in
Název
Citace
Citace
Rok
Clustering large graphs via the singular value decomposition
P Drineas, A Frieze, R Kannan, S Vempala, V Vinay
Machine learning 56, 9-33, 2004
951*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
2702008
Branching rules for satisfiability
JN Hooker, V Vinay
Journal of Automated Reasoning 15 (3), 359-383, 1995
2441995
A combinatorial algorithm for the determinant
M Mahajan, V Vinay
SODA, 730-738, 1997
206*1997
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits.
V Vinay
SCT, 270-284, 1991
1561991
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
1161998
String matching in O (n+ m) quantum time
H Ramesh, V Vinay
Journal of Discrete Algorithms 1 (1), 103-110, 2003
952003
Analyzing the structure of large graphs
R Kannan, V Vinay
Universität Bonn. Institut für Ökonometrie und Operations Research, 1999
861999
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
53*2004
Determinant: Old algorithms, new insights
M Mahajan, V Vinay
SIAM journal on Discrete Mathematics 12 (4), 474-490, 1999
471999
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
402001
A Circuit-Based Proof of Toda′ s Theorem
R Kannan, H Venkateswaran, V Vinay, AC Yao
Information and Computation 104 (2), 271-276, 1993
291993
Semi-unboundedness and complexity classes
V Vinay
PhD thesis, Indian Institute of Science, Bangalore, 1991
171991
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
162016
Vinay. Clustering in large graphs and matrices
V Kannan
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
132006
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
Computing and Combinatorics: 5th Annual International Conference, COCOON’99 …, 1999
111999
Suppress, and not just flatten: Strategies for Rapid Suppression of COVID19 transmission in Small World Communities
C Bhattacharyya, V Vinay
Journal of the Indian Institute of Science 100, 849-862, 2020
92020
Circuits, pebbling and expressibility
V Vinay, H Venkateswaran, CEV Madhavan
Proceedings Fifth Annual Structure in Complexity Theory Conference, 223-230, 1990
71990
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20