Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Srinivasan
Last name:	Venkatesh
DBLP:	v/SrinivasanVenkatesh
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 27  

Select a publication
Show	Title	Venue	Rating	Date
	Alex Thomo, Srinivasan Venkatesh. Rewriting of visibly pushdown languages for xml data integration.	Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008 2008	(0)	2008
	Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye. Visibly Pushdown Transducers for Approximate Validation of Streaming XML.	Foundations of Information and Knowledge Systems, 5th International Symposium, FoIKS 2008, Pisa, Italy, February 11-15, 2008, Proceedings 2008	(0)	2008
	Pranab Sen, Srinivasan Venkatesh. Lower bounds for predecessor searching in the cell probe model.	J. Comput. Syst. Sci. 2008, Volume 74	(0)	2008
	Srinivasan Venkatesh. Approximate Dictionaries.	Encyclopedia of Algorithms 2008	(0)	2008
	Manuel Tamashiro, Alex Thomo, Srinivasan Venkatesh. Towards practically feasible answering of regular path queries in lav data integration.	Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, Lisbon, Portugal, November 6-10, 2007 2007	(0)	2007
	Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh. A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC).	Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings 2007	(0)	2007
	Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh. Communication vs. Computation.	Computational Complexity 2007, Volume 16	(0)	2007
	Kasturi R. Varadarajan, Srinivasan Venkatesh, Yinyu Ye, Jiawei Zhang. Approximating the Radii of Point Sets.	SIAM J. Comput. 2006, Volume 36	(0)	2007
	Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh. Communication Versus Computation.	Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings 2004	(0)	2004
	Johan Håstad, Srinivasan Venkatesh. On the advantage over a random assignment.	Random Struct. Algorithms 2004, Volume 25	(0)	2004
	Navin Goyal, Michael E. Saks, Srinivasan Venkatesh. Optimal Separation of EROW and CROWPRAMs.	18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark 2003	(0)	2003
	Pranab Sen, Srinivasan Venkatesh. Lower bounds for predecessor searching in the cell probe model	CoRR 2003, Volume 0	(0)	2003
	Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiawei Zhang. On Approximating the Radii of Point Sets in High Dimensions.	43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings 2002	(0)	2002
	Johan Håstad, Srinivasan Venkatesh. On the advantage over a random assignment.	STOC 2002	(0)	2002
	Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh. The Quantum Complexity of Set Membership.	Algorithmica 2002, Volume 34	(0)	2002
	Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh. Are Bitvectors Optimal?	SIAM J. Comput. 2001, Volume 31	(0)	2002
	Pranab Sen, Srinivasan Venkatesh. Lower Bounds in the Quantum Cell Probe Model.	Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings 2001	(0)	2001
	Pranab Sen, Srinivasan Venkatesh. Lower bounds in the quantum cell probe model	CoRR 2001, Volume 0	(0)	2001
	Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh. The Communication Complexity of Pointer Chasing.	J. Comput. Syst. Sci. 2001, Volume 62	(0)	2001
	Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh. The Quantum Complexity of Set Membership.	FOCS 2000	(0)	2000
	Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh. Are bitvectors optimal?	STOC 2000	(0)	2000
	Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh. The Quantum Complexity of Set Membership	CoRR 2000, Volume 0	(0)	2000
	Gerth Stølting Brodal, Srinivasan Venkatesh. Improved bounds for dictionary look-up with one error.	Inf. Process. Lett. 2000, Volume 75	(0)	2000
	Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh. The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract).	IEEE Conference on Computational Complexity 1999	(0)	1999
	Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh. The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling.	STOC 1999	(0)	1999

Your query returned 27 matches in the database.