default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDV. Vinay
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[i10]Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay:
The Chasm at Depth Four, and Tensor Rank : Old results, new insights. CoRR abs/1606.04200 (2016)- [i9]Suryajith Chillara, Mrinal Kumar, Ramprasad Saptharishi, V. Vinay:
The Chasm at Depth Four, and Tensor Rank : Old results, new insights. Electron. Colloquium Comput. Complex. TR16 (2016)
2000 – 2009
- 2008
- [j10]M. V. Panduranga Rao, V. Vinay:
Quantum Finite Automata and Weighted Automata. J. Autom. Lang. Comb. 13(2): 125-139 (2008) - [c21]Manindra Agrawal, V. Vinay:
Arithmetic Circuits: A Chasm at Depth Four. FOCS 2008: 67-75 - [c20]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: 10 - [c19]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: i - [e3]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India. LIPIcs 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2008 [contents] - [i8]Manindra Agrawal, V. Vinay:
Arithmetic Circuits: A Chasm at Depth Four. Electron. Colloquium Comput. Complex. TR08 (2008) - 2006
- [j9]Kristoffer Arnsfelt Hansen
, Peter Bro Miltersen, V. Vinay:
Circuits on cylinders. Comput. Complex. 15(1): 62-81 (2006) - 2005
- [c18]M. V. Panduranga Rao, V. Vinay:
Quantum Finite Automata and Weighted Automata. ACiD 2005: 123-134 - 2004
- [j8]Meena Mahajan, P. R. Subramanya, V. Vinay:
The combinatorial approach yields an NC algorithm for computing Pfaffians. Discret. Appl. Math. 143(1-3): 1-16 (2004) - [j7]Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala, V. Vinay:
Clustering Large Graphs via the Singular Value Decomposition. Mach. Learn. 56(1-3): 9-33 (2004) - 2003
- [j6]Ramesh Hariharan, V. Vinay:
String matching in Õ(sqrt(n)+sqrt(m)) quantum time. J. Discrete Algorithms 1(1): 103-110 (2003) - [c17]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay:
Circuits on Cylinders. FCT 2003: 171-182 - 2002
- [i7]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay:
Circuits on Cylinders. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [c16]Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay:
Time-Space Tradeoffs in the Counting Hierarchy. CCC 2001: 295-302 - [e2]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings. Lecture Notes in Computer Science 2245, Springer 2001, ISBN 3-540-43002-4 [contents] - [i6]Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay:
Time-Space Tradeoffs in the Counting Hierarchy. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c15]V. Vinay, Krithi Ramamritham:
Scheduling Algorithms for the Broadcast Delivery of Multimedia Products. WECWIS 2000: 200-207 - [i5]Meena Mahajan, V. Vinay:
A note on the hardness of the characteristic polynomial. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j5]Meena Mahajan, V. Vinay:
Determinant: Old Algorithms, New Insights. SIAM J. Discret. Math. 12(4): 474-490 (1999) - [c14]Meena Mahajan, P. R. Subramanya, V. Vinay:
A Combinatorial Algorithm for Pfaffians. COCOON 1999: 134-143 - [c13]Pierre McKenzie, Klaus Reinhardt, V. Vinay:
Circuits and Context-Free Languages. COCOON 1999: 194-203 - [c12]Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala, V. Vinay:
Clustering in Large Graphs and Matrices. SODA 1999: 291-299 - [i4]Meena Mahajan, P. R. Subramanya, V. Vinay:
A Combinatorial Algorithm for Pfaffians. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j4]Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay:
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. Theor. Comput. Sci. 209(1-2): 47-86 (1998) - [c11]Meena Mahajan, V. Vinay:
Determinant: Old Algorithms, New Insights (Extended Abstract). SWAT 1998: 276-287 - [i3]Meena Mahajan, V. Vinay:
Determinant: Old Algorithms, New Insights. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j3]Meena Mahajan, V. Vinay:
Determinant: Combinatorics, Algorithms, and Complexity. Chic. J. Theor. Comput. Sci. 1997 (1997) - [c10]Meena Mahajan, V. Vinay:
A Combinatorial Algorithm for the Determinant. SODA 1997: 730-738 - [i2]Meena Mahajan, V. Vinay:
Determinant: Combinatorics, Algorithms, and Complexity. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [c9]V. Vinay:
Hierarchies of Circuit Classes that are Closed under Complement. CCC 1996: 108-117 - [e1]Vijay Chandru, V. Vinay:
Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings. Lecture Notes in Computer Science 1180, Springer 1996, ISBN 3-540-62034-6 [contents] - 1995
- [j2]John N. Hooker, V. Vinay:
Branching Rules for Satisfiability. J. Autom. Reason. 15(3): 359-383 (1995) - [c8]Satyanarayana V. Lokam, Meena Mahajan, V. Vinay:
Logspace Verifiers, NC, and NP. ISAAC 1995: 52-61 - [c7]Vijay Chandru, Abhi Dattasharma, S. Sathiya Keerthi, N. K. Sancheti, V. Vinay:
Algorithms for the Optimal Loading of Recursive Neural Nets. SODA 1995: 342-349 - [i1]Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay:
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [c6]Meena Mahajan, V. Vinay:
Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract). FSTTCS 1994: 48-59 - [c5]John N. Hooker, V. Vinay:
Branching Rules for Satisfiability (Extended Abstract). FSTTCS 1994: 426-437 - 1993
- [j1]Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao:
A Circuit-Based Proof of Toda's Theorem. Inf. Comput. 104(2): 271-276 (1993) - 1991
- [c4]V. Vinay:
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. SCT 1991: 270-284 - [c3]V. Vinay:
Is BP.+P a Probabilistic Class? FSTTCS 1991: 261-265 - 1990
- [c2]V. Vinay, H. Venkateswaran, C. E. Veni Madhavan:
Circuits, Pebbling and Expressibility. SCT 1990: 223-230 - [c1]V. Vinay, V. Chandru:
The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata. FSTTCS 1990: 104-114
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
