default search action
Rahul Jain 0015
Person information
- affiliation: Indian Institute of Technology Kanpur, India
Other persons with the same name
- Rahul Jain — disambiguation page
- Rahul Jain 0001
— National University of Singapore, Centre for Quantum Technologies (CQT), Singapore (and 2 more)
- Rahul Jain 0002
- Rahul Jain 0003
- Rahul Jain 0004 — Indian Institute of Technology Delhi
- Rahul Jain 0006 — IBM, San Francisco, USA (and 1 more)
- Rahul Jain 0007 — Deep Impact, Winterthur, Switzerland (and 1 more)
- Rahul Jain 0008 — IIIT-Hyderabad, Center for Visual Information Technology, India
- Rahul Jain 0009 — Numerify, Bangalore, India (and 1 more)
- Rahul Jain 0010 — Indian Institute of Science, TIFR Centre, Bangalore, India
- Rahul Jain 0011 — New Jersey Institute of Technology, Newark, NJ, USA
- Rahul Jain 0012 — Indian Institute of Technology, Roorkee, India
- Rahul Jain 0013 — Hindustan Institute of Technology and Management, Agra, India
- Rahul Jain 0014 — University of Iowa, Iowa City, IA, USA
- Rahul Jain 0016
- Rahul Jain 0017
- Rahul Jain 0018
- Rahul Jain 0019
- Rahul Jain 0020 — Goldman Sachs, Bangalore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Rahul Jain
Space efficient algorithm for solving reachability using tree decomposition and separators. Theor. Comput. Sci. 982: 114251 (2024) - [i10]Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Lossy Catalytic Computation. CoRR abs/2408.14670 (2024) - 2023
- [j1]Sujoy Bhore
Space-efficient algorithms for reachability in directed geometric graphs. Theor. Comput. Sci. 961: 113938 (2023) - [c9]Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz:
On the Geometric Thickness of 2-Degenerate Graphs. SoCG 2023: 44:1-44:15 - [i9]Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz:
On the geometric thickness of 2-degenerate graphs. CoRR abs/2302.14721 (2023) - 2022
- [c8]Samir Datta, Chetan Gupta
Dynamic Meta-Theorems for Distance and Matching. ICALP 2022: 118:1-118:20 - 2021
- [c7]Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee
Reachability and Matching in Single Crossing Minor Free Graphs. FSTTCS 2021: 16:1-16:16 - [c6]Chetan Gupta, Rahul Jain, Raghunath Tewari:
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. FSTTCS 2021: 23:1-23:15 - [c5]Sujoy Bhore, Rahul Jain:
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs. ISAAC 2021: 63:1-63:17 - [i8]Sujoy Bhore, Rahul Jain:
Space-Efficient Algorithms for Reachability in Geometric Graphs. CoRR abs/2101.05235 (2021) - [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
Randomized and Symmetric Catalytic Computation. CSR 2020: 211-223 - [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)
2010 – 2019
- 2019
- [c3]Chetan Gupta
Unambiguous Catalytic Computation. FSTTCS 2019: 16:1-16:13 - [c2]Rahul Jain
An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability. FSTTCS 2019: 19:1-19:14 - [c1]Rahul Jain
Reachability in High Treewidth Graphs. ISAAC 2019: 12:1-12:14 - [i3]Rahul Jain, Raghunath Tewari:
Reachability in High Treewidth Graphs. CoRR abs/1901.11285 (2019) - [i2]Rahul Jain, Raghunath Tewari:
Grid Graph Reachability. CoRR abs/1902.00488 (2019) - [i1]Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Unambiguous Catalytic Computation. Electron. Colloquium Comput. Complex. TR19 (2019)
Coauthor Index
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 2024-11-19 20:50 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: