Rahul Shah

J. Mobile Multimedia, 2023

2022

Fully Functional Parameterized Suffix Trees in Compact Space.

[BibT_eX]

[DOI]

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

Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space.

[BibT_eX]

[DOI]

Dhrumil Patel

Proceedings of the 32nd International Symposium on Algorithms and Computation, 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

Ranked document selection.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Succinct Non-overlapping Indexing.

[BibT_eX]

[DOI]

Algorithmica, 2020

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

Dictionary Matching with a Bounded Gap in Pattern or in Text.

[BibT_eX]

[DOI]

Algorithmica, 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

Position-restricted substring searching over small alphabets.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2017

Top-k Term-Proximity in Succinct Space.

[BibT_eX]

[DOI]

J. Ian Munro

Gonzalo Navarro

Jesper Sindahl Nielsen

Algorithmica, 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]

Proceedings of the 2017 Data Compression Conference, 2017

2016

Document Retrieval on String Collections.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Parameterized Pattern Matching - Succinctly.

[BibT_eX]

[DOI]

CoRR, 2016

Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees.

[BibT_eX]

[DOI]

Algorithmica, 2016

A Framework for Dynamic Parameterized Dictionary Matching.

[BibT_eX]

[DOI]

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

Probabilistic Threshold Indexing for Uncertain Strings.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Extending Database Technology, 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

Succinct indexes for reporting discriminating and generic words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Compressing Dictionary Matching Index via Sparsification Technique.

[BibT_eX]

[DOI]

Algorithmica, 2015

Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching.

[BibT_eX]

[DOI]

Algorithmica, 2015

Shared-Constraint Range Reporting.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Database Theory, 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

Proceedings of the Database and Expert Systems Applications, 2015

Dictionary Matching with Uneven Gaps.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Ranked Document Retrieval with Forbidden Pattern.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Space-Efficient Frameworks for Top-k String Retrieval.

[BibT_eX]

[DOI]

J. ACM, 2014

Similarity joins for uncertain strings.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Management of Data, 2014

Categorical range maxima queries.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

MapReduce based parallel suffix tree construction for human genome.

[BibT_eX]

[DOI]

Umesh Chandra Satish

Praveenkumar Kondikoppa

Seung-Jong Park

Proceedings of the 20th IEEE International Conference on Parallel and Distributed Systems, 2014

2013

Faster compressed dictionary matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Compressed text indexing with wildcards.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Compressed property suffix trees.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Faster Range LCP Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

Top-k Color Queries on Tree Paths.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

Top-k join queries: overcoming the curse of anti-correlation.

[BibT_eX]

[DOI]

Proceedings of the 17th International Database Engineering & Applications Symposium, 2013

Top-k Document Retrieval in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Approximate string matching by position restricted alignment.

[BibT_eX]

[DOI]

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Faster Compressed Top-k Document Retrieval.

[BibT_eX]

[DOI]

Proceedings of the 2013 Data Compression Conference, 2013

Space-Efficient Construction Algorithm for the Circular Suffix Tree.

[BibT_eX]

[DOI]

Proceedings of the 2013 Data Compression Conference, 2013

Indexes for Document Retrieval with Relevance.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

2012

Succinct representations of weighted trees supporting path queries.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On position restricted substring searching in succinct space.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On Optimal Top-K String Retrieval

[BibT_eX]

[DOI]

CoRR, 2012

Document Listing for Queries with Excluded Pattern.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Efficient Algorithm for Circular Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Cache-oblivious index for approximate string matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A Truly Dynamic Data Structure for Top-k Queries on Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the Scientific and Statistical Database Management, 2011

Inverted indexes for phrases and strings.

[BibT_eX]

[DOI]

Sabrina Chandrasekaran

Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

Succinct Indexes for Circular Patterns.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Compressed Dictionary Matching with One Error.

[BibT_eX]

[DOI]

Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010

Efficient index for retrieving top-k most frequent documents.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Fully Dynamic Data Structure for Top-k Queries on Uncertain Data

[BibT_eX]

[DOI]

CoRR, 2010

String Retrieval for Multi-pattern Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

I/O-Efficient Compressed Text Indexes: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

Compression, Indexing, and Retrieval for Massive String Data.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

PSI-RA: A parallel sparse index for read alignment on genomes.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009

Efficient Index for Retrieving Top-k Most Frequent Documents.

[BibT_eX]

[DOI]

Shih-Bin Wu

Proceedings of the String Processing and Information Retrieval, 2009

On Entropy-Compressed Text Indexing in External Memory.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2009

Succinct Index for Dynamic Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Space-Efficient Framework for Top-k String Retrieval Problems.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Indexing continuously changing data with mean-variance tree.

[BibT_eX]

[DOI]

Int. J. High Perform. Comput. Netw., 2008

Query Selectivity Estimation for Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the Scientific and Statistical Database Management, 2008

Tight competitive ratios for parallel disk prefetching and caching.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Orion 2.0: native support for uncertain data.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

On searching compressed string collections cache-obliviously.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Indexing Probabilistic Nearest-Neighbor Threshold Queries.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Quality in Databases and Management of Uncertain Data, 2008

Database Support for Probabilistic Attributes and Tuples.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Data Engineering, 2008

The SBC-tree: an index for run-length compressed sequences.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2008, 2008

Compressed Index for Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing.

[BibT_eX]

[DOI]

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

The Orion Uncertain Data Management System.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Management of Data, 2008

2007

Compressed data structures: Dictionaries and data-aware measures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Indexing Uncertain Categorical Data.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering, 2007

A Framework for Dynamizing Succinct Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Adaptive rank-aware query optimization in relational databases.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2006

Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Mob. Networks Appl., 2006

On the Complexity of Ordinal Clustering.

[BibT_eX]

[DOI]

Martin Farach-Colton

J. Classif., 2006

Compressed Dictionaries: Space Measures, Data Sets, and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Efficient join processing over uncertain data.

[BibT_eX]

[DOI]

Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

2005

On competitive online read-many parallel disks scheduling.

[BibT_eX]

[DOI]

Peter J. Varman

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Change Tolerant Indexing for Constantly Evolving Data.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Data Engineering, 2005

2004

Efficient Dissemination of Personalized Information Using Content-Based Multicast.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2004

Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

Mining Deviants in Time Series Data Streams.

[BibT_eX]

[DOI]

S. Muthukrishnan

Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004

Online algorithms for prefetching and caching on parallel disks.

[BibT_eX]

[DOI]

Peter J. Varman

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Rank-aware Query Optimization.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

Bulk Operations for Space-Partitioning Trees.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Data Engineering, 2004

2002

Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees.

[BibT_eX]

[DOI]

Martin Farach-Colton

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Efficient Dissemination of Personalized Information Using Content-Based Multicast.

[BibT_eX]

[DOI]

Ravi Jain

Farooq Anjum

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001

On the midpath tree conjuncture: a counter-example.

[BibT_eX]

[DOI]

Martin Farach-Colton

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Algorithms for Efficient Filtering in Content-Based Multicast.

[BibT_eX]

[DOI]

Stefan Langerman

Sachin Lodha