| Space complexity in polynomial calculus Y Filmus, M Lauria, J Nordstrom, N Ron-Zewi, N Thapen SIAM Journal on Computing 44 (4), 1119-1153, 2015 | 61 | 2015 |
| The provably total search problems of bounded arithmetic A Skelley, N Thapen Proceedings of the London Mathematical Society 103 (1), 106-138, 2011 | 50* | 2011 |
| NP search problems in low fragments of bounded arithmetic J Krajíček, A Skelley, N Thapen The Journal of Symbolic Logic 72 (02), 649-672, 2007 | 44 | 2007 |
| The strength of replacement in weak arithmetic S Cook, N Thapen ACM Transactions on Computational Logic (TOCL) 7 (4), 749-764, 2006 | 44 | 2006 |
| DRAT and Propagation Redundancy Proofs Without New Variables N Thapen, S Buss Logical Methods in Computer Science 17, 2021 | 37* | 2021 |
| Total space in resolution I Bonacina, N Galesi, N Thapen SIAM Journal on Computing 45 (5), 1894-1909, 2016 | 35 | 2016 |
| Fragments of approximate counting SR Buss, LA Kołodziejczyk, N Thapen The Journal of Symbolic Logic 79 (2), 496-525, 2014 | 34 | 2014 |
| A Tradeoff Between Length and Width in Resolution N Thapen Theory of Computing 12 (5), 1-14, 2016 | 27 | 2016 |
| The space complexity of cutting planes refutations N Galesi, P Pudlák, N Thapen Proceedings of the 30th Conference on Computational Complexity, 433-447, 2015 | 25 | 2015 |
| A model-theoretic characterization of the weak pigeonhole principle N Thapen Annals of Pure and Applied Logic 118 (1), 175-195, 2002 | 25 | 2002 |
| The provably total NP search problems of weak second order bounded arithmetic LA Kołodziejczyk, P Nguyen, N Thapen Annals of Pure and Applied Logic 162 (6), 419-446, 2011 | 24 | 2011 |
| The complexity of proving that a graph is Ramsey M Lauria, P Pudlák, V Rödl, N Thapen Combinatorica 37 (2), 253-268, 2017 | 21* | 2017 |
| Parity games and propositional proofs A Beckmann, P Pudlák, N Thapen ACM Transactions on Computational Logic (TOCL) 15 (2), 17, 2014 | 19 | 2014 |
| Resolution and pebbling games N Galesi, N Thapen International Conference on Theory and Applications of Satisfiability …, 2005 | 13 | 2005 |
| Pink Trombone N Thapen | 12* | 2017 |
| Random resolution refutations P Pudlák, N Thapen LIPIcs-Leibniz International Proceedings in Informatics 79, 2017 | 11 | 2017 |
| Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem N Thapen Archive for Mathematical Logic 50 (7-8), 665-680, 2011 | 11 | 2011 |
| Alternating minima and maxima, Nash equilibria and bounded arithmetic P Pudlák, N Thapen Annals of Pure and Applied Logic 163 (5), 604-614, 2012 | 10 | 2012 |
| The weak pigeonhole principle in models of bounded arithmetic N Thapen University of Oxford, 2002 | 10 | 2002 |
| The Ordering Principle in a Fragment of Approximate Counting A Atserias, N Thapen ACM Transactions on Computational Logic (TOCL) 15 (4), 29, 2014 | 9 | 2014 |
Sam BussProfessor of Mathematics and Computer ScienceVerified email at ucsd.edu
