Chetan Gupta

31 papers A* 1A 1B 7Misc 1Journal 17Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
EvenPath in directed single-crossing graphs.
Inf. Process. Lett.
Archit Chauhan, Chetan Gupta, Vimal Raj Sharma
2026 — conf
Matrix Multiplication in the MPC Model.
CALDAM
Lakshya Joshi, Arya Deshmukh, Atharv Chhabra, Chetan Gupta
2026 J jnl
Unambiguous, Randomized, and Symmetric Catalytic Computation.
ACM Trans. Comput. Theory
Samir Datta, Chetan Gupta, Rahul Jain, Vimalraj Sharma, Raghunath Tewari
2025 J jnl
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs.
CoRR
Chetan Gupta, Raghunath Tewari, Vimal Raj Sharma
2025 B conf
Evaluating Monotone Circuits on Surfaces.
WALCOM
Samir Datta, Chetan Gupta
2025 B conf
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.
SIROCCO
Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
2025 J jnl
Matrix Multiplication in the MPC Model.
CoRR
Atharv Chhabra, Arya Deshmukh, Chetan Gupta, Lakshya Joshi
2024 B conf
Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.
SPAA
Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
2024 J jnl
Lossy Catalytic Computation.
CoRR
Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2024 J jnl
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.
CoRR
Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
2024 B conf
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs.
MFCS
Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma
2024 J jnl
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs.
CoRR
Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma
2023 B conf
Fast Dynamic Programming in Trees in the MPC Model.
SPAA
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi
2023 J jnl
Fast Dynamic Programming in Trees in the MPC Model.
CoRR
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi
2022 A* conf
Dynamic Meta-Theorems for Distance and Matching.
ICALP
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
2022 J jnl
Evaluating Monotone Circuits on Surfaces.
Electron. Colloquium Comput. Complex.
Samir Datta, Chetan Gupta
2022 B conf
Sparse Matrix Multiplication in the Low-Bandwidth Model.
SPAA
Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela
2022 J jnl
Sparse matrix multiplication in the low-bandwidth model.
CoRR
Chetan Gupta, Juho Hirvonen, Janne Korhonen, Jan Studený, Jukka Suomela
2021 J jnl
Dynamic Meta-theorems for Distance and Matching.
CoRR
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
2021 — conf
Reachability and Matching in Single Crossing Minor Free Graphs.
FSTTCS
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
2021 J jnl
Reachability and Matching in Single Crossing Minor Free Graphs.
CoRR
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
2021 — conf
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs.
FSTTCS
Chetan Gupta, Rahul Jain, Raghunath Tewari
2020 B conf
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs.
MFCS
Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
2020 J jnl
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs.
Electron. Colloquium Comput. Complex.
Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
2020 Misc conf
Randomized and Symmetric Catalytic Computation.
CSR
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2020 J jnl
Randomized and Symmetric Catalytic Computation.
Electron. Colloquium Comput. Complex.
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2020 J jnl
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs.
CoRR
Chetan Gupta, Rahul Jain, Raghunath Tewari
2019 A conf
Reachability in O(log n) Genus Graphs is in Unambiguous Logspace.
STACS
Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
2019 — conf
Unambiguous Catalytic Computation.
FSTTCS
Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2019 J jnl
Unambiguous Catalytic Computation.
Electron. Colloquium Comput. Complex.
Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
2018 J jnl
Reachability in O(log n) Genus Graphs is in Unambiguous.
Electron. Colloquium Comput. Complex.
Chetan Gupta, Vimalraj Sharma, Raghunath Tewari