default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnab Ganguly 0002
Person information
- affiliation: Louisiana State University, Baton Rouge, USA
Other persons with the same name
- Arnab Ganguly 0001 — University of Louisville, KY, USA
- Arnab Ganguly 0003 — Khalifa University, Abu Dhabi, UAE
- Arnab Ganguly 0004 — IMA life North America, Tonawanda, NY
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c21]Arnab Ganguly
, Daniel Gibney, Paul Macnichol, Sharma V. Thankachan:
Bounded-Ratio Gapped String Indexing. SPIRE 2024: 118-126- 2022
- [j11]Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, Sharma V. Thankachan:
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications. Algorithmica 84(7): 2088-2105 (2022) - [c20]Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Fully Functional Parameterized Suffix Trees in Compact Space. ICALP 2022: 65:1-65:18 - 2021
- [j10]Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang:
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching. Theor. Comput. Sci. 854: 52-62 (2021) - [j9]Arnab Ganguly, Daniel Gibney, Sharma V. Thankachan, Rahul Shah:
I/O-optimal categorical 3-sided skyline queries. Theor. Comput. Sci. 896: 132-144 (2021) - [c19]Arnab Ganguly, Dhrumil Patel, Rahul Shah, Sharma V. Thankachan:
LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching. ICALP 2021: 71:1-71:19 - 2020
- [j8]Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Succinct Non-overlapping Indexing. Algorithmica 82(1): 107-117 (2020) - [j7]Paniz Abedin, Arnab Ganguly, Solon P. Pissis, Sharma V. Thankachan:
Efficient Data Structures for Range Shortest Unique Substring Queries. Algorithms 13(11): 276 (2020) - [j6]Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A linear-space data structure for range-LCP queries in poly-logarithmic time. Theor. Comput. Sci. 822: 15-22 (2020) - [c18]Supratik Mukhopadhyay, Subhajit Sidhanta, Arnab Ganguly, Qun Liu, Edward Collier, Yimin Zhu, Ravindra Gudishala, Chanachok Chokwitthaya, Robert DiBiano, Alimire Nabijiang, Sanaz Saeidi:
Context-Aware Design of Cyber-Physical Human Systems (CPHS). COMSNETS 2020: 322-329 - [c17]Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Külekci, Sharma V. Thankachan:
FM-Index Reveals the Reverse Suffix Array. CPM 2020: 13:1-13:14 - [i2]Supratik Mukhopadhyay, Qun Liu, Edward Collier, Yimin Zhu, Ravindra Gudishala, Chanachok Chokwitthaya, Robert DiBiano, Alimire Nabijiang, Sanaz Saeidi, Subhajit Sidhanta, Arnab Ganguly:
Context-Aware Design of Cyber-Physical Human Systems (CPHS). CoRR abs/2001.01918 (2020)
2010 – 2019
- 2019
- [c16]Daniel Gibney, Sharma V. Thankachan, Arnab Ganguly, Rahul Shah:
I/O Optimal Data Structures for Categorical Range Skyline Queries. CCCG 2019: 9-16 - [c15]Arnab Ganguly, Wing-Kai Hon, Yu-An Huang, Solon P. Pissis, Rahul Shah, Sharma V. Thankachan:
Parameterized Text Indexing with One Wildcard. DCC 2019: 152-161 - [c14]Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan:
Categorical Range Reporting with Frequencies. ICDT 2019: 9:1-9:19 - [c13]Paniz Abedin, Arnab Ganguly, Solon P. Pissis, Sharma V. Thankachan:
Range Shortest Unique Substring Queries. SPIRE 2019: 258-266 - 2018
- [j5]Arnab Ganguly, Manish Patil, Rahul Shah, Sharma V. Thankachan:
A Linear Space Data Structure for Range LCP Queries. Fundam. Informaticae 163(3): 245-251 (2018) - [j4]Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Space-efficient indexes for forbidden extension queries. J. Discrete Algorithms 50: 23-35 (2018) - [j3]Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Ranked document retrieval for multiple patterns. Theor. Comput. Sci. 746: 98-111 (2018) - [c12]Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. COCOON 2018: 615-625 - [c11]Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, Sharma V. Thankachan:
The Heaviest Induced Ancestors Problem Revisited. CPM 2018: 20:1-20:13 - 2017
- [j2]Arnab Ganguly, Kavita Ramanan, Philippe Robert, Wen Sun:
A Large-Scale Network with Moving Servers. SIGMETRICS Perform. Evaluation Rev. 45(2): 42-44 (2017) - [j1]Arnab Ganguly, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan:
Space-time trade-offs for finding shortest unique substrings and maximal unique matches. Theor. Comput. Sci. 700: 75-88 (2017) - [c10]Arnab Ganguly, Wing-Kai Hon, Rahul Shah:
Stabbing Colors in One Dimension. DCC 2017: 280-289 - [c9]Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Structural Pattern Matching - Succinctly. ISAAC 2017: 35:1-35:13 - [c8]Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems. SODA 2017: 397-407 - 2016
- [c7]Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang:
Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching. CPM 2016: 2:1-2:12 - [c6]Arnab Ganguly, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan:
Space-Time Trade-Offs for the Shortest Unique Substring Problem. ISAAC 2016: 34:1-34:13 - [c5]Arnab Ganguly, Wing-Kai Hon, Rahul Shah:
A Framework for Dynamic Parameterized Dictionary Matching. SWAT 2016: 10:1-10:14 - [i1]Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Parameterized Pattern Matching - Succinctly. CoRR abs/1603.07457 (2016) - 2015
- [c4]Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Ranked Document Retrieval with Forbidden Pattern. CPM 2015: 77-88 - [c3]Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Succinct Non-overlapping Indexing. CPM 2015: 185-195 - [c2]Sudip Biswas, Arnab Ganguly, Rahul Shah:
Restricted Shortest Path in Temporal Graphs. DEXA (1) 2015: 13-27 - [c1]Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Forbidden Extension Queries. FSTTCS 2015: 320-335
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-07 21:31 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:
