default search action
H. Venkateswaran
Person information
- affiliation: Georgia Institute of Technology, Atlanta GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [c17]H. Venkateswaran:
Derandomization of Probabilistic Auxiliary Pushdown Automata Classes. CCC 2006: 355-370 - 2004
- [c16]Subramanian Lakshmanan, Deepak J. Manohar, Mustaque Ahamad, H. Venkateswaran:
Collective Endorsement and the Dissemination Problem in Malicious Environments. DSN 2004: 527-536 - [c15]Michael J. Covington, Mustaque Ahamad, Irfan A. Essa, H. Venkateswaran:
Parameterized Authentication. ESORICS 2004: 276-292 - [c14]Ashok Kumar Ponnuswami, H. Venkateswaran:
Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size. FSTTCS 2004: 460-468 - 2003
- [j12]Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran:
Responsive Security for Stored Data. IEEE Trans. Parallel Distributed Syst. 14(9): 818-828 (2003) - [c13]Vinay Manivel, Mustaque Ahamad, H. Venkateswaran:
Attack resistant cache replacement for survivable services. SSRS@CCS 2003: 64-71 - [c12]Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran:
Responsive Security for Stored Data. ICDCS 2003: 146-154 - 2001
- [c11]Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran:
A Secure and Highly Available Distributed Store for Meeting Diverse Data Storage Needs. DSN 2001: 251-260 - 2000
- [j11]Rimli Sengupta, H. Venkateswaran:
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits. Theor. Comput. Sci. 237(1-2): 197-212 (2000)
1990 – 1999
- 1999
- [j10]Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran:
An Application-Driven Study of Parallel System Overheads and Network Bandwidth Requirements. IEEE Trans. Parallel Distributed Syst. 10(3): 193-210 (1999) - 1998
- [j9]Rimli Sengupta, H. Venkateswaran:
A Lower Bound for Monotone Arithmetic Circuits Computing 0-1 Permanent. Theor. Comput. Sci. 209(1-2): 389-398 (1998) - 1996
- [c10]Rimli Sengupta, H. Venkateswaran:
Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits. FSTTCS 1996: 298-309 - 1995
- [c9]Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran:
Abstracting Network Characteristics and Locality Properties of Parallel Systems. HPCA 1995: 54-63 - [c8]Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran:
On Characterizing Bandwidth Requirements of Parallel Applications. SIGMETRICS 1995: 198-207 - 1994
- [j8]Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran:
A Simulation-Based Scalability Study of Parallel Systems. J. Parallel Distributed Comput. 22(3): 411-426 (1994) - [c7]Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran:
An Approach to Scalability Study of Shared Memory Parallel Systems. SIGMETRICS 1994: 171-180 - 1993
- [j7]Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao:
A Circuit-Based Proof of Toda's Theorem. Inf. Comput. 104(2): 271-276 (1993) - 1992
- [j6]H. Venkateswaran:
Circuit Definitions of Nondeterministic Complexity Classes. SIAM J. Comput. 21(4): 655-670 (1992) - [c6]Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran:
A Computational Model for Message Passing. IPPS 1992: 358-361 - 1991
- [j5]H. Venkateswaran:
Two Dynamic Programming Algorithms for Which Intepreted Pebbling Helps. Inf. Comput. 92(2): 237-252 (1991) - [j4]H. Venkateswaran:
Properties that Characterize LOGCFL. J. Comput. Syst. Sci. 43(2): 380-404 (1991) - 1990
- [c5]V. Vinay, H. Venkateswaran, C. E. Veni Madhavan:
Circuits, Pebbling and Expressibility. SCT 1990: 223-230
1980 – 1989
- 1989
- [j3]H. Venkateswaran, Martin Tompa:
A New Pebble Game That Characterizes Parallel Complexity Classes. SIAM J. Comput. 18(3): 533-549 (1989) - 1988
- [c4]H. Venkateswaran:
Circuit Definitions of Nondeterministic Complexity Classes. FSTTCS 1988: 175-192 - 1987
- [c3]H. Venkateswaran:
Properties that Characterize LOGCFL. STOC 1987: 141-150 - 1986
- [c2]H. Venkateswaran, Martin Tompa:
A New Pebble Game that Characterizes Parallel Complexity Classes. FOCS 1986: 348-360 - 1985
- [j2]S. Panchapakesan, S. Subramanian, H. Venkateswaran:
An Interactive Assembly Level Debugging System. Softw. Pract. Exp. 15(1): 59-64 (1985)
1970 – 1979
- 1979
- [j1]S. Panchapakesan, H. Venkateswaran, S. Subramanian:
Assemblers for Microcomputers. Softw. Pract. Exp. 9(10): 843-852 (1979) - 1978
- [c1]E. V. Kriphnamurthy, H. Venkateswaran:
Multivariable polynomial processing - Applications to interpolation. IEEE Symposium on Computer Arithmetic 1978: 81-87
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: