research
∙
07/17/2022
On the Practical Power of Automata in Pattern Matching
The classical pattern matching paradigm is that of seeking occurrences o...
share
research
∙
12/23/2021
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time
The Suffix Array SA_S[1… n] of an n-length string S is a lexicographical...
research
∙
06/13/2021
The k-mappability problem revisited
The k-mappability problem has two integers parameters m and k. For every...
research
∙
11/05/2020
A Black-Box Attack Model for Visually-Aware Recommender Systems
Due to the advances in deep learning, visually-aware recommender systems...
research
∙
07/17/2020
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction
We study the query complexity of exactly reconstructing a string from ad...
research
∙
07/13/2020
Update Query Time Trade-off for dynamic Suffix Arrays
The Suffix Array SA(S) of a string S[1 ... n] is an array containing all...
research
∙
06/24/2019
Dynamic Palindrome Detection
Lately, there is a growing interest in dynamic string matching problems....
research
∙
05/22/2019
Cartesian Tree Matching and Indexing
We introduce a new metric of match, called Cartesian tree matching, whic...
research
∙
04/23/2018
