default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrantar Ghosh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Sepehr Assadi, Prantar Ghosh
, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay:
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CCC 2024: 7:1-7:16- [c12]Prantar Ghosh, Sahil Kuchlous:
New Algorithms and Lower Bounds for Streaming Tournaments. ESA 2024: 60:1-60:19 - [c11]Prantar Ghosh, Manuel Stoeckl:
Low-Memory Algorithms for Online Edge Coloring. ICALP 2024: 71:1-71:19 - [c10]Prantar Ghosh, Vihan Shah:
New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification. ITCS 2024: 53:1-53:22 - [i15]Prantar Ghosh, Vihan Shah:
New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification. CoRR abs/2401.06378 (2024) - [i14]Prantar Ghosh, Sahil Kuchlous:
New Algorithms and Lower Bounds for Streaming Tournaments. CoRR abs/2405.05952 (2024) - [i13]Sepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay:
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CoRR abs/2405.14835 (2024) - 2023
- [c9]Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl:
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. PODS 2023: 141-153 - [i12]Prantar Ghosh, Manuel Stoeckl:
Low-Memory Algorithms for Online and W-Streaming Edge Coloring. CoRR abs/2304.12285 (2023) - 2022
- [c8]Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl:
Adversarially Robust Coloring for Graph Streams. ITCS 2022: 37:1-37:23 - [c7]Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh:
A New Dynamic Algorithm for Densest Subhypergraphs. WWW 2022: 1093-1103 - [i11]Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh:
A New Dynamic Algorithm for Densest Subhypergraphs. CoRR abs/2204.08106 (2022) - [i10]Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl:
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. CoRR abs/2212.10641 (2022) - 2021
- [j2]Sandip Das, Prantar Ghosh, Shamik Ghosh, Sagnik Sen:
Oriented bipartite graphs and the Goldbach graph. Discret. Math. 344(9): 112497 (2021) - [i9]Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, Sofya Vorotnikova:
Vertex Ordering Problems in Directed Graph Streams. CoRR abs/2105.08215 (2021) - [i8]Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl:
Adversarially Robust Coloring for Graph Streams. CoRR abs/2109.11130 (2021) - 2020
- [j1]Sandip Das, Prantar Ghosh, Swathy Prabhu, Sagnik Sen:
Relative clique number of planar signed graphs. Discret. Appl. Math. 280: 86-92 (2020) - [c6]Amit Chakrabarti, Prantar Ghosh, Justin Thaler:
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches. APPROX-RANDOM 2020: 22:1-22:23 - [c5]Prantar Ghosh:
New Verification Schemes for Frequency-Based Functions on Data Streams. FSTTCS 2020: 22:1-22:15 - [c4]Suman K. Bera, Amit Chakrabarti, Prantar Ghosh:
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. ICALP 2020: 11:1-11:21 - [c3]Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, Sofya Vorotnikova:
Vertex Ordering Problems in Directed Graph Streams. SODA 2020: 1786-1802 - [i7]Amit Chakrabarti, Prantar Ghosh, Justin Thaler:
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches. CoRR abs/2007.03039 (2020) - [i6]Prantar Ghosh:
New Verification Schemes for Frequency-Based Functions on Data Streams. CoRR abs/2010.03287 (2020) - [i5]Amit Chakrabarti, Prantar Ghosh, Justin Thaler:
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c2]Amit Chakrabarti, Prantar Ghosh:
Streaming Verification of Graph Computations via Graph Structure. APPROX-RANDOM 2019: 70:1-70:20 - [i4]Suman K. Bera, Amit Chakrabarti, Prantar Ghosh:
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. CoRR abs/1905.00566 (2019) - [i3]Amit Chakrabarti, Prantar Ghosh:
Streaming Verification of Graph Computations via Graph Structure. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i2]Suman Kalyan Bera, Prantar Ghosh:
Coloring in Graph Streams. CoRR abs/1807.07640 (2018) - 2016
- [c1]Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen:
Relative Clique Number of Planar Signed Graphs. CALDAM 2016: 326-336 - [i1]Sandip Das, Shamik Ghosh, Prantar Ghosh, Sagnik Sen:
Oriented Bipartite Graphs and the Goldbach Graph. CoRR abs/1611.10259 (2016)
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-10-07 22:18 CEST 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:
