Andrei Tanasescu

13 papers B 1C 1Journal 11
YearRankTypeTitle / Venue / Authors
2025 J jnl
Optimal number of queries for phase-matching quantum search.
Quantum Inf. Process.
Raj Alexandru Gutoiu, Andrei Tanasescu, Pantelimon George Popescu
2024 B conf
Self Improvement of the McEliece- Yu Inequality.
ISIT
Andrei Tanasescu, Pantelimon George Popescu
2024 J jnl
Simple exact quantum search.
Quantum Inf. Process.
Raj Alexandru Gutoiu, Andrei Tanasescu, Pantelimon George Popescu
2021 J jnl
Asymptotically Optimal Massey-Like Inequality on Guessing Entropy With Application to Side-Channel Attack Evaluations.
CoRR
Andrei Tanasescu, Marios O. Choudary, Olivier Rioul, Pantelimon George Popescu
2021 J jnl
Separability of heterogeneous quantum systems using multipartite concurrence and tangle.
Quantum Inf. Process.
Andrei Tanasescu, Pantelimon George Popescu
2021 J jnl
Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy.
Entropy
Andrei Tanasescu, Marios O. Choudary, Olivier Rioul, Pantelimon George Popescu
2020 J jnl
Exploiting the Massey Gap.
Entropy
Andrei Tanasescu, Pantelimon George Popescu
2020 J jnl
Separability of heterogeneous multipartite quantum systems using Bloch Vectors.
Quantum Inf. Process.
Andrei Tanasescu, Pantelimon George Popescu
2019 J jnl
A fast singular value decomposition algorithm of general
J. Comput. Sci.
Andrei Tanasescu, Pantelimon George Popescu
2019 C conf
An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers.
TAMC
Alexandru Popa, Andrei Tanasescu
2018 J jnl
A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization.
CoRR
Alexandru Popa, Andrei Tanasescu
2018 J jnl
An output-sensitive algorithm for the minimization of 2-dimensional String Covers.
CoRR
Alexandru Popa, Andrei Tanasescu
2018 J jnl
Hardness and algorithmic results for the approximate cover problem.
CoRR
Alexandru Popa, Andrei Tanasescu