Vinay V

引用次数

	总计	2020 年至今
引用	2489	566
h 指数	15	10
i10 指数	19	11

140

105

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202510 11 15 14 24 27 45 53 53 38 77 67 80 89 89 76 117 113 66 89 84 106 98 110 122 123 96 98 113 126 107 112 10

合著作者

Meena MahajanThe Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, India在 imsc.res.in 的电子邮件经过验证
Santosh S. VempalaGeorgia Tech在 gatech.edu 的电子邮件经过验证
Petros DrineasProfessor, Computer Science Department, Purdue University在 purdue.edu 的电子邮件经过验证
Alan FriezeCarnegie Mellon University在 random.math.cmu.edu 的电子邮件经过验证
John HookerProfessor of Operations Research, Holleran Professor of Business Ethics, Carnegie Mellon University在 andrew.cmu.edu 的电子邮件经过验证
Eric AllenderRutgers University在 cs.rutgers.edu 的电子邮件经过验证
Manindra AgrawalProfessor of Computer Science, IIT Kanpur在 iitk.ac.in 的电子邮件经过验证
H. RameshProfessor of Computer Science, Indian Institute of Science, CTO, Strand Life Sciences在 strandls.com 的电子邮件经过验证
Vijay ChandruAdjunct faculty, BSSE, IISc, Bangalore在 strandls.com 的电子邮件经过验证
Michal KouckyCharles University, Prague在 iuuk.mff.cuni.cz 的电子邮件经过验证
Ramprasad SaptharishiTata Institute of Fundamental Research在 tifr.res.in 的电子邮件经过验证
Kristoffer Arnsfelt HansenAssociate Professor, Department of Computer Science, Aarhus University在 cs.au.dk 的电子邮件经过验证
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus University在 cs.au.dk 的电子邮件经过验证
Suryajith ChillaraAssistant Professor, IIIT Hyderabad在 iiit.ac.in 的电子邮件经过验证
Chiranjib BhattacharyyaProfessor, Indian Institute of Science在 csa.iisc.ernet.in 的电子邮件经过验证
Sambuddha RoyUnaffiliated - Deep Learning Consultant/Practitioner在 in.ibm.com 的电子邮件经过验证
Mathukumalli VidyasagarSERB National Science Chair, Indian Institute of Technology Hyderabad在 iith.ac.in 的电子邮件经过验证
Sathiya Keerthi SelvarajPrincipal Staff Scientist @ LinkedIn, Mountain View在 linkedin.com 的电子邮件经过验证

关注

Vinay V

Jed-i Technologies Pvt Ltd

在 jed-i.in 的电子邮件经过验证

Computational Complexity


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Clustering large graphs via the singular value decomposition P Drineas, A Frieze, R Kannan, S Vempala, V Vinay Machine learning 56, 9-33, 2004	967*	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	272	2008
Branching rules for satisfiability JN Hooker, V Vinay Journal of Automated Reasoning 15 (3), 359-383, 1995	245	1995
A combinatorial algorithm for the determinant M Mahajan, V Vinay SODA, 730-738, 1997	212*	1997
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. V Vinay SCT, 270-284, 1991	157	1991
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	116	1998
String matching in O (n+ m) quantum time H Ramesh, V Vinay Journal of Discrete Algorithms 1 (1), 103-110, 2003	112	2003
Analyzing the structure of large graphs R Kannan, V Vinay Universität Bonn. Institut für Ökonometrie und Operations Research, 1999	87	1999
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	48	1999
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	40	2001
A Circuit-Based Proof of Toda′ s Theorem R Kannan, H Venkateswaran, V Vinay, AC Yao Information and Computation 104 (2), 271-276, 1993	30	1993
String matching in Õ (sqrt (n)+ sqrt (m)) quantum time. R Hariharan, V Vinay J. Discrete Algorithms 1 (1), 103-110, 2003	23	2003
Semi-unboundedness and complexity classes V Vinay PhD thesis, Indian Institute of Science, Bangalore, 1991	17	1991
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	16	2016
Vinay. Clustering in large graphs and matrices V Kannan SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical …, 1999	15	1999
Circuits on cylinders KA Hansen, PB Miltersen, V Vinay computational complexity 15 (1), 62-81, 2006	13	2006
Circuits and context-free languages P McKenzie, K Reinhardt, V Vinay Computing and Combinatorics: 5th Annual International Conference, COCOON’99 …, 1999	13	1999
Hierarchies of circuit classes that are closed under complement V Vinay Proceedings of Computational Complexity (Formerly Structure in Complexity …, 1996	13	1996
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	9	2020

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

关注

引用次数

合著作者