Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Venkateswaran, H. - College of Computing, Georgia Institute of Technology
Parameterized Authentication Michael J. Covington, Mustaque Ahamad, Irfan Essa, and H. Venkateswaran
Circuits, Pebbling and Expressibility V. Vinay, H. Venkateswaran 1 and C.E. Veni Madhavan
Collective Endorsement and the Dissemination Problem in Malicious Environments
Responsive Security for Stored Data Subramanian Lakshmanan Mustaque Ahamad
An Applicationdriven Study of Parallel System Overheads and Network
A New Pebble Game That Characterizes Parallel Complexity H. Venkateswaran
Circuit Definitions of Nondeterministic Complexity Classes 1
Properties that Characterize LOGCFL H. Venkateswaran
A Lower Bound for Monotone Arithmetic Circuits Computing 01 Permanent \Lambda
A CircuitBased Proof of Toda's Theorem Ravi Kannan \Lambda
Noncancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits \Lambda
Two Dynamic Programming Algorithms for Which Interpreted Pebbling Helps
