H. Venkateswaran

29 papers A* 5A 5C 1Journal 12Unranked 6

Year	Rank	Type	Title / Venue / Authors
2006	A	`conf`	Derandomization of Probabilistic Auxiliary Pushdown Automata Classes. CCC H. Venkateswaran
2004	A	`conf`	Collective Endorsement and the Dissemination Problem in Malicious Environments. DSN Subramanian Lakshmanan, Deepak J. Manohar, Mustaque Ahamad, H. Venkateswaran
2004	—	`conf`	Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size. FSTTCS Ashok Kumar Ponnuswami, H. Venkateswaran
2004	A	`conf`	Parameterized Authentication. ESORICS Michael J. Covington, Mustaque Ahamad, Irfan A. Essa, H. Venkateswaran
2003	—	`conf`	Attack resistant cache replacement for survivable services. SSRS@CCS Vinay Manivel, Mustaque Ahamad, H. Venkateswaran
2003	A	`conf`	Responsive Security for Stored Data. ICDCS Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran
2003	J	`jnl`	Responsive Security for Stored Data. IEEE Trans. Parallel Distributed Syst. Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran
2001	A	`conf`	A Secure and Highly Available Distributed Store for Meeting Diverse Data Storage Needs. DSN Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran
2000	J	`jnl`	Non-cancellative Boolean circuits: A generalization of monotone boolean circuits. Theor. Comput. Sci. Rimli Sengupta, H. Venkateswaran
1999	J	`jnl`	An Application-Driven Study of Parallel System Overheads and Network Bandwidth Requirements. IEEE Trans. Parallel Distributed Syst. Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
1998	J	`jnl`	A Lower Bound for Monotone Arithmetic Circuits Computing 0-1 Permanent. Theor. Comput. Sci. Rimli Sengupta, H. Venkateswaran
1996	—	`conf`	Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits. FSTTCS Rimli Sengupta, H. Venkateswaran
1995	A*	`conf`	Abstracting Network Characteristics and Locality Properties of Parallel Systems. HPCA Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
1995	A*	`conf`	On Characterizing Bandwidth Requirements of Parallel Applications. SIGMETRICS Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
1994	J	`jnl`	A Simulation-Based Scalability Study of Parallel Systems. J. Parallel Distributed Comput. Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
1994	A*	`conf`	An Approach to Scalability Study of Shared Memory Parallel Systems. SIGMETRICS Anand Sivasubramaniam, Aman Singla, Umakishore Ramachandran, H. Venkateswaran
1993	J	`jnl`	A Circuit-Based Proof of Toda's Theorem Inf. Comput. Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao
1992	—	`conf`	A Computational Model for Message Passing. IPPS Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran
1992	J	`jnl`	Circuit Definitions of Nondeterministic Complexity Classes. SIAM J. Comput. H. Venkateswaran
1991	J	`jnl`	Properties that Characterize LOGCFL. J. Comput. Syst. Sci. H. Venkateswaran
1991	J	`jnl`	Two Dynamic Programming Algorithms for Which Intepreted Pebbling Helps Inf. Comput. H. Venkateswaran
1990	—	`conf`	Circuits, Pebbling and Expressibility. SCT V. Vinay, H. Venkateswaran, C. E. Veni Madhavan
1989	J	`jnl`	A New Pebble Game That Characterizes Parallel Complexity Classes. SIAM J. Comput. H. Venkateswaran, Martin Tompa
1988	—	`conf`	Circuit Definitions of Nondeterministic Complexity Classes. FSTTCS H. Venkateswaran
1987	A*	`conf`	Properties that Characterize LOGCFL STOC H. Venkateswaran
1986	A*	`conf`	A New Pebble Game that Characterizes Parallel Complexity Classes FOCS H. Venkateswaran, Martin Tompa
1985	J	`jnl`	An Interactive Assembly Level Debugging System. Softw. Pract. Exp. S. Panchapakesan, S. Subramanian, H. Venkateswaran
1979	J	`jnl`	Assemblers for Microcomputers. Softw. Pract. Exp. S. Panchapakesan, H. Venkateswaran, S. Subramanian
1978	C	`conf`	Multivariable polynomial processing - Applications to interpolation. IEEE Symposium on Computer Arithmetic E. V. Kriphnamurthy, H. Venkateswaran