2008 |
27 | EE | Alex Thomo,
Srinivasan Venkatesh:
Rewriting of visibly pushdown languages for xml data integration.
CIKM 2008: 521-530 |
26 | EE | Alex Thomo,
Srinivasan Venkatesh,
Ying Ying Ye:
Visibly Pushdown Transducers for Approximate Validation of Streaming XML.
FoIKS 2008: 219-238 |
25 | EE | Srinivasan Venkatesh:
Approximate Dictionaries.
Encyclopedia of Algorithms 2008 |
24 | EE | Pranab Sen,
Srinivasan Venkatesh:
Lower bounds for predecessor searching in the cell probe model.
J. Comput. Syst. Sci. 74(3): 364-385 (2008) |
2007 |
23 | EE | Manuel Tamashiro,
Alex Thomo,
Srinivasan Venkatesh:
Towards practically feasible answering of regular path queries in lav data integration.
CIKM 2007: 381-390 |
22 | EE | Bruce M. Kapron,
Lior Malka,
Srinivasan Venkatesh:
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC).
ICALP 2007: 328-339 |
21 | EE | Prahladh Harsha,
Yuval Ishai,
Joe Kilian,
Kobbi Nissim,
Srinivasan Venkatesh:
Communication vs. Computation.
Computational Complexity 16(1): 1-33 (2007) |
20 | EE | Kasturi R. Varadarajan,
Srinivasan Venkatesh,
Yinyu Ye,
Jiawei Zhang:
Approximating the Radii of Point Sets.
SIAM J. Comput. 36(6): 1764-1776 (2007) |
2004 |
19 | EE | Prahladh Harsha,
Yuval Ishai,
Joe Kilian,
Kobbi Nissim,
Srinivasan Venkatesh:
Communication Versus Computation.
ICALP 2004: 745-756 |
18 | EE | Johan Håstad,
Srinivasan Venkatesh:
On the advantage over a random assignment.
Random Struct. Algorithms 25(2): 117-149 (2004) |
2003 |
17 | EE | Navin Goyal,
Michael E. Saks,
Srinivasan Venkatesh:
Optimal Separation of EROW and CROWPRAMs.
IEEE Conference on Computational Complexity 2003: 93- |
16 | EE | Pranab Sen,
Srinivasan Venkatesh:
Lower bounds for predecessor searching in the cell probe model
CoRR cs.CC/0309033: (2003) |
2002 |
15 | EE | Kasturi R. Varadarajan,
Srinivasan Venkatesh,
Jiawei Zhang:
On Approximating the Radii of Point Sets in High Dimensions.
FOCS 2002: 561-569 |
14 | EE | Johan Håstad,
Srinivasan Venkatesh:
On the advantage over a random assignment.
STOC 2002: 43-52 |
13 | EE | Jaikumar Radhakrishnan,
Pranab Sen,
Srinivasan Venkatesh:
The Quantum Complexity of Set Membership.
Algorithmica 34(4): 462-479 (2002) |
12 | EE | Harry Buhrman,
Peter Bro Miltersen,
Jaikumar Radhakrishnan,
Srinivasan Venkatesh:
Are Bitvectors Optimal?
SIAM J. Comput. 31(6): 1723-1744 (2002) |
2001 |
11 | EE | Pranab Sen,
Srinivasan Venkatesh:
Lower Bounds in the Quantum Cell Probe Model.
ICALP 2001: 358-369 |
10 | EE | Pranab Sen,
Srinivasan Venkatesh:
Lower bounds in the quantum cell probe model
CoRR quant-ph/0104100: (2001) |
9 | | Stephen Ponzio,
Jaikumar Radhakrishnan,
Srinivasan Venkatesh:
The Communication Complexity of Pointer Chasing.
J. Comput. Syst. Sci. 62(2): 323-355 (2001) |
2000 |
8 | | Jaikumar Radhakrishnan,
Pranab Sen,
Srinivasan Venkatesh:
The Quantum Complexity of Set Membership.
FOCS 2000: 554-562 |
7 | EE | Harry Buhrman,
Peter Bro Miltersen,
Jaikumar Radhakrishnan,
Srinivasan Venkatesh:
Are bitvectors optimal?
STOC 2000: 449-458 |
6 | EE | Jaikumar Radhakrishnan,
Pranab Sen,
Srinivasan Venkatesh:
The Quantum Complexity of Set Membership
CoRR quant-ph/0007021: (2000) |
5 | EE | Gerth Stølting Brodal,
Srinivasan Venkatesh:
Improved bounds for dictionary look-up with one error.
Inf. Process. Lett. 75(1-2): 57-59 (2000) |
1999 |
4 | EE | 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 |
3 | EE | Stephen Ponzio,
Jaikumar Radhakrishnan,
Srinivasan Venkatesh:
The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling.
STOC 1999: 602-611 |
1998 |
2 | EE | Srinivasan Venkatesh:
Pseudo-Average Block Sensitivity Equals Average Sensitivity.
Inf. Process. Lett. 68(2): 93-95 (1998) |
1996 |
1 | | Manindra Agrawal,
Srinivasan Venkatesh:
On the Isomorphism Conjecture for 2-DFA Reductions.
Int. J. Found. Comput. Sci. 7(4): 339- (1996) |