| Hitting-sets for ROABP and sum of set-multilinear circuits M Agrawal, R Gurjar, A Korwar, N Saxena SIAM Journal on Computing 44 (3), 669-697, 2015 | 75 | 2015 |
| Deterministic identity testing for sum of read-once oblivious arithmetic branching programs R Gurjar, A Korwar, N Saxena, T Thierauf computational complexity 26, 835-880, 2017 | 60 | 2017 |
| Identity testing for constant-width, and any-order, read-once oblivious arithmetic branching programs R Gurjar, A Korwar, N Saxena arXiv preprint arXiv:1601.08031, 2016 | 37 | 2016 |
| Exact perfect matching in complete graphs R Gurjar, A Korwar, J Messner, T Thierauf ACM Transactions on Computation Theory (TOCT) 9 (2), 1-20, 2017 | 21 | 2017 |
| Planarizing gadgets for perfect matching do not exist R Gurjar, A Korwar, J Messner, S Straub, T Thierauf International Symposium on Mathematical Foundations of Computer Science, 478-490, 2012 | 18 | 2012 |
| Identity testing for constant-width, and commutative, read-once oblivious abps R Gurjar, A Korwar, N Saxena 31st Conference on Computational Complexity (CCC 2016), 29: 1-29: 16, 2016 | 15 | 2016 |
| Matching in planar graphs A Korwar Master’s thesis, Indian Institute of Technology Kanpur, 2009 | 4 | 2009 |
| Planarizing gadgets for perfect matching do not exist R Gurjar, A Korwar, J Messner, S Straub, T Thierauf ACM Transactions on Computation Theory (TOCT) 8 (4), 1-15, 2016 | 3 | 2016 |
| Hitting-sets for low-distance multilinear depth-3 M Agrawal, R Gurjar, A Korwar, N Saxena arXiv preprint arXiv:1312.1826, 2013 | 3 | 2013 |
| Exact perfect matching in complete graphs R Gurjar, A Korwar, J Messner, T Thierauf Electronic Colloquium on Computational Complexity (ECCC) 20, 112, 2013 | 3 | 2013 |
| Polynomial Identity Testing and Lower Bounds for Sum of Special Arithmetic Branching Programs A Korwar INDIAN INSTITUTE OF TECHNOLOGY KANPUR, 2016 | 1 | 2016 |
| On two-level poset games SA Fenner, R Gurjar, A Korwar, T Thierauf Electron. Colloquium Comput. Complex., 2013 | 1 | 2013 |
| Bloom filters A Korwar | 1 | 2010 |
| Impossibility results for the sum of two Width-2 Invertible Arithmetic Branching Programs H Singh, A Korwar Indian Institute of Technology Goa, 2022 | | 2022 |
| The Complexity of Poset Games S Fenner, D Grier, R Gurjar, A Korwar, T Thierauf Journal of Graph Algorithms and Applications 26 (1), 1-14, 2022 | | 2022 |
| 31st Conference on Computational Complexity (CCC 2016) R Raz Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016 | | 2016 |
| 30th Conference on Computational Complexity (CCC 2015) O Goldreich, T Gur, I Komargodski, V Guruswami, A Velingker, I Haviv, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2015 | | 2015 |
| Cuckoo Hashing A Korwar | | 2010 |
| Analysis of Hashing Algorithms A Korwar | | 2010 |
| Universal Hashing and Perfect Hashing A Korwar | | 2010 |
