Pantelimon George Popescu

According to our database, Pantelimon George Popescu authored at least 22 papers between 2007 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

A fast way to compute definite integrals.

Bogdan-Cãlin Ciobanu, Florin Pop, Pantelimon George Popescu

Soft Comput., December, 2022

GE vs GM: Efficient side-channel security evaluations on full cryptographic keys.

Anca Radulescu, Pantelimon George Popescu, Marios O. Choudary

IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

EntangleNetSat: A Satellite-Based Entanglement Resupply Network.

Bogdan-Cãlin Ciobanu, Voichita Iancu, Pantelimon George Popescu

IEEE Access, 2022

2021

Separability of heterogeneous quantum systems using multipartite concurrence and tangle.

Andrei Tanasescu, Pantelimon George Popescu

Quantum Inf. Process., 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

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

2020

Separability of heterogeneous multipartite quantum systems using Bloch Vectors.

Andrei Tanasescu, Pantelimon George Popescu

Quantum Inf. Process., 2020

Exploiting the Massey Gap.

Andrei Tanasescu, Pantelimon George Popescu

Entropy, 2020

2019

A new version of KSOR method with lower number of iterations and lower spectral radius.

Radu Constantinescu, Radu Constantin Poenaru, Florin Pop, Pantelimon George Popescu

Soft Comput., 2019

A fast singular value decomposition algorithm of general <i>k</i>-tridiagonal matrices.

Andrei Tanasescu, Pantelimon George Popescu

J. Comput. Sci., 2019

Refinement of Massey Inequality : (To Nicolae Ţăpuş on his 70th birthday).

Pantelimon George Popescu, Marios Omar Choudary

Proceedings of the IEEE International Symposium on Information Theory, 2019

2017

New third-order Newton-like method with lower iteration number and lower TNFE.

Pantelimon George Popescu, Radu Constantin Poenaru, Florin Pop

Soft Comput., 2017

Back to Massey: Impressively fast, scalable and tight security evaluation tools.

Marios O. Choudary, Pantelimon George Popescu

IACR Cryptol. ePrint Arch., 2017

Energy-efficient virtualized clusters.

Mihai Carabas, Pantelimon George Popescu

Future Gener. Comput. Syst., 2017

2016

A Geometric Programming Solution for the Mutual-Interference Model in HetNets.

Luis Díez, Pantelimon George Popescu, Ramón Agüero

IEEE Commun. Lett., 2016

A new upper bound for Shannon entropy. A novel approach in modeling of Big Data applications.

Pantelimon George Popescu, Emil-Ioan Slusanschi, Voichita Iancu, Florin Pop

Concurr. Comput. Pract. Exp., 2016

2015

A New Bound in Information Theory.

Pantelimon George Popescu, Emil-Ioan Slusanschi

Proceedings of the 20th International Conference on Control Systems and Computer Science, 2015

New Third-Order Method for Solving Nonlinear Equations with Lower Iteration Number.

Radu Constantin Poenaru, Radu Constantinescu, Pantelimon George Popescu

Proceedings of the 20th International Conference on Control Systems and Computer Science, 2015

2012

A new entropy upper bound.

Nicolae Tapus, Pantelimon George Popescu

Appl. Math. Lett., 2012

2009

Problem 11465.

Pantelimon George Popescu

Am. Math. Mon., 2009

2008

Refinements of Aczél, Popoviciu and Bellman's inequalities.

José Luis Díaz-Barrero, Miquel Grau-Sánchez, Pantelimon George Popescu

Comput. Math. Appl., 2008

2007

Problem 11326.

José Luis Díaz-Barrero, Pantelimon George Popescu

Am. Math. Mon., 2007