Hardness and algorithmic results for the approximate cover problem. - Alexandru Popa 001; Andrei Tanasescu (CoRR, 2018)

A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization. - Alexandru Popa 001; Andrei Tanasescu (CoRR, 2018)

An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers. - Alexandru Popa 001; Andrei Tanasescu (TAMC, 2019)

A fast singular value decomposition algorithm of general k-tridiagonal matrices. - Andrei Tanasescu; Pantelimon George Popescu (J. Comput. Sci., 2019)

Exploiting the Massey Gap. - Andrei Tanasescu; Pantelimon George Popescu (Entropy, 2020)

Separability of heterogeneous multipartite quantum systems using Bloch Vectors. - Andrei Tanasescu; Pantelimon George Popescu (Quantum Inf. Process., 2020)

Asymptotically Optimal Massey-Like Inequality on Guessing Entropy With Application to Side-Channel Attack Evaluations. - Andrei Tanasescu; Marios O. Choudary; Olivier Rioul; Pantelimon George Popescu (CoRR, 2021)

Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy. - Andrei Tanasescu; Marios O. Choudary; Olivier Rioul; Pantelimon George Popescu (Entropy, 2021)

Separability of heterogeneous quantum systems using multipartite concurrence and tangle. - Andrei Tanasescu; Pantelimon George Popescu (Quantum Inf. Process., 2021)

Self Improvement of the McEliece- Yu Inequality. - Andrei Tanasescu; Pantelimon George Popescu (ISIT, 2024)

Simple exact quantum search. - Raj Alexandru Gutoiu; Andrei Tanasescu; Pantelimon George Popescu (Quantum Inf. Process., 2024)