Arnab Ganguly

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

A framework for designing space-efficient dictionaries for parameterized and order-preserving matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

I/O-optimal categorical 3-sided skyline queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

A linear-space data structure for range-LCP queries in poly-logarithmic time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Efficient Data Structures for Range Shortest Unique Substring Queries.

[BibT_eX]

[DOI]

Algorithms, 2020

Succinct Non-overlapping Indexing.

[BibT_eX]

[DOI]

Algorithmica, 2020

FM-Index Reveals the Reverse Suffix Array.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Context-Aware Design of Cyber-Physical Human Systems (CPHS).

[BibT_eX]

[DOI]

Supratik Mukhopadhyay

Chanachok Chokwitthaya

Robert DiBiano

Alimire Nabijiang

Sanaz Saeidi

Proceedings of the 2020 International Conference on COMmunication Systems & NETworkS, 2020

2019

Range Shortest Unique Substring Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Categorical Range Reporting with Frequencies.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Database Theory, 2019

Parameterized Text Indexing with One Wildcard.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2019

I/O Optimal Data Structures for Categorical Range Skyline Queries.

[BibT_eX]

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Ranked document retrieval for multiple patterns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Space-efficient indexes for forbidden extension queries.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

A Linear Space Data Structure for Range LCP Queries.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

The Heaviest Induced Ancestors Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Space-time trade-offs for finding shortest unique substrings and maximal unique matches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

A Large-Scale Network with Moving Servers.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2017

pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Structural Pattern Matching - Succinctly.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Stabbing Colors in One Dimension.

[BibT_eX]

[DOI]

Wing-Kai Hon

Proceedings of the 2017 Data Compression Conference, 2017

2016

Parameterized Pattern Matching - Succinctly.

[BibT_eX]

[DOI]

CoRR, 2016

A Framework for Dynamic Parameterized Dictionary Matching.

[BibT_eX]

[DOI]

Wing-Kai Hon

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Space-Time Trade-Offs for the Shortest Unique Substring Problem.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Forbidden Extension Queries.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Restricted Shortest Path in Temporal Graphs.

[BibT_eX]

[DOI]

Sudip Biswas