| Battling the internet water army: Detection of hidden paid posters C Chen, K Wu, V Srinivasan, X Zhang 2013 IEEE/ACM International Conference on Advances in Social Networks …, 2013 | 283 | 2013 |
| K-core decomposition of large networks on a single PC W Khaouid, M Barsky, V Srinivasan, A Thomo Proceedings of the VLDB Endowment 9 (1), 13-23, 2015 | 275 | 2015 |
| Are bitvectors optimal? H Buhrman, PB Miltersen, J Radhkrishnan, S Venkatesh SIAM Journal on Computing 31 (6), 1723-1744, 2002 | 160 | 2002 |
| Computing k-regret minimizing sets S Chester, A Thomo, S Venkatesh, S Whitesides Proceedings of the VLDB Endowment 7 (5), 389-400, 2014 | 107 | 2014 |
| Lower bounds for predecessor searching in the cell probe model P Sen, S Venkatesh Journal of Computer and System Sciences 74 (3), 364-385, 2008 | 87* | 2008 |
| 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 (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 | 73 | 2013 |
| Efficient computation of feedback arc set at web-scale M Simpson, V Srinivasan, A Thomo Proceedings of the VLDB Endowment 10 (3), 133-144, 2016 | 60 | 2016 |
| 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 | 60 | 2002 |
| Conflict-aware weighted bipartite b-matching and its application to e-commerce C Chen, L Zheng, V Srinivasan, A Thomo, K Wu, A Sukow IEEE Transactions on Knowledge and Data Engineering 28 (6), 1475-1488, 2016 | 51 | 2016 |
| The communication complexity of pointer chasing SJ Ponzio, J Radhakrishnan, S Venkatesh Journal of Computer and System Sciences 62 (2), 323-355, 2001 | 46 | 2001 |
| 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 | 44 | 2011 |
| Social network anonymization via edge addition B Kapron, G Srivastava, S Venkatesh 2011 International Conference on Advances in Social Networks Analysis and …, 2011 | 42 | 2011 |
| SCC++: Predicting the programming language of questions and snippets of Stack Overflow K Alrashedy, D Dharmaretnam, DM German, V Srinivasan, TA Gulliver Journal of Systems and Software 162, 110505, 2020 | 38* | 2020 |
| Approximating the radii of point sets K Varadarajan, S Venkatesh, Y Ye, J Zhang SIAM Journal on Computing 36 (6), 1764-1776, 2007 | 36* | 2007 |
| 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 | 35 | 2012 |
| Improved bounds for dictionary look-up with one error GS Brodal, S Venkatesh Information Processing Letters 75 (1-2), 57-59, 2000 | 33 | 2000 |
| Visibly pushdown transducers for approximate validation of streaming XML A Thomo, S Venkatesh, YY Ye International Symposium on Foundations of Information and Knowledge Systems …, 2008 | 32 | 2008 |
| Restricted linear congruences K Bibak, BM Kapron, V Srinivasan, R Tauraso, L Tóth Journal of Number Theory 171, 128-144, 2017 | 30 | 2017 |
| Efficient graph summarization using weighted lsh at billion-scale Q Yong, M Hajiabadi, V Srinivasan, A Thomo Proceedings of the 2021 International Conference on Management of Data, 2357 …, 2021 | 29 | 2021 |
Alex ThomoProfessor of Computer Science, University of VictoriaVerified email at cs.uvic.ca
