V. Vinay

According to our database1, V. Vinay authored at least 31 papers between 1990 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
The Chasm at Depth Four, and Tensor Rank : Old results, new insights.
Electron. Colloquium Comput. Complex., 2016

2008
Quantum Finite Automata and Weighted Automata.
J. Autom. Lang. Comb., 2008

Arithmetic Circuits: A Chasm at Depth Four.
Electron. Colloquium Comput. Complex., 2008

2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.
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.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2006
Circuits on cylinders.
Comput. Complex., 2006

2004
Clustering Large Graphs via the Singular Value Decomposition.
Mach. Learn., 2004

The combinatorial approach yields an <sub>NC</sub> algorithm for computing Pfaffians.
Discret. Appl. Math., 2004

2003
String matching in Õ(sqrt(n)+sqrt(m)) quantum time.
J. Discrete Algorithms, 2003

2001
Time-Space Tradeoffs in the Counting Hierarchy
Electron. Colloquium Comput. Complex., 2001

2000
A note on the hardness of the characteristic polynomial
Electron. Colloquium Comput. Complex., 2000

Scheduling Algorithms for the Broadcast Delivery of Multimedia Products.
Proceedings of the Second International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems (WECWIS 2000), 2000

1999
Determinant: Old Algorithms, New Insights.
SIAM J. Discret. Math., 1999

A Combinatorial Algorithm for Pfaffians
Electron. Colloquium Comput. Complex., 1999

Clustering in Large Graphs and Matrices.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Circuits and Context-Free Languages.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds.
Theor. Comput. Sci., 1998

Determinant: Old Algorithms, New Insights (Extended Abstract).
Proceedings of the Algorithm Theory, 1998

1997
Determinant: Combinatorics, Algorithms, and Complexity.
Chic. J. Theor. Comput. Sci., 1997

A Combinatorial Algorithm for the Determinant.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
Hierarchies of Circuit Classes that are Closed under Complement.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
Branching Rules for Satisfiability.
J. Autom. Reason., 1995

Algorithms for the Optimal Loading of Recursive Neural Nets.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Logspace Verifiers, NC, and NP.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994
Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Branching Rules for Satisfiability (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993
A Circuit-Based Proof of Toda's Theorem
Inf. Comput., June, 1993

1991
Is BP.+<i>P</i> a Probabilistic Class?
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

Counting Auxiliary Pushdown Automata.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991

1990
The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

Circuits, Pebbling and Expressibility.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990


  Loading...