Chetan Gupta

According to our database, Chetan Gupta authored at least 15 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Lossy Catalytic Computation.

Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

CoRR, 2024

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.

Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi

CoRR, 2024

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.

Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs.

Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Fast Dynamic Programming in Trees in the MPC Model.

Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2022

Evaluating Monotone Circuits on Surfaces.

Samir Datta, Chetan Gupta

Electron. Colloquium Comput. Complex., 2022

Sparse Matrix Multiplication in the Low-Bandwidth Model.

Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Dynamic Meta-Theorems for Distance and Matching.

Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Reachability and Matching in Single Crossing Minor Free Graphs.

Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs.

Chetan Gupta, Rahul Jain, Raghunath Tewari

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs.

Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2020

Randomized and Symmetric Catalytic Computation.

Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2020

2019

Unambiguous Catalytic Computation.

Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2019

Reachability in O(log n) Genus Graphs is in Unambiguous Logspace.

Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Reachability in O(log n) Genus Graphs is in Unambiguous.

Chetan Gupta, Vimalraj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2018