default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManish Patil
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j6]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)- 2016
- [c13]Sudip Biswas, Manish Patil, Sharma V. Thankachan, Rahul Shah:
Probabilistic Threshold Indexing for Uncertain Strings. EDBT 2016: 401-412 - 2015
- [j5]Sudip Biswas, Manish Patil, Rahul Shah, Sharma V. Thankachan
:
Succinct indexes for reporting discriminating and generic words. Theor. Comput. Sci. 593: 165-173 (2015) - [c12]Sudip Biswas, Manish Patil, Rahul Shah, Sharma V. Thankachan:
Shared-Constraint Range Reporting. ICDT 2015: 277-290 - [i2]Sharma V. Thankachan, Manish Patil, Rahul Shah, Sudip Biswas:
Probabilistic Threshold Indexing for Uncertain Strings. CoRR abs/1509.08608 (2015) - 2014
- [j4]Sebastian Wandelt, Dong Deng, Stefan Gerdjikov, Shashwat Mishra, Petar Mitankin, Manish Patil, Enrico Siragusa, Alexander Tiskin, Wei Wang, Jiaying Wang, Ulf Leser:
State-of-the-art in string similarity search and join. SIGMOD Rec. 43(1): 64-76 (2014) - [c11]Umesh Chandra Satish, Praveenkumar Kondikoppa, Seung-Jong Park, Manish Patil, Rahul Shah:
MapReduce based parallel suffix tree construction for human genome. ICPADS 2014: 664-670 - [c10]Manish Patil, Sharma V. Thankachan, Rahul Shah, Yakov Nekrich, Jeffrey Scott Vitter:
Categorical range maxima queries. PODS 2014: 266-277 - [c9]Manish Patil, Rahul Shah:
Similarity joins for uncertain strings. SIGMOD Conference 2014: 1471-1482 - [c8]Sudip Biswas, Manish Patil, Rahul Shah, Sharma V. Thankachan:
Succinct Indexes for Reporting Discriminating and Generic Words. SPIRE 2014: 89-100 - 2013
- [j3]Wing-Kai Hon, Manish Patil, Rahul Shah, Sharma V. Thankachan:
Compressed property suffix trees. Inf. Comput. 232: 10-18 (2013) - [c7]Wing-Kai Hon, Manish Patil, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
Indexes for Document Retrieval with Relevance. Space-Efficient Data Structures, Streams, and Algorithms 2013: 351-362 - [c6]Manish Patil, Xuanting Cai, Sharma V. Thankachan, Rahul Shah, Seung-Jong Park, David W. Foltz:
Approximate string matching by position restricted alignment. EDBT/ICDT Workshops 2013: 384-391 - [c5]Manish Patil, Rahul Shah, Sharma V. Thankachan:
Top-k join queries: overcoming the curse of anti-correlation. IDEAS 2013: 76-85 - [c4]Manish Patil, Rahul Shah, Sharma V. Thankachan:
Faster Range LCP Queries. SPIRE 2013: 263-270 - 2012
- [j2]Manish Patil, Rahul Shah, Sharma V. Thankachan:
Succinct representations of weighted trees supporting path queries. J. Discrete Algorithms 17: 103-108 (2012) - 2011
- [c3]Wing-Kai Hon, Manish Patil, Rahul Shah, Sharma V. Thankachan:
Compressed Property Suffix Trees. DCC 2011: 123-132 - [c2]Manish Patil, Sharma V. Thankachan, Rahul Shah, Wing-Kai Hon, Jeffrey Scott Vitter, Sabrina Chandrasekaran:
Inverted indexes for phrases and strings. SIGIR 2011: 555-564 - [c1]Manish Patil, Rahul Shah, Sharma V. Thankachan:
A Truly Dynamic Data Structure for Top-k Queries on Uncertain Data. SSDBM 2011: 91-108 - 2010
- [j1]Wing-Kai Hon, Manish Patil, Rahul Shah, Shih-Bin Wu:
Efficient index for retrieving top-k most frequent documents. J. Discrete Algorithms 8(4): 402-417 (2010) - [i1]Manish Patil, Rahul Shah, Sharma V. Thankachan:
Fully Dynamic Data Structure for Top-k Queries on Uncertain Data. CoRR abs/1007.5110 (2010)
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-05-08 20:57 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:
