The SCEAS System
| |||||||

## Search the dblp DataBase
Srinivasan Venkatesh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Navin Goyal, Michael E. Saks, Srinivasan Venkatesh
**Optimal Separation of EROW and CROWPRAMs.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:93-0 [Conf] - Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
**The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract).**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:7- [Conf] - Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
**The Quantum Complexity of Set Membership.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:554-562 [Conf] - Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiawei Zhang
**On Approximating the Radii of Point Sets in High Dimensions.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:561-569 [Conf] - Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
**Communication Versus Computation.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:745-756 [Conf] - Pranab Sen, Srinivasan Venkatesh
**Lower Bounds in the Quantum Cell Probe Model.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:358-369 [Conf] - Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
**Are bitvectors optimal?**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:449-458 [Conf] - Johan Håstad, Srinivasan Venkatesh
**On the advantage over a random assignment.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:43-52 [Conf] - Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
**The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:602-611 [Conf] - Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
**The Quantum Complexity of Set Membership.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:34, n:4, pp:462-479 [Journal] - Pranab Sen, Srinivasan Venkatesh
**Lower bounds for predecessor searching in the cell probe model**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
**The Quantum Complexity of Set Membership**[Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal] - Pranab Sen, Srinivasan Venkatesh
**Lower bounds in the quantum cell probe model**[Citation Graph (0, 0)][DBLP] CoRR, 2001, v:0, n:, pp:- [Journal] - Manindra Agrawal, Srinivasan Venkatesh
**On the Isomorphism Conjecture for 2-DFA Reductions.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1996, v:7, n:4, pp:339-0 [Journal] - Gerth Stølting Brodal, Srinivasan Venkatesh
**Improved bounds for dictionary look-up with one error.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:1-2, pp:57-59 [Journal] - Srinivasan Venkatesh
**Pseudo-Average Block Sensitivity Equals Average Sensitivity.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:2, pp:93-95 [Journal] - Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
**The Communication Complexity of Pointer Chasing.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:62, n:2, pp:323-355 [Journal] - Johan Håstad, Srinivasan Venkatesh
**On the advantage over a random assignment.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2004, v:25, n:2, pp:117-149 [Journal] - Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
**Are Bitvectors Optimal?**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:6, pp:1723-1744 [Journal] - Bruce M. Kapron, Lior Malka, Venkatesh Srinivasan
**A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC).**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:328-339 [Conf] - Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
**Communication vs. Computation.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2007, v:16, n:1, pp:1-33 [Journal] **Towards practically feasible answering of regular path queries in lav data integration.**[Citation Graph (, )][DBLP]**Rewriting of visibly pushdown languages for xml data integration.**[Citation Graph (, )][DBLP]**Visibly Pushdown Transducers for Approximate Validation of Streaming XML.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |