Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Srinivasan, Venkatesh - Department of Computer Science, University of Victoria
International Journal of Foundations of Computer Science fl World Scientific Publishing Company
The communication complexity of pointer chasing Stephen J. Ponzio 1 Jaikumar Radhakrishnan 2 S. Venkatesh 2
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Optimal Separation of EROW and CROW PRAMs Navin Goyal 1 Michael Saks 2 S. Venkatesh 3
Pseudo-average block sensitivity equals average sensitivity S. Venkatesh
Rewriting of Visibly Pushdown Languages for XML Data Integration
Towards Practically Feasible Answering of Regular Path Queries in LAV Data Integration
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
On the Advantage over a Random Assignment*
Journal of Computer and System Sciences 74 (2008) 364385 www.elsevier.com/locate/jcss
SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 36, No. 6, pp. 17641776
The Quantum Complexity of Set Jaikumar Radhakrishnan Pranab Sen S. Venkatesh
Improved Bounds for Dictionary Look-up with One Error
Are bitvectors optimal? H. Buhrman 1 P. B. Miltersen 2 J. Radhakrishnan 3 S. Venkatesh 4
