| Are bitvectors optimal? H Buhrman, PB Miltersen, J Radhakrishnan, S Venkatesh Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 149 | 2000 |
| Computing k-regret minimizing sets S Chester, A Thomo, S Venkatesh, S Whitesides Proceedings of the VLDB Endowment 7 (5), 389-400, 2014 | 86 | 2014 |
| Lower bounds for predecessor searching in the cell probe model P Sen 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003 | 80 | 2003 |
| Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes S Chester, BM Kapron, G Ramesh, G Srivastava, A Thomo, S Venkatesh Social Network Analysis and Mining 3, 381-399, 2013 | 73 | 2013 |
| Complexity of social network anonymization S Chester, BM Kapron, G Srivastava, S Venkatesh Social Network Analysis and Mining 3 (2), 151-166, 2013 | 64 | 2013 |
| On the advantage over a random assignment J Håstad, S Venkatesh Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 54 | 2002 |
| Low-dimensional carbon spacers in surface plasmon-coupled emission with femtomolar sensitivity and 1000-fold fluorescence enhancements S Venkatesh, PK Badiya, SS Ramamurthy Chemical communications 51 (37), 7809-7811, 2015 | 42 | 2015 |
| k-Anonymization of Social Networks by Vertex Addition. S Chester, BM Kapron, G Ramesh, G Srivastava, A Thomo, S Venkatesh ADBIS (2) 789, 107-116, 2011 | 42 | 2011 |
| Social network anonymization via edge addition B Kapron, G Srivastava, S Venkatesh 2011 International Conference on Advances in Social Networks Analysis and …, 2011 | 40 | 2011 |
| The communication complexity of pointer chasing SJ Ponzio, J Radhakrishnan, S Venkatesh Journal of Computer and System Sciences 62 (2), 323-355, 2001 | 40 | 2001 |
| Anonymizing subsets of social networks with degree constrained subgraphs S Chester, J Gaertner, U Stege, S Venkatesh 2012 IEEE/ACM International Conference on Advances in Social Networks …, 2012 | 33 | 2012 |
| Visibly pushdown transducers for approximate validation of streaming XML A Thomo, S Venkatesh, YY Ye Foundations of Information and Knowledge Systems: 5th International …, 2008 | 32 | 2008 |
| Improved bounds for dictionary look-up with one error GS Brodal, S Venkatesh Information Processing Letters 75 (1-2), 57-59, 2000 | 32 | 2000 |
| Purcell factor based understanding of enhancements in surface plasmon-coupled emission with DNA architectures S Venkatesh, PK Badiya, SS Ramamurthy Physical Chemistry Chemical Physics 18 (2), 681-684, 2016 | 23 | 2016 |
| Indexing reverse top-k queries in two dimensions S Chester, A Thomo, S Venkatesh, S Whitesides International Conference on Database Systems for Advanced Applications, 201-208, 2013 | 20 | 2013 |
| Approximating the radii of point sets K Varadarajan, S Venkatesh, Y Ye, J Zhang SIAM journal on computing 36 (6), 1764-1776, 2007 | 20 | 2007 |
| The communication complexity of pointer chasing: Applications of entropy and sampling SJ Ponzio, J Radhakrishnan, S Venkatesh Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing …, 1999 | 19 | 1999 |
| Rewriting of visibly pushdown languages for xml data integration A Thomo, S Venkatesh Proceedings of the 17th ACM conference on Information and knowledge …, 2008 | 18 | 2008 |
| The quantum complexity of set membership Radhakrishnan, Sen, Venkatesh Algorithmica 34, 462-479, 2002 | 18 | 2002 |
| Lower bounds in the quantum cell probe model P Sen, S Venkatesh Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001 | 18 | 2001 |
