Pantelimon George Popescu

According to our database1, Pantelimon George Popescu authored at least 27 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Simple exact quantum search.
Quantum Inf. Process., October, 2024

SkySwapping: Entanglement resupply by separating quantum swapping and photon exchange.
Future Gener. Comput. Syst., 2024

CEF: Connecting Elaborate Federal QKD Networks.
CoRR, 2024

The Future of QKD Networks.
CoRR, 2024

Self Improvement of the McEliece- Yu Inequality.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2022
A fast way to compute definite integrals.
Soft Comput., December, 2022

GE vs GM: Efficient side-channel security evaluations on full cryptographic keys.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

EntangleNetSat: A Satellite-Based Entanglement Resupply Network.
IEEE Access, 2022

2021
Separability of heterogeneous quantum systems using multipartite concurrence and tangle.
Quantum Inf. Process., 2021

Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy.
Entropy, 2021

Asymptotically Optimal Massey-Like Inequality on Guessing Entropy With Application to Side-Channel Attack Evaluations.
CoRR, 2021

2020
Separability of heterogeneous multipartite quantum systems using Bloch Vectors.
Quantum Inf. Process., 2020

Exploiting the Massey Gap.
Entropy, 2020

2019
A new version of KSOR method with lower number of iterations and lower spectral radius.
Soft Comput., 2019

A fast singular value decomposition algorithm of general <i>k</i>-tridiagonal matrices.
J. Comput. Sci., 2019

Refinement of Massey Inequality : (To Nicolae Ţăpuş on his 70th birthday).
Proceedings of the IEEE International Symposium on Information Theory, 2019

2017
New third-order Newton-like method with lower iteration number and lower TNFE.
Soft Comput., 2017

Back to Massey: Impressively fast, scalable and tight security evaluation tools.
IACR Cryptol. ePrint Arch., 2017

Energy-efficient virtualized clusters.
Future Gener. Comput. Syst., 2017

2016
A Geometric Programming Solution for the Mutual-Interference Model in HetNets.
IEEE Commun. Lett., 2016

A new upper bound for Shannon entropy. A novel approach in modeling of Big Data applications.
Concurr. Comput. Pract. Exp., 2016

2015
A New Bound in Information Theory.
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.
Proceedings of the 20th International Conference on Control Systems and Computer Science, 2015

2012
A new entropy upper bound.
Appl. Math. Lett., 2012

2009
Problem 11465.
Am. Math. Mon., 2009

2008
Refinements of Aczél, Popoviciu and Bellman's inequalities.
Comput. Math. Appl., 2008

2007
Problem 11326.
Am. Math. Mon., 2007


  Loading...