Adel Elmahdy
Adel Elmahdy
Graduate Student, University of Minnesota
Verified email at umn.edu
Title
Cited by
Cited by
Year
Optimizing cooperative cognitive radio networks performance with primary QoS provisioning
AM Elmahdy, A El-Keyi, T ElBatt, KG Seddik
IEEE Transactions on Communications 65 (4), 1451-1463, 2016
142016
On the fundamental limits of coded data shuffling
A Elmahdy, S Mohajer
2018 IEEE International Symposium on Information Theory (ISIT), 716-720, 2018
132018
Active Learning for Top- Rank Aggregation from Noisy Comparisons
S Mohajer, C Suh, A Elmahdy
International Conference on Machine Learning, 2488-2497, 2017
132017
On the Stable Throughput of Cooperative Cognitive Radio Networks with Finite Relaying Buffer
AM Elmahdy, A El-Keyi, T ElBatt, KG Seddik
Personal Indoor and Mobile Radio Communications (PIMRC), 2014 IEEE 25th …, 2014
132014
Asymmetric degrees of freedom of the full-duplex MIMO 3-way channel
AM Elmahdy, A El-Keyi, Y Mohasseb, T ElBatt, M Nafie, KG Seddik
2016 IEEE Information Theory Workshop (ITW), 469-473, 2016
62016
Degrees of freedom of the full-duplex asymmetric MIMO three-way channel with unicast and broadcast messages
AM Elmahdy, A El-Keyi, Y Mohasseb, T ElBatt, M Nafie, KG Seddik, ...
IEEE Transactions on Communications 65 (8), 3276-3287, 2017
5*2017
On Optimizing Cooperative Cognitive User Performance under Primary QoS Constraints
AM Elmahdy, A El-Keyi, T ElBatt, KG Seddik
Wireless Communications and Networking Conference, 2016 IEEE, 1-7, 2016
42016
Generalized Instantly Decodable Network Coding for Relay-Assisted Networks
AM Elmahdy, S Sorour, KG Seddik
Personal Indoor and Mobile Radio Communications (PIMRC), 2013 IEEE 24th …, 2013
32013
On the Fundamental Limits of Coded Data Shuffling for Distributed Machine Learning
A Elmahdy, S Mohajer
IEEE Transactions on Information Theory 66 (5), 3098-3131, 2020
2020
Supplementary Material for Active Learning for Top-K Rank Aggregation from Noisy Comparisons
S Mohajer, C Suh, A Elmahdy
The system can't perform the operation now. Try again later.
Articles 1–10