Chetan Gupta

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 22

Top Topics

Bipartite Graph

Maximum Matching

Matrix Multiplication

Dynamic Programming

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. CoRR (2024)
Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. SPAA (2024)
Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. MFCS (2024)
Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. CoRR (2024)
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi
Fast Dynamic Programming in Trees in the MPC Model. CoRR (2023)
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi
Fast Dynamic Programming in Trees in the MPC Model. SPAA (2023)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Dynamic Meta-Theorems for Distance and Matching. ICALP (2022)
Samir Datta, Chetan Gupta
Evaluating Monotone Circuits on Surfaces. Electron. Colloquium Comput. Complex. (2022)
Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela
Sparse Matrix Multiplication in the Low-Bandwidth Model. SPAA (2022)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Reachability and Matching in Single Crossing Minor Free Graphs. CoRR (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Reachability and Matching in Single Crossing Minor Free Graphs. FSTTCS (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Dynamic Meta-theorems for Distance and Matching. CoRR (2021)
Chetan Gupta, Rahul Jain, Raghunath Tewari
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. FSTTCS (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Randomized and Symmetric Catalytic Computation. CSR (2020)
Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. 27 (2020)
Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. MFCS (2020)
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Randomized and Symmetric Catalytic Computation. Electron. Colloquium Comput. Complex. 27 (2020)
Chetan Gupta, Rahul Jain, Raghunath Tewari
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. CoRR (2020)
Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. STACS (2019)
Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Unambiguous Catalytic Computation. FSTTCS (2019)
Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Unambiguous Catalytic Computation. Electron. Colloquium Comput. Complex. 26 (2019)
Chetan Gupta, Vimalraj Sharma, Raghunath Tewari
Reachability in O(log n) Genus Graphs is in Unambiguous. Electron. Colloquium Comput. Complex. 25 (2018)