V. Vinay

M. V. Panduranga Rao, V. Vinay: Quantum Finite Automata and Weighted Automata. Journal of Automata, Languages and Combinatorics 13(2): 125-139 (2008)

Manindra Agrawal, V. Vinay: Arithmetic Circuits: A Chasm at Depth Four. FOCS 2008: 67-75

Ramesh Hariharan, Madhavan Mukund, V. Vinay: 2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: 10

Ramesh Hariharan, Madhavan Mukund, V. Vinay: 2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: i

Ramesh Hariharan, Madhavan Mukund, V. Vinay (Eds.): 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 fuer Informatik 2008

Manindra Agrawal, V. Vinay: Arithmetic Circuits: A Chasm at Depth Four. Electronic Colloquium on Computational Complexity (ECCC) 15(062) (2008)

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on cylinders. Computational Complexity 15(1): 62-81 (2006)

M. V. Panduranga Rao, V. Vinay: Quantum Finite Automata and Weighted Automata. ACiD 2005: 123-134

Meena Mahajan, P. R. Subramanya, V. Vinay: The combinatorial approach yields an _NC algorithm for computing Pfaffians. Discrete Applied Mathematics 143(1-3): 1-16 (2004)

Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay: Clustering Large Graphs via the Singular Value Decomposition. Machine Learning 56(1-3): 9-33 (2004)

Ramesh Hariharan, V. Vinay: String matching in Õ(sqrt(n)+sqrt(m)) quantum time. J. Discrete Algorithms 1(1): 103-110 (2003)

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on Cylinders. FCT 2003: 171-182

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on Cylinders. Electronic Colloquium on Computational Complexity (ECCC)(066) (2002)

Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay: Time-Space Tradeoffs in the Counting Hierarchy. IEEE Conference on Computational Complexity 2001: 295-302

Ramesh Hariharan, Madhavan Mukund, V. Vinay (Eds.): 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

Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay: Time-Space Tradeoffs in the Counting Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 8(41) (2001)

V. Vinay, Krithi Ramamritham: Scheduling Algorithms for the Broadcast Delivery of Multimedia Products. WECWIS 2000: 200-207

Meena Mahajan, V. Vinay: A note on the hardness of the characteristic polynomial. Electronic Colloquium on Computational Complexity (ECCC) 7(88) (2000)

Meena Mahajan, V. Vinay: Determinant: Old Algorithms, New Insights. SIAM J. Discrete Math. 12(4): 474-490 (1999)

Meena Mahajan, P. R. Subramanya, V. Vinay: A Combinatorial Algorithm for Pfaffians. COCOON 1999: 134-143

Pierre McKenzie, Klaus Reinhardt, V. Vinay: Circuits and Context-Free Languages. COCOON 1999: 194-203

Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay: Clustering in Large Graphs and Matrices. SODA 1999: 291-299

Meena Mahajan, P. R. Subramanya, V. Vinay: A Combinatorial Algorithm for Pfaffians. Electronic Colloquium on Computational Complexity (ECCC) 6(30) (1999)

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)

Meena Mahajan, V. Vinay: Determinant: Old Algorithms, New Insights (Extended Abstract). SWAT 1998: 276-287

Meena Mahajan, V. Vinay: Determinant: Old Algorithms, New Insights. Electronic Colloquium on Computational Complexity (ECCC) 5(12) (1998)

Meena Mahajan, V. Vinay: Determinant: Combinatorics, Algorithms, and Complexity. Chicago J. Theor. Comput. Sci. 1997 (1997)

Meena Mahajan, V. Vinay: A Combinatorial Algorithm for the Determinant. SODA 1997: 730-738

Meena Mahajan, V. Vinay: Determinant: Combinatorics, Algorithms, and Complexity. Electronic Colloquium on Computational Complexity (ECCC) 4(36) (1997)

V. Vinay: Hierarchies of Circuit Classes that are Closed under Complement. IEEE Conference on Computational Complexity 1996: 108-117

Vijay Chandru, V. Vinay (Eds.): 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

John N. Hooker, V. Vinay: Branching Rules for Satisfiability. J. Autom. Reasoning 15(3): 359-383 (1995)

Satyanarayana V. Lokam, Meena Mahajan, V. Vinay: Logspace Verifiers, NC, and NP. ISAAC 1995: 52-61

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

Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay: Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 2(43) (1995)

Meena Mahajan, V. Vinay: Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract). FSTTCS 1994: 48-59

John N. Hooker, V. Vinay: Branching Rules for Satisfiability (Extended Abstract). FSTTCS 1994: 426-437

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)

V. Vinay: Counting Auxiliary Pushdown Automata. Structure in Complexity Theory Conference 1991: 270-284

V. Vinay: Is BP.+P a Probabilistic Class? FSTTCS 1991: 261-265

V. Vinay, H. Venkateswaran, C. E. Veni Madhavan: Circuits, Pebbling and Expressibility. Structure in Complexity Theory Conference 1990: 223-230

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