Unambiguous catalytic computation C Gupta, R Jain, VR Sharma, R Tewari 39th IARCS Annual Conference on Foundations of Software Technology and …, 2019 | 9 | 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 | 6 | 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 | 5 | 2019 |
Sparse matrix multiplication in the low-bandwidth model C Gupta, J Hirvonen, JH Korhonen, J Studený, J Suomela Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | 4 | 2022 |
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 |
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs C Gupta, R Jain, R Tewari arXiv preprint arXiv:2005.06419, 2020 | 2 | 2020 |
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 |