default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChetan Gupta 0002
Person information
- affiliation: Aalto University, Helsinki, Finland
- affiliation (PhD 2014): Indian Institute of Technology, Kanpur, India
Other persons with the same name
- Chetan Gupta — disambiguation page
- Chetan Gupta 0001 — Hitachi America Ltd, Santa Clara, CA, USA (and 2 more)
- Chetan Gupta 0003
![[0009-0003-5856-7296]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0009-0003-5856-7296")
— JUET, Computer Science and Engineering, India - Chetan Gupta 0004 — Arizona State University, Tempe, AZ USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c12]Samir Datta, Chetan Gupta:
Evaluating Monotone Circuits on Surfaces. WALCOM 2025: 127-142- 2024
- [c11]Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma:
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. MFCS 2024: 43:1-43:16 - [c10]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: 305-307 - [i13]Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi:
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. CoRR abs/2404.15559 (2024) - [i12]Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma:
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. CoRR abs/2407.00237 (2024) - [i11]Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Lossy Catalytic Computation. CoRR abs/2408.14670 (2024) - 2023
- [c9]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: 443-453 - [i10]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 abs/2305.03693 (2023) - 2022
- [c8]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Dynamic Meta-Theorems for Distance and Matching. ICALP 2022: 118:1-118:20 - [c7]Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela:
Sparse Matrix Multiplication in the Low-Bandwidth Model. SPAA 2022: 435-444 - [i9]Chetan Gupta, Juho Hirvonen, Janne Korhonen, Jan Studený, Jukka Suomela:
Sparse matrix multiplication in the low-bandwidth model. CoRR abs/2203.01297 (2022) - [i8]Samir Datta, Chetan Gupta:
Evaluating Monotone Circuits on Surfaces. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c6]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Reachability and Matching in Single Crossing Minor Free Graphs. FSTTCS 2021: 16:1-16:16 - [c5]Chetan Gupta, Rahul Jain, Raghunath Tewari:
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. FSTTCS 2021: 23:1-23:15 - [i7]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Reachability and Matching in Single Crossing Minor Free Graphs. CoRR abs/2103.13940 (2021) - [i6]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Dynamic Meta-theorems for Distance and Matching. CoRR abs/2109.01875 (2021) - 2020
- [c4]Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Randomized and Symmetric Catalytic Computation. CSR 2020: 211-223 - [c3]Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari:
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. MFCS 2020: 43:1-43:13 - [i5]Chetan Gupta, Rahul Jain, Raghunath Tewari:
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. CoRR abs/2005.06419 (2020) - [i4]Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Randomized and Symmetric Catalytic Computation. Electron. Colloquium Comput. Complex. TR20 (2020) - [i3]Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari:
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c2]Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Unambiguous Catalytic Computation. FSTTCS 2019: 16:1-16:13 - [c1]Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari:
Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. STACS 2019: 34:1-34:13 - [i2]Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Unambiguous Catalytic Computation. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i1]Chetan Gupta, Vimalraj Sharma, Raghunath Tewari:
Reachability in O(log n) Genus Graphs is in Unambiguous. Electron. Colloquium Comput. Complex. TR18 (2018)
Coauthor Index
aka: Vimal Raj Sharma
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-20 01:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
