research
∙
07/25/2023
A Compact DAG for Storing and Searching Maximal Common Subsequences
Maximal Common Subsequences (MCSs) between two strings X and Y are subse...
share
research
∙
10/02/2020
Efficient Estimation of Graph Trussness
A k-truss is an edge-induced subgraph H such that each of its edges belo...
research
∙
09/02/2020
Zuckerli: A New Compressed Representation for Graphs
Zuckerli is a scalable compression system meant for large real-world gra...
research
∙
12/31/2019
Proximity Search For Maximal Subgraph Enumeration
This paper considers the subgraphs of an input graph that satisfy a give...
research
∙
07/22/2019
Succinct Representation for (Non)Deterministic Finite Automata
Deterministic finite automata are one of the simplest and most practical...
research
∙
06/26/2019
String Sanitization: A Combinatorial Approach
String data are often disseminated to support applications such as locat...
research
∙
02/10/2019
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching
Exact pattern matching in labeled graphs is the problem of searching pat...
research
∙
01/16/2019
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree
Exact pattern matching in labeled graphs is the problem of searching pat...
research
∙
10/04/2018
Longest Property-Preserved Common Factor
In this paper we introduce a new family of string processing problems. W...
research
∙
06/08/2018
Compressed Communication Complexity of Longest Common Prefixes
We consider the communication complexity of fundamental longest common p...
research
∙
05/08/2018
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables
This paper proposes round-hashing, which is suitable for data storage on...
research
∙
03/09/2018
