The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

H. Venkateswaran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. H. Venkateswaran
    Derandomization of Probabilistic Auxiliary Pushdown Automata Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:355-370 [Conf]
  2. 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]
  3. Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran
    A Secure and Highly Available Distributed Store for Meeting Diverse Data Storage Needs. [Citation Graph (0, 0)][DBLP]
    DSN, 2001, pp:251-260 [Conf]
  4. Subramanian Lakshmanan, Deepak J. Manohar, Mustaque Ahamad, H. Venkateswaran
    Collective Endorsement and the Dissemination Problem in Malicious Environments. [Citation Graph (0, 0)][DBLP]
    DSN, 2004, pp:527-536 [Conf]
  5. Michael J. Covington, Mustaque Ahamad, Irfan A. Essa, H. Venkateswaran
    Parameterized Authentication. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2004, pp:276-292 [Conf]
  6. H. Venkateswaran, Martin Tompa
    A New Pebble Game that Characterizes Parallel Complexity Classes [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:348-360 [Conf]
  7. Ashok Kumar Ponnuswami, H. Venkateswaran
    Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:460-468 [Conf]
  8. Rimli Sengupta, H. Venkateswaran
    Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:298-309 [Conf]
  9. H. Venkateswaran
    Circuit Definitions of Nondeterministic Complexity Classes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:175-192 [Conf]
  10. Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
    Abstracting Network Characteristics and Locality Properties of Parallel Systems. [Citation Graph (0, 0)][DBLP]
    HPCA, 1995, pp:54-63 [Conf]
  11. Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran
    Responsive Security for Stored Data. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2003, pp:146-154 [Conf]
  12. Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran
    A Computational Model for Message Passing. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:358-361 [Conf]
  13. Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
    An Approach to Scalability Study of Shared Memory Parallel Systems. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1994, pp:171-180 [Conf]
  14. Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
    On Characterizing Bandwidth Requirements of Parallel Applications. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1995, pp:198-207 [Conf]
  15. H. Venkateswaran
    Properties that Characterize LOGCFL [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:141-150 [Conf]
  16. 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]
  17. H. Venkateswaran
    Two Dynamic Programming Algorithms for Which Intepreted Pebbling Helps [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:2, pp:237-252 [Journal]
  18. H. Venkateswaran
    Properties that Characterize LOGCFL. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:2, pp:380-404 [Journal]
  19. Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
    A Simulation-Based Scalability Study of Parallel Systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:22, n:3, pp:411-426 [Journal]
  20. H. Venkateswaran
    Circuit Definitions of Nondeterministic Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:4, pp:655-670 [Journal]
  21. H. Venkateswaran, Martin Tompa
    A New Pebble Game That Characterizes Parallel Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:533-549 [Journal]
  22. S. Panchapakesan, S. Subramanian, H. Venkateswaran
    An Interactive Assembly Level Debugging System. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1985, v:15, n:1, pp:59-64 [Journal]
  23. S. Panchapakesan, H. Venkateswaran, S. Subramanian
    Assemblers for Microcomputers. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1979, v:9, n:10, pp:843-852 [Journal]
  24. Rimli Sengupta, H. Venkateswaran
    Non-cancellative Boolean circuits: A generalization of monotone boolean circuits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:197-212 [Journal]
  25. Rimli Sengupta, H. Venkateswaran
    A Lower Bound for Monotone Arithmetic Circuits Computing 0-1 Permanent. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:389-398 [Journal]
  26. Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran
    Responsive Security for Stored Data. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:9, pp:818-828 [Journal]
  27. Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
    An Application-Driven Study of Parallel System Overheads and Network Bandwidth Requirements. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:3, pp:193-210 [Journal]

Search in 0.033secs, Finished in 0.035secs
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