| pBWT: achieving succinct data structures for parameterized pattern matching and related problems A Ganguly, R Shah, SV Thankachan Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 29 | 2017 |
| Ranked document retrieval for multiple patterns S Biswas, A Ganguly, R Shah, SV Thankachan Theoretical Computer Science 746, 98-111, 2018 | 17 | 2018 |
| Space–time trade-offs for finding shortest unique substrings and maximal unique matches A Ganguly, WK Hon, R Shah, SV Thankachan Theoretical Computer Science 700, 75-88, 2017 | 16 | 2017 |
| Space-efficient dictionaries for parameterized and order-preserving pattern matching A Ganguly, WK Hon, K Sadakane, R Shah, SV Thankachan, Y Yang 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016 | 15 | 2016 |
| The Heaviest Induced Ancestors Problem Revisited P Abedin, S Hooshmand, A Ganguly, SV Thankachan Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018 | 14 | 2018 |
| A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time P Abedin, A Ganguly, WK Hon, Y Nekrich, K Sadakane, R Shah, ... International Computing and Combinatorics Conference, 615-625, 2018 | 13 | 2018 |
| A framework for dynamic parameterized dictionary matching A Ganguly, WK Hon, R Shah 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), 2016 | 13 | 2016 |
| Structural Pattern Matching-Succinctly A Ganguly, R Shah, SV Thankachan 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017 | 10 | 2017 |
| Efficient Data Structures for Range Shortest Unique Substring Queries P Abedin, A Ganguly, SP Pissis, SV Thankachan Algorithms 13 (11), 276, 2020 | 8 | 2020 |
| Context-Aware Design of Cyber-Physical Human Systems (CPHS) S Mukhopadhyay, Q Liu, E Collier, Y Zhu, R Gudishala, C Chokwitthaya, ... 2020 International Conference on COMmunication Systems & NETworkS (COMSNETS …, 2020 | 8 | 2020 |
| Succinct Non-overlapping Indexing A Ganguly, R Shah, SV Thankachan Algorithmica 82 (1), 107-117, 2020 | 8 | 2020 |
| Categorical Range Reporting with Frequencies A Ganguly, JI Munro, Y Nekrich, R Shah, SV Thankachan 22nd International Conference on Database Theory (ICDT 2019), 2019 | 8 | 2019 |
| A Linear Space Data Structure for Range LCP Queries A Ganguly, M Patil, R Shah, SV Thankachan Fundamenta Informaticae 163 (3), 245-251, 2018 | 8 | 2018 |
| Restricted shortest path in temporal graphs S Biswas, A Ganguly, R Shah International Conference on Data Management in Cloud, Grid and P2P Systems …, 2015 | 8 | 2015 |
| Succinct non-overlapping indexing A Ganguly, R Shah, SV Thankachan Annual Symposium on Combinatorial Pattern Matching, 185-195, 2015 | 8 | 2015 |
| The heaviest induced ancestors problem: better data structures and applications P Abedin, S Hooshmand, A Ganguly, SV Thankachan Algorithmica 84 (7), 2088-2105, 2022 | 7 | 2022 |
| FM-Index Reveals the Reverse Suffix Array A Ganguly, D Gibney, S Hooshmand, MO Külekci, SV Thankachan 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020 | 6 | 2020 |
| Parameterized Pattern Matching--Succinctly A Ganguly, R Shah, SV Thankachan arXiv preprint arXiv:1603.07457, 2016 | 6 | 2016 |
| Ranked document retrieval with forbidden pattern S Biswas, A Ganguly, R Shah, SV Thankachan Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia …, 2015 | 6 | 2015 |
| Range Shortest Unique Substring Queries P Abedin, A Ganguly, SP Pissis, SV Thankachan International Symposium on String Processing and Information Retrieval, 258-266, 2019 | 5 | 2019 |
Sharma V. ThankachanNorth Carolina State University在 ncsu.edu 的电子邮件经过验证
