4 papers
Asymptotically Optimal Massey-Like Inequality on Guessing Entropy With Application to Side-Channel Attack Evaluations
Andrei Tănăsescu, Marios O. Choudary, Olivier Rioul +1
A Massey-like inequality is any useful lower bound on guessing entropy in terms of the computationally scalable Shannon entropy. The asymptotically optimal Massey-like inequality i…
A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization
Alexandru Popa, Andrei Tanasescu
Data compression plays a crucial part in the cloud based systems of today. One the fundaments of compression is quasi-periodicity, for which there are several models. We build upon…
Hardness and algorithmic results for the approximate cover problem
Alexandru Popa, Andrei Tanasescu
In CPM 2017, Amir et al. introduce a problem, named \emph{approximate string cover} (\textbf{ACP}), motivated by many aplications including coding and automata theory, formal langu…
An output-sensitive algorithm for the minimization of 2-dimensional String Covers
Alexandru Popa, Andrei Tanasescu
String covers are a powerful tool for analyzing the quasi-periodicity of 1-dimensional data and find applications in automata theory, computational biology, coding and the analysis…