V. Vinay

This page is a disambiguation page, it actually contains mutiple papers from persons of the same or a similar name.

Bibliography

2016

The Chasm at Depth Four, and Tensor Rank : Old results, new insights.

[BibT_eX]

[DOI]

Suryajith Chillara

Mrinal Kumar

Ramprasad Saptharishi

V. Vinay

Electron. Colloquium Comput. Complex., 2016

2008

Quantum Finite Automata and Weighted Automata.

[BibT_eX]

[DOI]

M. V. Panduranga Rao

V. Vinay

J. Autom. Lang. Comb., 2008

Arithmetic Circuits: A Chasm at Depth Four.

[BibT_eX]

[DOI]

Manindra Agrawal

V. Vinay

Electron. Colloquium Comput. Complex., 2008

2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.

[BibT_eX]

[DOI]

Ramesh Hariharan

Madhavan Mukund

V. Vinay

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.

[BibT_eX]

[DOI]

Ramesh Hariharan

Madhavan Mukund

V. Vinay

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2006

Circuits on cylinders.

[BibT_eX]

[DOI]

Kristoffer Arnsfelt Hansen

Peter Bro Miltersen

V. Vinay

Comput. Complex., 2006

2004

Clustering Large Graphs via the Singular Value Decomposition.

[BibT_eX]

[DOI]

Mach. Learn., 2004

The combinatorial approach yields an <sub>NC</sub> algorithm for computing Pfaffians.

[BibT_eX]

[DOI]

Meena Mahajan

P. R. Subramanya

V. Vinay

Discret. Appl. Math., 2004

2003

String matching in Õ(sqrt(n)+sqrt(m)) quantum time.

[BibT_eX]

[DOI]

Ramesh Hariharan

V. Vinay

J. Discrete Algorithms, 2003

2001

Time-Space Tradeoffs in the Counting Hierarchy

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

2000

A note on the hardness of the characteristic polynomial

[BibT_eX]

[DOI]

Meena Mahajan

V. Vinay

Electron. Colloquium Comput. Complex., 2000

Scheduling Algorithms for the Broadcast Delivery of Multimedia Products.

[BibT_eX]

[DOI]

V. Vinay

Krithi Ramamritham

Proceedings of the Second International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems (WECWIS 2000), 2000

1999

A Combinatorial Algorithm for Pfaffians

[BibT_eX]

[DOI]

Meena Mahajan

P. R. Subramanya

V. Vinay

Electron. Colloquium Comput. Complex., 1999

Clustering in Large Graphs and Matrices.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Circuits and Context-Free Languages.

[BibT_eX]

[DOI]

Pierre McKenzie

Klaus Reinhardt

V. Vinay

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Determinant: Old Algorithms, New Insights

[BibT_eX]

[DOI]

Meena Mahajan

V. Vinay

Electron. Colloquium Comput. Complex., 1998

Determinant: Old Algorithms, New Insights (Extended Abstract).

[BibT_eX]

[DOI]

Meena Mahajan

V. Vinay

Proceedings of the Algorithm Theory, 1998

1997

Determinant: Combinatorics, Algorithms, and Complexity.

[BibT_eX]

[DOI]

Meena Mahajan

V. Vinay

Chic. J. Theor. Comput. Sci., 1997

A Combinatorial Algorithm for the Determinant.

[BibT_eX]

[DOI]

Meena Mahajan

V. Vinay

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Hierarchies of Circuit Classes that are Closed under Complement.

[BibT_eX]

[DOI]

V. Vinay

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995

Branching Rules for Satisfiability.

[BibT_eX]

[DOI]

John N. Hooker

V. Vinay

J. Autom. Reason., 1995

Algorithms for the Optimal Loading of Recursive Neural Nets.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Logspace Verifiers, NC, and NP.

[BibT_eX]

[DOI]

Satyanarayana V. Lokam

Meena Mahajan

V. Vinay

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract).

[BibT_eX]

[DOI]

Meena Mahajan

V. Vinay

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Branching Rules for Satisfiability (Extended Abstract).

[BibT_eX]

[DOI]

John N. Hooker

V. Vinay

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993

A Circuit-Based Proof of Toda's Theorem

[BibT_eX]

[DOI]

Inf. Comput., June, 1993

1991

Is BP.+<i>P</i> a Probabilistic Class?

[BibT_eX]

[DOI]

V. Vinay

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits.

[BibT_eX]

[DOI]

V. Vinay

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1990

The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata.

[BibT_eX]

[DOI]

V. Vinay

V. Chandru

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

Circuits, Pebbling and Expressibility.

[BibT_eX]

[DOI]

V. Vinay

H. Venkateswaran

C. E. Veni Madhavan

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

V. Vinay

Bibliography

Loading...