| Unambiguous Catalytic Computation C Gupta, R Jain, VR Sharma, R Tewari 39th IARCS Annual Conference on Foundations of Software Technology and …, 2019 | 17 | 2019 |
| Randomized and Symmetric Catalytic Computation S Datta, C Gupta, R Jain, VR Sharma, R Tewari International Computer Science Symposium in Russia, 211-223, 2020 | 12 | 2020 |
| Reachability in O (log n) Genus Graphs is in Unambiguous Logspace C Gupta, VR Sharma, R Tewari 36th International Symposium on Theoretical Aspects of Computer Science …, 2019 | 6 | 2019 |
| Reachability and Matching in Single Crossing Minor Free Graphs S Datta, C Gupta, R Jain, A Mukherjee, VR Sharma, R Tewari arXiv preprint arXiv:2103.13940, 2021 | 2 | 2021 |
| Efficient Isolation of Perfect Matching in O (log n) Genus Bipartite Graphs C Gupta, VR Sharma, R Tewari 45th International Symposium on Mathematical Foundations of Computer Science …, 2020 | 2 | 2020 |
| Dynamic Meta-theorems for Distance and Matching S Datta, C Gupta, R Jain, A Mukherjee, VR Sharma, R Tewari arXiv preprint arXiv:2109.01875, 2021 | 1 | 2021 |
Raghunath TewariAssociate Professor, Indian Institute of Technology, KanpurVerified email at cse.iitk.ac.in
