Search the dblp DataBase
Ahmed A. Belal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Ahmed A. Belal, Amr Elmasry
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes. [Citation Graph (0, 0)][DBLP]
STACS, 2006, pp:92-103 [Conf] - Ahmed A. Belal, Abdelhamid S. Abdelhamid
Secure Transmission of Sensitive data using multiple channels [Citation Graph (0, 0)][DBLP]
CoRR, 2004, v:0, n:, pp:- [Journal] - Magdy A. Ahmed, Ahmed A. Belal, Khalil M. Ahmed
Optimal Insertion in Two-Dimensional Arrays. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 1997, v:99, n:1-2, pp:1-20 [Journal] - Ahmed A. Belal, Amr Elmasry
Reaching the Bound in the (2, n) merging Problem. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 1998, v:111, n:1-4, pp:261-271 [Journal] - Ahmed A. Belal, Amr Elmasry
Verification of minimum-redundancy prefix codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 2006, v:52, n:4, pp:1399-1404 [Journal] - Abdelhamid S. Abdelhamid, Ahmed A. Belal
Secure transmission of sensitive data using multiple channels. [Citation Graph (0, 0)][DBLP]
AICCSA, 2005, pp:87- [Conf] - Ahmed A. Belal, Amr Elmasry
Finding maximum-cost minimum spanning trees. [Citation Graph (0, 0)][DBLP]
AICCSA, 2005, pp:14- [Conf]
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002