ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 16.

Book Chapter

Chandru, V and Vidyasagar, M and Vinay, V (1997) Tractable theories for the synthesis of neural networks. [Book Chapter]

Conference Paper

Mahajan, M and Vinay, V (1998) Determinant: Old algorithms, new insights (Extended Abstract). In: 6th Scandinavian Workshop on Algorithm Theory (SWAT 98), JUL 08-10, 1998, Stockholm, Sweden.

Vinay, V (1996) Hierarchies of circuit classes that are closed under complement. In: 11th Annual IEEE Conference on Computational Complexity, MAY 24-27, 1996, PHILADELPHIA.

Chandru, V and Dattasharma, A and Keerthi, SS and Sancheti, NK and Vinay, V (1995) Algorithms for the optimal loading of recursive neural nets. In: of Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 Jan. 1995, San Francisco, CA, USA, pp. 342-349.

Vinay, V (1991) Counting Auxiliary Pushdown Automata and Semi-unbounded Arithmetic Circuits. In: Sixth Annual Structure in Complexity Theory Conference, 1991, 30th June - 3rd July, Chicago,IL, pp. 270-284.

Vinay, V (1991) Is BP.(+)P a probabilistic class? In: Foundations of Software Technology and Theoretical Computer Science, 17-19 Dec. 1991, New Delhi, India, pp. 261-265.

Vinay, V and Venkateswaran, H and Madhavan, Veni CE (1990) Circuits, Pebbling and Expressibility. In: Fifth Annual Structure in Complexity Theory Conference, 1990, 8-11 July, Barcelona, pp. 223-230.

Vinay, V and Chandru, V (1990) The expressibility of nondeterministic auxiliary stack automata and its relation to treesize bounded alternating auxiliary pushdown automata. In: Foundations of Software Technology and Theoretical Computer Science. Tenth Conference Proceedings, 17-19 Dec. 1990, Bangalore, India, pp. 104-114.

Journal Article

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

Mahajan, Meena and Subramanya, PR and Vinay, V (2004) The combinatorial approach yields an NC algorithm for computing Pfaffians. In: Discrete Applied Mathematics, 143 (1-3). pp. 1-16.

Drineas, P and Frieze, A and Kannan, R and Vempala, S and Vinay, V (2004) Clustering Large Graphs via the Singular Value Decomposition. In: Machine Learning, 56 (1-3). pp. 9-33.

Mahajan, Meena and Vinay, V (1999) Determinant: old algorithms, new insights. In: SIAM Journal on Discrete Mathematics, 12 (4). pp. 474-490.

Allender, Eric and Jiao, Jia and Mahajan, Meena and Vinay, V (1998) Non-commutative arithmetic circuits: depth reduction and size lower bounds. In: Theoretical Computer Science, 209 (1-2). pp. 47-86.

Vinay, V (1994) Rudiments of complexity theory for scientists and engineers. In: Sadhana :Academy Proceedings in Engineering Sciences, 19 (6). 985-994 .

Kannan, R and Venkateswaran, H and Vinay, V and Yao, AC (1993) A Circuit-Based Proof of Toda′s Theorem. In: Information and Computation, 104 (2). pp. 271-276.

Editorials/Short Communications

Hansen, Kristoffer Arnsfelt and Miltersen, Peter Bro and Vinay, V (2003) Circuits on cylinders. In: Lecture Notes in Computer Science, 2751 . pp. 171-182.

This list was generated on Wed Jul 23 05:49:37 2014 IST.