WANT A PROFILE LIKE THIS?
Create my FREE Plan Or learn about other options
Elsayed Badr
PeerJ Author & Reviewer
35 Points

Contributions by role

Reviewer 35

Contributions by subject area

Algorithms and Analysis of Algorithms
Optimization Theory and Computation

Elsayed Badr

PeerJ Author & Reviewer

Summary

Elsayed Badr is a full professor of computer science at Faculty of Computers & Artificial Intelligence, Benha University, Egypt. Prof. Dr. Badr received his Ph.D. degree in Parallel Algorithms (mainly in parallel programming applications) in 2006 from the University of Macedonia; Greece. He has worked on several research topics. He has contributed more than 50+ technical papers in the areas of Artificial Intelligence, Machine learning, Data Science, wireless networks, High-Performance Computing, Cloud Computing, graph algorithms, neutrosophic theory and Mathematical Programming in international journals and conferences.

Algorithms & Analysis of Algorithms Artificial Intelligence Distributed & Parallel Computing Optimization Theory & Computation Quantum Computing Scientific Computing & Simulation

Past or current institution affiliations

Benha University

Websites

  • Google Scholar

PeerJ Contributions

  • Reviewed 1

Signed reviews submitted for articles published in PeerJ Note that some articles may not have the review itself made public unless authors have made them open as well.

March 30, 2020
A new non-monotonic infeasible simplex-type algorithm for Linear Programming
Charalampos P. Triantafyllidis, Nikolaos Samaras
https://doi.org/10.7717/peerj-cs.265