Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Srinivasan Venkatesh
2010 – today
- 2012
[c15]Krishnan Rajagopalan, Srinivasan Venkatesh, Alex Thomo: Learning the News in Social Networks. FoIKS 2012: 298-311- 2011
- [j11]Alex Thomo, Srinivasan Venkatesh: Rewriting of visibly pushdown languages for XML data integration. Theor. Comput. Sci. 412(39): 5285-5297 (2011)
- [c14]Sean Chester, Alex Thomo, Srinivasan Venkatesh, Sue Whitesides: Indexing for Vector Projections. DASFAA (2) 2011: 367-376
2000 – 2009
- 2009
- [i4]Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh: A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC). IACR Cryptology ePrint Archive 2009: 461 (2009)
- 2008
- [j10]Pranab Sen, Srinivasan Venkatesh: Lower bounds for predecessor searching in the cell probe model. J. Comput. Syst. Sci. 74(3): 364-385 (2008)
- [c13]Alex Thomo, Srinivasan Venkatesh: Rewriting of visibly pushdown languages for xml data integration. CIKM 2008: 521-530
- [c12]Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye: Visibly Pushdown Transducers for Approximate Validation of Streaming XML. FoIKS 2008: 219-238
- [r1]
- 2007
- [j9]Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication vs. Computation. Computational Complexity 16(1): 1-33 (2007)
- [j8]Kasturi R. Varadarajan, Srinivasan Venkatesh, Yinyu Ye, Jiawei Zhang: Approximating the Radii of Point Sets. SIAM J. Comput. 36(6): 1764-1776 (2007)
- [c11]Manuel Tamashiro, Alex Thomo, Srinivasan Venkatesh: Towards practically feasible answering of regular path queries in lav data integration. CIKM 2007: 381-390
- [c10]Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh: A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). ICALP 2007: 328-339
- 2004
- [j7]Johan Håstad, Srinivasan Venkatesh: On the advantage over a random assignment. Random Struct. Algorithms 25(2): 117-149 (2004)
- [c9]Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication Versus Computation. ICALP 2004: 745-756
- 2003
- [c8]Navin Goyal, Michael E. Saks, Srinivasan Venkatesh: Optimal Separation of EROW and CROWPRAMs. IEEE Conference on Computational Complexity 2003: 93-
- [i3]Pranab Sen, Srinivasan Venkatesh: Lower bounds for predecessor searching in the cell probe model. CoRR cs.CC/0309033 (2003)
- 2002
- [j6]Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh: The Quantum Complexity of Set Membership. Algorithmica 34(4): 462-479 (2002)
- [j5]Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh: Are Bitvectors Optimal? SIAM J. Comput. 31(6): 1723-1744 (2002)
- [c7]Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiawei Zhang: On Approximating the Radii of Point Sets in High Dimensions. FOCS 2002: 561-569
- [c6]
- 2001
- [j4]Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh: The Communication Complexity of Pointer Chasing. J. Comput. Syst. Sci. 62(2): 323-355 (2001)
- [c5]
- [i2]Pranab Sen, Srinivasan Venkatesh: Lower bounds in the quantum cell probe model. CoRR quant-ph/0104100 (2001)
- 2000
- [j3]Gerth Stølting Brodal, Srinivasan Venkatesh: Improved bounds for dictionary look-up with one error. Inf. Process. Lett. 75(1-2): 57-59 (2000)
- [c4]Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh: The Quantum Complexity of Set Membership. FOCS 2000: 554-562
- [c3]Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh: Are bitvectors optimal? STOC 2000: 449-458
- [i1]Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh: The Quantum Complexity of Set Membership. CoRR quant-ph/0007021 (2000)
1990 – 1999
- 1999
- [c2]Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh: The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract). IEEE Conference on Computational Complexity 1999: 7
- [c1]Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh: The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling. STOC 1999: 602-611
- 1998
- [j2]Srinivasan Venkatesh: Pseudo-Average Block Sensitivity Equals Average Sensitivity. Inf. Process. Lett. 68(2): 93-95 (1998)
- 1996
- [j1]Manindra Agrawal, Srinivasan Venkatesh: On the Isomorphism Conjecture for 2-DFA Reductions. Int. J. Found. Comput. Sci. 7(4): 339-352 (1996)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-23 20:55 CET by the dblp team