H. Venkateswaran

发表

Properties that characterize LOGCFL

H. Venkateswaran, Logcfl H Venkatcswaran, 1987, J. Comput. Syst. Sci..

Circuit Definitions of Nondeterministic Complexity Classes

H. Venkateswaran, 1988, FSTTCS.

Synthesizing Network Requirements Using Parallel Scientific Applications

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1994 .

Multivariable polynomial processing — Applications to interpolation

H. Venkateswaran, E. V. Kriphnamurthy, 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

Abstracting network characteristics and locality properties of parallel systems

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1995, Proceedings of 1995 1st IEEE Symposium on High Performance Computer Architecture.

On characterizing bandwidth requirements of parallel applications

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1995, SIGMETRICS '95/PERFORMANCE '95.

A computational model for message-passing

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1992, Proceedings Sixth International Parallel Processing Symposium.

A Circuit-Based Proof of Toda's Theorem

Andrew Chi-Chih Yao, V. Vinay, H. Venkateswaran, 1993, Inf. Comput..

Properties that Characterize LOGCFL

H. Venkateswaran, 1991, J. Comput. Syst. Sci..

Structure of computations in parallel complexity classes

H. Venkateswaran, 1987 .

Derandomization of probabilistic auxiliary pushdown automata classes

H. Venkateswaran, 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

Circuits, pebbling and expressibility

V. Vinay, C. E. Veni Madhavan, H. Venkateswaran, 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

A Comparative Evaluation of Techniques for Studying Parallel Systems

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1994 .

Attack resistant cache replacement for survivable services

H. Venkateswaran, Mustaque Ahamad, Vinay Manivel, 2003, SSRS '03.

An interactive assembly level debugging system

S. Subramanian, H. Venkateswaran, S. Panchapakesan, 1985, Softw. Pract. Exp..

Collective endorsement and the dissemination problem in malicious environments

H. Venkateswaran, Mustaque Ahamad, Subramanian Lakshmanan, 2004, International Conference on Dependable Systems and Networks, 2004.

Responsive security for stored data

H. Venkateswaran, Mustaque Ahamad, Subramanian Lakshmanan, 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

A Lower Bound for Monotone Arithmetic Circuits Computing 0-1 Permanent

H. Venkateswaran, Rimli Sengupta, 1998, Theor. Comput. Sci..

A Simulation-Based Scalability Study of Parallel Systems

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1994, J. Parallel Distributed Comput..

Circuit Definitions of Nondeterministic Complexity Classes

H. Venkateswaran, 1992, SIAM J. Comput..

A New Pebble Game that Characterizes Parallel Complexity Classes

Martin Tompa, H. Venkateswaran, 1986, FOCS.

Studies in complexity theory : : a circuit based approach

H. Venkateswaran, 1993 .

Towards realizing scalable high performance parallel systems

Umakishore Ramachandran, H. Venkateswaran, 1994 .

A Comparative Evaluation of Techniques for Studying Parallel System Performance

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1994 .

Responsive Security for Stored Data

H. Venkateswaran, Mustaque Ahamad, Subramanian Lakshmanan, 2003, IEEE Trans. Parallel Distributed Syst..

Scalable Geographic Based Multicasting (SGBM) Protocol

H. Venkateswaran, A. John Prakash, 2011, CSE 2011.

Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits

H. Venkateswaran, Rimli Sengupta, 1996, FSTTCS.

A secure and highly available distributed store for meeting diverse data storage needs

H. Venkateswaran, Mustaque Ahamad, Subramanian Lakshmanan, 2001, 2001 International Conference on Dependable Systems and Networks.

Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size

H. Venkateswaran, Ashok Kumar Ponnuswami, 2004, FSTTCS.

An Application-Driven Study of Parallel System Overheads and Network Bandwidth Requirements

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1999, IEEE Trans. Parallel Distributed Syst..

An approach to scalability study of shared memory parallel systems

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1994, SIGMETRICS.

Machine Abstractions and Locality Issues in Studying Parallel Systems

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1993 .

A new pebble game that characterizes parallel complexity classes

Martin Tompa, H. Venkateswaran, M. Tompa, 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

Parameterized Authentication

Irfan A. Essa, H. Venkateswaran, Mustaque Ahamad, 2004, ESORICS.

Non-cancellative Boolean circuits: A generalization of monotone boolean circuits

H. Venkateswaran, Rimli Sengupta, 2000, Theor. Comput. Sci..

Issues in Understanding the Scalability of Parallel Systems

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1994 .

Two Dynamic Programming Algorithms for Which Intepreted Pebbling Helps

H. Venkateswaran, 1991, Inf. Comput..

Assemblers for micro‐computers

S. Subramanian, H. Venkateswaran, S. Panchapakesan, 1979, Softw. Pract. Exp..

Multilinearity Can Be Exponentially Restrictive (Preliminary Version)

H. Venkateswaran, Rimli Sengupta, 1994 .

Characterizations of parallel complexity classes

H. Venkateswaran, H. Venkateswaran, 1986 .

An approach to scalability study of shared memory parallel systems

Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran, 1994, SIGMETRICS.

A Crow or a Blackbird?: Using True Social Network and Tweeting Behavior to Detect Malicious Entities in Twitter

H. Venkateswaran, Mustaque Ahamad, Vijay A. Balasubramaniyan, 2010 .

A parallel wilf algorithm for complex zeros of a polynomial

E. V. Krishnamurthy, H. Venkateswaran, E. Krishnamurthy, 1981 .