| Counting and sampling triangles from a graph stream A Pavan, S Tirthapura | 164 | 2013 |
| On the hardness of permanent JY Cai, A Pavan, D Sivakumar Annual Symposium on Theoretical Aspects of Computer Science, 90-99, 1999 | 66 | 1999 |
| Parallel triangle counting in massive streaming graphs K Tangwongsan, A Pavan, S Tirthapura Proceedings of the 22nd ACM international conference on Information …, 2013 | 48 | 2013 |
| Lecture notes in computer science TX Bui Springer, 1987 | 47* | 1987 |
| Extracting Kolmogorov complexity with applications to dimension zero-one laws L Fortnow, JM Hitchcock, A Pavan, NV Vinodchandran, F Wang International Colloquium on Automata, Languages, and Programming, 335-345, 2006 | 40 | 2006 |
| Separation of NP-completeness notions A Pavan, AL Selman Proceedings 16th Annual IEEE Conference on Computational Complexity, 78-89, 2001 | 35 | 2001 |
| Range-efficient computation of F/sub 0/over massive data streams A Pavan, S Tirthapura 21st International Conference on Data Engineering (ICDE'05), 32-43, 2005 | 30 | 2005 |
| Range-efficient counting of distinct elements in a massive data stream A Pavan, S Tirthapura SIAM Journal on Computing 37 (2), 359-379, 2007 | 29 | 2007 |
| On the NP-completeness of the minimum circuit size problem JM Hitchcock, A Pavan 35th IARCS Annual Conference on Foundations of Software Technology and …, 2015 | 27 | 2015 |
| An O (n½+?)-Space and Polynomial-Time Algorithm for Directed Planar Reachability T Imai, K Nakagawa, A Pavan, NV Vinodchandran, O Watanabe 2013 IEEE Conference on Computational Complexity, 277-286, 2013 | 26 | 2013 |
| New time-space upperbounds for directed reachability in high-genus and h-minor-free graphs D Chakraborty, A Pavan, R Tewari, NV Vinodchandran, LF Yang 34th International Conference on Foundation of Software Technology and …, 2014 | 24 | 2014 |
| Autoreducibility, mitoticity, and immunity C Glaßer, M Ogihara, A Pavan, AL Selman, L Zhang Journal of Computer and System Sciences 73 (5), 735-754, 2007 | 23 | 2007 |
| Hardness hypotheses, derandomization, and circuit complexity JM Hitchcock, A Pavan International Conference on Foundations of Software Technology and …, 2004 | 22 | 2004 |
| Kolmogorov complexity in randomness extraction JM Hitchcock, A Pavan, NV Vinodchandran ACM Transactions on Computation Theory (TOCT) 3 (1), 1-12, 2011 | 21 | 2011 |
| Proving SAT does not have small circuits with an application to the two queries problem L Fortnow, A Pavan, S Sengupta Journal of Computer and System Sciences 74 (3), 358-363, 2008 | 20 | 2008 |
| Properties of NP-complete sets C Glaßer, A Pavan, AL Selman, S Sengupta SIAM Journal on Computing 36 (2), 516-542, 2006 | 20 | 2006 |
| Some results on derandomization H Buhrman, L Fortnow, A Pavan Annual Symposium on Theoretical Aspects of Computer Science, 212-222, 2003 | 20* | 2003 |
| Comparison of reductions and completeness notions A Pavan SIGACT News 34 (2), 27-41, 2003 | 17 | 2003 |
| On the power of unambiguity in log-space A Pavan, R Tewari, NV Vinodchandran computational complexity 21 (4), 643-670, 2012 | 16 | 2012 |
| Comparing reductions to NP-complete sets JM Hitchcock, A Pavan Information and Computation 205 (5), 694-706, 2007 | 16 | 2007 |
