default search action
Pantelimon George Popescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]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: 89-97 (2024) - [j18]Raj Alexandru Gutoiu, Andrei Tanasescu, Pantelimon George Popescu:
Simple exact quantum search. Quantum Inf. Process. 23(10): 356 (2024) - [c5]Andrei Tanasescu, Pantelimon George Popescu:
Self Improvement of the McEliece- Yu Inequality. ISIT 2024: 3184-3188 - [i4]Alin-Bogdan Popa, Pantelimon George Popescu:
The Future of QKD Networks. CoRR abs/2407.00877 (2024) - [i3]Alin-Bogdan Popa, Pantelimon George Popescu:
CEF: Connecting Elaborate Federal QKD Networks. CoRR abs/2409.12027 (2024) - 2022
- [j17]Bogdan-Cãlin Ciobanu
EntangleNetSat: A Satellite-Based Entanglement Resupply Network. IEEE Access 10: 69963-69971 (2022) - [j16]Bogdan-Cãlin Ciobanu, Florin Pop
A fast way to compute definite integrals. Soft Comput. 26(24): 13485-13488 (2022) - [j15]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): 886-905 (2022) - 2021
- [j14]Andrei Tanasescu
Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy. Entropy 23(11): 1538 (2021) - [j13]Andrei Tanasescu, Pantelimon George Popescu:
Separability of heterogeneous quantum systems using multipartite concurrence and tangle. Quantum Inf. Process. 20(2): 50 (2021) - [i2]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 abs/2103.15620 (2021) - 2020
- [j12]Andrei Tanasescu
Exploiting the Massey Gap. Entropy 22(12): 1398 (2020) - [j11]Andrei Tanasescu
Separability of heterogeneous multipartite quantum systems using Bloch Vectors. Quantum Inf. Process. 19(6): 176 (2020)
2010 – 2019
- 2019
- [j10]Andrei Tanasescu
A fast singular value decomposition algorithm of general k-tridiagonal matrices. J. Comput. Sci. 31: 1-5 (2019) - [j9]Radu Constantinescu, Radu Constantin Poenaru, Florin Pop
A new version of KSOR method with lower number of iterations and lower spectral radius. Soft Comput. 23(22): 11729-11736 (2019) - [c4]Pantelimon George Popescu, Marios Omar Choudary:
Refinement of Massey Inequality : (To Nicolae Ţăpuş on his 70th birthday). ISIT 2019: 495-496 - 2017
- [j8]Mihai Carabas
Energy-efficient virtualized clusters. Future Gener. Comput. Syst. 74: 151-157 (2017) - [j7]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): 459-466 (2017) - [c3]Marios O. Choudary, Pantelimon George Popescu:
Back to Massey: Impressively Fast, Scalable and Tight Security Evaluation Tools. CHES 2017: 367-386 - [i1]Marios O. Choudary, Pantelimon George Popescu:
Back to Massey: Impressively fast, scalable and tight security evaluation tools. IACR Cryptol. ePrint Arch. 2017: 623 (2017) - 2016
- [j6]Pantelimon George Popescu, Emil-Ioan Slusanschi
A new upper bound for Shannon entropy. A novel approach in modeling of Big Data applications. Concurr. Comput. Pract. Exp. 28(2): 351-359 (2016) - [j5]Luis Díez
A Geometric Programming Solution for the Mutual-Interference Model in HetNets. IEEE Commun. Lett. 20(9): 1876-1879 (2016) - 2015
- [c2]Pantelimon George Popescu, Emil-Ioan Slusanschi
A New Bound in Information Theory. CSCS 2015: 220-221 - [c1]Radu Constantin Poenaru, Radu Constantinescu, Pantelimon George Popescu:
New Third-Order Method for Solving Nonlinear Equations with Lower Iteration Number. CSCS 2015: 222-225 - 2012
- [j4]Nicolae Tapus
A new entropy upper bound. Appl. Math. Lett. 25(11): 1887-1890 (2012)
2000 – 2009
- 2009
- [j3]Pantelimon George Popescu:
Problem 11465. Am. Math. Mon. 116(9): 845 (2009) - 2008
- [j2]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): 2356-2359 (2008) - 2007
- [j1]José Luis Díaz-Barrero, Pantelimon George Popescu:
Problem 11326. Am. Math. Mon. 114(9): 836 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: