The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

V. Vinay: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. M. V. Panduranga Rao, V. Vinay
    Quantum Finite Automata and Weighted Automata. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:123-134 [Conf]
  2. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
    Time-Space Tradeoffs in the Counting Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:295-302 [Conf]
  3. V. Vinay
    Counting Auxiliary Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:270-284 [Conf]
  4. V. Vinay
    Hierarchies of Circuit Classes that are Closed under Complement. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:108-117 [Conf]
  5. V. Vinay, H. Venkateswaran, C. E. Veni Madhavan
    Circuits, Pebbling and Expressibility. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:223-230 [Conf]
  6. Meena Mahajan, P. R. Subramanya, V. Vinay
    A Combinatorial Algorithm for Pfaffians. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:134-143 [Conf]
  7. Pierre McKenzie, Klaus Reinhardt, V. Vinay
    Circuits and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:194-203 [Conf]
  8. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
    Circuits on Cylinders. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:171-182 [Conf]
  9. John N. Hooker, V. Vinay
    Branching Rules for Satisfiability (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:426-437 [Conf]
  10. Meena Mahajan, V. Vinay
    Non-commutative Computation, Depth Reduction, and Skew Circuits (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:48-59 [Conf]
  11. V. Vinay
    Is BP.+P a Probabilistic Class? [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:261-265 [Conf]
  12. V. Vinay, V. Chandru
    The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:104-114 [Conf]
  13. Satyanarayana V. Lokam, Meena Mahajan, V. Vinay
    Logspace Verifiers, NC, and NP. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:52-61 [Conf]
  14. Vijay Chandru, Abhi Dattasharma, S. Sathiya Keerthi, N. K. Sancheti, V. Vinay
    Algorithms for the Optimal Loading of Recursive Neural Nets. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:342-349 [Conf]
  15. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
    Clustering in Large Graphs and Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:291-299 [Conf]
  16. Meena Mahajan, V. Vinay
    A Combinatorial Algorithm for the Determinant. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:730-738 [Conf]
  17. Meena Mahajan, V. Vinay
    Determinant: Old Algorithms, New Insights (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:276-287 [Conf]
  18. V. Vinay, Krithi Ramamritham
    Scheduling Algorithms for the Broadcast Delivery of Multimedia Products. [Citation Graph (0, 0)][DBLP]
    WECWIS, 2000, pp:200-207 [Conf]
  19. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
    Circuits on cylinders. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:1, pp:62-81 [Journal]
  20. Meena Mahajan, V. Vinay
    Determinant: Combinatorics, Algorithms, and Complexity. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1997, v:1997, n:, pp:- [Journal]
  21. Meena Mahajan, P. R. Subramanya, V. Vinay
    The combinatorial approach yields an NC algorithm for computing Pfaffians. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:1-16 [Journal]
  22. Meena Mahajan, V. Vinay
    A note on the hardness of the characteristic polynomial [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:88, pp:- [Journal]
  23. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
    Time-Space Tradeoffs in the Counting Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:41, pp:- [Journal]
  24. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
    Circuits on Cylinders [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:066, pp:- [Journal]
  25. Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay
    Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:43, pp:- [Journal]
  26. Meena Mahajan, V. Vinay
    Determinant: Combinatorics, Algorithms, and Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:36, pp:- [Journal]
  27. Meena Mahajan, V. Vinay
    Determinant: Old Algorithms, New Insights [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:12, pp:- [Journal]
  28. Meena Mahajan, P. R. Subramanya, V. Vinay
    A Combinatorial Algorithm for Pfaffians [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:30, pp:- [Journal]
  29. Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao
    A Circuit-Based Proof of Toda's Theorem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:2, pp:271-276 [Journal]
  30. John N. Hooker, V. Vinay
    Branching Rules for Satisfiability. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1995, v:15, n:3, pp:359-383 [Journal]
  31. Ramesh Hariharan, V. Vinay
    String matching in Õ(sqrt(n)+sqrt(m)) quantum time. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:103-110 [Journal]
  32. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
    Clustering Large Graphs via the Singular Value Decomposition. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:56, n:1-3, pp:9-33 [Journal]
  33. Meena Mahajan, V. Vinay
    Determinant: Old Algorithms, New Insights. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:474-490 [Journal]
  34. Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay
    Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:47-86 [Journal]

  35. Arithmetic Circuits: A Chasm at Depth Four. [Citation Graph (, )][DBLP]


  36. 2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. [Citation Graph (, )][DBLP]


  37. 2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. [Citation Graph (, )][DBLP]


  38. Arithmetic Circuits: A Chasm at Depth Four. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002