H. Venkateswaran

Affiliations:
  • Georgia Institute of Technology, Atlanta GA, USA


According to our database1, H. Venkateswaran authored at least 23 papers between 1978 and 2006.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2006
Derandomization of Probabilistic Auxiliary Pushdown Automata Classes.
Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2004
Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Parameterized Authentication.
Proceedings of the Computer Security, 2004

Collective Endorsement and the Dissemination Problem in Malicious Environments.
Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

2003
Responsive Security for Stored Data.
IEEE Trans. Parallel Distributed Syst., 2003

2001
A Secure and Highly Available Distributed Store for Meeting Diverse Data Storage Needs.
Proceedings of the 2001 International Conference on Dependable Systems and Networks (DSN 2001) (formerly: FTCS), 2001

2000
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits.
Theor. Comput. Sci., 2000

1999
An Application-Driven Study of Parallel System Overheads and Network Bandwidth Requirements.
IEEE Trans. Parallel Distributed Syst., 1999

1998
A Lower Bound for Monotone Arithmetic Circuits Computing 0-1 Permanent.
Theor. Comput. Sci., 1998

1995
On Characterizing Bandwidth Requirements of Parallel Applications.
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1995

Abstracting Network Characteristics and Locality Properties of Parallel Systems.
Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture (HPCA 1995), 1995

1994
A Simulation-Based Scalability Study of Parallel Systems.
J. Parallel Distributed Comput., 1994

An Approach to Scalability Study of Shared Memory Parallel Systems.
Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1994

1993
A Circuit-Based Proof of Toda's Theorem
Inf. Comput., June, 1993

1992
Circuit Definitions of Nondeterministic Complexity Classes.
SIAM J. Comput., 1992

A Computational Model for Message Passing.
Proceedings of the 6th International Parallel Processing Symposium, 1992

1991
Two Dynamic Programming Algorithms for Which Intepreted Pebbling Helps
Inf. Comput., June, 1991

Properties that Characterize LOGCFL.
J. Comput. Syst. Sci., 1991

1990
Circuits, Pebbling and Expressibility.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989
A New Pebble Game That Characterizes Parallel Complexity Classes.
SIAM J. Comput., 1989

1985
An Interactive Assembly Level Debugging System.
Softw. Pract. Exp., 1985

1979
Assemblers for Microcomputers.
Softw. Pract. Exp., 1979

1978
Multivariable polynomial processing - Applications to interpolation.
Proceedings of the 4th IEEE Symposium on Computer Arithmetic, 1978


  Loading...