Multivariable polynomial processing - Applications to interpolation. - E. V. Kriphnamurthy; H. Venkateswaran (IEEE Symposium on Computer Arithmetic, 1978)

Assemblers for Microcomputers. - S. Panchapakesan; H. Venkateswaran; S. Subramanian (Softw. Pract. Exp., 1979)

An Interactive Assembly Level Debugging System. - S. Panchapakesan; S. Subramanian; H. Venkateswaran (Softw. Pract. Exp., 1985)

A New Pebble Game That Characterizes Parallel Complexity Classes. - H. Venkateswaran; Martin Tompa (SIAM J. Comput., 1989)

Circuits, Pebbling and Expressibility. - V. Vinay; H. Venkateswaran; C. E. Veni Madhavan (SCT, 1990)

Properties that Characterize LOGCFL. - H. Venkateswaran (J. Comput. Syst. Sci., 1991)

Two Dynamic Programming Algorithms for Which Intepreted Pebbling Helps - H. Venkateswaran (Inf. Comput., 1991)

A Computational Model for Message Passing. - Anand Sivasubramaniam; Umakishore Ramachandran; H. Venkateswaran (IPPS, 1992)

Circuit Definitions of Nondeterministic Complexity Classes. - H. Venkateswaran (SIAM J. Comput., 1992)

A Circuit-Based Proof of Toda's Theorem - Ravi Kannan; H. Venkateswaran; V. Vinay; Andrew Chi-Chih Yao (Inf. Comput., 1993)

An Approach to Scalability Study of Shared Memory Parallel Systems. - Anand Sivasubramaniam; Aman Singla; Umakishore Ramachandran; H. Venkateswaran (SIGMETRICS, 1994)

A Simulation-Based Scalability Study of Parallel Systems. - Anand Sivasubramaniam; Aman Singla; Umakishore Ramachandran; H. Venkateswaran (J. Parallel Distributed Comput., 1994)

Abstracting Network Characteristics and Locality Properties of Parallel Systems. - Anand Sivasubramaniam; Aman Singla; Umakishore Ramachandran; H. Venkateswaran (HPCA, 1995)

On Characterizing Bandwidth Requirements of Parallel Applications. - Anand Sivasubramaniam; Aman Singla; Umakishore Ramachandran; H. Venkateswaran (SIGMETRICS, 1995)

A Lower Bound for Monotone Arithmetic Circuits Computing 0-1 Permanent. - Rimli Sengupta; H. Venkateswaran (Theor. Comput. Sci., 1998)

An Application-Driven Study of Parallel System Overheads and Network Bandwidth Requirements. - Anand Sivasubramaniam; Aman Singla; Umakishore Ramachandran; H. Venkateswaran (IEEE Trans. Parallel Distributed Syst., 1999)

Non-cancellative Boolean circuits: A generalization of monotone boolean circuits. - Rimli Sengupta; H. Venkateswaran (Theor. Comput. Sci., 2000)

A Secure and Highly Available Distributed Store for Meeting Diverse Data Storage Needs. - Subramanian Lakshmanan; Mustaque Ahamad; H. Venkateswaran (DSN, 2001)

Attack resistant cache replacement for survivable services. - Vinay Manivel; Mustaque Ahamad; H. Venkateswaran (SSRS@CCS, 2003)

Responsive Security for Stored Data. - Subramanian Lakshmanan; Mustaque Ahamad; H. Venkateswaran (IEEE Trans. Parallel Distributed Syst., 2003)

Collective Endorsement and the Dissemination Problem in Malicious Environments. - Subramanian Lakshmanan; Deepak J. Manohar; Mustaque Ahamad; H. Venkateswaran (DSN, 2004)

Parameterized Authentication. - Michael J. Covington; Mustaque Ahamad; Irfan A. Essa; H. Venkateswaran (ESORICS, 2004)

Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size. - Ashok Kumar Ponnuswami; H. Venkateswaran (FSTTCS, 2004)

Derandomization of Probabilistic Auxiliary Pushdown Automata Classes. - H. Venkateswaran (CCC, 2006)