Pantelimon George Popescu

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 21

Top Topics

Information Theory

Shannon Entropy

Statistical Physics

Solving Nonlinear

Top Venues

Future Gener. Comput. Syst.

Quantum Inf. Process.

Publications

Alin-Bogdan Popa, Bogdan-Cãlin Ciobanu, Voichita Iancu, Florin Pop, Pantelimon George Popescu
SkySwapping: Entanglement resupply by separating quantum swapping and photon exchange. Future Gener. Comput. Syst. 158 (2024)
Alin-Bogdan Popa, Pantelimon George Popescu
The Future of QKD Networks. CoRR (2024)
Bogdan-Cãlin Ciobanu, Florin Pop, Pantelimon George Popescu
A fast way to compute definite integrals. Soft Comput. 26 (24) (2022)
Bogdan-Cãlin Ciobanu, Voichita Iancu, Pantelimon George Popescu
EntangleNetSat: A Satellite-Based Entanglement Resupply Network. IEEE Access 10 (2022)
Anca Radulescu, Pantelimon George Popescu, Marios O. Choudary
GE vs GM: Efficient side-channel security evaluations on full cryptographic keys. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022 (4) (2022)
Andrei Tanasescu, Marios O. Choudary, Olivier Rioul, Pantelimon George Popescu
Asymptotically Optimal Massey-Like Inequality on Guessing Entropy With Application to Side-Channel Attack Evaluations. CoRR (2021)
Andrei Tanasescu, Pantelimon George Popescu
Separability of heterogeneous quantum systems using multipartite concurrence and tangle. Quantum Inf. Process. 20 (2) (2021)
Andrei Tanasescu, Marios O. Choudary, Olivier Rioul, Pantelimon George Popescu
Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy. Entropy 23 (11) (2021)
Andrei Tanasescu, Pantelimon George Popescu
Exploiting the Massey Gap. Entropy 22 (12) (2020)
Andrei Tanasescu, Pantelimon George Popescu
Separability of heterogeneous multipartite quantum systems using Bloch Vectors. Quantum Inf. Process. 19 (6) (2020)
Andrei Tanasescu, Pantelimon George Popescu
-tridiagonal matrices. J. Comput. Sci. 31 (2019)
Radu Constantinescu, Radu Constantin Poenaru, Florin Pop, Pantelimon George Popescu
A new version of KSOR method with lower number of iterations and lower spectral radius. Soft Comput. 23 (22) (2019)
Pantelimon George Popescu, Marios Omar Choudary
Refinement of Massey Inequality : (To Nicolae Ţăpuş on his 70th birthday). ISIT (2019)
Pantelimon George Popescu, Radu Constantin Poenaru, Florin Pop
New third-order Newton-like method with lower iteration number and lower TNFE. Soft Comput. 21 (2) (2017)
Marios O. Choudary, Pantelimon George Popescu
Back to Massey: Impressively fast, scalable and tight security evaluation tools. IACR Cryptol. ePrint Arch. 2017 (2017)
Marios O. Choudary, Pantelimon George Popescu
Back to Massey: Impressively Fast, Scalable and Tight Security Evaluation Tools. CHES (2017)
Mihai Carabas, Pantelimon George Popescu
Energy-efficient virtualized clusters. Future Gener. Comput. Syst. 74 (2017)
Pantelimon George Popescu, Emil-Ioan Slusanschi, Voichita Iancu, Florin Pop
A new upper bound for Shannon entropy. A novel approach in modeling of Big Data applications. Concurr. Comput. Pract. Exp. 28 (2) (2016)
Luis Díez, Pantelimon George Popescu, Ramón Agüero
A Geometric Programming Solution for the Mutual-Interference Model in HetNets. IEEE Commun. Lett. 20 (9) (2016)
Pantelimon George Popescu, Emil-Ioan Slusanschi
A New Bound in Information Theory. CSCS (2015)
Radu Constantin Poenaru, Radu Constantinescu, Pantelimon George Popescu
New Third-Order Method for Solving Nonlinear Equations with Lower Iteration Number. CSCS (2015)
Nicolae Tapus, Pantelimon George Popescu
A new entropy upper bound. Appl. Math. Lett. 25 (11) (2012)
Pantelimon George Popescu
Problem 11465. Am. Math. Mon. 116 (9) (2009)
José Luis Díaz-Barrero, Miquel Grau-Sánchez, Pantelimon George Popescu
Refinements of Aczél, Popoviciu and Bellman's inequalities. Comput. Math. Appl. 56 (9) (2008)
José Luis Díaz-Barrero, Pantelimon George Popescu
Problem 11326. Am. Math. Mon. 114 (9) (2007)